Submission #70379

# Submission time Handle Problem Language Result Execution time Memory
70379 2018-08-22T18:02:08 Z chpipis The Big Prize (IOI17_prize) C++11
90 / 100
122 ms 6384 KB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;

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

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]++;
        int b;
        for (b = i / SIZE; (b + 1) * SIZE < n; b++) {
            if (query((b + 1) * SIZE) != cur)
                break;
        }
        int lo = max(i + 1, b * SIZE), hi = min(n - 1, (b + 1) * SIZE - 1);
        if (i == (b + 1) * SIZE - 1) {
            lo = (b + 1) * SIZE;
            hi = min(n - 1, (b + 2) * SIZE - 1);
        }
        while (lo < hi) {
            int mid = (lo + hi) >> 1;
            vi now = query(mid);
            if (now == cur) {
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }
        i = hi - 1;
    }
}



Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:76:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 11 ms 5752 KB Output is correct
2 Correct 18 ms 5940 KB Output is correct
3 Correct 16 ms 5940 KB Output is correct
4 Correct 15 ms 5940 KB Output is correct
5 Correct 12 ms 5940 KB Output is correct
6 Correct 9 ms 5940 KB Output is correct
7 Correct 14 ms 5976 KB Output is correct
8 Correct 18 ms 6000 KB Output is correct
9 Correct 11 ms 6000 KB Output is correct
10 Correct 17 ms 6048 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 6048 KB Output is correct
2 Correct 17 ms 6048 KB Output is correct
3 Correct 19 ms 6048 KB Output is correct
4 Correct 18 ms 6048 KB Output is correct
5 Correct 15 ms 6048 KB Output is correct
6 Correct 10 ms 6080 KB Output is correct
7 Correct 16 ms 6080 KB Output is correct
8 Correct 15 ms 6080 KB Output is correct
9 Correct 15 ms 6080 KB Output is correct
10 Correct 14 ms 6080 KB Output is correct
11 Correct 17 ms 6080 KB Output is correct
12 Correct 10 ms 6080 KB Output is correct
13 Correct 23 ms 6092 KB Output is correct
14 Correct 11 ms 6092 KB Output is correct
15 Correct 23 ms 6092 KB Output is correct
16 Partially correct 92 ms 6204 KB Partially correct - number of queries: 6137
17 Correct 11 ms 6204 KB Output is correct
18 Partially correct 65 ms 6324 KB Partially correct - number of queries: 7367
19 Correct 11 ms 6324 KB Output is correct
20 Correct 24 ms 6324 KB Output is correct
21 Correct 33 ms 6324 KB Output is correct
22 Correct 17 ms 6324 KB Output is correct
23 Correct 9 ms 6324 KB Output is correct
24 Correct 10 ms 6324 KB Output is correct
25 Correct 60 ms 6324 KB Output is correct
26 Correct 44 ms 6324 KB Output is correct
27 Correct 13 ms 6324 KB Output is correct
28 Partially correct 68 ms 6324 KB Partially correct - number of queries: 6607
29 Partially correct 62 ms 6324 KB Partially correct - number of queries: 5145
30 Partially correct 122 ms 6324 KB Partially correct - number of queries: 7355
31 Correct 9 ms 6324 KB Output is correct
32 Correct 21 ms 6324 KB Output is correct
33 Correct 9 ms 6324 KB Output is correct
34 Correct 41 ms 6324 KB Output is correct
35 Correct 17 ms 6324 KB Output is correct
36 Correct 17 ms 6324 KB Output is correct
37 Correct 12 ms 6324 KB Output is correct
38 Correct 12 ms 6324 KB Output is correct
39 Correct 41 ms 6324 KB Output is correct
40 Partially correct 88 ms 6324 KB Partially correct - number of queries: 6358
41 Correct 72 ms 6324 KB Output is correct
42 Correct 61 ms 6324 KB Output is correct
43 Correct 58 ms 6324 KB Output is correct
44 Correct 49 ms 6324 KB Output is correct
45 Correct 40 ms 6324 KB Output is correct
46 Correct 10 ms 6324 KB Output is correct
47 Correct 44 ms 6324 KB Output is correct
48 Partially correct 84 ms 6324 KB Partially correct - number of queries: 5259
49 Correct 13 ms 6324 KB Output is correct
50 Partially correct 94 ms 6336 KB Partially correct - number of queries: 7380
51 Correct 36 ms 6336 KB Output is correct
52 Correct 12 ms 6336 KB Output is correct
53 Correct 24 ms 6336 KB Output is correct
54 Correct 32 ms 6336 KB Output is correct
55 Correct 8 ms 6336 KB Output is correct
56 Partially correct 79 ms 6336 KB Partially correct - number of queries: 7389
57 Partially correct 64 ms 6336 KB Partially correct - number of queries: 5222
58 Partially correct 47 ms 6336 KB Partially correct - number of queries: 5243
59 Correct 51 ms 6336 KB Output is correct
60 Correct 50 ms 6336 KB Output is correct
61 Correct 15 ms 6336 KB Output is correct
62 Correct 11 ms 6336 KB Output is correct
63 Correct 17 ms 6336 KB Output is correct
64 Correct 13 ms 6336 KB Output is correct
65 Correct 16 ms 6336 KB Output is correct
66 Correct 17 ms 6336 KB Output is correct
67 Correct 18 ms 6336 KB Output is correct
68 Correct 9 ms 6336 KB Output is correct
69 Correct 15 ms 6336 KB Output is correct
70 Correct 17 ms 6336 KB Output is correct
71 Partially correct 89 ms 6336 KB Partially correct - number of queries: 8620
72 Correct 24 ms 6336 KB Output is correct
73 Partially correct 101 ms 6336 KB Partially correct - number of queries: 8501
74 Partially correct 110 ms 6336 KB Partially correct - number of queries: 8552
75 Correct 20 ms 6336 KB Output is correct
76 Partially correct 56 ms 6336 KB Partially correct - number of queries: 7396
77 Partially correct 73 ms 6336 KB Partially correct - number of queries: 6258
78 Correct 18 ms 6336 KB Output is correct
79 Correct 36 ms 6336 KB Output is correct
80 Partially correct 47 ms 6384 KB Partially correct - number of queries: 6410
81 Partially correct 62 ms 6384 KB Partially correct - number of queries: 6258
82 Partially correct 96 ms 6384 KB Partially correct - number of queries: 6231
83 Correct 18 ms 6384 KB Output is correct
84 Partially correct 67 ms 6384 KB Partially correct - number of queries: 5222
85 Partially correct 75 ms 6384 KB Partially correct - number of queries: 6275
86 Correct 15 ms 6384 KB Output is correct
87 Correct 13 ms 6384 KB Output is correct
88 Correct 11 ms 6384 KB Output is correct
89 Correct 17 ms 6384 KB Output is correct
90 Correct 11 ms 6384 KB Output is correct
91 Correct 19 ms 6384 KB Output is correct
92 Correct 17 ms 6384 KB Output is correct
93 Correct 19 ms 6384 KB Output is correct
94 Correct 16 ms 6384 KB Output is correct
95 Correct 17 ms 6384 KB Output is correct
96 Correct 19 ms 6384 KB Output is correct
97 Correct 13 ms 6384 KB Output is correct