답안 #294944

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294944 2020-09-09T10:58:09 Z VodkaInTheJar 커다란 상품 (IOI17_prize) C++14
90 / 100
61 ms 384 KB
#include <bits/stdc++.h>
#include "prize.h"
 
using namespace std;
mt19937 random_generator(chrono::steady_clock::now().time_since_epoch().count());
 
const int maxn = 2e5 + 3; 
 
/*
int m; 
int a[maxn];
vector <int> ask(int x)
{
	vector <int> ans;
	ans.resize(2);
	ans[0] = ans[1] = 0; 
	
	for (int i = 0; i < x; i++)
	if (a[i] < a[x])
	ans[0]++;
	
	for (int i = x + 1; i < m; i++)
	if (a[i] < a[x])
	ans[1]++;
	
	return ans;
}
*/

const int c = 500;

int max_sum; 
int find_best(int n)
{
	for (int i = 0; i < min(n, 500); i++)
	{
		auto curr = ask(i);
		if (curr[0] + curr[1] == 0)
		return i;
		
		max_sum = max(max_sum, curr[0] + curr[1]);
	}
	
	for (int i = 501; i < n; )
	{
		auto curr = ask(i);
		if (curr[0] + curr[1] == 0)
		return i; 
		
		if (curr[0] + curr[1] != max_sum)
		{
			i++;
			continue;
		}
		
		if (i + c < n)
		{
			auto temp = ask(i+c);
			if (temp[0] == curr[0] && temp[1] == curr[1])
			{
				i += c + 1; 
				continue;
			}
		}
		
		int low = i+1, high = min(n-1, i+c); 
		while (low < high)
		{
			int mid = (low + high) / 2;
			auto temp = ask(mid);
			
			if (temp[0] != curr[0] || temp[1] != curr[1])
			high = mid;
			
			else 
			low = mid + 1; 
		}
		
		i = low; 
	}
}
 
/*
int main()
{
	cin >> m;
	for (int i = 0; i < m; i++)
	cin >> a[i];
	
	cout << find_best(m) << endl; 
}
*/

Compilation message

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