Submission #715486

# Submission time Handle Problem Language Result Execution time Memory
715486 2023-03-27T04:29:27 Z lmqzzz The Big Prize (IOI17_prize) C++14
97.41 / 100
57 ms 412 KB
#include "prize.h"

#include <bits/stdc++.h>
using namespace std;
int lolipop = -1;
int best = -1;
int solve(int l, int r, int before_left, int cnt) {
        if (cnt == 0) return -1;
        // cerr << l << ' ' << r << ' ' << before_left << '\n';
        if (l >= r) return -1;
        //[l, r)
        int m = l + r >> 1;
        // [l, m) [m + 1, r)
        int rm = m;
        int L, R;
        while (rm < r) {
                auto mid = ask(rm);
                if (mid[0] + mid[1] == 0) return rm;
                if (mid[0] + mid[1] == best) {
                        L = mid[0], R = mid[1];
                        break;
                }
                rm++;
        }
        int cnt_m = rm - m;
        int left_size = L - before_left - cnt_m;
        int right_size = cnt - left_size;
        if (rm == r) {
                return solve(l, m, before_left, left_size);
        } else {
                return max(solve(l, m, before_left, left_size), solve(rm + 1, r, L, right_size));
        }
}

int find_best(int n) {
        const int LIM = 500;
        vector<vector<int>> b(LIM);
        for (int i = 0; i < LIM; i++) {
                b[i] = ask(i);
                if (best < b[i][0] + b[i][1]) {
                        best = b[i][0] + b[i][1];
                        lolipop = i;
                }
                if (b[i][0] + b[i][1] == 0) return i;
        }
        int cnt = 0;
        for (int i = 0; i < LIM; i++) {
                if (b[i][0] + b[i][1] < best) cnt++;
        }
        return solve(LIM, n, cnt, best - cnt);
}

Compilation message

prize.cpp: In function 'int solve(int, int, int, int)':
prize.cpp:12:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   12 |         int m = l + r >> 1;
      |                 ~~^~~
prize.cpp:15:16: warning: variable 'R' set but not used [-Wunused-but-set-variable]
   15 |         int L, R;
      |                ^
prize.cpp:26:27: warning: 'L' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |         int left_size = L - before_left - cnt_m;
      |                         ~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 6 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 4 ms 288 KB Output is correct
