Submission #1075555

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1075555	2024-08-26T07:40:45 Z	Abito	The Big Prize (IOI17_prize)	C++17	20 / 100	59 ms	1916 KB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5,S=25;
int ans[N][2];
int find_best(int n) {
	int s=0,mx=0;
	for (int i=0;i<min(500,n);i++){
		vector<int> v=ask(i);
		ans[i][0]=v[0];
		ans[i][1]=v[1];
		if (v[0]+v[1]==0) return i;
		if (v[0]+v[1]>mx){
			mx=v[0]+v[1];
			s=i;
		}
	}
	//cout<<s<<endl;
	for (int i=s;i+S<n;i+=S){
		vector<int> v=ask(i+S);
		ans[i+S][0]=v[0];
		ans[i+S][1]=v[1];
		if (v[0]+v[1]==0) return i+S;
		if (v[0]==ans[i][0] && v[1]==ans[i][1]) continue;
		for (int j=i+1;j<i+S;j++){
			v=ask(j);
			ans[j][0]=v[0];
			ans[j][1]=v[1];
			if (v[0]+v[1]==0) return j;
		}
	}
	for (int i=max(0,n-S);i<n;i++){
		vector<int> v=ask(i);
		ans[i][0]=v[0];
		ans[i][1]=v[1];
		if (v[0]+v[1]==0) return i;
	}
	return 0;
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	600 KB	Output is correct
2	Correct	27 ms	1328 KB	Output is correct
3	Correct	35 ms	1216 KB	Output is correct
4	Correct	59 ms	1916 KB	Output is correct
5	Correct	35 ms	1352 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	24 ms	1004 KB	Output is correct
8	Correct	16 ms	1112 KB	Output is correct
9	Correct	22 ms	1084 KB	Output is correct
10	Correct	42 ms	1740 KB	Output is correct

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	856 KB	Output is correct
2	Partially correct	27 ms	1312 KB	Partially correct - number of queries: 5373
3	Correct	32 ms	1244 KB	Output is correct
4	Partially correct	47 ms	1848 KB	Partially correct - number of queries: 8524
5	Correct	22 ms	1068 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	20 ms	1188 KB	Output is correct
8	Correct	19 ms	1360 KB	Output is correct
9	Correct	20 ms	1164 KB	Output is correct
10	Partially correct	44 ms	1852 KB	Partially correct - number of queries: 8524
11	Correct	20 ms	852 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Partially correct	44 ms	1724 KB	Partially correct - number of queries: 9119
14	Correct	5 ms	344 KB	Output is correct
15	Correct	17 ms	692 KB	Output is correct
16	Incorrect	57 ms	1044 KB	Incorrect
17	Halted	0 ms	0 KB	-