답안 #53433 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
53433	2018-06-30T02:26:03 Z	fallingstar	커다란 상품 (IOI17_prize)	C++14	100 / 100	50 ms	5536 KB

prize

#include <cassert>
#include <iostream>
#include <vector>

using namespace std;

const int N = 2e5 + 2;

vector<int> cache[N];
vector<int> lv(1, 1);

int sumUpper = 0;

vector<int> ask(int i);
int countQuery = 0;
vector<int> Ask(int i)
{
    assert(++countQuery <= 6000);
    return ask(i);
}

inline bool Type(int i) { return cache[i][0] + cache[i][1] == sumUpper; }

int Solve(int l, int r, int cntL, int cntR)
{
    int cur = sumUpper - cntL - cntR;
    
    if (l > r || cur == 0) return -1;
    
    int i = (l + r) / 2;
    while (true)
    {
        if (cache[i].empty()) cache[i] = Ask(i);
        if (cache[i][0] + cache[i][1] == 0) return i;
        if (Type(i)) 
            return max(Solve(l, i - 1, cntL, cache[i][1]), Solve(i + 1, r, cache[i][0], cntR));
        if (i == r) return Solve(l, (l + r) / 2 - 1, cntL, cntR + r - (l + r) / 2 + 1);
        ++i;
    }
    return -1;
}

int find_best(int n)
{
    for (int i = 1, sum = 1; ; ++i)
    {
        int nex = lv.back() * lv.back() + 1;
        if (sum + nex + (long long) nex * nex + 1 <= n)
        {
            lv.push_back(nex);
            sum += nex * nex;
        }
        else
        {
            int &cur = lv.back();
            while (sum + 1 + (cur + 1) * (cur + 1) + 1 <= n) ++cur;
            break;
        }
    }
    
    
    int upp = 1;
    for (int i = 0; i < (int) lv.size(); ++i)
        upp += lv[i];
    
    for (int i = 0; i < n; ++i)
        if ((i + 1) % (n / upp) == 0) 
        {
            cache[i] = Ask(i);
            sumUpper = max(sumUpper, cache[i][0] + cache[i][1]);
        }
    
    int last = -1, sumL = 0;
    for (int i = 0, need = 0; i < n; ++i)
    {
        if (!cache[i].empty() && cache[i][0] + cache[i][1] == 0) return i;
        need += (i + 1) % (n / upp) == 0;
        need -= !cache[i].empty() && Type(i);
        if (need && cache[i].empty())
        {
            cache[i] = Ask(i);
            --need;
        }
        if (!cache[i].empty() && Type(i))
        {
            int solved = Solve(last + 1, i - 1, sumL, cache[i][1]);
            if (solved != -1) return solved;
            last = i;
            sumL = cache[i][0];
        }
    }
    return Solve(last + 1, n - 1, sumL, 0);
}

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5120 KB	Output is correct
2	Correct	15 ms	5120 KB	Output is correct
3	Correct	10 ms	5220 KB	Output is correct
4	Correct	15 ms	5220 KB	Output is correct
5	Correct	10 ms	5360 KB	Output is correct
6	Correct	9 ms	5360 KB	Output is correct
7	Correct	8 ms	5360 KB	Output is correct
8	Correct	11 ms	5360 KB	Output is correct
9	Correct	11 ms	5360 KB	Output is correct
10	Correct	11 ms	5360 KB	Output is correct

