oj.uz

답안 #1072456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072456 2024-08-23T19:24:46 Z Joshua_Andersson 커다란 상품 (IOI17_prize) C++14
20 / 100
 56 ms 1492 KB 
#include "prize.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll linf = ll(1e18);

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> p2;

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define sz(container) ((int)container.size())
#define all(x) begin(x),end(x)

#if _LOCAL
#define assert(x) if (!(x)) __debugbreak()
#endif

map<int, vi> cache;
vi q(int i)
{
	if (cache.find(i) != cache.end()) return cache[i];
	return cache[i] = ask(i);
}

int find_best(int n)
{
	int lollipop_cnt = 0;
	int i = 0;
	while (i < 450)
	{
		vi res = q(i);
		ll s = res[0] + res[1];
		if (s==0)
		{
			return i;
		}
		// assume that i is second most common
		// then there are s^2 of type t[i], and s^4 of most common type
		/*if (s*s*s*s>n)
		{
			lollipop_cnt = s;
			break;
		}*/
		lollipop_cnt = max(lollipop_cnt, (int)s);
		i++;
	}
	
	int jump = 220;
	while (true)
	{
		vi base = q(i);
		if (base[0]+base[1]==0)
		{
			return i;
		}
		
		if (base[0]+base[1]==lollipop_cnt)
		{
			if (i+ jump <n)
			{
				vi b2 = q(i + jump);
				if (b2 == base)
				{
					i += jump;
					continue;
				}
			}
			
			int lo = i;
			int hi = min(n, i+ jump);
			while (lo+1<hi)
			{
				int mid = (lo + hi) / 2;
				vi m = q(mid);
				if (m == base)
				{
					lo = mid;
				}
				else hi = mid;
			}
			i = hi;
		}
		else
		{
			i++;
		}
	}

	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 6 ms 520 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 340 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 568 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 8 ms 600 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 6 ms 428 KB Output is correct
16 Correct 17 ms 912 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Partially correct 21 ms 1072 KB Partially correct - number of queries: 5335
19 Correct 3 ms 876 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 10 ms 600 KB Output is correct
22 Correct 4 ms 344 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 14 ms 556 KB Output is correct
26 Correct 15 ms 580 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Partially correct 26 ms 972 KB Partially correct - number of queries: 5264
29 Correct 20 ms 848 KB Output is correct
30 Partially correct 26 ms 864 KB Partially correct - number of queries: 5216
31 Correct 2 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 6 ms 600 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 8 ms 600 KB Output is correct
37 Correct 5 ms 700 KB Output is correct
38 Correct 4 ms 344 KB Output is correct
39 Correct 9 ms 600 KB Output is correct
40 Correct 29 ms 848 KB Output is correct
41 Correct 13 ms 600 KB Output is correct
42 Correct 23 ms 600 KB Output is correct
43 Correct 15 ms 1124 KB Output is correct
44 Correct 14 ms 768 KB Output is correct
45 Correct 13 ms 720 KB Output is correct
46 Correct 3 ms 344 KB Output is correct
47 Correct 13 ms 600 KB Output is correct
48 Correct 16 ms 632 KB Output is correct
49 Correct 4 ms 344 KB Output is correct
50 Partially correct 27 ms 956 KB Partially correct - number of queries: 5350
51 Correct 11 ms 600 KB Output is correct
52 Correct 3 ms 344 KB Output is correct
53 Correct 8 ms 600 KB Output is correct
54 Correct 12 ms 600 KB Output is correct
55 Correct 3 ms 600 KB Output is correct
56 Partially correct 25 ms 1104 KB Partially correct - number of queries: 5340
57 Correct 27 ms 668 KB Output is correct
58 Correct 24 ms 732 KB Output is correct
59 Correct 16 ms 600 KB Output is correct
60 Correct 17 ms 768 KB Output is correct
61 Correct 6 ms 544 KB Output is correct
62 Correct 2 ms 344 KB Output is correct
63 Correct 8 ms 344 KB Output is correct
64 Correct 5 ms 344 KB Output is correct
65 Correct 4 ms 576 KB Output is correct
66 Correct 7 ms 532 KB Output is correct
67 Correct 8 ms 480 KB Output is correct
68 Correct 2 ms 344 KB Output is correct
69 Correct 9 ms 600 KB Output is correct
70 Correct 7 ms 344 KB Output is correct
71 Partially correct 36 ms 924 KB Partially correct - number of queries: 5134
72 Correct 7 ms 600 KB Output is correct
73 Partially correct 22 ms 848 KB Partially correct - number of queries: 5078
74 Partially correct 34 ms 1096 KB Partially correct - number of queries: 5102
75 Correct 7 ms 344 KB Output is correct
76 Correct 22 ms 1136 KB Output is correct
77 Partially correct 38 ms 948 KB Partially correct - number of queries: 5397
78 Correct 8 ms 600 KB Output is correct
79 Correct 25 ms 776 KB Output is correct
80 Partially correct 34 ms 936 KB Partially correct - number of queries: 5402
81 Partially correct 25 ms 980 KB Partially correct - number of queries: 5370
82 Partially correct 29 ms 844 KB Partially correct - number of queries: 5346
83 Correct 7 ms 600 KB Output is correct
84 Correct 20 ms 1156 KB Output is correct
85 Partially correct 34 ms 876 KB Partially correct - number of queries: 5353
86 Incorrect 56 ms 1492 KB Incorrect
87 Halted 0 ms 0 KB -