oj.uz

답안 #133479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
133479 2019-07-20T21:24:45 Z hugo_pm 커다란 상품 (IOI17_prize) C++17
100 / 100
 60 ms 5368 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int nbPrix;
vector<int> perm;
vector<int> rv[200*1005];

int outil = -1;

vector<int> realGet(int x)
{
	vector<int> &res = rv[x];
	if (res.empty()) res = ask(x);
	return res;
}

#define ask flrfldl

int rp=-1;

void trouver(int a, int b, int va, int vb)
{
	if (a+1 >= b) return;

	va = a; vb = b;
	int mid = (va + vb) / 2;
	int niceSp = -1;

	for (int split = mid; split < b; ++split) {
		auto res = realGet(split);
		int val = res[0] + res[1];
		if (val == 0) { rp = split; return; }
		if (val == outil) { niceSp = split; break; }
	}

	if (niceSp == -1) {
		for (int split = mid; split > a; --split) {
			auto res = realGet(split);
			int val = res[0] + res[1];
			if (val == 0) { rp = split; return; }
			if (val == outil) { niceSp = split; break; }
		}
	}

	if (niceSp != -1) {
		if (realGet(a)[0] != realGet(niceSp)[0]) {
			trouver(a, niceSp, a, min(mid, niceSp));
			if (rp != -1) return;
		}
		if (realGet(niceSp)[1] != realGet(b)[1]) {
			trouver(niceSp, b, max(mid, niceSp), b);
		}
	}
}

