oj.uz

Submission #1118458

# Submission time Handle Problem Language Result Execution time Memory
1118458 2024-11-25T14:10:22 Z adaawf The Big Prize (IOI17_prize) C++17
99.49 / 100
 85 ms 3784 KB 
#include <bits/stdc++.h>
using namespace std;
int a[200005], cc = 0, hh = 200000, dd[200005], c[200005][10], da[200005];
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);
        }
    }
}
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
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 < 475; 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] = da[i] = 0;
    int c = 0;
    for (int i = 0; i < n; i += 500) {
        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}});
    vector<int> vb, vvb;
    for (int i = 0; i < v.size() - 1; i++) vb.push_back(i);
    for (int i = 0; i < vb.size(); i++) {
        int h = mt() % (vb.size() - i) + 1;
        for (int j = 0; j < vb.size(); j++) {
            if (da[j] == 0) {
                h--;
                if (h == 0) {
                    vvb.push_back(vb[j]);
                    da[j] = 1;
                    break;
                }
            }
        }
    }
    for (int i : vvb) {
        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 + 500, 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:43: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]
   43 |     for (int i = 0; i < v.size() - 1; i++) vb.push_back(i);
      |                     ~~^~~~~~~~~~~~~~
prize.cpp:44:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for (int i = 0; i < vb.size(); i++) {
      |                     ~~^~~~~~~~~~~
prize.cpp:46:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int j = 0; j < vb.size(); j++) {
      |                         ~~^~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3276 KB Output is correct
2 Correct 16 ms 3420 KB Output is correct
3 Correct 16 ms 3476 KB Output is correct
4 Correct 17 ms 2028 KB Output is correct
5 Correct 12 ms 1884 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 13 ms 1884 KB Output is correct
8 Correct 14 ms 2276 KB Output is correct
9 Correct 16 ms 2004 KB Output is correct
10 Correct 18 ms 1884 KB Output is correct

Subtask #2
79.49 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1884 KB Output is correct
2 Correct 18 ms 2044 KB Output is correct
3 Correct 19 ms 3532 KB Output is correct
4 Correct 17 ms 3540 KB Output is correct
5 Correct 13 ms 3288 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 14 ms 3264 KB Output is correct
8 Correct 13 ms 1988 KB Output is correct
9 Correct 18 ms 1992 KB Output is correct
10 Correct 20 ms 2128 KB Output is correct
11 Correct 18 ms 2128 KB Output is correct
12 Correct 16 ms 2040 KB Output is correct
13 Correct 19 ms 2120 KB Output is correct
14 Correct 30 ms 848 KB Output is correct
15 Correct 32 ms 2120 KB Output is correct
16 Correct 67 ms 2032 KB Output is correct
17 Correct 7 ms 336 KB Output is correct
18 Correct 57 ms 3664 KB Output is correct
19 Correct 8 ms 356 KB Output is correct
20 Correct 14 ms 3056 KB Output is correct
21 Correct 28 ms 2128 KB Output is correct
22 Correct 18 ms 2244 KB Output is correct
23 Correct 15 ms 1988 KB Output is correct
24 Correct 17 ms 2128 KB Output is correct
25 Correct 26 ms 2240 KB Output is correct
26 Correct 42 ms 2248 KB Output is correct
27 Correct 17 ms 1988 KB Output is correct
28 Correct 61 ms 2248 KB Output is correct
29 Correct 59 ms 3544 KB Output is correct
30 Correct 56 ms 3560 KB Output is correct
31 Correct 9 ms 336 KB Output is correct
32 Correct 22 ms 3712 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 58 ms 3728 KB Output is correct
35 Correct 17 ms 2276 KB Output is correct
36 Correct 65 ms 2000 KB Output is correct
37 Correct 14 ms 2020 KB Output is correct
38 Correct 18 ms 2024 KB Output is correct
39 Correct 53 ms 2128 KB Output is correct
40 Correct 26 ms 2132 KB Output is correct
41 Correct 48 ms 2248 KB Output is correct
42 Correct 42 ms 3784 KB Output is correct
43 Correct 69 ms 3464 KB Output is correct
44 Correct 55 ms 3464 KB Output is correct
45 Correct 24 ms 3720 KB Output is correct
46 Correct 7 ms 588 KB Output is correct
47 Correct 25 ms 1996 KB Output is correct
48 Correct 60 ms 1872 KB Output is correct
49 Correct 48 ms 2272 KB Output is correct
50 Correct 56 ms 1872 KB Output is correct
51 Correct 46 ms 2244 KB Output is correct
52 Correct 59 ms 2240 KB Output is correct
53 Correct 17 ms 2384 KB Output is correct
54 Correct 30 ms 3532 KB Output is correct
55 Correct 8 ms 352 KB Output is correct
56 Correct 40 ms 3516 KB Output is correct
57 Correct 41 ms 3460 KB Output is correct
58 Correct 72 ms 2244 KB Output is correct
59 Correct 31 ms 2128 KB Output is correct
60 Correct 17 ms 2032 KB Output is correct
61 Correct 15 ms 1992 KB Output is correct
62 Correct 18 ms 2128 KB Output is correct
63 Correct 16 ms 2128 KB Output is correct
64 Correct 18 ms 2408 KB Output is correct
65 Correct 19 ms 2024 KB Output is correct
66 Correct 23 ms 3456 KB Output is correct
67 Correct 24 ms 3460 KB Output is correct
68 Correct 8 ms 348 KB Output is correct
69 Correct 24 ms 3456 KB Output is correct
70 Correct 18 ms 3288 KB Output is correct
71 Partially correct 80 ms 2252 KB Partially correct - number of queries: 5051
72 Correct 24 ms 1988 KB Output is correct
73 Partially correct 82 ms 3408 KB Partially correct - number of queries: 5042
74 Partially correct 82 ms 2024 KB Partially correct - number of queries: 5042
75 Correct 18 ms 2128 KB Output is correct
76 Correct 78 ms 3472 KB Output is correct
77 Correct 72 ms 3456 KB Output is correct
78 Correct 19 ms 3720 KB Output is correct
79 Correct 41 ms 3408 KB Output is correct
80 Correct 63 ms 1992 KB Output is correct
81 Correct 82 ms 2016 KB Output is correct
82 Correct 74 ms 1992 KB Output is correct
83 Correct 19 ms 2384 KB Output is correct
84 Correct 63 ms 2500 KB Output is correct
85 Correct 85 ms 3408 KB Output is correct
86 Correct 21 ms 3408 KB Output is correct
87 Correct 22 ms 2024 KB Output is correct
88 Correct 24 ms 2016 KB Output is correct
89 Correct 28 ms 2236 KB Output is correct
90 Correct 18 ms 2032 KB Output is correct
91 Correct 24 ms 2024 KB Output is correct
92 Correct 26 ms 2536 KB Output is correct
93 Correct 28 ms 2164 KB Output is correct
94 Correct 27 ms 3728 KB Output is correct
95 Correct 30 ms 3532 KB Output is correct
96 Correct 28 ms 3468 KB Output is correct
97 Correct 21 ms 3460 KB Output is correct