Submission #70401

# Submission time Handle Problem Language Result Execution time Memory
70401 2018-08-22T19:37:22 Z chpipis The Big Prize (IOI17_prize) C++11
96.13 / 100
95 ms 6300 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]++;
        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;
        }
        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 || (now[0] == cnt[type] + cur[0] && now[1] >= cur[1])) {
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }
        i = hi - 1;
    }
}



Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:79:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 13 ms 5752 KB Output is correct
2 Correct 14 ms 5812 KB Output is correct
3 Correct 15 ms 5888 KB Output is correct
4 Correct 22 ms 6092 KB Output is correct
5 Correct 14 ms 6092 KB Output is correct
6 Correct 11 ms 6092 KB Output is correct
7 Correct 19 ms 6092 KB Output is correct
8 Correct 16 ms 6092 KB Output is correct
9 Correct 19 ms 6092 KB Output is correct
10 Correct 16 ms 6092 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 6092 KB Output is correct
2 Correct 15 ms 6092 KB Output is correct
3 Correct 17 ms 6092 KB Output is correct
4 Correct 24 ms 6092 KB Output is correct
5 Correct 13 ms 6092 KB Output is correct
6 Correct 10 ms 6092 KB Output is correct
7 Correct 16 ms 6092 KB Output is correct
8 Correct 18 ms 6092 KB Output is correct
9 Correct 15 ms 6092 KB Output is correct
10 Correct 20 ms 6092 KB Output is correct
11 Correct 19 ms 6092 KB Output is correct
12 Correct 11 ms 6092 KB Output is correct
13 Correct 24 ms 6092 KB Output is correct
14 Correct 12 ms 6092 KB Output is correct
15 Correct 22 ms 6092 KB Output is correct
16 Correct 65 ms 6248 KB Output is correct
17 Correct 11 ms 6248 KB Output is correct
18 Partially correct 95 ms 6248 KB Partially correct - number of queries: 5083
19 Correct 12 ms 6248 KB Output is correct
20 Correct 27 ms 6248 KB Output is correct
21 Correct 39 ms 6248 KB Output is correct
22 Correct 16 ms 6248 KB Output is correct
23 Correct 13 ms 6248 KB Output is correct
24 Correct 11 ms 6248 KB Output is correct
25 Correct 52 ms 6248 KB Output is correct
26 Correct 52 ms 6248 KB Output is correct
27 Correct 9 ms 6248 KB Output is correct
28 Correct 81 ms 6248 KB Output is correct
29 Correct 70 ms 6248 KB Output is correct
30 Partially correct 62 ms 6288 KB Partially correct - number of queries: 5039
31 Correct 10 ms 6288 KB Output is correct
32 Correct 22 ms 6288 KB Output is correct
33 Correct 9 ms 6288 KB Output is correct
34 Correct 42 ms 6288 KB Output is correct
35 Correct 19 ms 6288 KB Output is correct
36 Correct 32 ms 6288 KB Output is correct
37 Correct 12 ms 6288 KB Output is correct
38 Correct 13 ms 6288 KB Output is correct
39 Correct 24 ms 6288 KB Output is correct
40 Correct 54 ms 6288 KB Output is correct
41 Correct 61 ms 6288 KB Output is correct
42 Correct 66 ms 6288 KB Output is correct
43 Correct 48 ms 6288 KB Output is correct
44 Correct 33 ms 6288 KB Output is correct
45 Correct 41 ms 6288 KB Output is correct
46 Correct 10 ms 6288 KB Output is correct
47 Correct 50 ms 6288 KB Output is correct
48 Correct 72 ms 6288 KB Output is correct
49 Correct 20 ms 6288 KB Output is correct
50 Partially correct 45 ms 6288 KB Partially correct - number of queries: 5085
51 Correct 46 ms 6288 KB Output is correct
52 Correct 13 ms 6288 KB Output is correct
53 Correct 16 ms 6288 KB Output is correct
54 Correct 20 ms 6288 KB Output is correct
55 Correct 11 ms 6288 KB Output is correct
56 Partially correct 84 ms 6288 KB Partially correct - number of queries: 5085
57 Correct 63 ms 6288 KB Output is correct
58 Correct 63 ms 6288 KB Output is correct
59 Correct 54 ms 6288 KB Output is correct
60 Correct 31 ms 6288 KB Output is correct
61 Correct 23 ms 6288 KB Output is correct
62 Correct 13 ms 6288 KB Output is correct
63 Correct 22 ms 6288 KB Output is correct
64 Correct 16 ms 6288 KB Output is correct
65 Correct 19 ms 6288 KB Output is correct
66 Correct 20 ms 6288 KB Output is correct
67 Correct 14 ms 6288 KB Output is correct
68 Correct 13 ms 6288 KB Output is correct
69 Correct 22 ms 6288 KB Output is correct
70 Correct 26 ms 6288 KB Output is correct
71 Partially correct 80 ms 6288 KB Partially correct - number of queries: 5387
72 Correct 23 ms 6288 KB Output is correct
73 Partially correct 80 ms 6288 KB Partially correct - number of queries: 5317
74 Partially correct 90 ms 6288 KB Partially correct - number of queries: 5347
75 Correct 22 ms 6288 KB Output is correct
76 Correct 82 ms 6288 KB Output is correct
77 Partially correct 70 ms 6300 KB Partially correct - number of queries: 5250
78 Correct 16 ms 6300 KB Output is correct
79 Correct 41 ms 6300 KB Output is correct
80 Partially correct 95 ms 6300 KB Partially correct - number of queries: 5264
81 Partially correct 73 ms 6300 KB Partially correct - number of queries: 5237
82 Partially correct 74 ms 6300 KB Partially correct - number of queries: 5191
83 Correct 19 ms 6300 KB Output is correct
84 Correct 76 ms 6300 KB Output is correct
85 Partially correct 74 ms 6300 KB Partially correct - number of queries: 5226
86 Correct 16 ms 6300 KB Output is correct
87 Correct 24 ms 6300 KB Output is correct
88 Correct 20 ms 6300 KB Output is correct
89 Correct 21 ms 6300 KB Output is correct
90 Correct 19 ms 6300 KB Output is correct
91 Correct 23 ms 6300 KB Output is correct
92 Correct 14 ms 6300 KB Output is correct
93 Correct 17 ms 6300 KB Output is correct
94 Correct 20 ms 6300 KB Output is correct
95 Correct 20 ms 6300 KB Output is correct
96 Correct 20 ms 6300 KB Output is correct
97 Correct 17 ms 6300 KB Output is correct