답안 #69348 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69348	2018-08-20T15:11:15 Z	Noam527	커다란 상품 (IOI17_prize)	C++17	95.88 / 100	82 ms	1244 KB

prize

#include "prize.h"
#include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define debug cout << "ok" << endl
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7, inf = 1e9 + 7;
const ll hs = 199;
const ldb eps = 1e-9, pi = acos(-1);
using namespace std;
/*
vector<int> ask(int i) {
	cout << "? " << i << endl;
	vector<int> rtn(2);
	cin >> rtn[0] >> rtn[1];
	return rtn;
}
*/

map<int, vector<int>> alreadyfound;
vector<int> Q(int i) {
	if (alreadyfound.count(i)) return alreadyfound[i];
	return alreadyfound[i] = ask(i);
}

int N, badval;

bool bad(vector<int> a) {
	return a[0] + a[1] == badval;
}
bool answer(vector<int> a) {
	return a[0] + a[1] == 0;
}
// finds next bad position after pos. assumes it exists.
pair<int, vector<int>> findnext(int pos) {
	vector<int> a;
	while (!bad(a = Q(pos))) {
		if (answer(a)) return{ pos, a };
		pos++;
	}
	return{ pos, a };
}
// returns the ? in (val, val, ?, val + 1, ...). ? is the first in the sequence.
int calc(int l, int r, int val) {
	pair<int, vector<int>> b;
	int mid;
	while (l < r) {
		mid = (l + r + 1) / 2;
		b = findnext(mid);
		if (answer(b.second)) return b.first;
		if (val < b.second[0]) r = mid - 1;
		else l = mid;
	}
	return l;
}

int find_best(int n) {
	alreadyfound.clear();
	vector<int> a;
	if (n <= 5000) {
		for (int i = 0; i < n; i++) {
			a = ask(i);
			if (a[0] + a[1] == 0) return i;
		}
	}
	
	for (int i = 0; i < 500; i++) {
		auto something = Q(i);
		if (answer(something)) return i;
		badval = max(badval, something[0] + something[1]);
	}
	
	N = n;
	int l = 0, r = n - 1;
	while (!bad(a = Q(l))) {
		if (answer(a)) return l;
		l++;
	}
	while (!bad(a = Q(r))) {
		if (answer(a)) return r;
		r--;
	}
	int st = l, en, cnt;
	pair<int, vector<int>> b;
	while (st <= r) {
		en = min(r, st + 900);
		b = findnext(st);
		if (answer(b.second)) return b.first;
		st = b.first;
		b = findnext(en);
		if (answer(b.second)) return b.first;
		cnt = b.second[0] - Q(st)[0] - (b.first - en);
		for (int i = 0, tmp; i < cnt; i++) {
			tmp = calc(st, en, Q(st)[0] + i);
			if (answer(Q(tmp))) return tmp;
			if (answer(Q(tmp + 1))) return tmp + 1;
		}
		st = b.first;
	}
	return -1;
}
/*
int main() {
	int n;
	cin >> n;
	cout << find_best(n) << endl;
	cout << "^ is my answer" << endl;
}
*/

Subtask #1
20.0 / 20.0

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

