oj.uz

답안 #1075539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075539 2024-08-26T07:35:51 Z Abito 커다란 상품 (IOI17_prize) C++17
20 / 100
 53 ms 1880 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5,S=500;
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 3 ms 600 KB Output is correct
2 Correct 5 ms 1368 KB Output is correct
3 Correct 4 ms 1112 KB Output is correct
4 Correct 7 ms 1880 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 4 ms 1368 KB Output is correct
9 Correct 4 ms 1112 KB Output is correct
10 Correct 7 ms 1880 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 600 KB Output is correct
2 Correct 4 ms 1368 KB Output is correct
3 Correct 4 ms 1112 KB Output is correct
4 Correct 7 ms 1880 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 3 ms 1220 KB Output is correct
9 Correct 6 ms 1112 KB Output is correct
10 Correct 7 ms 1880 KB Output is correct
11 Partially correct 34 ms 1004 KB Partially correct - number of queries: 7867
12 Correct 4 ms 600 KB Output is correct
13 Incorrect 53 ms 1368 KB Incorrect
14 Halted 0 ms 0 KB -