oj.uz

Submission #1118425

# Submission time Handle Problem Language Result Execution time Memory
1118425 2024-11-25T13:31:45 Z adaawf The Big Prize (IOI17_prize) C++17
97.44 / 100
 94 ms 3000 KB 
#include <iostream>
#include <vector>
using namespace std;
int a[200005], cc = 0, hh = 200000, dd[200005], c[200005][10];
void build(int n) {
    for (int j = 0; j <= 9; j++) {
        c[0][j] = (a[0] <= j);
        for (int i = 1; i < n; i++) {
            c[i][j] = c[i - 1][j] + (a[i] <= j);
        }
    }
}
vector<int> ask(int i);
int find_best(int n) {
    vector<pair<int, pair<int, int>>> v;
    vector<int> t;
    int mi = 0;
    for (int i = 0; i < 480; i++) {
        t = ask(i);
        if (t[0] + t[1] == 0) return i;
        mi = max(mi, t[0] + t[1]);
    }
    for (int i = 0; i < n; i++) dd[i] = 0;
    int c = 0;
    for (int i = 0; i < n; i += 200) {
        while (1) {
            if (i >= n) break;
            t = ask(i);
            if (t[0] + t[1] == 0) return i;
            if (t[0] + t[1] == mi) {
                break;
            }
            c++;
            i++;
        }
        if (i < n) {
            v.push_back({i, {t[1], c}});
            c = 0;
        }
    }
    v.push_back({n, {0, c}});
    for (int i = 0; i < v.size() - 1; i++) {
        int h = v[i].second.first - v[i + 1].second.first;
        h -= v[i + 1].second.second;
        vector<int> va, vc, vv;
        for (int j = v[i].first; j < min(v[i].first + 200, n + 1); j++) {
            va.push_back(j);
        }
        for (int j = 0; j < h; j++) {
            int l = 0, r = va.size() - 1, res;
            while (1) {
                int mid = (l + r) / 2;
                res = va[mid];
                dd[va[mid]] = 1;
                t = ask(va[mid]);
                if (t[0] + t[1] == 0) return va[mid];
                if (t[0] + t[1] != mi) break;
                for (int w : vc) {
                    if (w <= va[mid]) t[1]++;
                }
                if (t[1] == v[i].second.first) {
                    l = mid + 1;
                }
                else r = mid - 1;
            }
            vc.push_back(res);
            vv.clear();
            for (int w : va) {
                if (dd[w] == 0) vv.push_back(w);
            }
            va = vv;
        }
    }
    return -1;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 0; i < v.size() - 1; i++) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2724 KB Output is correct
2 Correct 22 ms 2728 KB Output is correct
3 Correct 25 ms 2724 KB Output is correct
4 Correct 21 ms 2980 KB Output is correct
5 Correct 12 ms 2728 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 17 ms 2724 KB Output is correct
8 Correct 15 ms 2716 KB Output is correct
9 Correct 26 ms 2496 KB Output is correct
10 Correct 23 ms 2724 KB Output is correct