Subtask #2
75.88 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	616 KB	Output is correct
2	Correct	11 ms	660 KB	Output is correct
3	Correct	10 ms	676 KB	Output is correct
4	Correct	7 ms	676 KB	Output is correct
5	Correct	10 ms	676 KB	Output is correct
6	Correct	2 ms	676 KB	Output is correct
7	Correct	9 ms	676 KB	Output is correct
8	Correct	10 ms	676 KB	Output is correct
9	Correct	9 ms	676 KB	Output is correct
10	Correct	8 ms	676 KB	Output is correct
11	Correct	13 ms	676 KB	Output is correct
12	Correct	7 ms	676 KB	Output is correct
13	Correct	11 ms	676 KB	Output is correct
14	Correct	8 ms	676 KB	Output is correct
15	Correct	11 ms	700 KB	Output is correct
16	Correct	34 ms	1052 KB	Output is correct
17	Correct	7 ms	1052 KB	Output is correct
18	Partially correct	82 ms	1088 KB	Partially correct - number of queries: 5355
19	Correct	8 ms	1088 KB	Output is correct
20	Correct	26 ms	1088 KB	Output is correct
21	Correct	23 ms	1088 KB	Output is correct
22	Correct	12 ms	1088 KB	Output is correct
23	Correct	8 ms	1088 KB	Output is correct
24	Correct	11 ms	1088 KB	Output is correct
25	Correct	43 ms	1088 KB	Output is correct
26	Correct	34 ms	1088 KB	Output is correct
27	Correct	9 ms	1088 KB	Output is correct
28	Correct	36 ms	1088 KB	Output is correct
29	Correct	37 ms	1088 KB	Output is correct
30	Partially correct	54 ms	1088 KB	Partially correct - number of queries: 5324
31	Correct	3 ms	1088 KB	Output is correct
32	Correct	11 ms	1088 KB	Output is correct
33	Correct	2 ms	1088 KB	Output is correct
34	Correct	10 ms	1088 KB	Output is correct
35	Correct	8 ms	1088 KB	Output is correct
36	Correct	18 ms	1088 KB	Output is correct
37	Correct	9 ms	1088 KB	Output is correct
38	Correct	7 ms	1088 KB	Output is correct
39	Correct	27 ms	1088 KB	Output is correct
40	Correct	47 ms	1088 KB	Output is correct
41	Correct	31 ms	1088 KB	Output is correct
42	Correct	33 ms	1088 KB	Output is correct
43	Correct	33 ms	1088 KB	Output is correct
44	Correct	31 ms	1088 KB	Output is correct
45	Correct	26 ms	1088 KB	Output is correct
46	Correct	6 ms	1088 KB	Output is correct
47	Correct	29 ms	1088 KB	Output is correct
48	Correct	37 ms	1088 KB	Output is correct
49	Correct	12 ms	1088 KB	Output is correct
50	Partially correct	55 ms	1088 KB	Partially correct - number of queries: 5362
51	Correct	25 ms	1088 KB	Output is correct
52	Correct	12 ms	1088 KB	Output is correct
53	Correct	10 ms	1088 KB	Output is correct
54	Correct	15 ms	1088 KB	Output is correct
55	Correct	6 ms	1088 KB	Output is correct
56	Partially correct	57 ms	1088 KB	Partially correct - number of queries: 5356
57	Correct	40 ms	1088 KB	Output is correct
58	Correct	33 ms	1088 KB	Output is correct
59	Correct	32 ms	1088 KB	Output is correct
60	Correct	38 ms	1088 KB	Output is correct
61	Correct	11 ms	1088 KB	Output is correct
62	Correct	5 ms	1088 KB	Output is correct
63	Correct	6 ms	1088 KB	Output is correct
64	Correct	8 ms	1088 KB	Output is correct
65	Correct	8 ms	1088 KB	Output is correct
66	Correct	7 ms	1088 KB	Output is correct
67	Correct	12 ms	1088 KB	Output is correct
68	Correct	6 ms	1088 KB	Output is correct
69	Correct	8 ms	1088 KB	Output is correct
70	Correct	8 ms	1088 KB	Output is correct
71	Partially correct	59 ms	1148 KB	Partially correct - number of queries: 5163
72	Correct	10 ms	1148 KB	Output is correct
73	Partially correct	46 ms	1148 KB	Partially correct - number of queries: 5107
74	Partially correct	47 ms	1148 KB	Partially correct - number of queries: 5131
75	Correct	9 ms	1148 KB	Output is correct
76	Correct	51 ms	1148 KB	Output is correct
77	Partially correct	52 ms	1148 KB	Partially correct - number of queries: 5412
78	Correct	14 ms	1148 KB	Output is correct
79	Correct	32 ms	1148 KB	Output is correct
80	Partially correct	55 ms	1148 KB	Partially correct - number of queries: 5406
81	Partially correct	52 ms	1148 KB	Partially correct - number of queries: 5381
82	Partially correct	55 ms	1244 KB	Partially correct - number of queries: 5363
83	Correct	9 ms	1244 KB	Output is correct
84	Correct	35 ms	1244 KB	Output is correct
85	Partially correct	47 ms	1244 KB	Partially correct - number of queries: 5367
86	Correct	9 ms	1244 KB	Output is correct
87	Correct	10 ms	1244 KB	Output is correct
88	Correct	10 ms	1244 KB	Output is correct
89	Correct	9 ms	1244 KB	Output is correct
90	Correct	9 ms	1244 KB	Output is correct
91	Correct	9 ms	1244 KB	Output is correct
92	Correct	8 ms	1244 KB	Output is correct
93	Correct	11 ms	1244 KB	Output is correct
94	Correct	11 ms	1244 KB	Output is correct
95	Correct	12 ms	1244 KB	Output is correct
96	Correct	11 ms	1244 KB	Output is correct
97	Correct	10 ms	1244 KB	Output is correct

답안 #69348

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 75.88 / 80.0

Subtask #1
20.0 / 20.0

Subtask #2
75.88 / 80.0