oj.uz

Submission #981422

# Submission time Handle Problem Language Result Execution time Memory
981422 2024-05-13T07:43:03 Z vjudge1 The Big Prize (IOI17_prize) C++17
20 / 100
 52 ms 2112 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<460;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(460,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;
      |             ~^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 720 KB Output is correct
4 Correct 3 ms 696 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 3 ms 720 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 3 ms 628 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 720 KB Output is correct
2 Correct 2 ms 976 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 968 KB Output is correct
5 Correct 2 ms 692 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 2 ms 704 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 2 ms 964 KB Output is correct
11 Correct 3 ms 496 KB Output is correct
12 Correct 2 ms 1144 KB Output is correct
13 Correct 5 ms 720 KB Output is correct
14 Correct 3 ms 432 KB Output is correct
15 Correct 5 ms 1236 KB Output is correct
16 Correct 22 ms 2064 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Partially correct 28 ms 1860 KB Partially correct - number of queries: 5224
19 Correct 2 ms 720 KB Output is correct
20 Correct 7 ms 836 KB Output is correct
21 Correct 14 ms 1008 KB Output is correct
22 Correct 4 ms 712 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 13 ms 1552 KB Output is correct
26 Correct 13 ms 1100 KB Output is correct
27 Correct 3 ms 716 KB Output is correct
28 Correct 26 ms 1732 KB Output is correct
29 Correct 19 ms 1556 KB Output is correct
30 Partially correct 22 ms 1856 KB Partially correct - number of queries: 5188
31 Correct 2 ms 724 KB Output is correct
32 Correct 7 ms 956 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 9 ms 772 KB Output is correct
35 Correct 3 ms 744 KB Output is correct
36 Correct 6 ms 1080 KB Output is correct
37 Correct 3 ms 496 KB Output is correct
38 Correct 2 ms 720 KB Output is correct
39 Correct 14 ms 1868 KB Output is correct
40 Correct 34 ms 1116 KB Output is correct
41 Correct 16 ms 1664 KB Output is correct
42 Correct 19 ms 1056 KB Output is correct
43 Correct 15 ms 1680 KB Output is correct
44 Correct 11 ms 1400 KB Output is correct
45 Correct 12 ms 1328 KB Output is correct
46 Correct 2 ms 884 KB Output is correct
47 Correct 11 ms 1172 KB Output is correct
48 Correct 19 ms 2028 KB Output is correct
49 Correct 3 ms 992 KB Output is correct
50 Partially correct 31 ms 1280 KB Partially correct - number of queries: 5220
51 Correct 9 ms 1396 KB Output is correct
52 Correct 3 ms 964 KB Output is correct
53 Correct 3 ms 744 KB Output is correct
54 Correct 13 ms 1120 KB Output is correct
55 Correct 2 ms 964 KB Output is correct
56 Partially correct 27 ms 2016 KB Partially correct - number of queries: 5219
57 Correct 29 ms 1300 KB Output is correct
58 Correct 20 ms 1708 KB Output is correct
59 Correct 17 ms 1092 KB Output is correct
60 Correct 14 ms 996 KB Output is correct
61 Correct 3 ms 740 KB Output is correct
62 Correct 2 ms 1144 KB Output is correct
63 Correct 3 ms 744 KB Output is correct
64 Correct 2 ms 488 KB Output is correct
65 Correct 3 ms 956 KB Output is correct
66 Correct 5 ms 952 KB Output is correct
67 Correct 3 ms 1004 KB Output is correct
68 Correct 3 ms 464 KB Output is correct
69 Correct 4 ms 1240 KB Output is correct
70 Correct 3 ms 696 KB Output is correct
71 Partially correct 26 ms 1416 KB Partially correct - number of queries: 5219
72 Correct 6 ms 1484 KB Output is correct
73 Partially correct 26 ms 1812 KB Partially correct - number of queries: 5156
74 Partially correct 29 ms 2112 KB Partially correct - number of queries: 5183
75 Correct 3 ms 744 KB Output is correct
76 Correct 22 ms 1160 KB Output is correct
77 Partially correct 34 ms 1924 KB Partially correct - number of queries: 5390
78 Correct 4 ms 944 KB Output is correct
79 Correct 17 ms 1628 KB Output is correct
80 Partially correct 24 ms 1560 KB Partially correct - number of queries: 5410
81 Partially correct 25 ms 1420 KB Partially correct - number of queries: 5395
82 Partially correct 26 ms 1828 KB Partially correct - number of queries: 5340
83 Correct 3 ms 692 KB Output is correct
84 Correct 25 ms 1752 KB Output is correct
85 Partially correct 29 ms 1724 KB Partially correct - number of queries: 5401
86 Incorrect 52 ms 2056 KB Incorrect
87 Halted 0 ms 0 KB -