Submission #70413

# Submission time Handle Problem Language Result Execution time Memory
70413 2018-08-22T19:56:32 Z chpipis The Big Prize (IOI17_prize) C++11
90 / 100
89 ms 6372 KB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;

const int MAXN = 2e5 + 5;
const int SIZE = 350;

int cnt[MAXN], num_q;
vi memo[MAXN];

vi query(int x) {
    if (memo[x].size() > 0)
        return memo[x];
    num_q++;
    vi ret = ask(x);
    return memo[x] = ret;
}

int find_best(int n) {
    memset(cnt, 0, sizeof cnt);
    fill(memo, memo + n + 1, vi());
    num_q = 0;
    /*
    int mx = -1;
    for (int i = 0, j; i < n; i = j + 1) {
        if (i == n - 1) return i;
        j = i;
        vi cur = query(i);
        if (cur[0] + cur[1] == 0) return i;
        if (cur[0] + cur[1] < mx) continue;
        mx = max(mx, cur[0] + cur[1]);
        int lo = i + 1, hi = n - 1;
        while (lo <= hi) {
            int mid = (lo + hi) >> 1;
            vi now = query(mid);
            if (now[0] + now[1] == 0) return mid;
            if (now == cur) {
                lo = mid + 1;
                j = mid;
            } else {
                hi = mid - 1;
            }
        }
    }
    */
    for (int i = 0; i < n; i++) {
        if (i == n - 1) return i;
        vi cur = query(i);
        int type = cur[0] + cur[1];
        if (type == 0) return i;
        cnt[type]++;
        //if (query(i + 1) != cur)
          //  continue;
        int b;
        for (b = i / SIZE; (b + 1) * SIZE < n; b++) {
            vi now = query((b + 1) * SIZE);
            if (!(now == cur || (now[0] == cnt[type] + cur[0] && now[1] >= cur[1])))
                break;
            cnt[now[0] + now[1]] += b * SIZE + SIZE - 1 - max(i, b * SIZE - 1);
        }
        int lo = max(i + 1, b * SIZE), hi = min(n - 1, (b + 1) * SIZE);
        if (i == (b + 1) * SIZE - 1) {
            lo = (b + 1) * SIZE;
            hi = min(n - 1, (b + 2) * SIZE);
        }
        while (lo < hi) {
            int mid = (lo + hi) >> 1;
            vi now = query(mid);
            if (now == cur || (now[0] == cnt[type] + cur[0] && now[1] >= cur[1])) {
                cnt[now[0] + now[1]] += mid - lo + 1;
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }
        i = hi - 1;
    }
}



Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:81:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 9 ms 5752 KB Output is correct
2 Correct 13 ms 5940 KB Output is correct
3 Correct 10 ms 5940 KB Output is correct
4 Correct 12 ms 5948 KB Output is correct
5 Correct 11 ms 5948 KB Output is correct
6 Correct 9 ms 5980 KB Output is correct
7 Correct 13 ms 5980 KB Output is correct
8 Correct 13 ms 5980 KB Output is correct
9 Correct 12 ms 5980 KB Output is correct
10 Correct 10 ms 6056 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 6144 KB Output is correct
2 Correct 10 ms 6144 KB Output is correct
3 Correct 11 ms 6144 KB Output is correct
4 Correct 15 ms 6144 KB Output is correct
5 Correct 14 ms 6144 KB Output is correct
6 Correct 8 ms 6144 KB Output is correct
7 Correct 11 ms 6144 KB Output is correct
8 Correct 11 ms 6144 KB Output is correct
9 Correct 11 ms 6144 KB Output is correct
10 Correct 13 ms 6144 KB Output is correct
11 Correct 12 ms 6144 KB Output is correct
12 Correct 9 ms 6144 KB Output is correct
13 Correct 22 ms 6144 KB Output is correct
14 Correct 10 ms 6144 KB Output is correct
15 Correct 20 ms 6144 KB Output is correct
16 Partially correct 78 ms 6224 KB Partially correct - number of queries: 6191
17 Correct 8 ms 6224 KB Output is correct
18 Partially correct 87 ms 6224 KB Partially correct - number of queries: 7524
19 Correct 9 ms 6224 KB Output is correct
20 Correct 26 ms 6224 KB Output is correct
21 Correct 38 ms 6224 KB Output is correct
22 Correct 12 ms 6224 KB Output is correct
23 Correct 9 ms 6224 KB Output is correct
24 Correct 8 ms 6224 KB Output is correct
25 Correct 39 ms 6228 KB Output is correct
26 Correct 49 ms 6228 KB Output is correct
27 Correct 9 ms 6228 KB Output is correct
28 Partially correct 86 ms 6228 KB Partially correct - number of queries: 6654
29 Partially correct 33 ms 6228 KB Partially correct - number of queries: 5200
30 Partially correct 74 ms 6372 KB Partially correct - number of queries: 7432
31 Correct 9 ms 6372 KB Output is correct
32 Correct 17 ms 6372 KB Output is correct
33 Correct 7 ms 6372 KB Output is correct
34 Correct 33 ms 6372 KB Output is correct
35 Correct 14 ms 6372 KB Output is correct
36 Correct 26 ms 6372 KB Output is correct
37 Correct 9 ms 6372 KB Output is correct
38 Correct 10 ms 6372 KB Output is correct
39 Correct 50 ms 6372 KB Output is correct
40 Partially correct 80 ms 6372 KB Partially correct - number of queries: 6403
41 Correct 41 ms 6372 KB Output is correct
42 Correct 40 ms 6372 KB Output is correct
43 Correct 31 ms 6372 KB Output is correct
44 Correct 37 ms 6372 KB Output is correct
45 Correct 37 ms 6372 KB Output is correct
46 Correct 10 ms 6372 KB Output is correct
47 Correct 40 ms 6372 KB Output is correct
48 Partially correct 65 ms 6372 KB Partially correct - number of queries: 5316
49 Correct 16 ms 6372 KB Output is correct
50 Partially correct 89 ms 6372 KB Partially correct - number of queries: 7476
51 Correct 38 ms 6372 KB Output is correct
52 Correct 10 ms 6372 KB Output is correct
53 Correct 15 ms 6372 KB Output is correct
54 Correct 20 ms 6372 KB Output is correct
55 Correct 9 ms 6372 KB Output is correct
56 Partially correct 66 ms 6372 KB Partially correct - number of queries: 7472
57 Partially correct 79 ms 6372 KB Partially correct - number of queries: 5244
58 Partially correct 68 ms 6372 KB Partially correct - number of queries: 5321
59 Correct 61 ms 6372 KB Output is correct
60 Correct 47 ms 6372 KB Output is correct
61 Correct 18 ms 6372 KB Output is correct
62 Correct 9 ms 6372 KB Output is correct
63 Correct 14 ms 6372 KB Output is correct
64 Correct 11 ms 6372 KB Output is correct
65 Correct 15 ms 6372 KB Output is correct
66 Correct 16 ms 6372 KB Output is correct
67 Correct 17 ms 6372 KB Output is correct
68 Correct 9 ms 6372 KB Output is correct
69 Correct 14 ms 6372 KB Output is correct
70 Correct 14 ms 6372 KB Output is correct
71 Correct 56 ms 6372 KB Output is correct
72 Correct 17 ms 6372 KB Output is correct
73 Correct 54 ms 6372 KB Output is correct
74 Correct 63 ms 6372 KB Output is correct
75 Correct 15 ms 6372 KB Output is correct
76 Correct 52 ms 6372 KB Output is correct
77 Partially correct 69 ms 6372 KB Partially correct - number of queries: 7252
78 Correct 14 ms 6372 KB Output is correct
79 Correct 32 ms 6372 KB Output is correct
80 Partially correct 55 ms 6372 KB Partially correct - number of queries: 7242
81 Partially correct 57 ms 6372 KB Partially correct - number of queries: 7231
82 Partially correct 64 ms 6372 KB Partially correct - number of queries: 7181
83 Correct 15 ms 6372 KB Output is correct
84 Partially correct 74 ms 6372 KB Partially correct - number of queries: 5998
85 Partially correct 65 ms 6372 KB Partially correct - number of queries: 7225
86 Correct 15 ms 6372 KB Output is correct
87 Correct 13 ms 6372 KB Output is correct
88 Correct 15 ms 6372 KB Output is correct
89 Correct 10 ms 6372 KB Output is correct
90 Correct 20 ms 6372 KB Output is correct
91 Correct 14 ms 6372 KB Output is correct
92 Correct 14 ms 6372 KB Output is correct
93 Correct 15 ms 6372 KB Output is correct
94 Correct 15 ms 6372 KB Output is correct
95 Correct 15 ms 6372 KB Output is correct
96 Correct 15 ms 6372 KB Output is correct
97 Correct 14 ms 6372 KB Output is correct