답안 #70331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
70331 2018-08-22T15:46:16 Z E869120 커다란 상품 (IOI17_prize) C++14
99.5 / 100
80 ms 5528 KB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

vector<int>Y[200009];

vector<int>asks(int pos){
	if(Y[pos].size()==2) return Y[pos];
	Y[pos] = ask(pos);
	return Y[pos];
}

int find_best(int n) {
	int cx = 0;
	
	while (true) {
		vector<int> X1 = asks(cx);
		
		int L = cx, R = n, M, maxn = 0, QQ = 18;
		
		vector<int> G = {511, 1023, 4095};
		for (int i = 0; i < G.size(); i++) {
			vector<int> X2 = asks(min(n - 1, cx + G[i]));
			if (X2 != X1) { R = min(n, cx + G[i]); break; }
		}
		
		for (int i = 0; i <= 18; i++) { if ((1 << i) >= R - L + 1) { QQ = i; break; } }
		
		for (int i = 0; i < QQ; i++) {
			M = (L + R) / 2; bool flag = false; if (R - L <= 1) flag = true;
			vector<int> R1 = asks(min(n, M));
			if (R1[0] + R1[1] == 0) return M;
			if (X1 == R1) { L = M + 1; maxn = max(maxn, M); }
			else { R = M; }
			
			if (flag == true) break;
		}
		cx = maxn + 2;
	}
	return -1;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:22:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < G.size(); i++) {
                   ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4900 KB Output is correct
2 Correct 7 ms 5044 KB Output is correct
3 Correct 8 ms 5044 KB Output is correct
4 Correct 6 ms 5104 KB Output is correct
5 Correct 7 ms 5104 KB Output is correct
6 Correct 6 ms 5176 KB Output is correct
7 Correct 7 ms 5180 KB Output is correct
8 Correct 6 ms 5236 KB Output is correct
9 Correct 6 ms 5236 KB Output is correct
10 Correct 7 ms 5236 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5236 KB Output is correct
2 Correct 8 ms 5236 KB Output is correct
3 Correct 7 ms 5236 KB Output is correct
4 Correct 8 ms 5236 KB Output is correct
5 Correct 7 ms 5256 KB Output is correct
6 Correct 7 ms 5256 KB Output is correct
7 Correct 6 ms 5256 KB Output is correct
8 Correct 7 ms 5256 KB Output is correct
9 Correct 8 ms 5256 KB Output is correct
10 Correct 8 ms 5256 KB Output is correct
11 Correct 9 ms 5256 KB Output is correct
12 Correct 8 ms 5256 KB Output is correct
13 Correct 11 ms 5272 KB Output is correct
14 Correct 12 ms 5272 KB Output is correct
15 Correct 10 ms 5276 KB Output is correct
16 Correct 43 ms 5372 KB Output is correct
17 Correct 6 ms 5372 KB Output is correct
18 Partially correct 58 ms 5412 KB Partially correct - number of queries: 5018
19 Correct 7 ms 5412 KB Output is correct
20 Correct 26 ms 5412 KB Output is correct
21 Correct 32 ms 5412 KB Output is correct
22 Correct 12 ms 5412 KB Output is correct
23 Correct 8 ms 5412 KB Output is correct
24 Correct 8 ms 5412 KB Output is correct
25 Correct 48 ms 5412 KB Output is correct
26 Correct 46 ms 5412 KB Output is correct
27 Correct 9 ms 5412 KB Output is correct
28 Correct 32 ms 5412 KB Output is correct
29 Correct 58 ms 5412 KB Output is correct
30 Partially correct 59 ms 5412 KB Partially correct - number of queries: 5050
31 Correct 7 ms 5412 KB Output is correct
32 Correct 8 ms 5412 KB Output is correct
33 Correct 7 ms 5412 KB Output is correct
34 Correct 16 ms 5412 KB Output is correct
35 Correct 7 ms 5412 KB Output is correct
36 Correct 20 ms 5412 KB Output is correct
37 Correct 9 ms 5412 KB Output is correct
38 Correct 7 ms 5412 KB Output is correct
39 Correct 30 ms 5412 KB Output is correct
40 Correct 32 ms 5412 KB Output is correct
41 Correct 28 ms 5420 KB Output is correct
42 Correct 28 ms 5420 KB Output is correct
43 Correct 28 ms 5420 KB Output is correct
44 Correct 30 ms 5420 KB Output is correct
45 Correct 32 ms 5420 KB Output is correct
46 Correct 7 ms 5420 KB Output is correct
47 Correct 28 ms 5420 KB Output is correct
48 Correct 60 ms 5420 KB Output is correct
49 Correct 8 ms 5420 KB Output is correct
50 Correct 37 ms 5528 KB Output is correct
51 Correct 36 ms 5528 KB Output is correct
52 Correct 7 ms 5528 KB Output is correct
53 Correct 12 ms 5528 KB Output is correct
54 Correct 36 ms 5528 KB Output is correct
55 Correct 9 ms 5528 KB Output is correct
56 Partially correct 33 ms 5528 KB Partially correct - number of queries: 5011
57 Correct 48 ms 5528 KB Output is correct
58 Correct 22 ms 5528 KB Output is correct
59 Correct 19 ms 5528 KB Output is correct
60 Correct 45 ms 5528 KB Output is correct
61 Correct 10 ms 5528 KB Output is correct
62 Correct 9 ms 5528 KB Output is correct
63 Correct 11 ms 5528 KB Output is correct
64 Correct 9 ms 5528 KB Output is correct
65 Correct 8 ms 5528 KB Output is correct
66 Correct 9 ms 5528 KB Output is correct
67 Correct 8 ms 5528 KB Output is correct
68 Correct 7 ms 5528 KB Output is correct
69 Correct 7 ms 5528 KB Output is correct
70 Correct 8 ms 5528 KB Output is correct
71 Correct 75 ms 5528 KB Output is correct
72 Correct 11 ms 5528 KB Output is correct
73 Correct 59 ms 5528 KB Output is correct
74 Correct 47 ms 5528 KB Output is correct
75 Correct 10 ms 5528 KB Output is correct
76 Correct 50 ms 5528 KB Output is correct
77 Correct 56 ms 5528 KB Output is correct
78 Correct 9 ms 5528 KB Output is correct
79 Correct 31 ms 5528 KB Output is correct
80 Correct 80 ms 5528 KB Output is correct
81 Correct 52 ms 5528 KB Output is correct
82 Correct 63 ms 5528 KB Output is correct
83 Correct 11 ms 5528 KB Output is correct
84 Correct 57 ms 5528 KB Output is correct
85 Correct 29 ms 5528 KB Output is correct
86 Correct 35 ms 5528 KB Output is correct
87 Correct 12 ms 5528 KB Output is correct
88 Correct 27 ms 5528 KB Output is correct
89 Correct 39 ms 5528 KB Output is correct
90 Correct 8 ms 5528 KB Output is correct
91 Correct 34 ms 5528 KB Output is correct
92 Correct 7 ms 5528 KB Output is correct
93 Correct 11 ms 5528 KB Output is correct
94 Correct 12 ms 5528 KB Output is correct
95 Correct 11 ms 5528 KB Output is correct
96 Correct 12 ms 5528 KB Output is correct
97 Correct 5 ms 5528 KB Output is correct