Subtask #2
77.44 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2736 KB Output is correct
2 Correct 23 ms 2724 KB Output is correct
3 Correct 23 ms 2984 KB Output is correct
4 Correct 24 ms 2736 KB Output is correct
5 Correct 18 ms 2764 KB Output is correct
6 Correct 1 ms 504 KB Output is correct
7 Correct 19 ms 2724 KB Output is correct
8 Correct 17 ms 2724 KB Output is correct
9 Correct 23 ms 2496 KB Output is correct
10 Correct 25 ms 2640 KB Output is correct
11 Correct 25 ms 2736 KB Output is correct
12 Correct 22 ms 2732 KB Output is correct
13 Correct 30 ms 2752 KB Output is correct
14 Correct 12 ms 2396 KB Output is correct
15 Correct 25 ms 2504 KB Output is correct
16 Correct 54 ms 2764 KB Output is correct
17 Correct 8 ms 336 KB Output is correct
18 Correct 83 ms 2640 KB Output is correct
19 Correct 10 ms 336 KB Output is correct
20 Correct 24 ms 2756 KB Output is correct
21 Correct 46 ms 2736 KB Output is correct
22 Correct 32 ms 2488 KB Output is correct
23 Correct 24 ms 2732 KB Output is correct
24 Correct 22 ms 2732 KB Output is correct
25 Correct 53 ms 2740 KB Output is correct
26 Correct 53 ms 2728 KB Output is correct
27 Correct 27 ms 2736 KB Output is correct
28 Correct 82 ms 2728 KB Output is correct
29 Correct 55 ms 2888 KB Output is correct
30 Correct 76 ms 2640 KB Output is correct
31 Correct 7 ms 336 KB Output is correct
32 Correct 29 ms 2484 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 43 ms 2896 KB Output is correct
35 Correct 25 ms 2736 KB Output is correct
36 Correct 33 ms 2640 KB Output is correct
37 Correct 25 ms 2744 KB Output is correct
38 Correct 24 ms 2980 KB Output is correct
39 Correct 41 ms 2896 KB Output is correct
40 Correct 61 ms 2724 KB Output is correct
41 Correct 51 ms 2736 KB Output is correct
42 Correct 55 ms 2724 KB Output is correct
43 Correct 43 ms 2728 KB Output is correct
44 Correct 44 ms 2896 KB Output is correct
45 Correct 41 ms 2732 KB Output is correct
46 Correct 7 ms 336 KB Output is correct
47 Correct 48 ms 3000 KB Output is correct
48 Correct 64 ms 2752 KB Output is correct
49 Correct 26 ms 2736 KB Output is correct
50 Correct 82 ms 2888 KB Output is correct
51 Correct 18 ms 2732 KB Output is correct
52 Correct 20 ms 2896 KB Output is correct
53 Correct 25 ms 2484 KB Output is correct
54 Correct 42 ms 2492 KB Output is correct
55 Correct 7 ms 336 KB Output is correct
56 Correct 71 ms 2752 KB Output is correct
57 Correct 75 ms 2492 KB Output is correct
58 Correct 63 ms 2640 KB Output is correct
59 Correct 60 ms 2740 KB Output is correct
60 Correct 49 ms 2640 KB Output is correct
61 Correct 25 ms 2496 KB Output is correct
62 Correct 24 ms 2724 KB Output is correct
63 Correct 25 ms 2724 KB Output is correct
64 Correct 28 ms 2728 KB Output is correct
65 Correct 26 ms 2744 KB Output is correct
66 Correct 32 ms 2724 KB Output is correct
67 Correct 32 ms 2728 KB Output is correct
68 Correct 7 ms 336 KB Output is correct
69 Correct 37 ms 2736 KB Output is correct
70 Correct 28 ms 2904 KB Output is correct
71 Partially correct 79 ms 2732 KB Partially correct - number of queries: 5256
72 Correct 29 ms 2880 KB Output is correct
73 Partially correct 81 ms 2728 KB Partially correct - number of queries: 5200
74 Partially correct 90 ms 2732 KB Partially correct - number of queries: 5224
75 Correct 24 ms 2724 KB Output is correct
76 Correct 74 ms 2740 KB Output is correct
77 Correct 94 ms 2496 KB Output is correct
78 Correct 31 ms 2728 KB Output is correct
79 Correct 44 ms 2728 KB Output is correct
80 Correct 72 ms 2756 KB Output is correct
81 Correct 75 ms 2640 KB Output is correct
82 Correct 86 ms 2728 KB Output is correct
83 Correct 27 ms 2720 KB Output is correct
84 Correct 62 ms 2756 KB Output is correct
85 Correct 78 ms 2492 KB Output is correct
86 Correct 34 ms 2720 KB Output is correct
87 Correct 26 ms 2728 KB Output is correct
88 Correct 32 ms 2728 KB Output is correct
89 Correct 28 ms 2888 KB Output is correct
90 Correct 25 ms 2732 KB Output is correct
91 Correct 26 ms 2740 KB Output is correct
92 Correct 33 ms 2640 KB Output is correct
93 Correct 32 ms 2896 KB Output is correct
94 Correct 36 ms 2720 KB Output is correct
95 Correct 32 ms 2728 KB Output is correct
96 Correct 33 ms 2972 KB Output is correct
97 Correct 28 ms 2972 KB Output is correct