oj.uz

Submission #790705

# Submission time Handle Problem Language Result Execution time Memory
790705 2023-07-23T06:40:25 Z ttamx The Big Prize (IOI17_prize) C++14
20 / 100
 1000 ms 11616 KB 
#include "prize.h"
#include<bits/stdc++.h>

using namespace std;

const int N=2e5+5;

struct fenwick{
	int t[N];
	void add(int i,int v){
		while(i<N)t[i]+=v,i+=i&-i;
	}
	int read(int i){
		int res=0;
		while(i>0)res+=t[i],i-=i&-i;
		return res;
	}
}f;

int cnt=0;
int n;
int ans=-1;
vector<vector<int>> mem(N),mem2(N);
int mx;
vector<int> vec;

vector<int> ask2(int x){
	if(mem[x].empty()){
		assert(++cnt<=1e4);
		mem[x]=mem2[x]=ask(x);
	}
	return mem[x];
}

int bsearch(){
	int l=0,r=vec.size()-1;
	bool left=false;
	while(l<r){
		int mid=(l+r)/2;
		int m=vec[mid];
		ask2(m);
		auto &res=mem2[m];
		int val=res[0]+res[1];
		if(val<mx)return m;
		if(res[0]-f.read(m-1)){
			r=mid-1;
		}else{
			l=mid+1;
		}
	}
	return vec[l];
}

int find_best(int _n) {
	n=_n;
	for(int i=0;i*i<=n;i++){
		auto res=ask2(i);
		mx=max(mx,res[0]+res[1]);
	}
	for(int i=0;i<n;i++)vec.emplace_back(i);
	while(ans==-1){
		int x=bsearch();
		auto res=ask2(x);
		if(res[0]+res[1]==0)return x;
		f.add(x,1);
		vec.erase(lower_bound(vec.begin(),vec.end(),x));
	}
	return ans;
}

Compilation message

prize.cpp: In function 'int bsearch()':
prize.cpp:37:7: warning: unused variable 'left' [-Wunused-variable]
   37 |  bool left=false;
      |       ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 10856 KB Output is correct
2 Correct 7 ms 10884 KB Output is correct
3 Correct 9 ms 10848 KB Output is correct
4 Correct 8 ms 10872 KB Output is correct
5 Correct 9 ms 10768 KB Output is correct
6 Correct 8 ms 10872 KB Output is correct
7 Correct 9 ms 10860 KB Output is correct
8 Correct 9 ms 10820 KB Output is correct
9 Correct 8 ms 10876 KB Output is correct
10 Correct 10 ms 10884 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 10816 KB Output is correct
2 Correct 10 ms 10816 KB Output is correct
3 Correct 9 ms 10868 KB Output is correct
4 Correct 7 ms 10872 KB Output is correct
5 Correct 8 ms 10876 KB Output is correct
6 Correct 7 ms 10880 KB Output is correct
7 Correct 8 ms 10976 KB Output is correct
8 Correct 10 ms 10848 KB Output is correct
9 Correct 8 ms 10880 KB Output is correct
10 Correct 9 ms 10864 KB Output is correct
11 Correct 8 ms 10876 KB Output is correct
12 Correct 8 ms 10976 KB Output is correct
13 Correct 11 ms 10984 KB Output is correct
14 Correct 8 ms 9976 KB Output is correct
15 Correct 14 ms 10876 KB Output is correct
16 Correct 46 ms 11428 KB Output is correct
17 Correct 9 ms 10796 KB Output is correct
18 Partially correct 47 ms 11528 KB Partially correct - number of queries: 5949
19 Correct 8 ms 10876 KB Output is correct
20 Correct 21 ms 10368 KB Output is correct
21 Correct 31 ms 10948 KB Output is correct
22 Correct 13 ms 10852 KB Output is correct
23 Correct 10 ms 10876 KB Output is correct
24 Correct 7 ms 10868 KB Output is correct
25 Correct 37 ms 11044 KB Output is correct
26 Correct 35 ms 11084 KB Output is correct
27 Correct 8 ms 10848 KB Output is correct
28 Partially correct 54 ms 11568 KB Partially correct - number of queries: 5450
29 Correct 25 ms 11428 KB Output is correct
30 Partially correct 55 ms 11616 KB Partially correct - number of queries: 5880
31 Correct 8 ms 10876 KB Output is correct
32 Correct 13 ms 10856 KB Output is correct
33 Correct 4 ms 9680 KB Output is correct
34 Correct 28 ms 10840 KB Output is correct
35 Correct 8 ms 10824 KB Output is correct
36 Correct 21 ms 10884 KB Output is correct
37 Correct 10 ms 10824 KB Output is correct
38 Correct 10 ms 10824 KB Output is correct
39 Correct 35 ms 11024 KB Output is correct
40 Partially correct 37 ms 11484 KB Partially correct - number of queries: 5112
41 Correct 24 ms 11164 KB Output is correct
42 Correct 23 ms 11156 KB Output is correct
43 Correct 42 ms 11068 KB Output is correct
44 Correct 18 ms 10940 KB Output is correct
45 Correct 28 ms 10824 KB Output is correct
46 Correct 8 ms 10824 KB Output is correct
47 Correct 27 ms 10996 KB Output is correct
48 Correct 49 ms 11252 KB Output is correct
49 Correct 11 ms 10824 KB Output is correct
50 Partially correct 62 ms 11576 KB Partially correct - number of queries: 5961
51 Correct 20 ms 10948 KB Output is correct
52 Correct 9 ms 10880 KB Output is correct
53 Correct 8 ms 10976 KB Output is correct
54 Correct 20 ms 10992 KB Output is correct
55 Correct 10 ms 10848 KB Output is correct
56 Partially correct 60 ms 11604 KB Partially correct - number of queries: 5961
57 Correct 30 ms 11356 KB Output is correct
58 Correct 43 ms 11292 KB Output is correct
59 Correct 33 ms 11068 KB Output is correct
60 Correct 35 ms 11024 KB Output is correct
61 Correct 10 ms 10856 KB Output is correct
62 Correct 8 ms 10844 KB Output is correct
63 Correct 8 ms 10880 KB Output is correct
64 Correct 8 ms 10872 KB Output is correct
65 Execution timed out 3043 ms 10884 KB Time limit exceeded
66 Halted 0 ms 0 KB -