oj.uz

답안 #1118448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1118448 2024-11-25T13:53:40 Z adaawf 커다란 상품 (IOI17_prize) C++17
98.72 / 100
 93 ms 3972 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;
    if (n <= 180000) {
         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]);
        }
    }
    else {
        for (int i = 0; i < n; i++) da[i] = 0;
        for (int i = 0; i < 480; i++) {
            int h;
            while (1) {
                h = 1ll * (mt() % n) * rand() % n;
                if (da[h] == 1) continue;
                break;
            }
            da[h] = 1;
            t = ask(h);
            if (t[0] + t[1] == 0) return h;
            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 += 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}});
    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 + 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:59: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]
   59 |     for (int i = 0; i < v.size() - 1; i++) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 3464 KB Output is correct
2 Correct 17 ms 3468 KB Output is correct
3 Correct 17 ms 3420 KB Output is correct
4 Correct 16 ms 3444 KB Output is correct
5 Correct 13 ms 3448 KB Output is correct
6 Correct 9 ms 3444 KB Output is correct
7 Correct 11 ms 3416 KB Output is correct
8 Correct 15 ms 3464 KB Output is correct
9 Correct 16 ms 3408 KB Output is correct
10 Correct 17 ms 3708 KB Output is correct

Subtask #2
78.72 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 3408 KB Output is correct
2 Correct 18 ms 3728 KB Output is correct
3 Correct 14 ms 3420 KB Output is correct
4 Correct 11 ms 3420 KB Output is correct
5 Correct 13 ms 3420 KB Output is correct
6 Correct 10 ms 3676 KB Output is correct
7 Correct 14 ms 3716 KB Output is correct
8 Correct 11 ms 3448 KB Output is correct
9 Correct 14 ms 3448 KB Output is correct
10 Correct 17 ms 3448 KB Output is correct
11 Correct 15 ms 3444 KB Output is correct
12 Correct 15 ms 3704 KB Output is correct
13 Correct 18 ms 3400 KB Output is correct
14 Correct 6 ms 456 KB Output is correct
15 Correct 23 ms 3708 KB Output is correct
16 Correct 68 ms 3420 KB Output is correct
17 Correct 15 ms 3472 KB Output is correct
18 Correct 70 ms 3676 KB Output is correct
19 Correct 8 ms 3476 KB Output is correct
20 Correct 25 ms 968 KB Output is correct
21 Correct 29 ms 3524 KB Output is correct
22 Correct 19 ms 3472 KB Output is correct
23 Correct 15 ms 3408 KB Output is correct
24 Correct 14 ms 3460 KB Output is correct
25 Correct 50 ms 3440 KB Output is correct
26 Correct 51 ms 3664 KB Output is correct
27 Correct 16 ms 3724 KB Output is correct
28 Correct 81 ms 3688 KB Output is correct
29 Correct 54 ms 3664 KB Output is correct
30 Correct 80 ms 3712 KB Output is correct
31 Correct 18 ms 3716 KB Output is correct
32 Correct 23 ms 3664 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 37 ms 3688 KB Output is correct
35 Correct 17 ms 3472 KB Output is correct
36 Correct 28 ms 3728 KB Output is correct
37 Correct 18 ms 3408 KB Output is correct
38 Correct 18 ms 3440 KB Output is correct
39 Correct 40 ms 3456 KB Output is correct
40 Correct 72 ms 3468 KB Output is correct
41 Correct 57 ms 3464 KB Output is correct
42 Correct 45 ms 3656 KB Output is correct
43 Correct 47 ms 3712 KB Output is correct
44 Correct 39 ms 3664 KB Output is correct
45 Correct 35 ms 3476 KB Output is correct
46 Correct 16 ms 3664 KB Output is correct
47 Correct 42 ms 3664 KB Output is correct
48 Correct 51 ms 3472 KB Output is correct
49 Correct 19 ms 3460 KB Output is correct
50 Correct 78 ms 3684 KB Output is correct
51 Correct 35 ms 3720 KB Output is correct
52 Correct 16 ms 3464 KB Output is correct
53 Correct 15 ms 3408 KB Output is correct
54 Correct 41 ms 3664 KB Output is correct
55 Correct 15 ms 3664 KB Output is correct
56 Correct 80 ms 3408 KB Output is correct
57 Correct 56 ms 3408 KB Output is correct
58 Correct 55 ms 3972 KB Output is correct
59 Correct 48 ms 3664 KB Output is correct
60 Correct 51 ms 3444 KB Output is correct
61 Correct 14 ms 3716 KB Output is correct
62 Correct 15 ms 3444 KB Output is correct
63 Correct 19 ms 3408 KB Output is correct
64 Correct 17 ms 3664 KB Output is correct
65 Correct 14 ms 3472 KB Output is correct
66 Correct 21 ms 3664 KB Output is correct
67 Correct 21 ms 3444 KB Output is correct
68 Correct 15 ms 3456 KB Output is correct
69 Correct 25 ms 3464 KB Output is correct
70 Correct 18 ms 3724 KB Output is correct
71 Partially correct 93 ms 3464 KB Partially correct - number of queries: 5128
72 Correct 21 ms 3696 KB Output is correct
73 Partially correct 83 ms 3472 KB Partially correct - number of queries: 5065
74 Partially correct 81 ms 3408 KB Partially correct - number of queries: 5092
75 Correct 18 ms 3464 KB Output is correct
76 Correct 83 ms 3700 KB Output is correct
77 Correct 82 ms 3464 KB Output is correct
78 Correct 21 ms 3700 KB Output is correct
79 Correct 49 ms 3960 KB Output is correct
80 Correct 80 ms 3444 KB Output is correct
81 Correct 74 ms 3688 KB Output is correct
82 Correct 88 ms 3664 KB Output is correct
83 Correct 19 ms 3472 KB Output is correct
84 Correct 64 ms 3464 KB Output is correct
85 Correct 81 ms 3400 KB Output is correct
86 Correct 52 ms 3448 KB Output is correct
87 Correct 18 ms 3464 KB Output is correct
88 Correct 59 ms 3724 KB Output is correct
89 Correct 28 ms 3708 KB Output is correct
90 Correct 16 ms 3456 KB Output is correct
91 Correct 45 ms 3460 KB Output is correct
92 Correct 59 ms 3704 KB Output is correct
93 Correct 79 ms 3464 KB Output is correct
94 Correct 77 ms 3664 KB Output is correct
95 Correct 82 ms 3664 KB Output is correct
96 Correct 83 ms 3440 KB Output is correct
97 Correct 68 ms 3664 KB Output is correct