Submission #1048242

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1048242	2024-08-08T05:52:50 Z	pcc	The Big Prize (IOI17_prize)	C++17	20 / 100	96 ms	3828 KB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define fs first
#define sc second

#ifdef LOCAL
const int lim = 3;
const int sq = 5;
#else
const int lim = 5000;
const int sq = 500;
#endif

const int mxn = 2e5+10;
pii dp[mxn];
int N;
int big = 1e9;
int ans = 0;
bool done = false;
int C = 0;

pii req(int p){
	if(dp[p].fs != -1)return dp[p];
	C++;
	assert(C<=10000);
	auto re = ask(p);
	return (dp[p] = pii(re[0],re[1]));
}

int check(int p){
	auto re = req(p);
	if(!re.fs&&!re.sc)return 0;
	else if(N-re.fs-re.sc == big)return 2;
	else return 1;
}

void dfs(int l,int r){
	if(done)return;
	cerr<<"DFS: "<<l<<','<<r<<endl;
	while(l<=r){
		if(!check(l)){
			ans = l;
			done = true;
			return;
		}
		else if(check(l) == 1)l++;
		else break;
	}
	while(l<=r){
		if(!check(r)){
			ans = r;
			done = true;
			return;
		}
		else if(check(r) == 1)r--;
		else break;
	}
	if(l>r)return;
	int cnt = req(r).fs+req(l).sc-(N-big);
	if(!cnt)return;
	cerr<<"CHECK: "<<l<<','<<r<<','<<cnt<<endl;
	assert(cnt>0);
	int mid = (l+r)>>1;
	if(check(mid) == 0){
		ans = mid;
		done = true;
		return;
	}
	if(l == r)return;
	if(l != mid)dfs(l,mid-1);
	if(mid != r)dfs(mid+1,r);
	return;
}

int find_best(int nn) {
	N = nn;
	int pt = 0;
	for(int i = 1;i*i<2e5;i++)pt = i;
	cerr<<pt<<endl;
	for(auto &i:dp)i = pii(-1,-1);
	if(N<=lim){
		for(int i = 0;i<N;i++){
			auto tmp = req(i);
			if(!tmp.fs&&!tmp.sc)return i;
		}
		assert(false);
		return 0;
	}
	for(int i = 0;i<sq;i++){
		auto tmp = req(i);
		big = min(big,N-tmp.fs-tmp.sc);
	}
	cerr<<"BIG: "<<big<<endl;
	dfs(0,N-1);
	assert(done);
	return ans;
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	1880 KB	Output is correct
2	Correct	3 ms	1880 KB	Output is correct
3	Correct	3 ms	1880 KB	Output is correct
4	Correct	2 ms	1976 KB	Output is correct
5	Correct	3 ms	1880 KB	Output is correct
6	Correct	3 ms	1880 KB	Output is correct
7	Correct	3 ms	1880 KB	Output is correct
8	Correct	3 ms	1880 KB	Output is correct
9	Correct	3 ms	1880 KB	Output is correct
10	Correct	3 ms	1880 KB	Output is correct

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	1880 KB	Output is correct
2	Correct	3 ms	1968 KB	Output is correct
3	Correct	3 ms	1880 KB	Output is correct
4	Correct	3 ms	1880 KB	Output is correct
5	Correct	3 ms	1880 KB	Output is correct
6	Correct	2 ms	1880 KB	Output is correct
7	Correct	3 ms	1880 KB	Output is correct
8	Correct	3 ms	1880 KB	Output is correct
9	Correct	3 ms	1880 KB	Output is correct
10	Correct	4 ms	1880 KB	Output is correct
11	Correct	6 ms	1880 KB	Output is correct
12	Correct	3 ms	1880 KB	Output is correct
13	Correct	17 ms	2012 KB	Output is correct
14	Correct	9 ms	2008 KB	Output is correct
15	Correct	24 ms	2148 KB	Output is correct
16	Partially correct	88 ms	2524 KB	Partially correct - number of queries: 8987
17	Correct	4 ms	1880 KB	Output is correct
18	Runtime error	96 ms	3828 KB	Execution killed with signal 6
19	Halted	0 ms	0 KB	-