oj.uz

답안 #56494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
56494 2018-07-11T13:26:40 Z Kerim 커다란 상품 (IOI17_prize) C++17
90 / 100
 107 ms 5600 KB 
#include "bits/stdc++.h"
#include "prize.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
#define left cep
#define right sag
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<=b){a=b;return 1;}return 0;}
int n;
const int c=480;
//~ int arr[MAXN],query=0;
//~ int left[MAXN],right[MAXN],cnt[123];
//~ vector<int>ask(int x){
	//~ query++;
	//~ vector<int>res(2,0);
	//~ assert(res[0]+res[1]==0);
	//~ res[0]=left[x];
	//~ res[1]=right[x];
	//~ return res;	
//~ }
vector<int>memo[MAXN];
vector<int>sora(int x){
	if(!memo[x].empty())
		return memo[x];
	return memo[x]=ask(x);
}
int find_best(int N){
	n=N;
	int mx=0;
	vector<int>res,tmp;
	for(int i=0;i<min(n,c);i++){
		res=sora(i);
		if(res[0]+res[1]==0)
			return i;
		umax(mx,res[0]+res[1]);
	}
	for(int i=c;i<n;i+=c){
		int who=i;
		if(sora(who)==sora(min(n-1,i+c-1)))
			continue;
		while(who<min(n,i+c)){
			tmp=sora(who);
			if(tmp[0]+tmp[1]==0)
				return who;
			if(tmp[0]+tmp[1]<mx){
				who++;
				continue;
			}	
			int st=who+1,en=min(n-1,i+c-1),pos=who;
			while(st<=en){
				int mid=(st+en)/2;
				res=sora(mid);
				if(res!=tmp)
					en=mid-1;
				else{
					pos=mid;
					st=mid+1;
				}	
			}
			who=pos+1;
		}
	}
	return -1;
}
//~ int main(){
    //~ freopen("file.in", "r", stdin);
    //~ int N;
    //~ scanf("%d",&N);
    //~ for(int i=0;i<N;i++)
		//~ scanf("%d",arr+i);
	//~ for(int i=0;i<N;i++){
		//~ for(int j=1;j<arr[i];j++)
			//~ left[i]+=cnt[j];
		//~ cnt[arr[i]]++;	
	//~ }	
	//~ memset(cnt,0,sizeof cnt);
	//~ for(int i=N-1;i>=0;i--){
		//~ for(int j=1;j<arr[i];j++)
			//~ right[i]+=cnt[j];
		//~ cnt[arr[i]]++;	
	//~ }
	//~ int ans=find_best(N);
	//~ assert(arr[ans]==1);
	//~ printf("%d\n",ans);	
	//~ debug(query);
	//~ return 0;
//~ }

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 4984 KB Output is correct
2 Correct 11 ms 5188 KB Output is correct
3 Correct 16 ms 5224 KB Output is correct
4 Correct 18 ms 5224 KB Output is correct
5 Correct 16 ms 5224 KB Output is correct
6 Correct 8 ms 5224 KB Output is correct
7 Correct 12 ms 5224 KB Output is correct
8 Correct 12 ms 5224 KB Output is correct
9 Correct 12 ms 5236 KB Output is correct
10 Correct 18 ms 5264 KB Output is correct

