oj.uz

답안 #1075589

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075589 2024-08-26T07:55:23 Z Abito 커다란 상품 (IOI17_prize) C++17
20 / 100
 58 ms 3264 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5;
int ans[N][2],S;
int32_t find_best(int32_t n) {
	int s=0,mx=0;
	for (int i=0;i<min(500,n);i++){
		vector<int32_t> 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;
		}
	}
	int sq=sqrtl(n),mn=LLONG_MAX;
	for (int i=1;i<=n;i++){
		int x=sq+(n-sq)/i+mx*i;
		if (x<mn) mn=x,S=i;
	}	
	//cout<<s<<endl;
	for (int i=s;i+S<n;i+=S){
		vector<int32_t> 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(0LL,n-S);i<n;i++){
		vector<int32_t> 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 6 ms 856 KB Output is correct
2 Correct 6 ms 1364 KB Output is correct
3 Correct 6 ms 1368 KB Output is correct
4 Correct 6 ms 2136 KB Output is correct
5 Correct 5 ms 1368 KB Output is correct
6 Correct 1 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 6 ms 1204 KB Output is correct
10 Correct 6 ms 2136 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 600 KB Output is correct
2 Correct 7 ms 1464 KB Output is correct
3 Correct 5 ms 1368 KB Output is correct
4 Correct 8 ms 2408 KB Output is correct
5 Correct 4 ms 1364 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 7 ms 1296 KB Output is correct
8 Correct 4 ms 1368 KB Output is correct
9 Correct 7 ms 1368 KB Output is correct
10 Correct 7 ms 2136 KB Output is correct
11 Correct 13 ms 1616 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Partially correct 38 ms 3264 KB Partially correct - number of queries: 5558
14 Correct 5 ms 344 KB Output is correct
15 Correct 20 ms 868 KB Output is correct
16 Incorrect 58 ms 2004 KB Incorrect
17 Halted 0 ms 0 KB -