int find_best(int n)
{
	nbPrix = n;

	if (nbPrix <= 5000) {
		for (int i = 0; i < nbPrix; ++i) {
			auto res = realGet(i);
			if (res[0] + res[1] == 0) return i;
		}
	}
	
	int lim = min(477, nbPrix);
	int lolId=-1;

	for (int pos = 0; pos < lim; ++pos) {
		auto res = realGet(pos);
		int val = res[0] + res[1];
		if (val > outil) {
			lolId = pos;
			outil = val;
		}
		if (val == 0) {
			return pos;
		}
		if (val > 40) break;
	}

	int der = n-1;
	while (true) {
		auto res = realGet(der);
		int val = res[0] + res[1];
		if (val == 0) return der;
		if (val == outil) break;
		--der;
	}

	trouver(lolId, der, lolId, der);
	return rp;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4984 KB Output is correct
2 Correct 11 ms 4984 KB Output is correct
3 Correct 12 ms 4984 KB Output is correct
4 Correct 10 ms 4984 KB Output is correct
5 Correct 11 ms 4984 KB Output is correct
6 Correct 6 ms 5036 KB Output is correct
7 Correct 11 ms 4984 KB Output is correct
8 Correct 9 ms 5132 KB Output is correct
9 Correct 12 ms 4984 KB Output is correct
10 Correct 12 ms 5112 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 5032 KB Output is correct
2 Correct 10 ms 5032 KB Output is correct
3 Correct 12 ms 5112 KB Output is correct
4 Correct 11 ms 4984 KB Output is correct
5 Correct 12 ms 4984 KB Output is correct
6 Correct 6 ms 5036 KB Output is correct
7 Correct 12 ms 4984 KB Output is correct
8 Correct 11 ms 5112 KB Output is correct
9 Correct 10 ms 4984 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 10 ms 5136 KB Output is correct
12 Correct 11 ms 5112 KB Output is correct
13 Correct 11 ms 5052 KB Output is correct
14 Correct 8 ms 4984 KB Output is correct
15 Correct 13 ms 4984 KB Output is correct
16 Correct 56 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 57 ms 5104 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 21 ms 5056 KB Output is correct
21 Correct 24 ms 4984 KB Output is correct
22 Correct 9 ms 4988 KB Output is correct
23 Correct 10 ms 4984 KB Output is correct
24 Correct 12 ms 5112 KB Output is correct
25 Correct 35 ms 5040 KB Output is correct
26 Correct 29 ms 4984 KB Output is correct
27 Correct 12 ms 4984 KB Output is correct
28 Correct 50 ms 5368 KB Output is correct
29 Correct 44 ms 5032 KB Output is correct
30 Correct 54 ms 5172 KB Output is correct
31 Correct 6 ms 5028 KB Output is correct
32 Correct 14 ms 4984 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 21 ms 5112 KB Output is correct
35 Correct 11 ms 4988 KB Output is correct
36 Correct 12 ms 5136 KB Output is correct
37 Correct 11 ms 5024 KB Output is correct
38 Correct 11 ms 5032 KB Output is correct
39 Correct 32 ms 5024 KB Output is correct
40 Correct 47 ms 5112 KB Output is correct
41 Correct 33 ms 5112 KB Output is correct
42 Correct 21 ms 5196 KB Output is correct
43 Correct 31 ms 5076 KB Output is correct
44 Correct 16 ms 5164 KB Output is correct
45 Correct 14 ms 5156 KB Output is correct
46 Correct 7 ms 4984 KB Output is correct
47 Correct 26 ms 4984 KB Output is correct
48 Correct 43 ms 5128 KB Output is correct
49 Correct 10 ms 4988 KB Output is correct
50 Correct 57 ms 5232 KB Output is correct
51 Correct 16 ms 5164 KB Output is correct
52 Correct 7 ms 5032 KB Output is correct
53 Correct 12 ms 4988 KB Output is correct
54 Correct 27 ms 4984 KB Output is correct
55 Correct 6 ms 5112 KB Output is correct
56 Correct 48 ms 5148 KB Output is correct
57 Correct 36 ms 5140 KB Output is correct
58 Correct 38 ms 5108 KB Output is correct
59 Correct 27 ms 5260 KB Output is correct
60 Correct 36 ms 5084 KB Output is correct
61 Correct 9 ms 5140 KB Output is correct
62 Correct 12 ms 4984 KB Output is correct
63 Correct 13 ms 4984 KB Output is correct
64 Correct 11 ms 4988 KB Output is correct
65 Correct 12 ms 4984 KB Output is correct
66 Correct 6 ms 5024 KB Output is correct
67 Correct 12 ms 4984 KB Output is correct
68 Correct 11 ms 4984 KB Output is correct
69 Correct 6 ms 4984 KB Output is correct
70 Correct 8 ms 5032 KB Output is correct
71 Correct 60 ms 5132 KB Output is correct
72 Correct 16 ms 5056 KB Output is correct
73 Correct 52 ms 5112 KB Output is correct
74 Correct 52 ms 5112 KB Output is correct
75 Correct 11 ms 4984 KB Output is correct
76 Correct 54 ms 5112 KB Output is correct
77 Correct 60 ms 5160 KB Output is correct
78 Correct 17 ms 4984 KB Output is correct
79 Correct 32 ms 5112 KB Output is correct
80 Correct 41 ms 5248 KB Output is correct
81 Correct 51 ms 5112 KB Output is correct
82 Correct 50 ms 5140 KB Output is correct
83 Correct 12 ms 4984 KB Output is correct
84 Correct 48 ms 5160 KB Output is correct
85 Correct 49 ms 5112 KB Output is correct
86 Correct 11 ms 5044 KB Output is correct
87 Correct 9 ms 5036 KB Output is correct
88 Correct 11 ms 4984 KB Output is correct
89 Correct 11 ms 4984 KB Output is correct
90 Correct 11 ms 4984 KB Output is correct
91 Correct 9 ms 4984 KB Output is correct
92 Correct 10 ms 4984 KB Output is correct
93 Correct 12 ms 5116 KB Output is correct
94 Correct 14 ms 5112 KB Output is correct
95 Correct 14 ms 4984 KB Output is correct
96 Correct 14 ms 4984 KB Output is correct
97 Correct 8 ms 5132 KB Output is correct