Subtask #2
70.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 5264 KB Output is correct
2 Correct 12 ms 5284 KB Output is correct
3 Correct 15 ms 5284 KB Output is correct
4 Correct 21 ms 5284 KB Output is correct
5 Correct 17 ms 5284 KB Output is correct
6 Correct 7 ms 5284 KB Output is correct
7 Correct 15 ms 5284 KB Output is correct
8 Correct 15 ms 5284 KB Output is correct
9 Correct 12 ms 5284 KB Output is correct
10 Correct 16 ms 5308 KB Output is correct
11 Correct 21 ms 5308 KB Output is correct
12 Correct 10 ms 5308 KB Output is correct
13 Correct 24 ms 5308 KB Output is correct
14 Correct 14 ms 5308 KB Output is correct
15 Correct 24 ms 5308 KB Output is correct
16 Partially correct 69 ms 5436 KB Partially correct - number of queries: 7165
17 Correct 9 ms 5436 KB Output is correct
18 Partially correct 62 ms 5532 KB Partially correct - number of queries: 8557
19 Correct 14 ms 5532 KB Output is correct
20 Correct 28 ms 5532 KB Output is correct
21 Correct 31 ms 5532 KB Output is correct
22 Correct 18 ms 5532 KB Output is correct
23 Correct 17 ms 5532 KB Output is correct
24 Correct 9 ms 5532 KB Output is correct
25 Correct 66 ms 5532 KB Output is correct
26 Correct 53 ms 5532 KB Output is correct
27 Correct 16 ms 5532 KB Output is correct
28 Partially correct 52 ms 5532 KB Partially correct - number of queries: 7071
29 Partially correct 42 ms 5532 KB Partially correct - number of queries: 5687
30 Partially correct 103 ms 5564 KB Partially correct - number of queries: 8522
31 Correct 12 ms 5564 KB Output is correct
32 Correct 16 ms 5564 KB Output is correct
33 Correct 5 ms 5564 KB Output is correct
34 Correct 31 ms 5564 KB Output is correct
35 Correct 17 ms 5564 KB Output is correct
36 Correct 28 ms 5564 KB Output is correct
37 Correct 12 ms 5564 KB Output is correct
38 Correct 13 ms 5564 KB Output is correct
39 Correct 40 ms 5564 KB Output is correct
40 Partially correct 45 ms 5564 KB Partially correct - number of queries: 7827
41 Partially correct 43 ms 5564 KB Partially correct - number of queries: 5075
42 Partially correct 44 ms 5564 KB Partially correct - number of queries: 5075
43 Correct 51 ms 5564 KB Output is correct
44 Correct 45 ms 5564 KB Output is correct
45 Correct 34 ms 5564 KB Output is correct
46 Correct 10 ms 5564 KB Output is correct
47 Correct 45 ms 5564 KB Output is correct
48 Partially correct 61 ms 5564 KB Partially correct - number of queries: 6249
49 Correct 15 ms 5564 KB Output is correct
50 Partially correct 71 ms 5564 KB Partially correct - number of queries: 8573
51 Correct 28 ms 5564 KB Output is correct
52 Correct 14 ms 5564 KB Output is correct
53 Correct 16 ms 5564 KB Output is correct
54 Correct 29 ms 5564 KB Output is correct
55 Correct 11 ms 5564 KB Output is correct
56 Partially correct 72 ms 5564 KB Partially correct - number of queries: 8556
57 Partially correct 63 ms 5564 KB Partially correct - number of queries: 6151
58 Partially correct 54 ms 5564 KB Partially correct - number of queries: 6197
59 Partially correct 30 ms 5564 KB Partially correct - number of queries: 5075
60 Correct 59 ms 5564 KB Output is correct
61 Correct 15 ms 5564 KB Output is correct
62 Correct 18 ms 5564 KB Output is correct
63 Correct 28 ms 5564 KB Output is correct
64 Correct 13 ms 5564 KB Output is correct
65 Correct 24 ms 5564 KB Output is correct
66 Correct 22 ms 5564 KB Output is correct
67 Correct 23 ms 5564 KB Output is correct
68 Correct 10 ms 5564 KB Output is correct
69 Correct 27 ms 5564 KB Output is correct
70 Correct 20 ms 5564 KB Output is correct
71 Partially correct 96 ms 5564 KB Partially correct - number of queries: 8353
72 Correct 21 ms 5564 KB Output is correct
73 Partially correct 80 ms 5580 KB Partially correct - number of queries: 8304
74 Partially correct 90 ms 5580 KB Partially correct - number of queries: 8325
75 Correct 21 ms 5580 KB Output is correct
76 Partially correct 81 ms 5580 KB Partially correct - number of queries: 7703
77 Partially correct 91 ms 5580 KB Partially correct - number of queries: 8539
78 Correct 28 ms 5580 KB Output is correct
79 Correct 53 ms 5580 KB Output is correct
80 Partially correct 107 ms 5580 KB Partially correct - number of queries: 8517
81 Partially correct 76 ms 5600 KB Partially correct - number of queries: 8488
82 Partially correct 98 ms 5600 KB Partially correct - number of queries: 8448
83 Correct 21 ms 5600 KB Output is correct
84 Partially correct 69 ms 5600 KB Partially correct - number of queries: 7602
85 Partially correct 69 ms 5600 KB Partially correct - number of queries: 8509
86 Correct 25 ms 5600 KB Output is correct
87 Correct 15 ms 5600 KB Output is correct
88 Correct 15 ms 5600 KB Output is correct
89 Correct 16 ms 5600 KB Output is correct
90 Correct 12 ms 5600 KB Output is correct
91 Correct 17 ms 5600 KB Output is correct
92 Correct 19 ms 5600 KB Output is correct
93 Correct 30 ms 5600 KB Output is correct
94 Correct 22 ms 5600 KB Output is correct
95 Correct 12 ms 5600 KB Output is correct
96 Correct 22 ms 5600 KB Output is correct
97 Correct 17 ms 5600 KB Output is correct