답안 #464778

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464778	2021-08-14T03:28:47 Z	hellowsdf	커다란 상품 (IOI17_prize)	C++14	100 / 100	65 ms	5480 KB

prize

#include "prize.h"
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

vector<int> res[202020];
bool visited[202020];

int worst_sum = 0;

vector<int> query(int pos) {
    if (visited[pos]) return res[pos];
    visited[pos] = true;
    res[pos] = ask(pos);
    if (res[pos][0] + res[pos][1] == 0) throw pos;
    return res[pos];
}

void binary_search(int l, int r, int nl, int nr) {
    FOR(i, 0, r - l + 1) {
        int mid, midl = (l + r) / 2 - i / 2, midr = (l + r) / 2 + (i + 1) / 2;
        if (i & 1)
            mid = midr;
        else
            mid = midl;

        vector<int> x = query(mid);
        if (x[0] + x[1] == worst_sum) {
            int xl = (i & 1 ? midr - midl : 0), xr = (i & 1 ? 0 : midr - midl);
            if (x[0] - xl > nl) binary_search(l, midl - 1, nl, x[1] + xl);
            if (x[1] - xr > nr) binary_search(midr + 1, r, x[0] + xr, nr);
            break;
        }
    }
}

int find_best(int n) {
    try {
        int p = 0;
        for (int i = 0; i < 474 && i < n && worst_sum < 27; i++) {
            vector<int> x = query(i);
            if (x[0] + x[1] > worst_sum) p = i, worst_sum = x[0] + x[1];
        }
        binary_search(p, n - 1, p, 0);
    } catch (int ans) {
        return ans;
    }

    return -1;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	5032 KB	Output is correct
2	Correct	10 ms	5036 KB	Output is correct
3	Correct	11 ms	5128 KB	Output is correct
4	Correct	11 ms	5056 KB	Output is correct
5	Correct	9 ms	5056 KB	Output is correct
6	Correct	5 ms	5032 KB	Output is correct
7	Correct	9 ms	5056 KB	Output is correct
8	Correct	8 ms	5048 KB	Output is correct
9	Correct	10 ms	5028 KB	Output is correct
10	Correct	9 ms	5084 KB	Output is correct

Subtask #2

80.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	5072 KB	Output is correct
2	Correct	10 ms	5036 KB	Output is correct
3	Correct	11 ms	5040 KB	Output is correct
4	Correct	11 ms	5132 KB	Output is correct
5	Correct	12 ms	5036 KB	Output is correct
6	Correct	5 ms	5064 KB	Output is correct
7	Correct	12 ms	5012 KB	Output is correct
8	Correct	10 ms	5052 KB	Output is correct
9	Correct	10 ms	5028 KB	Output is correct
10	Correct	10 ms	5044 KB	Output is correct
11	Correct	6 ms	5220 KB	Output is correct
12	Correct	5 ms	5036 KB	Output is correct
13	Correct	10 ms	5284 KB	Output is correct
14	Correct	6 ms	5064 KB	Output is correct
15	Correct	12 ms	5160 KB	Output is correct
16	Correct	23 ms	5292 KB	Output is correct
17	Correct	5 ms	5064 KB	Output is correct
18	Correct	25 ms	5380 KB	Output is correct
19	Correct	6 ms	5028 KB	Output is correct
20	Correct	18 ms	5084 KB	Output is correct
21	Correct	13 ms	5144 KB	Output is correct
22	Correct	9 ms	5028 KB	Output is correct
23	Correct	7 ms	5072 KB	Output is correct
24	Correct	5 ms	5064 KB	Output is correct
25	Correct	32 ms	5280 KB	Output is correct
26	Correct	25 ms	5184 KB	Output is correct
27	Correct	10 ms	5064 KB	Output is correct
28	Correct	40 ms	5280 KB	Output is correct
29	Correct	42 ms	5260 KB	Output is correct
30	Correct	54 ms	5428 KB	Output is correct
31	Correct	5 ms	5064 KB	Output is correct
32	Correct	9 ms	5152 KB	Output is correct
33	Correct	5 ms	5064 KB	Output is correct
34	Correct	19 ms	5192 KB	Output is correct
35	Correct	9 ms	5240 KB	Output is correct
36	Correct	10 ms	5116 KB	Output is correct
37	Correct	6 ms	5064 KB	Output is correct
38	Correct	11 ms	5036 KB	Output is correct
39	Correct	14 ms	5156 KB	Output is correct
40	Correct	23 ms	5312 KB	Output is correct
41	Correct	33 ms	5184 KB	Output is correct
42	Correct	16 ms	5224 KB	Output is correct
43	Correct	34 ms	5184 KB	Output is correct
44	Correct	23 ms	5200 KB	Output is correct
45	Correct	12 ms	5244 KB	Output is correct
46	Correct	5 ms	5060 KB	Output is correct
47	Correct	23 ms	5188 KB	Output is correct
48	Correct	47 ms	5288 KB	Output is correct
49	Correct	10 ms	5036 KB	Output is correct
50	Correct	29 ms	5340 KB	Output is correct
51	Correct	25 ms	5172 KB	Output is correct
52	Correct	5 ms	5056 KB	Output is correct
53	Correct	12 ms	5184 KB	Output is correct
54	Correct	16 ms	5156 KB	Output is correct
55	Correct	6 ms	5064 KB	Output is correct
56	Correct	49 ms	5356 KB	Output is correct
57	Correct	49 ms	5308 KB	Output is correct
58	Correct	34 ms	5308 KB	Output is correct
59	Correct	29 ms	5184 KB	Output is correct
60	Correct	25 ms	5212 KB	Output is correct
61	Correct	13 ms	5152 KB	Output is correct
62	Correct	11 ms	5052 KB	Output is correct
63	Correct	10 ms	5184 KB	Output is correct
64	Correct	12 ms	5152 KB	Output is correct
65	Correct	5 ms	5132 KB	Output is correct
66	Correct	11 ms	5056 KB	Output is correct
67	Correct	7 ms	5064 KB	Output is correct
68	Correct	9 ms	5036 KB	Output is correct
69	Correct	9 ms	5068 KB	Output is correct
70	Correct	7 ms	5016 KB	Output is correct
71	Correct	55 ms	5424 KB	Output is correct
72	Correct	11 ms	5192 KB	Output is correct
73	Correct	65 ms	5336 KB	Output is correct
74	Correct	63 ms	5480 KB	Output is correct
75	Correct	10 ms	5180 KB	Output is correct
76	Correct	45 ms	5344 KB	Output is correct
77	Correct	55 ms	5388 KB	Output is correct
78	Correct	11 ms	5288 KB	Output is correct
79	Correct	31 ms	5248 KB	Output is correct
80	Correct	59 ms	5364 KB	Output is correct
81	Correct	61 ms	5312 KB	Output is correct
82	Correct	58 ms	5316 KB	Output is correct
83	Correct	12 ms	5184 KB	Output is correct
84	Correct	37 ms	5440 KB	Output is correct
85	Correct	40 ms	5312 KB	Output is correct
86	Correct	10 ms	5064 KB	Output is correct
87	Correct	5 ms	5064 KB	Output is correct
88	Correct	11 ms	5048 KB	Output is correct
89	Correct	10 ms	5056 KB	Output is correct
90	Correct	10 ms	5064 KB	Output is correct
91	Correct	8 ms	5036 KB	Output is correct
92	Correct	9 ms	5064 KB	Output is correct
93	Correct	13 ms	5196 KB	Output is correct
94	Correct	14 ms	5184 KB	Output is correct
95	Correct	12 ms	5196 KB	Output is correct
96	Correct	15 ms	5148 KB	Output is correct
97	Correct	9 ms	5064 KB	Output is correct