Submission #70409

# Submission time Handle Problem Language Result Execution time Memory
70409 2018-08-22T19:50:45 Z chpipis The Big Prize (IOI17_prize) C++11
98.44 / 100
68 ms 6292 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);
        }
        int same = 0, who = type;
        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])) {
                if (now == cur) {
                    who = type;
                } else {
                    who = now[0] + now[1];
                }
                same = mid - i;
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }
        cnt[who] += same;
        i = hi - 1;
    }
}



Compilation message

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