oj.uz

Submission #966338

# Submission time Handle Problem Language Result Execution time Memory
966338 2024-04-19T17:47:35 Z bachhoangxuan The Big Prize (IOI17_prize) C++17
20 / 100
 50 ms 7196 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand_int(int l,int r){
    return l+(int)(rng()%(r-l+1));
}
const int B = 500;
const int maxn = 2e5+5;

vector<int> res[maxn];
vector<int> get(int x){
    if(!res[x].empty()) return res[x];
    res[x]=ask(x);res[x][1]+=res[x][0];
    return res[x];
}

int N,bit[maxn],Max;
void update(int x){
    for(int i=x+1;i<=N;i+=(i&(-i))) bit[i]++;
}
int query(int x){
    int ans=0;
    for(int i=x+1;i>=1;i-=(i&(-i))) ans+=bit[i];
    return ans;
}

int find_best(int n){
    N=n;rng.seed(998244353);
    for(int i=0;i<400;i++){
        vector<int> cc=get(i);
        if(cc[1]==0) return i;
        Max=max(Max,cc[1]);
    }
    for(int i=0;i<n;i+=B){
        vector<int> p;
        for(int j=i;j<min(i+B,n);j++) p.push_back(j);
        int cnt=0;
        while(!p.empty()){
            int x=p.back();p.pop_back();
            vector<int> cc=get(x);
            if(cc[1]==0) return x;
            if(cc[1]<Max) update(x);
            else{
                cnt=cc[0]-query(x);
                break;
            }
        }
        while(cnt){
            int l=0,r=(int)p.size()-1;
            while(l<=r){
                int mid=(l+r)>>1;
                vector<int> cc=get(p[mid]);
                if(cc[1]==0) return p[mid];
                if(cc[1]<Max){
                    update(p[mid]);
                    p.erase(p.begin()+mid);
                    break;
                }
                if(cc[0]-query(p[mid])) r=mid-1;
                else l=mid+1;
            }
            cnt--;
        }
    }
	return -1;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6012 KB Output is correct
2 Correct 4 ms 6264 KB Output is correct
3 Correct 4 ms 6020 KB Output is correct
4 Correct 5 ms 5776 KB Output is correct
5 Correct 4 ms 5768 KB Output is correct
6 Correct 1 ms 5720 KB Output is correct
7 Correct 4 ms 6268 KB Output is correct
8 Correct 5 ms 6020 KB Output is correct
9 Correct 4 ms 6028 KB Output is correct
10 Correct 6 ms 6020 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5764 KB Output is correct
2 Correct 5 ms 6020 KB Output is correct
3 Correct 5 ms 6016 KB Output is correct
4 Correct 5 ms 6268 KB Output is correct
5 Correct 4 ms 6016 KB Output is correct
6 Correct 1 ms 5720 KB Output is correct
7 Correct 4 ms 6020 KB Output is correct
8 Correct 4 ms 6016 KB Output is correct
9 Correct 5 ms 5776 KB Output is correct
10 Correct 6 ms 6024 KB Output is correct
11 Correct 5 ms 6080 KB Output is correct
12 Correct 3 ms 6012 KB Output is correct
13 Correct 7 ms 6008 KB Output is correct
14 Correct 4 ms 6016 KB Output is correct
15 Correct 6 ms 6056 KB Output is correct
16 Correct 20 ms 6508 KB Output is correct
17 Correct 4 ms 6008 KB Output is correct
18 Correct 22 ms 6544 KB Output is correct
19 Correct 3 ms 6012 KB Output is correct
20 Correct 7 ms 6316 KB Output is correct
21 Correct 14 ms 6264 KB Output is correct
22 Correct 5 ms 6268 KB Output is correct
23 Correct 4 ms 6016 KB Output is correct
24 Correct 4 ms 5764 KB Output is correct
25 Correct 12 ms 6484 KB Output is correct
26 Correct 15 ms 6420 KB Output is correct
27 Correct 4 ms 6264 KB Output is correct
28 Correct 20 ms 6512 KB Output is correct
29 Correct 21 ms 6508 KB Output is correct
30 Correct 24 ms 6988 KB Output is correct
31 Correct 5 ms 6012 KB Output is correct
32 Correct 6 ms 6280 KB Output is correct
33 Correct 2 ms 5720 KB Output is correct
34 Correct 9 ms 5972 KB Output is correct
35 Correct 6 ms 6052 KB Output is correct
36 Correct 9 ms 6520 KB Output is correct
37 Correct 4 ms 6320 KB Output is correct
38 Correct 4 ms 6264 KB Output is correct
39 Correct 11 ms 6252 KB Output is correct
40 Correct 24 ms 6264 KB Output is correct
41 Correct 13 ms 6648 KB Output is correct
42 Correct 14 ms 6656 KB Output is correct
43 Correct 13 ms 6720 KB Output is correct
44 Correct 9 ms 6432 KB Output is correct
45 Correct 9 ms 7196 KB Output is correct
46 Correct 3 ms 6004 KB Output is correct
47 Correct 10 ms 6700 KB Output is correct
48 Correct 18 ms 7008 KB Output is correct
49 Correct 5 ms 6576 KB Output is correct
50 Correct 28 ms 6540 KB Output is correct
51 Correct 13 ms 6220 KB Output is correct
52 Correct 3 ms 6268 KB Output is correct
53 Correct 6 ms 6044 KB Output is correct
54 Correct 13 ms 6236 KB Output is correct
55 Correct 3 ms 6016 KB Output is correct
56 Correct 19 ms 6772 KB Output is correct
57 Correct 18 ms 6864 KB Output is correct
58 Correct 16 ms 6384 KB Output is correct
59 Correct 14 ms 6484 KB Output is correct
60 Correct 13 ms 6704 KB Output is correct
61 Correct 5 ms 6040 KB Output is correct
62 Correct 3 ms 5764 KB Output is correct
63 Correct 5 ms 6548 KB Output is correct
64 Correct 5 ms 6296 KB Output is correct
65 Correct 5 ms 6044 KB Output is correct
66 Correct 7 ms 6028 KB Output is correct
67 Correct 8 ms 6044 KB Output is correct
68 Correct 4 ms 6008 KB Output is correct
69 Correct 5 ms 6024 KB Output is correct
70 Correct 7 ms 6276 KB Output is correct
71 Correct 23 ms 6540 KB Output is correct
72 Correct 7 ms 6280 KB Output is correct
73 Correct 25 ms 6556 KB Output is correct
74 Correct 28 ms 6308 KB Output is correct
75 Correct 5 ms 5776 KB Output is correct
76 Correct 22 ms 6760 KB Output is correct
77 Correct 20 ms 7088 KB Output is correct
78 Correct 8 ms 6028 KB Output is correct
79 Correct 15 ms 6628 KB Output is correct
80 Correct 21 ms 7024 KB Output is correct
81 Correct 21 ms 6788 KB Output is correct
82 Correct 23 ms 6832 KB Output is correct
83 Correct 6 ms 6260 KB Output is correct
84 Correct 17 ms 6328 KB Output is correct
85 Correct 24 ms 6936 KB Output is correct
86 Incorrect 50 ms 6652 KB Integer -1 violates the range [0, 199999]
87 Halted 0 ms 0 KB -