Submission #1075565

# Submission time Handle Problem Language Result Execution time Memory
1075565 2024-08-26T07:44:28 Z Abito The Big Prize (IOI17_prize) C++17
20 / 100
59 ms 2044 KB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int ans[N][2],S=40;
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;
}
# Verdict Execution time Memory Grader output
1 Correct 4 ms 600 KB Output is correct
2 Correct 14 ms 1348 KB Output is correct
3 Correct 18 ms 1156 KB Output is correct
4 Correct 23 ms 1872 KB Output is correct
5 Correct 12 ms 1112 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 13 ms 1128 KB Output is correct
8 Correct 10 ms 1104 KB Output is correct
9 Correct 19 ms 1360 KB Output is correct
10 Correct 22 ms 2044 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 856 KB Output is correct
2 Correct 17 ms 1316 KB Output is correct
3 Correct 16 ms 1064 KB Output is correct
4 Partially correct 24 ms 1872 KB Partially correct - number of queries: 5539
5 Correct 18 ms 1360 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 15 ms 1104 KB Output is correct
8 Correct 20 ms 1104 KB Output is correct
9 Correct 12 ms 1104 KB Output is correct
10 Partially correct 25 ms 1992 KB Partially correct - number of queries: 5539
11 Correct 10 ms 856 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Partially correct 33 ms 1760 KB Partially correct - number of queries: 6647
14 Correct 9 ms 600 KB Output is correct
15 Correct 17 ms 600 KB Output is correct
16 Incorrect 59 ms 940 KB Incorrect
17 Halted 0 ms 0 KB -