답안 #65030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65030 2018-08-06T13:15:12 Z nvmdava 커다란 상품 (IOI17_prize) C++17
100 / 100
76 ms 5712 KB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<int> ans[200001];
map<int, set<int> > v;
int find_best(int n) {
	queue<pair<int, int> > q;
	q.push(make_pair(0, n - 1));
	int l, r, m;
	while(!q.empty()){
		l = q.front().first;
		r = q.front().second;
		q.pop();
		if(l > r){
			continue;
		}
		m = (l + r) >> 1;
		if(ans[m].size() == 0)ans[m] = ask(m);
		if(ans[m][0] + ans[m][1] == 0){
			return m;
		}
		v[ans[m][0] + ans[m][1]].insert(m);
		auto it = v.find(ans[m][0] + ans[m][1]);
		auto loc = it -> second.find(m);
		bool in = 0;
		auto tmp = loc;
		while(tmp != it -> second.begin()){
			if(ans[m][0] != ans[*tmp][0]){
				in = 1;
				tmp++;
				q.push(make_pair(l, *tmp - 1));
				break;
			}
			tmp--;
		}
		if(in == 0){
			tmp = it->second.begin();
			q.push(make_pair(l, *tmp - 1));
		} else {
			in = 0;
		}
		tmp = loc;
		while(tmp != it -> second.end()){
			if(ans[m][0] != ans[*tmp][0]){
				in = 1;
				tmp--;
				q.push(make_pair(*tmp + 1, r));
				break;
			}
			tmp++;
		}
		if(in == 0){
			tmp = it->second.end();
			tmp--;
			q.push(make_pair(*tmp + 1, r));
		}
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:59:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 9 ms 5172 KB Output is correct
3 Correct 9 ms 5172 KB Output is correct
4 Correct 7 ms 5172 KB Output is correct
5 Correct 7 ms 5172 KB Output is correct
6 Correct 7 ms 5192 KB Output is correct
7 Correct 8 ms 5192 KB Output is correct
8 Correct 8 ms 5192 KB Output is correct
9 Correct 7 ms 5232 KB Output is correct
10 Correct 6 ms 5232 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5240 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 10 ms 5308 KB Output is correct
4 Correct 8 ms 5308 KB Output is correct
5 Correct 7 ms 5308 KB Output is correct
6 Correct 7 ms 5308 KB Output is correct
7 Correct 7 ms 5308 KB Output is correct
8 Correct 7 ms 5308 KB Output is correct
9 Correct 7 ms 5308 KB Output is correct
10 Correct 9 ms 5308 KB Output is correct
11 Correct 14 ms 5308 KB Output is correct
12 Correct 15 ms 5308 KB Output is correct
13 Correct 14 ms 5308 KB Output is correct
14 Correct 13 ms 5308 KB Output is correct
15 Correct 33 ms 5656 KB Output is correct
16 Correct 58 ms 5656 KB Output is correct
17 Correct 45 ms 5656 KB Output is correct
18 Correct 41 ms 5656 KB Output is correct
19 Correct 35 ms 5656 KB Output is correct
20 Correct 29 ms 5656 KB Output is correct
21 Correct 51 ms 5656 KB Output is correct
22 Correct 36 ms 5656 KB Output is correct
23 Correct 8 ms 5656 KB Output is correct
24 Correct 13 ms 5656 KB Output is correct
25 Correct 69 ms 5656 KB Output is correct
26 Correct 25 ms 5656 KB Output is correct
27 Correct 9 ms 5656 KB Output is correct
28 Correct 38 ms 5656 KB Output is correct
29 Correct 46 ms 5656 KB Output is correct
30 Correct 49 ms 5656 KB Output is correct
31 Correct 48 ms 5656 KB Output is correct
32 Correct 18 ms 5656 KB Output is correct
33 Correct 6 ms 5656 KB Output is correct
34 Correct 23 ms 5656 KB Output is correct
35 Correct 11 ms 5656 KB Output is correct
36 Correct 54 ms 5656 KB Output is correct
37 Correct 12 ms 5656 KB Output is correct
38 Correct 9 ms 5656 KB Output is correct
39 Correct 67 ms 5656 KB Output is correct
40 Correct 41 ms 5656 KB Output is correct
41 Correct 46 ms 5656 KB Output is correct
42 Correct 76 ms 5656 KB Output is correct
43 Correct 39 ms 5656 KB Output is correct
44 Correct 38 ms 5656 KB Output is correct
45 Correct 64 ms 5656 KB Output is correct
46 Correct 34 ms 5656 KB Output is correct
47 Correct 26 ms 5656 KB Output is correct
48 Correct 46 ms 5656 KB Output is correct
49 Correct 31 ms 5656 KB Output is correct
50 Correct 75 ms 5656 KB Output is correct
51 Correct 42 ms 5656 KB Output is correct
52 Correct 29 ms 5656 KB Output is correct
53 Correct 8 ms 5656 KB Output is correct
54 Correct 33 ms 5656 KB Output is correct
55 Correct 73 ms 5656 KB Output is correct
56 Correct 55 ms 5656 KB Output is correct
57 Correct 32 ms 5656 KB Output is correct
58 Correct 53 ms 5656 KB Output is correct
59 Correct 46 ms 5656 KB Output is correct
60 Correct 32 ms 5656 KB Output is correct
61 Correct 9 ms 5656 KB Output is correct
62 Correct 7 ms 5656 KB Output is correct
63 Correct 8 ms 5656 KB Output is correct
64 Correct 8 ms 5656 KB Output is correct
65 Correct 7 ms 5656 KB Output is correct
66 Correct 7 ms 5656 KB Output is correct
67 Correct 10 ms 5656 KB Output is correct
68 Correct 11 ms 5656 KB Output is correct
69 Correct 9 ms 5656 KB Output is correct
70 Correct 10 ms 5656 KB Output is correct
71 Correct 39 ms 5656 KB Output is correct
72 Correct 13 ms 5656 KB Output is correct
73 Correct 64 ms 5712 KB Output is correct
74 Correct 74 ms 5712 KB Output is correct
75 Correct 7 ms 5712 KB Output is correct
76 Correct 50 ms 5712 KB Output is correct
77 Correct 44 ms 5712 KB Output is correct
78 Correct 11 ms 5712 KB Output is correct
79 Correct 26 ms 5712 KB Output is correct
80 Correct 67 ms 5712 KB Output is correct
81 Correct 57 ms 5712 KB Output is correct
82 Correct 46 ms 5712 KB Output is correct
83 Correct 9 ms 5712 KB Output is correct
84 Correct 28 ms 5712 KB Output is correct
85 Correct 54 ms 5712 KB Output is correct
86 Correct 10 ms 5712 KB Output is correct
87 Correct 11 ms 5712 KB Output is correct
88 Correct 10 ms 5712 KB Output is correct
89 Correct 16 ms 5712 KB Output is correct
90 Correct 10 ms 5712 KB Output is correct
91 Correct 10 ms 5712 KB Output is correct
92 Correct 10 ms 5712 KB Output is correct
93 Correct 14 ms 5712 KB Output is correct
94 Correct 12 ms 5712 KB Output is correct
95 Correct 8 ms 5712 KB Output is correct
96 Correct 8 ms 5712 KB Output is correct
97 Correct 6 ms 5712 KB Output is correct