4 Correct 6 ms 292 KB Output is correct
5 Correct 5 ms 292 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 7 ms 208 KB Output is correct
8 Correct 4 ms 288 KB Output is correct
9 Correct 5 ms 280 KB Output is correct
10 Correct 6 ms 308 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 292 KB Output is correct
2 Correct 3 ms 296 KB Output is correct
3 Correct 3 ms 312 KB Output is correct
4 Correct 7 ms 292 KB Output is correct
5 Correct 5 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 7 ms 272 KB Output is correct
8 Correct 2 ms 312 KB Output is correct
9 Correct 5 ms 300 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 7 ms 288 KB Output is correct
12 Correct 11 ms 288 KB Output is correct
13 Correct 6 ms 272 KB Output is correct
14 Correct 16 ms 324 KB Output is correct
15 Partially correct 51 ms 300 KB Partially correct - number of queries: 5023
16 Partially correct 34 ms 272 KB Partially correct - number of queries: 5248
17 Correct 4 ms 280 KB Output is correct
18 Partially correct 57 ms 292 KB Partially correct - number of queries: 5247
19 Correct 5 ms 284 KB Output is correct
20 Correct 26 ms 292 KB Output is correct
21 Partially correct 47 ms 292 KB Partially correct - number of queries: 5214
22 Correct 32 ms 292 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 11 ms 312 KB Output is correct
25 Correct 37 ms 284 KB Output is correct
26 Correct 44 ms 304 KB Output is correct
27 Correct 4 ms 208 KB Output is correct
28 Correct 43 ms 208 KB Output is correct
29 Correct 16 ms 316 KB Output is correct
30 Partially correct 49 ms 276 KB Partially correct - number of queries: 5212
31 Correct 3 ms 208 KB Output is correct
32 Correct 6 ms 320 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Partially correct 34 ms 408 KB Partially correct - number of queries: 5245
35 Correct 9 ms 296 KB Output is correct
36 Partially correct 34 ms 300 KB Partially correct - number of queries: 5210
37 Correct 4 ms 316 KB Output is correct
38 Correct 4 ms 296 KB Output is correct
39 Partially correct 30 ms 280 KB Partially correct - number of queries: 5213
40 Correct 28 ms 280 KB Output is correct
41 Partially correct 49 ms 292 KB Partially correct - number of queries: 5248
42 Partially correct 45 ms 284 KB Partially correct - number of queries: 5248
43 Partially correct 37 ms 304 KB Partially correct - number of queries: 5115
44 Partially correct 23 ms 296 KB Partially correct - number of queries: 5249
45 Correct 45 ms 208 KB Output is correct
46 Correct 4 ms 296 KB Output is correct
47 Correct 30 ms 312 KB Output is correct
48 Partially correct 56 ms 208 KB Partially correct - number of queries: 5248
49 Partially correct 41 ms 308 KB Partially correct - number of queries: 5248
50 Partially correct 20 ms 308 KB Partially correct - number of queries: 5250
51 Partially correct 44 ms 208 KB Partially correct - number of queries: 5249
52 Partially correct 34 ms 208 KB Partially correct - number of queries: 5248
53 Correct 5 ms 288 KB Output is correct
54 Partially correct 42 ms 208 KB Partially correct - number of queries: 5212
55 Correct 6 ms 292 KB Output is correct
56 Partially correct 52 ms 284 KB Partially correct - number of queries: 5248
57 Partially correct 40 ms 304 KB Partially correct - number of queries: 5212
58 Partially correct 32 ms 304 KB Partially correct - number of queries: 5250
59 Partially correct 38 ms 284 KB Partially correct - number of queries: 5250
60 Partially correct 40 ms 292 KB Partially correct - number of queries: 5213
61 Correct 7 ms 268 KB Output is correct
62 Correct 5 ms 300 KB Output is correct
63 Correct 5 ms 272 KB Output is correct
64 Correct 5 ms 284 KB Output is correct
65 Correct 6 ms 208 KB Output is correct
66 Correct 9 ms 412 KB Output is correct
67 Correct 4 ms 336 KB Output is correct
68 Correct 4 ms 208 KB Output is correct
69 Correct 5 ms 348 KB Output is correct
70 Correct 7 ms 284 KB Output is correct
71 Partially correct 22 ms 328 KB Partially correct - number of queries: 5259
72 Correct 8 ms 208 KB Output is correct
73 Partially correct 37 ms 208 KB Partially correct - number of queries: 5196
74 Partially correct 52 ms 328 KB Partially correct - number of queries: 5223
75 Correct 6 ms 208 KB Output is correct
76 Correct 34 ms 208 KB Output is correct
77 Partially correct 48 ms 324 KB Partially correct - number of queries: 5259
78 Correct 10 ms 208 KB Output is correct
79 Correct 20 ms 208 KB Output is correct
80 Partially correct 21 ms 364 KB Partially correct - number of queries: 5259
81 Partially correct 51 ms 328 KB Partially correct - number of queries: 5259
82 Partially correct 31 ms 208 KB Partially correct - number of queries: 5204
83 Correct 4 ms 312 KB Output is correct
84 Correct 44 ms 208 KB Output is correct
85 Partially correct 47 ms 320 KB Partially correct - number of queries: 5229
86 Correct 7 ms 308 KB Output is correct
87 Correct 4 ms 208 KB Output is correct
88 Correct 4 ms 208 KB Output is correct
89 Correct 5 ms 320 KB Output is correct
90 Correct 6 ms 208 KB Output is correct
91 Correct 3 ms 312 KB Output is correct
92 Correct 3 ms 308 KB Output is correct
93 Correct 8 ms 208 KB Output is correct
94 Correct 6 ms 324 KB Output is correct
95 Correct 7 ms 208 KB Output is correct
96 Correct 8 ms 324 KB Output is correct
97 Correct 6 ms 208 KB Output is correct