Subtask #2
80.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	5360 KB	Output is correct
2	Correct	9 ms	5360 KB	Output is correct
3	Correct	10 ms	5360 KB	Output is correct
4	Correct	11 ms	5360 KB	Output is correct
5	Correct	11 ms	5360 KB	Output is correct
6	Correct	9 ms	5360 KB	Output is correct
7	Correct	10 ms	5360 KB	Output is correct
8	Correct	8 ms	5360 KB	Output is correct
9	Correct	11 ms	5360 KB	Output is correct
10	Correct	8 ms	5360 KB	Output is correct
11	Correct	9 ms	5360 KB	Output is correct
12	Correct	13 ms	5360 KB	Output is correct
13	Correct	13 ms	5360 KB	Output is correct
14	Correct	8 ms	5360 KB	Output is correct
15	Correct	16 ms	5360 KB	Output is correct
16	Correct	38 ms	5360 KB	Output is correct
17	Correct	13 ms	5360 KB	Output is correct
18	Correct	41 ms	5408 KB	Output is correct
19	Correct	14 ms	5408 KB	Output is correct
20	Correct	22 ms	5408 KB	Output is correct
21	Correct	14 ms	5428 KB	Output is correct
22	Correct	10 ms	5428 KB	Output is correct
23	Correct	10 ms	5428 KB	Output is correct
24	Correct	9 ms	5428 KB	Output is correct
25	Correct	35 ms	5428 KB	Output is correct
26	Correct	30 ms	5428 KB	Output is correct
27	Correct	12 ms	5428 KB	Output is correct
28	Correct	26 ms	5428 KB	Output is correct
29	Correct	29 ms	5428 KB	Output is correct
30	Correct	34 ms	5428 KB	Output is correct
31	Correct	10 ms	5428 KB	Output is correct
32	Correct	13 ms	5428 KB	Output is correct
33	Correct	5 ms	5428 KB	Output is correct
34	Correct	18 ms	5428 KB	Output is correct
35	Correct	12 ms	5428 KB	Output is correct
36	Correct	15 ms	5428 KB	Output is correct
37	Correct	11 ms	5428 KB	Output is correct
38	Correct	10 ms	5428 KB	Output is correct
39	Correct	26 ms	5428 KB	Output is correct
40	Correct	40 ms	5428 KB	Output is correct
41	Correct	32 ms	5428 KB	Output is correct
42	Correct	36 ms	5428 KB	Output is correct
43	Correct	22 ms	5428 KB	Output is correct
44	Correct	15 ms	5428 KB	Output is correct
45	Correct	20 ms	5428 KB	Output is correct
46	Correct	10 ms	5428 KB	Output is correct
47	Correct	21 ms	5428 KB	Output is correct
48	Correct	29 ms	5428 KB	Output is correct
49	Correct	15 ms	5428 KB	Output is correct
50	Correct	34 ms	5536 KB	Output is correct
51	Correct	25 ms	5536 KB	Output is correct
52	Correct	10 ms	5536 KB	Output is correct
53	Correct	12 ms	5536 KB	Output is correct
54	Correct	25 ms	5536 KB	Output is correct
55	Correct	10 ms	5536 KB	Output is correct
56	Correct	43 ms	5536 KB	Output is correct
57	Correct	33 ms	5536 KB	Output is correct
58	Correct	43 ms	5536 KB	Output is correct
59	Correct	31 ms	5536 KB	Output is correct
60	Correct	26 ms	5536 KB	Output is correct
61	Correct	16 ms	5536 KB	Output is correct
62	Correct	12 ms	5536 KB	Output is correct
63	Correct	17 ms	5536 KB	Output is correct
64	Correct	9 ms	5536 KB	Output is correct
65	Correct	16 ms	5536 KB	Output is correct
66	Correct	13 ms	5536 KB	Output is correct
67	Correct	16 ms	5536 KB	Output is correct
68	Correct	10 ms	5536 KB	Output is correct
69	Correct	14 ms	5536 KB	Output is correct
70	Correct	12 ms	5536 KB	Output is correct
71	Correct	42 ms	5536 KB	Output is correct
72	Correct	10 ms	5536 KB	Output is correct
73	Correct	43 ms	5536 KB	Output is correct
74	Correct	42 ms	5536 KB	Output is correct
75	Correct	11 ms	5536 KB	Output is correct
76	Correct	41 ms	5536 KB	Output is correct
77	Correct	26 ms	5536 KB	Output is correct
78	Correct	12 ms	5536 KB	Output is correct
79	Correct	24 ms	5536 KB	Output is correct
80	Correct	45 ms	5536 KB	Output is correct
81	Correct	40 ms	5536 KB	Output is correct
82	Correct	47 ms	5536 KB	Output is correct
83	Correct	10 ms	5536 KB	Output is correct
84	Correct	33 ms	5536 KB	Output is correct
85	Correct	44 ms	5536 KB	Output is correct
86	Correct	19 ms	5536 KB	Output is correct
87	Correct	13 ms	5536 KB	Output is correct
88	Correct	33 ms	5536 KB	Output is correct
89	Correct	31 ms	5536 KB	Output is correct
90	Correct	12 ms	5536 KB	Output is correct
91	Correct	23 ms	5536 KB	Output is correct
92	Correct	32 ms	5536 KB	Output is correct
93	Correct	24 ms	5536 KB	Output is correct
94	Correct	41 ms	5536 KB	Output is correct
95	Correct	25 ms	5536 KB	Output is correct
96	Correct	50 ms	5536 KB	Output is correct
97	Correct	37 ms	5536 KB	Output is correct

답안 #53433

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 80.0 / 80.0

Subtask #1
20.0 / 20.0

Subtask #2
80.0 / 80.0