Submission #1061334

# Submission time Handle Problem Language Result Execution time Memory
1061334 2024-08-16T08:06:55 Z Zicrus The Big Prize (IOI17_prize) C++17
90 / 100
59 ms 2132 KB
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;

typedef long long ll;

vector<pair<int, int>> cache;

pair<int, int> get(int i) {
    if (cache[i].first >= 0) return cache[i];
    auto res = ask(i);
    return cache[i] = {res[0], res[1]};
}

int find_best(int n) {
    cache = vector<pair<int, int>>(n, {-1, -1});
	int root = (int)ceil(sqrt(n));
    
    ll mxDeg = 0;
    for (int i = n-1; i >= n - 2*root && i >= 0; i--) {
        ll deg = get(i).first + get(i).second;
        if (deg == 0) return i;
        mxDeg = max(mxDeg, deg);
    }
    int m = max(n - 2*root, 0);

    int prevLeft = 0;
    vector<bool> vst(mxDeg);
    for (int i = 0; i < mxDeg; i++) {
        if (vst[i]) continue;
        int left = prevLeft, right = m-1;
        while (left < right) {
            int mid = (left+right+1)/2;
            pair<int, int> val = get(mid);
            int deg = val.first + val.second;
            int cnt = 0;
            int orig = mid;
            while (deg < mxDeg && mid > 0) {
                if (deg == 0) return mid;
                mid--; right--;
                val = get(mid);
                deg = val.first + val.second;
                cnt++;
            }
            if (deg == 0) return mid;
            if (cnt > 0) {
                int ptr = 0;
                while (cnt--) vst[val.first + ptr++] = true;
            }
            if (vst[i]) {
                prevLeft = orig+1;
                break;
            }
            
            if (val.first <= i) {
                left = mid;
                prevLeft = left+1;
            }
            else {
                right = mid-1;
            }
        }
        if (vst[i]) continue;

        if(get(left).first + get(left).second == 0) return left;
        vst[i] = true;
    }

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 7 ms 1880 KB Output is correct
2 Correct 7 ms 1880 KB Output is correct
3 Correct 7 ms 1880 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 8 ms 1880 KB Output is correct
6 Correct 8 ms 1880 KB Output is correct
7 Correct 9 ms 1880 KB Output is correct
8 Correct 6 ms 1880 KB Output is correct
9 Correct 5 ms 1880 KB Output is correct
10 Correct 5 ms 1880 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 1880 KB Output is correct
2 Correct 6 ms 1880 KB Output is correct
3 Correct 7 ms 1880 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 7 ms 1880 KB Output is correct
6 Correct 6 ms 1880 KB Output is correct
7 Correct 6 ms 1876 KB Output is correct
8 Correct 7 ms 1880 KB Output is correct
9 Correct 5 ms 1880 KB Output is correct
10 Correct 6 ms 1880 KB Output is correct
11 Correct 7 ms 1880 KB Output is correct
12 Correct 5 ms 1880 KB Output is correct
13 Correct 10 ms 1880 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 11 ms 1880 KB Output is correct
16 Partially correct 38 ms 1880 KB Partially correct - number of queries: 7156
17 Correct 7 ms 1876 KB Output is correct
18 Correct 3 ms 1880 KB Output is correct
19 Correct 7 ms 1880 KB Output is correct
20 Correct 12 ms 1112 KB Output is correct
21 Correct 28 ms 1880 KB Output is correct
22 Correct 10 ms 1880 KB Output is correct
23 Correct 6 ms 1880 KB Output is correct
24 Correct 6 ms 1880 KB Output is correct
25 Partially correct 33 ms 1880 KB Partially correct - number of queries: 5019
26 Correct 19 ms 2132 KB Output is correct
27 Correct 6 ms 1880 KB Output is correct
28 Partially correct 31 ms 1880 KB Partially correct - number of queries: 7690
29 Partially correct 34 ms 1880 KB Partially correct - number of queries: 6110
30 Correct 3 ms 1884 KB Output is correct
31 Correct 8 ms 1880 KB Output is correct
32 Correct 6 ms 1892 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 23 ms 1888 KB Output is correct
35 Correct 6 ms 1880 KB Output is correct
36 Correct 16 ms 1880 KB Output is correct
37 Correct 6 ms 1880 KB Output is correct
38 Correct 4 ms 1880 KB Output is correct
39 Correct 16 ms 1880 KB Output is correct
40 Correct 4 ms 1880 KB Output is correct
41 Partially correct 21 ms 1880 KB Partially correct - number of queries: 5318
42 Partially correct 29 ms 1880 KB Partially correct - number of queries: 5318
43 Correct 27 ms 1880 KB Output is correct
44 Correct 23 ms 1880 KB Output is correct
45 Correct 15 ms 1880 KB Output is correct
46 Correct 5 ms 1880 KB Output is correct
47 Correct 18 ms 1880 KB Output is correct
48 Partially correct 23 ms 1880 KB Partially correct - number of queries: 6344
49 Correct 6 ms 1880 KB Output is correct
50 Correct 3 ms 1880 KB Output is correct
51 Correct 18 ms 1880 KB Output is correct
52 Correct 5 ms 1880 KB Output is correct
53 Correct 5 ms 1880 KB Output is correct
54 Correct 31 ms 1880 KB Output is correct
55 Correct 5 ms 1880 KB Output is correct
56 Correct 3 ms 1880 KB Output is correct
57 Partially correct 37 ms 1964 KB Partially correct - number of queries: 6276
58 Partially correct 31 ms 1880 KB Partially correct - number of queries: 6151
59 Partially correct 22 ms 1880 KB Partially correct - number of queries: 5319
60 Correct 18 ms 1880 KB Output is correct
61 Correct 6 ms 1876 KB Output is correct
62 Correct 5 ms 1880 KB Output is correct
63 Correct 5 ms 1880 KB Output is correct
64 Correct 6 ms 1880 KB Output is correct
65 Correct 1 ms 1880 KB Output is correct
66 Correct 1 ms 1880 KB Output is correct
67 Correct 3 ms 1880 KB Output is correct
68 Correct 7 ms 1960 KB Output is correct
69 Correct 1 ms 1880 KB Output is correct
70 Correct 3 ms 1880 KB Output is correct
71 Partially correct 59 ms 1880 KB Partially correct - number of queries: 8655
72 Correct 5 ms 2132 KB Output is correct
73 Partially correct 35 ms 1880 KB Partially correct - number of queries: 8555
74 Partially correct 53 ms 1880 KB Partially correct - number of queries: 8580
75 Correct 5 ms 1880 KB Output is correct
76 Partially correct 33 ms 1880 KB Partially correct - number of queries: 7521
77 Partially correct 38 ms 1880 KB Partially correct - number of queries: 8075
78 Correct 8 ms 2132 KB Output is correct
79 Correct 19 ms 1880 KB Output is correct
80 Partially correct 37 ms 1880 KB Partially correct - number of queries: 8070
81 Partially correct 47 ms 1880 KB Partially correct - number of queries: 8265
82 Partially correct 43 ms 1880 KB Partially correct - number of queries: 8036
83 Correct 5 ms 1880 KB Output is correct
84 Partially correct 34 ms 1880 KB Partially correct - number of queries: 6806
85 Partially correct 41 ms 1880 KB Partially correct - number of queries: 8070
86 Correct 7 ms 1880 KB Output is correct
87 Correct 4 ms 1876 KB Output is correct
88 Correct 4 ms 1880 KB Output is correct
89 Correct 5 ms 1880 KB Output is correct
90 Correct 5 ms 1880 KB Output is correct
91 Correct 4 ms 1880 KB Output is correct
92 Correct 4 ms 1880 KB Output is correct
93 Correct 8 ms 1880 KB Output is correct
94 Correct 7 ms 1880 KB Output is correct
95 Correct 9 ms 1880 KB Output is correct
96 Correct 8 ms 1880 KB Output is correct
97 Correct 5 ms 1880 KB Output is correct