답안 #53426

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
53426 2018-06-30T02:02:53 Z fallingstar 커다란 상품 (IOI17_prize) C++14
20 / 100
73 ms 10688 KB
#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 <= 10000);
    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 <= n && sum + nex * nex + 1 <= n)
            lv.push_back(nex);
        else 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);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4984 KB Output is correct
2 Correct 8 ms 5072 KB Output is correct
3 Correct 7 ms 5124 KB Output is correct
4 Correct 8 ms 5200 KB Output is correct
5 Correct 7 ms 5212 KB Output is correct
6 Correct 7 ms 5268 KB Output is correct
7 Correct 8 ms 5268 KB Output is correct
8 Correct 7 ms 5268 KB Output is correct
9 Correct 8 ms 5268 KB Output is correct
10 Correct 8 ms 5268 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5268 KB Output is correct
2 Correct 7 ms 5268 KB Output is correct
3 Correct 10 ms 5268 KB Output is correct
4 Correct 11 ms 5268 KB Output is correct
5 Correct 8 ms 5268 KB Output is correct
6 Correct 8 ms 5268 KB Output is correct
7 Correct 8 ms 5268 KB Output is correct
8 Correct 7 ms 5268 KB Output is correct
9 Correct 8 ms 5268 KB Output is correct
10 Correct 8 ms 5268 KB Output is correct
11 Correct 8 ms 5308 KB Output is correct
12 Correct 7 ms 5308 KB Output is correct
13 Correct 11 ms 5308 KB Output is correct
14 Correct 8 ms 5308 KB Output is correct
15 Correct 10 ms 5308 KB Output is correct
16 Correct 35 ms 5308 KB Output is correct
17 Correct 8 ms 5308 KB Output is correct
18 Correct 46 ms 5308 KB Output is correct
19 Correct 9 ms 5308 KB Output is correct
20 Correct 13 ms 5308 KB Output is correct
21 Correct 21 ms 5312 KB Output is correct
22 Correct 10 ms 5312 KB Output is correct
23 Correct 7 ms 5312 KB Output is correct
24 Correct 7 ms 5312 KB Output is correct
25 Correct 31 ms 5312 KB Output is correct
26 Correct 33 ms 5380 KB Output is correct
27 Correct 9 ms 5380 KB Output is correct
28 Correct 42 ms 5380 KB Output is correct
29 Correct 36 ms 5380 KB Output is correct
30 Correct 45 ms 5380 KB Output is correct
31 Correct 8 ms 5380 KB Output is correct
32 Correct 11 ms 5380 KB Output is correct
33 Correct 6 ms 5380 KB Output is correct
34 Correct 18 ms 5380 KB Output is correct
35 Correct 11 ms 5380 KB Output is correct
36 Correct 17 ms 5380 KB Output is correct
37 Correct 8 ms 5380 KB Output is correct
38 Correct 8 ms 5380 KB Output is correct
39 Correct 21 ms 5408 KB Output is correct
40 Correct 44 ms 5408 KB Output is correct
41 Correct 28 ms 5408 KB Output is correct
42 Correct 26 ms 5408 KB Output is correct
43 Correct 30 ms 5408 KB Output is correct
44 Correct 26 ms 5408 KB Output is correct
45 Correct 21 ms 5408 KB Output is correct
46 Correct 11 ms 5408 KB Output is correct
47 Correct 24 ms 5408 KB Output is correct
48 Correct 37 ms 5408 KB Output is correct
49 Correct 10 ms 5408 KB Output is correct
50 Correct 26 ms 5448 KB Output is correct
51 Correct 27 ms 5448 KB Output is correct
52 Correct 8 ms 5448 KB Output is correct
53 Correct 9 ms 5448 KB Output is correct
54 Correct 28 ms 5448 KB Output is correct
55 Correct 11 ms 5448 KB Output is correct
56 Correct 40 ms 5448 KB Output is correct
57 Correct 38 ms 5448 KB Output is correct
58 Correct 32 ms 5448 KB Output is correct
59 Correct 31 ms 5448 KB Output is correct
60 Correct 42 ms 5448 KB Output is correct
61 Correct 8 ms 5448 KB Output is correct
62 Correct 7 ms 5448 KB Output is correct
63 Correct 8 ms 5448 KB Output is correct
64 Correct 7 ms 5448 KB Output is correct
65 Correct 8 ms 5448 KB Output is correct
66 Correct 14 ms 5448 KB Output is correct
67 Correct 10 ms 5448 KB Output is correct
68 Correct 7 ms 5448 KB Output is correct
69 Correct 10 ms 5448 KB Output is correct
70 Correct 9 ms 5448 KB Output is correct
71 Correct 41 ms 5448 KB Output is correct
72 Correct 15 ms 5448 KB Output is correct
73 Correct 26 ms 5448 KB Output is correct
74 Correct 43 ms 5448 KB Output is correct
75 Correct 8 ms 5448 KB Output is correct
76 Correct 39 ms 5448 KB Output is correct
77 Correct 46 ms 5448 KB Output is correct
78 Correct 12 ms 5448 KB Output is correct
79 Correct 27 ms 5448 KB Output is correct
80 Correct 46 ms 5448 KB Output is correct
81 Correct 53 ms 5448 KB Output is correct
82 Correct 41 ms 5448 KB Output is correct
83 Correct 9 ms 5448 KB Output is correct
84 Correct 36 ms 5448 KB Output is correct
85 Correct 33 ms 5616 KB Output is correct
86 Runtime error 73 ms 10688 KB Execution killed with signal 11 (could be triggered by violating memory limits)
87 Halted 0 ms 0 KB -