답안 #1075543

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1075543	2024-08-26T07:38:27 Z	Abito	커다란 상품 (IOI17_prize)	C++17	20 / 100	59 ms	1880 KB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5,S=100;
int ans[N][2];
int find_best(int n) {
	int s=0,mx=0;
	for (int i=0;i<min(S,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

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	600 KB	Output is correct
2	Correct	6 ms	1368 KB	Output is correct
3	Correct	5 ms	1192 KB	Output is correct
4	Correct	12 ms	1872 KB	Output is correct
5	Correct	6 ms	1112 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	7 ms	1192 KB	Output is correct
8	Correct	5 ms	1088 KB	Output is correct
9	Correct	9 ms	1044 KB	Output is correct
10	Correct	13 ms	1784 KB	Output is correct

Subtask #2

0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	596 KB	Output is correct
2	Correct	7 ms	1368 KB	Output is correct
3	Correct	4 ms	1216 KB	Output is correct
4	Correct	10 ms	1880 KB	Output is correct
5	Correct	9 ms	1112 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	8 ms	1196 KB	Output is correct
8	Correct	6 ms	1136 KB	Output is correct
9	Correct	5 ms	1368 KB	Output is correct
10	Correct	10 ms	1788 KB	Output is correct
11	Correct	7 ms	848 KB	Output is correct
12	Correct	2 ms	344 KB	Output is correct
13	Partially correct	23 ms	1692 KB	Partially correct - number of queries: 5392
14	Correct	7 ms	476 KB	Output is correct
15	Partially correct	47 ms	508 KB	Partially correct - number of queries: 6865
16	Incorrect	59 ms	876 KB	Incorrect
17	Halted	0 ms	0 KB	-