Submission #778541

# Submission time Handle Problem Language Result Execution time Memory
778541 2023-07-10T11:59:48 Z benjaminkleyn The Big Prize (IOI17_prize) C++17
90 / 100
82 ms 2168 KB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair

bool asked[200000];
int L[200000], R[200000];
map<pair<int, int>, int> max_idx;

void Ask(int i)
{
    if (asked[200000]) return;
    asked[i] = true;
    vector<int> res = ask(i);
    L[i] = res[0], R[i] = res[1];
    if (max_idx.find(mp(L[i], R[i])) == max_idx.end())
        max_idx[mp(L[i], R[i])] = i;
    else
        max_idx[mp(L[i], R[i])] = max(max_idx[mp(L[i], R[i])], i);
}

int find_best(int n) 
{
    memset(asked, false, sizeof(asked));
    max_idx = map<pair<int,int>,int>();

    int i = 0;
    Ask(i);
    for (int j = 0; j < n && j < 500; j++)
    {
        Ask(j);
        if (L[j] + R[j] == 0)
            return j;
        if (L[j] + R[j] > L[i] + R[i])
            i = j;
    }
    int v = i;

    while (i < n)
    {
        for (int j = 18; j >= 0; j--)
            if (i + (1 << j) < n)
            {
                Ask(i + (1 << j));
                i = max_idx[mp(L[i], R[i])];
            }
        while (i < n)
        {
            Ask(++i);
            if (L[i] + R[i] == 0) return i;
            if (L[i] + R[i] == L[v] + R[v]) break;
        }
    }
    return n - 1;
}

Compilation message

prize.cpp: In function 'void Ask(int)':
prize.cpp:12:21: warning: array subscript 200000 is above array bounds of 'bool [200000]' [-Warray-bounds]
   12 |     if (asked[200000]) return;
      |         ~~~~~~~~~~~~^
prize.cpp:6:6: note: while referencing 'asked'
    6 | bool asked[200000];
      |      ^~~~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 564 KB Output is correct
