Submission #981425

# Submission time Handle Problem Language Result Execution time Memory
981425 2024-05-13T07:55:02 Z vjudge1 The Big Prize (IOI17_prize) C++17
95.43 / 100
35 ms 2300 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int unloli,ans=-1;
map<int,vector<int>> mem;
vector<int>ask2(int n){
    if(mem.count(n))
        return mem[n];
    return mem[n]=ask(n);
}
void calc(int l,int r,int tol,int tor){
    if(ans>=0)
        return;
    if(l>r)
        return;
    if(tol+tor==unloli)
        return;
    if(tol+tor+r-l+1==unloli){
        for(int i=l;i<=r;i++) {
            vector<int>x=ask2(i);
            if(x[0]+x[1]==0) {
                ans=i;
                return;
            }
        }
        return;
    }
    int mid=l+r>>1,pt=mid;
    vector<int>stuff=ask2(mid);
    if(stuff[0]+stuff[1]==0){
        ans=mid;
        return;
    }
    while(stuff[0]+stuff[1]-unloli&&pt>l){
        stuff=ask2(--pt);
        if(stuff[0]+stuff[1]==0){
            ans=pt;
            return;
        }
    }
    if(stuff[0]+stuff[1]==unloli)
        calc(l,pt-1,tol,stuff[1]),
        calc(mid+1,r,stuff[0],tor);
    else {
        stuff=ask2(++mid);
        if(stuff[0]+stuff[1]==0) {
            ans=mid;
            return;
        }
        while(stuff[0]+stuff[1]-unloli){
            stuff=ask2(++mid);
            if(stuff[0]+stuff[1]==0) {
                ans=mid;
                return;
            }
        }
        calc(mid+1,r,stuff[0],tor);
    }
}
int find_best(int n) {
    if(n<5002) {
        for(int i = 1; i < n; i++) {
            std::vector<int> res = ask2(i);
            if(res[0] + res[1] == 0)
                return i;
        }
	    return 0;
    }
    map<int,int>cnt;
    for(int i=0;i<512;i++){
        vector<int>x=ask2(i);
        if(x[0]+x[1]==0)
            return i;
        cnt[x[0]+x[1]]++;
        unloli=max(unloli,x[0]+x[1]);
    }
    int s=0;
    for(auto[i,j]:cnt)
        s+=(i<unloli)*j;
    calc(512,n-1,s,0);
    return ans;
}

Compilation message

prize.cpp: In function 'void calc(int, int, int, int)':
prize.cpp:28:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |     int mid=l+r>>1,pt=mid;
      |             ~^~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 440 KB Output is correct
