Submission #1030988

# Submission time Handle Problem Language Result Execution time Memory
1030988 2024-07-22T13:15:53 Z coolboy19521 The Big Prize (IOI17_prize) C++17
99.72 / 100
47 ms 5528 KB
#include "prize.h"
#include "iostream"
 
using namespace std;

const int sz = 2e5 + 10;

vector<int> bf[sz];
int ft[sz];
int N;

void inc(int v) {
    for (; v <= N; v += v & -v)
        ft[v] ++;
}

int sum(int le, int ri) {
    le --;
    int ql = 0;
    for (; 0 < le; le -= le & -le)
        ql += ft[le];
    int qr = 0;
    for (; 0 < ri; ri -= ri & -ri)
        qr += ft[ri];
    return qr - ql;
}

vector<int> Ask(int x) {
    if (bf[x].size()) return bf[x];
    return bf[x] = ask(x);
}
 
int find_best(int n) {
    int mx = 0, xx = 600;
    for (int i = 0; i < min(n, 600); i ++) {
        auto pr = Ask(i);
        mx = max(mx, pr[0] + pr[1]);
        if (0 == pr[0] + pr[1]) return i;
        if (30 < mx) {
            xx = i + 1;
            break;
        }
        inc(i + 1);
    }
    int ls = xx;
    while (ls < n) {
        int ps;
        for (; ls < n; ls ++) {
            auto pr = Ask(ls);
            int sm = pr[0] + pr[1];
            if (0 == sm) return ls;
            if (sm == mx) {
                ps = pr[1];
                break;
            }
            inc(ls + 1);
        }
        int ds = xx;
        int rs = n;
        while (1 < rs - ds) {
            int mi = (ds + rs) / 2;
            if (mi <= ls) {
                ds = mi;
                continue;
            }
            if (sum(ls + 1, mi + 1)) {
                rs = mi;
                continue;
            }
            auto pr = Ask(mi);
            int sm = pr[0] + pr[1];
            if (0 == sm) return mi;
            if (sm != mx) {
                inc(mi + 1);
                rs = mi;
            }
            if (0 == ps - pr[1]) ds = mi;
            else rs = mi;
        }
        ls = ds + 1;
    }
    return 0;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:77:13: warning: 'ps' may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |             if (0 == ps - pr[1]) ds = mi;
      |             ^~
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4952 KB Output is correct
2 Correct 6 ms 4952 KB Output is correct
3 Correct 5 ms 4952 KB Output is correct
4 Correct 5 ms 4952 KB Output is correct
5 Correct 5 ms 4952 KB Output is correct
6 Correct 3 ms 4952 KB Output is correct
7 Correct 6 ms 4952 KB Output is correct
8 Correct 6 ms 4952 KB Output is correct
9 Correct 4 ms 4952 KB Output is correct
10 Correct 6 ms 5144 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4952 KB Output is correct
2 Correct 5 ms 4952 KB Output is correct
3 Correct 4 ms 5140 KB Output is correct
4 Correct 4 ms 4952 KB Output is correct
5 Correct 6 ms 4952 KB Output is correct
6 Correct 3 ms 4952 KB Output is correct
7 Correct 6 ms 5208 KB Output is correct
8 Correct 5 ms 4952 KB Output is correct
9 Correct 6 ms 4952 KB Output is correct
10 Correct 5 ms 4952 KB Output is correct
11 Correct 3 ms 4952 KB Output is correct
12 Correct 2 ms 4952 KB Output is correct
13 Correct 5 ms 5136 KB Output is correct
14 Correct 3 ms 4952 KB Output is correct
15 Correct 7 ms 5208 KB Output is correct
16 Correct 23 ms 5468 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 25 ms 5208 KB Output is correct
19 Correct 2 ms 4952 KB Output is correct
20 Correct 7 ms 4952 KB Output is correct
21 Correct 10 ms 5376 KB Output is correct
22 Correct 4 ms 4952 KB Output is correct
23 Correct 7 ms 4952 KB Output is correct
24 Correct 2 ms 4952 KB Output is correct
25 Correct 16 ms 5208 KB Output is correct
26 Correct 10 ms 5200 KB Output is correct
27 Correct 6 ms 5204 KB Output is correct
28 Correct 21 ms 5228 KB Output is correct
29 Correct 18 ms 5204 KB Output is correct
30 Correct 27 ms 5500 KB Output is correct
31 Correct 2 ms 4952 KB Output is correct
32 Correct 5 ms 4952 KB Output is correct
33 Correct 3 ms 4952 KB Output is correct
34 Correct 9 ms 4952 KB Output is correct
35 Correct 6 ms 5208 KB Output is correct
36 Correct 7 ms 5160 KB Output is correct
37 Correct 3 ms 4952 KB Output is correct
38 Correct 5 ms 5392 KB Output is correct
39 Correct 13 ms 4952 KB Output is correct
40 Correct 29 ms 5216 KB Output is correct
41 Correct 14 ms 5208 KB Output is correct
42 Correct 15 ms 5196 KB Output is correct
43 Correct 14 ms 5208 KB Output is correct
44 Correct 14 ms 5180 KB Output is correct
45 Correct 9 ms 4952 KB Output is correct
46 Correct 3 ms 5128 KB Output is correct
47 Correct 18 ms 5376 KB Output is correct
48 Correct 20 ms 5208 KB Output is correct
49 Correct 5 ms 5208 KB Output is correct
50 Correct 33 ms 5208 KB Output is correct
51 Correct 17 ms 5176 KB Output is correct
52 Correct 2 ms 4952 KB Output is correct
53 Correct 7 ms 5208 KB Output is correct
54 Correct 12 ms 5168 KB Output is correct
55 Correct 2 ms 5132 KB Output is correct
56 Correct 21 ms 5456 KB Output is correct
57 Correct 20 ms 5208 KB Output is correct
58 Correct 16 ms 5220 KB Output is correct
59 Correct 18 ms 5380 KB Output is correct
60 Correct 14 ms 4952 KB Output is correct
61 Correct 7 ms 5208 KB Output is correct
62 Correct 5 ms 4952 KB Output is correct
63 Correct 5 ms 5208 KB Output is correct
64 Correct 5 ms 4952 KB Output is correct
65 Correct 2 ms 4952 KB Output is correct
66 Correct 4 ms 4952 KB Output is correct
67 Correct 3 ms 5132 KB Output is correct
68 Correct 6 ms 5464 KB Output is correct
69 Correct 4 ms 4952 KB Output is correct
70 Correct 2 ms 4952 KB Output is correct
71 Correct 47 ms 5208 KB Output is correct
72 Correct 6 ms 4952 KB Output is correct
73 Correct 27 ms 5228 KB Output is correct
74 Correct 37 ms 5232 KB Output is correct
75 Correct 5 ms 5160 KB Output is correct
76 Correct 23 ms 5452 KB Output is correct
77 Partially correct 26 ms 5412 KB Partially correct - number of queries: 5004
78 Correct 5 ms 4952 KB Output is correct
79 Correct 13 ms 4952 KB Output is correct
80 Correct 33 ms 5440 KB Output is correct
81 Partially correct 34 ms 5528 KB Partially correct - number of queries: 5028
82 Correct 33 ms 5200 KB Output is correct
83 Correct 7 ms 5140 KB Output is correct
84 Correct 22 ms 5436 KB Output is correct
85 Correct 20 ms 5208 KB Output is correct
86 Correct 5 ms 4952 KB Output is correct
87 Correct 2 ms 4952 KB Output is correct
88 Correct 5 ms 4952 KB Output is correct
89 Correct 6 ms 4952 KB Output is correct
90 Correct 4 ms 4956 KB Output is correct
91 Correct 3 ms 4952 KB Output is correct
92 Correct 4 ms 4952 KB Output is correct
93 Correct 6 ms 4952 KB Output is correct
94 Correct 8 ms 4952 KB Output is correct
95 Correct 6 ms 4952 KB Output is correct
96 Correct 5 ms 4952 KB Output is correct
97 Correct 5 ms 4948 KB Output is correct