Submission #1083247

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1083247	2024-09-02T19:18:33 Z	Math4Life2020	The Big Prize (IOI17_prize)	C++17	20 / 100	38 ms	704 KB

prize

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
using ll = long long; using pii = pair<ll,ll>;
#include "prize.h"

int triv(int N1) {
	for (ll i=0;i<N1;i++) {
		vector<int> a0 = ask((int)i);
		if ((a0[0]+a0[1])==0) {
			return i;
		}
	}
	return -1;
}

map<ll,pii> pts;
ll N;
ll gm;
ll ans = -1;
vector<bool> asked;

ll process(ll x) {
	if (!asked[x]) {
		vector<int> a0 = ask((int)x);
		pts[x]={a0[0],a0[1]};
		asked[x]=1;
	}
	ll S = pts[x].first+pts[x].second;
	if (S==0) {
		return x;
	}
	if (S<gm) {
		ll y = -1;
		if (x>0 && !asked[x-1]) {
			y=max(y,process(x-1));
		}
		if (x<(N-1) && !asked[x+1]) {
			y=max(y,process(x+1));
		}
		return y;
	}
	return -1;
}

void query(ll a, ll b) {
	if ((a+1)==b) {
		return;
	}
	if (pts[a].first==pts[b].first) {
		return;
	}
	ll c = (a+b)/2;
	ans=max(ans,process(c));
	if (ans!=-1) {
		return;
	}
	auto A1 = pts.find(a); A1++;
	query(a,(*A1).first);
	auto B1 = pts.find(b); B1--;
	query((*B1).first,b);
}

int find_best(int N0) {
	N=N0;
	gm=0;
	ans = -1;
	pts.clear();
	asked.clear();
	for (ll i=0;i<N;i++) {
		asked.push_back(0);
	}
	if (N<=5000) {
		return triv(N);
	}
	ll r = (N-1)/500;
	for (ll i=1;i<=500;i++) {
		vector<int> a0 = ask((int)(i*r));
		asked[i*r]=1;
		pts[i*r]={a0[0],a0[1]};
	}
	for (auto A: pts) {
		pii p0 = A.second;
		gm = max(gm,p0.first+p0.second);
	}
	for (auto A: pts) {
		ll v = process(A.first);
		if (v!=-1) {
			return v;
		}
	}
	if (process(0)!=-1) {
		return 0;
	}
	if (process(N-1)!=-1) {
		return (N-1);
	}
	auto A = pts.begin(); auto B=A; B++;
	do {
		pii pa = (*A).second; pii pb = (*B).second;
		if ((pa.first+pa.second+pb.first+pb.second)==(2*gm)) {
			query((*A).first,(*B).first);
			if (ans != -1) {
				return ans;
			}
		}
		A++; B++;
	} while (B != pts.end());
	return -1;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	344 KB	Output is correct
2	Correct	2 ms	344 KB	Output is correct
3	Correct	3 ms	344 KB	Output is correct
4	Correct	3 ms	340 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Correct	3 ms	344 KB	Output is correct
7	Correct	3 ms	428 KB	Output is correct
8	Correct	3 ms	344 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	3 ms	344 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	7 ms	488 KB	Output is correct
14	Correct	3 ms	344 KB	Output is correct
15	Correct	6 ms	344 KB	Output is correct
16	Correct	18 ms	604 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	36 ms	704 KB	Output is correct
19	Correct	3 ms	344 KB	Output is correct
20	Correct	6 ms	508 KB	Output is correct
21	Correct	14 ms	564 KB	Output is correct
22	Correct	8 ms	344 KB	Output is correct
23	Correct	5 ms	344 KB	Output is correct
24	Correct	3 ms	344 KB	Output is correct
25	Incorrect	38 ms	492 KB	Integer -1 violates the range [0, 199999]
26	Halted	0 ms	0 KB	-