2 Correct 3 ms 564 KB Output is correct
3 Correct 5 ms 464 KB Output is correct
4 Correct 3 ms 432 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 3 ms 556 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 4 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 464 KB Output is correct
2 Correct 5 ms 560 KB Output is correct
3 Correct 5 ms 464 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 1 ms 504 KB Output is correct
7 Correct 4 ms 508 KB Output is correct
8 Correct 4 ms 492 KB Output is correct
9 Correct 4 ms 548 KB Output is correct
10 Correct 5 ms 464 KB Output is correct
11 Correct 4 ms 1104 KB Output is correct
12 Correct 5 ms 552 KB Output is correct
13 Correct 5 ms 1552 KB Output is correct
14 Correct 9 ms 580 KB Output is correct
15 Correct 15 ms 1384 KB Output is correct
16 Partially correct 29 ms 2068 KB Partially correct - number of queries: 8021
17 Correct 2 ms 512 KB Output is correct
18 Partially correct 33 ms 2068 KB Partially correct - number of queries: 9336
19 Correct 3 ms 432 KB Output is correct
20 Correct 18 ms 1252 KB Output is correct
21 Correct 17 ms 2124 KB Output is correct
22 Correct 12 ms 1084 KB Output is correct
23 Correct 5 ms 560 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Partially correct 20 ms 2048 KB Partially correct - number of queries: 5485
26 Partially correct 34 ms 1980 KB Partially correct - number of queries: 5404
27 Correct 2 ms 684 KB Output is correct
28 Partially correct 75 ms 1956 KB Partially correct - number of queries: 8886
29 Partially correct 39 ms 1992 KB Partially correct - number of queries: 6851
30 Partially correct 72 ms 2004 KB Partially correct - number of queries: 9260
31 Correct 3 ms 464 KB Output is correct
32 Correct 8 ms 1264 KB Output is correct
33 Correct 0 ms 464 KB Output is correct
34 Correct 13 ms 1900 KB Output is correct
35 Correct 4 ms 976 KB Output is correct
36 Correct 10 ms 1668 KB Output is correct
37 Correct 6 ms 808 KB Output is correct
38 Correct 5 ms 496 KB Output is correct
39 Correct 17 ms 2084 KB Output is correct
40 Partially correct 53 ms 1956 KB Partially correct - number of queries: 7988
41 Partially correct 33 ms 2004 KB Partially correct - number of queries: 5774
42 Partially correct 52 ms 2072 KB Partially correct - number of queries: 5774
43 Partially correct 20 ms 2044 KB Partially correct - number of queries: 5256
44 Correct 37 ms 1960 KB Output is correct
45 Correct 31 ms 1864 KB Output is correct
46 Correct 2 ms 504 KB Output is correct
47 Correct 42 ms 1928 KB Output is correct
48 Partially correct 58 ms 2124 KB Partially correct - number of queries: 7031
49 Correct 8 ms 968 KB Output is correct
50 Partially correct 76 ms 2168 KB Partially correct - number of queries: 9336
51 Correct 38 ms 1980 KB Output is correct
52 Correct 3 ms 580 KB Output is correct
53 Correct 6 ms 808 KB Output is correct
54 Correct 16 ms 2020 KB Output is correct
55 Correct 4 ms 424 KB Output is correct
56 Partially correct 82 ms 2060 KB Partially correct - number of queries: 9336
57 Partially correct 61 ms 1960 KB Partially correct - number of queries: 6938
58 Partially correct 46 ms 2008 KB Partially correct - number of queries: 7050
59 Partially correct 53 ms 1992 KB Partially correct - number of queries: 5774
60 Partially correct 30 ms 2068 KB Partially correct - number of queries: 5393
61 Correct 5 ms 840 KB Output is correct
62 Correct 4 ms 464 KB Output is correct
63 Correct 6 ms 812 KB Output is correct
64 Correct 5 ms 688 KB Output is correct
65 Correct 4 ms 464 KB Output is correct
66 Correct 4 ms 496 KB Output is correct
67 Correct 5 ms 512 KB Output is correct
68 Correct 2 ms 512 KB Output is correct
69 Correct 4 ms 532 KB Output is correct
70 Correct 3 ms 432 KB Output is correct
71 Partially correct 45 ms 2144 KB Partially correct - number of queries: 9314
72 Correct 11 ms 1344 KB Output is correct
73 Partially correct 72 ms 1992 KB Partially correct - number of queries: 9183
74 Partially correct 56 ms 1992 KB Partially correct - number of queries: 9240
75 Correct 5 ms 848 KB Output is correct
76 Partially correct 49 ms 2016 KB Partially correct - number of queries: 7979
77 Partially correct 76 ms 2008 KB Partially correct - number of queries: 9151
78 Correct 5 ms 1404 KB Output is correct
79 Correct 39 ms 1936 KB Output is correct
80 Partially correct 33 ms 2020 KB Partially correct - number of queries: 9317
81 Partially correct 64 ms 2064 KB Partially correct - number of queries: 9323
82 Partially correct 76 ms 2080 KB Partially correct - number of queries: 9123
83 Correct 6 ms 768 KB Output is correct
84 Partially correct 53 ms 1988 KB Partially correct - number of queries: 7658
85 Partially correct 64 ms 2064 KB Partially correct - number of queries: 9321
86 Correct 5 ms 520 KB Output is correct
87 Correct 4 ms 464 KB Output is correct
88 Correct 5 ms 512 KB Output is correct
89 Correct 3 ms 464 KB Output is correct
90 Correct 5 ms 516 KB Output is correct
91 Correct 5 ms 464 KB Output is correct
92 Correct 2 ms 560 KB Output is correct
93 Correct 6 ms 1360 KB Output is correct
94 Correct 10 ms 1488 KB Output is correct
95 Correct 9 ms 1360 KB Output is correct
96 Correct 6 ms 1296 KB Output is correct
97 Correct 5 ms 464 KB Output is correct