Submission #1083256

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1083256	2024-09-02T19:31:54 Z	Math4Life2020	The Big Prize (IOI17_prize)	C++17	20 / 100	32 ms	876 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"

map<ll,pii> pts;
ll N;
ll gm;
ll ans = -1;
vector<bool> asked;
const ll C = 500;
ll USED;
ll UMAX = 9000;

vector<int> get(ll x) {
	USED++;
	//assert(USED<UMAX);
	if (USED>UMAX) {
		ll y=0;
		while (1) {
			y++;
		}
	}
	return ask((int)x);
}

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

ll process(ll x) {
	if (!asked[x]) {
		vector<int> a0 = get(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;
	USED=0;
	gm=0;
	ans = -1;
	pts.clear();
	asked.clear();
	for (ll i=0;i<N;i++) {
		asked.push_back(0);
	}
	if (N<=C) {
		return triv(N);
	}
	ll r = (N-1)/C;
	for (ll i=1;i<=C;i++) {
		vector<int> a0 = get(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++;
	vector<pii> qrv;
	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;
			}*/
			qrv.push_back({(*A).first,(*B).first});
		}
		A++; B++;
	} while (B != pts.end());
	for (pii p0: qrv) {
		query(p0.first,p0.second);
		if (ans != -1) {
			return ans;
		}
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:116:14: warning: control reaches end of non-void function [-Wreturn-type]
  116 |  vector<pii> qrv;
      |              ^~~

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	344 KB	Output is correct
2	Correct	3 ms	600 KB	Output is correct
3	Correct	3 ms	344 KB	Output is correct
4	Correct	4 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	3 ms	596 KB	Output is correct
8	Correct	2 ms	344 KB	Output is correct
9	Correct	3 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	3 ms	344 KB	Output is correct
2	Correct	4 ms	492 KB	Output is correct
3	Correct	4 ms	344 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	3 ms	344 KB	Output is correct
8	Correct	2 ms	344 KB	Output is correct
9	Correct	2 ms	344 KB	Output is correct
10	Correct	3 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	344 KB	Output is correct
14	Correct	4 ms	344 KB	Output is correct
15	Correct	8 ms	492 KB	Output is correct
16	Correct	16 ms	824 KB	Output is correct
17	Correct	5 ms	344 KB	Output is correct
18	Correct	32 ms	876 KB	Output is correct
19	Correct	3 ms	344 KB	Output is correct
20	Correct	8 ms	344 KB	Output is correct
21	Correct	11 ms	344 KB	Output is correct
22	Correct	4 ms	344 KB	Output is correct
23	Correct	3 ms	344 KB	Output is correct
24	Correct	3 ms	600 KB	Output is correct
25	Correct	13 ms	820 KB	Output is correct
26	Correct	13 ms	592 KB	Output is correct
27	Correct	3 ms	344 KB	Output is correct
28	Correct	20 ms	560 KB	Output is correct
29	Correct	12 ms	856 KB	Output is correct
30	Correct	19 ms	600 KB	Output is correct
31	Correct	3 ms	344 KB	Output is correct
32	Correct	4 ms	600 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	9 ms	548 KB	Output is correct
35	Correct	4 ms	344 KB	Output is correct
36	Correct	8 ms	344 KB	Output is correct
37	Correct	2 ms	492 KB	Output is correct
38	Correct	2 ms	344 KB	Output is correct
39	Correct	11 ms	600 KB	Output is correct
40	Correct	15 ms	592 KB	Output is correct
41	Correct	12 ms	600 KB	Output is correct
42	Correct	12 ms	716 KB	Output is correct
43	Correct	14 ms	600 KB	Output is correct
44	Correct	11 ms	600 KB	Output is correct
45	Correct	6 ms	344 KB	Output is correct
46	Correct	2 ms	344 KB	Output is correct
47	Correct	11 ms	556 KB	Output is correct
48	Correct	18 ms	600 KB	Output is correct
49	Correct	6 ms	516 KB	Output is correct
50	Correct	23 ms	856 KB	Output is correct
51	Correct	14 ms	600 KB	Output is correct
52	Correct	3 ms	344 KB	Output is correct
53	Correct	2 ms	344 KB	Output is correct
54	Correct	8 ms	344 KB	Output is correct
55	Correct	4 ms	600 KB	Output is correct
56	Correct	20 ms	848 KB	Output is correct
57	Correct	15 ms	592 KB	Output is correct
58	Correct	16 ms	600 KB	Output is correct
59	Correct	23 ms	592 KB	Output is correct
60	Correct	15 ms	632 KB	Output is correct
61	Correct	3 ms	344 KB	Output is correct
62	Correct	3 ms	344 KB	Output is correct
63	Correct	3 ms	344 KB	Output is correct
64	Correct	3 ms	344 KB	Output is correct
65	Incorrect	3 ms	344 KB	answer is not correct
66	Halted	0 ms	0 KB	-