2 Correct 3 ms 744 KB Output is correct
3 Correct 2 ms 744 KB Output is correct
4 Correct 4 ms 976 KB Output is correct
5 Correct 2 ms 740 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 3 ms 956 KB Output is correct
8 Correct 3 ms 972 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 3 ms 744 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 692 KB Output is correct
2 Correct 2 ms 740 KB Output is correct
3 Correct 3 ms 744 KB Output is correct
4 Correct 3 ms 976 KB Output is correct
5 Correct 2 ms 728 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 3 ms 740 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 2 ms 488 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 3 ms 980 KB Output is correct
12 Correct 2 ms 488 KB Output is correct
13 Correct 4 ms 996 KB Output is correct
14 Correct 3 ms 692 KB Output is correct
15 Correct 6 ms 1248 KB Output is correct
16 Correct 22 ms 2300 KB Output is correct
17 Correct 3 ms 692 KB Output is correct
18 Partially correct 23 ms 1180 KB Partially correct - number of queries: 5275
19 Correct 2 ms 956 KB Output is correct
20 Correct 9 ms 1000 KB Output is correct
21 Correct 10 ms 920 KB Output is correct
22 Correct 4 ms 748 KB Output is correct
23 Correct 3 ms 1224 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 12 ms 1656 KB Output is correct
26 Correct 12 ms 1464 KB Output is correct
27 Correct 3 ms 948 KB Output is correct
28 Correct 23 ms 2120 KB Output is correct
29 Correct 17 ms 1728 KB Output is correct
30 Partially correct 24 ms 1144 KB Partially correct - number of queries: 5239
31 Correct 2 ms 692 KB Output is correct
32 Correct 4 ms 692 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 10 ms 1292 KB Output is correct
35 Correct 3 ms 740 KB Output is correct
36 Correct 9 ms 1232 KB Output is correct
37 Correct 3 ms 492 KB Output is correct
38 Correct 3 ms 696 KB Output is correct
39 Correct 13 ms 1632 KB Output is correct
40 Correct 23 ms 1816 KB Output is correct
41 Correct 15 ms 1260 KB Output is correct
42 Correct 13 ms 1416 KB Output is correct
43 Correct 13 ms 1396 KB Output is correct
44 Correct 13 ms 1132 KB Output is correct
45 Correct 11 ms 1260 KB Output is correct
46 Correct 2 ms 464 KB Output is correct
47 Correct 10 ms 1504 KB Output is correct
48 Correct 23 ms 1084 KB Output is correct
49 Correct 4 ms 1220 KB Output is correct
50 Partially correct 29 ms 1152 KB Partially correct - number of queries: 5269
51 Correct 10 ms 696 KB Output is correct
52 Correct 2 ms 744 KB Output is correct
53 Correct 3 ms 968 KB Output is correct
54 Correct 11 ms 1152 KB Output is correct
55 Correct 2 ms 636 KB Output is correct
56 Partially correct 34 ms 1104 KB Partially correct - number of queries: 5275
57 Correct 20 ms 1388 KB Output is correct
58 Correct 22 ms 1860 KB Output is correct
59 Correct 14 ms 1824 KB Output is correct
60 Correct 13 ms 1588 KB Output is correct
61 Correct 3 ms 724 KB Output is correct
62 Correct 3 ms 956 KB Output is correct
63 Correct 3 ms 744 KB Output is correct
64 Correct 3 ms 728 KB Output is correct
65 Correct 3 ms 944 KB Output is correct
66 Correct 4 ms 720 KB Output is correct
67 Correct 4 ms 980 KB Output is correct
68 Correct 3 ms 724 KB Output is correct
69 Correct 5 ms 996 KB Output is correct
70 Correct 3 ms 968 KB Output is correct
71 Partially correct 24 ms 1924 KB Partially correct - number of queries: 5271
72 Correct 4 ms 788 KB Output is correct
73 Partially correct 30 ms 1952 KB Partially correct - number of queries: 5208
74 Partially correct 34 ms 1444 KB Partially correct - number of queries: 5235
75 Correct 3 ms 1248 KB Output is correct
76 Correct 25 ms 1488 KB Output is correct
77 Partially correct 27 ms 1952 KB Partially correct - number of queries: 5455
78 Correct 5 ms 944 KB Output is correct
79 Correct 14 ms 1524 KB Output is correct
80 Partially correct 29 ms 1904 KB Partially correct - number of queries: 5443
81 Partially correct 29 ms 1860 KB Partially correct - number of queries: 5457
82 Partially correct 35 ms 1596 KB Partially correct - number of queries: 5402
83 Correct 3 ms 948 KB Output is correct
84 Correct 19 ms 1980 KB Output is correct
85 Partially correct 20 ms 1500 KB Partially correct - number of queries: 5411
86 Correct 3 ms 692 KB Output is correct
87 Correct 3 ms 692 KB Output is correct
88 Correct 2 ms 692 KB Output is correct
89 Correct 2 ms 696 KB Output is correct
90 Correct 4 ms 948 KB Output is correct
91 Correct 3 ms 968 KB Output is correct
92 Correct 3 ms 1204 KB Output is correct
93 Correct 4 ms 980 KB Output is correct
94 Correct 4 ms 996 KB Output is correct
95 Correct 4 ms 968 KB Output is correct
96 Correct 6 ms 692 KB Output is correct
97 Correct 2 ms 492 KB Output is correct