Submission #69471

# Submission time Handle Problem Language Result Execution time Memory
69471 2018-08-21T02:13:15 Z Diuven The Big Prize (IOI17_prize) C++14
20 / 100
67 ms 2388 KB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int MX=200010;

bool up[MX];
int L[MX], R[MX], sum, n, ans;

void my_ask(int i){
	static set<int> S;
	if(S.find(i)!=S.end()) return;
	S.insert(i);
	if(S.size()>10000U) exit(1);
	vi now=ask(i);
	L[i]=now[0], R[i]=now[1];
}

void search(int s, int e, int lc, int rc){
	if(s>e) return;

	int m=(s+e)/2;

	for(int i=m; i<=e; i++){
		my_ask(i);
		if(L[i]+R[i]==0){ ans=i; return; }
		if(L[i]+R[i]==sum){
			if(lc<L[i]-(i-m)) search(s,m-1,lc,R[i]+i-m);
			if(rc<R[i]) search(i+1,e,L[i],rc);
			return;
		}
	}
	for(int i=m; i>=s; i--){
		my_ask(i);
		if(L[i]+R[i]==0){ ans=i; return; }
		if(L[i]+R[i]==sum){
			if(lc<L[i]) search(s,i-1,lc,R[i]);
			return;
		}
	}
}

void get(){
	srand(time(NULL));
	for(int i=0; i<20; i++){
		int x=rand()%n; my_ask(x);
		sum=max(sum, L[x]+R[x]);
	}
}

int find_best(int _n){
	n=_n;
	get();
	ans=-1;
	search(0,n-1,0,0);
	assert(ans>=0);
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 5 ms 564 KB Output is correct
3 Correct 4 ms 644 KB Output is correct
4 Correct 3 ms 644 KB Output is correct
5 Correct 3 ms 644 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 776 KB Output is correct
2 Correct 3 ms 776 KB Output is correct
3 Correct 3 ms 776 KB Output is correct
4 Correct 3 ms 776 KB Output is correct
5 Correct 3 ms 776 KB Output is correct
6 Correct 2 ms 776 KB Output is correct
7 Correct 3 ms 776 KB Output is correct
8 Correct 3 ms 776 KB Output is correct
9 Correct 2 ms 776 KB Output is correct
10 Correct 2 ms 776 KB Output is correct
11 Correct 8 ms 1468 KB Output is correct
12 Correct 7 ms 1468 KB Output is correct
13 Correct 8 ms 1468 KB Output is correct
14 Correct 12 ms 1468 KB Output is correct
15 Correct 35 ms 2280 KB Output is correct
16 Correct 43 ms 2280 KB Output is correct
17 Correct 44 ms 2280 KB Output is correct
18 Correct 39 ms 2316 KB Output is correct
19 Correct 40 ms 2316 KB Output is correct
20 Correct 28 ms 2316 KB Output is correct
21 Correct 22 ms 2316 KB Output is correct
22 Correct 33 ms 2316 KB Output is correct
23 Correct 4 ms 2316 KB Output is correct
24 Correct 14 ms 2316 KB Output is correct
25 Correct 41 ms 2316 KB Output is correct
26 Correct 39 ms 2316 KB Output is correct
27 Correct 4 ms 2316 KB Output is correct
28 Correct 37 ms 2316 KB Output is correct
29 Correct 33 ms 2316 KB Output is correct
30 Correct 42 ms 2316 KB Output is correct
31 Correct 42 ms 2316 KB Output is correct
32 Correct 8 ms 2316 KB Output is correct
33 Correct 2 ms 2316 KB Output is correct
34 Correct 29 ms 2316 KB Output is correct
35 Correct 3 ms 2316 KB Output is correct
36 Correct 67 ms 2332 KB Output is correct
37 Correct 8 ms 2332 KB Output is correct
38 Correct 4 ms 2332 KB Output is correct
39 Correct 25 ms 2332 KB Output is correct
40 Correct 21 ms 2332 KB Output is correct
41 Correct 51 ms 2364 KB Output is correct
42 Correct 43 ms 2364 KB Output is correct
43 Correct 44 ms 2364 KB Output is correct
44 Correct 45 ms 2364 KB Output is correct
45 Correct 40 ms 2364 KB Output is correct
46 Correct 41 ms 2364 KB Output is correct
47 Correct 40 ms 2364 KB Output is correct
48 Correct 22 ms 2364 KB Output is correct
49 Correct 42 ms 2364 KB Output is correct
50 Correct 21 ms 2364 KB Output is correct
51 Correct 34 ms 2364 KB Output is correct
52 Correct 40 ms 2364 KB Output is correct
53 Correct 4 ms 2364 KB Output is correct
54 Correct 39 ms 2364 KB Output is correct
55 Correct 38 ms 2364 KB Output is correct
56 Correct 34 ms 2364 KB Output is correct
57 Correct 22 ms 2364 KB Output is correct
58 Correct 43 ms 2364 KB Output is correct
59 Correct 40 ms 2364 KB Output is correct
60 Correct 38 ms 2388 KB Output is correct
61 Correct 4 ms 2388 KB Output is correct
62 Correct 3 ms 2388 KB Output is correct
63 Correct 3 ms 2388 KB Output is correct
64 Correct 3 ms 2388 KB Output is correct
65 Correct 4 ms 2388 KB Output is correct
66 Correct 6 ms 2388 KB Output is correct
67 Correct 4 ms 2388 KB Output is correct
68 Correct 3 ms 2388 KB Output is correct
69 Correct 5 ms 2388 KB Output is correct
70 Correct 3 ms 2388 KB Output is correct
71 Correct 40 ms 2388 KB Output is correct
72 Correct 6 ms 2388 KB Output is correct
73 Correct 29 ms 2388 KB Output is correct
74 Correct 26 ms 2388 KB Output is correct
75 Correct 4 ms 2388 KB Output is correct
76 Correct 36 ms 2388 KB Output is correct
77 Correct 33 ms 2388 KB Output is correct
78 Correct 4 ms 2388 KB Output is correct
79 Correct 23 ms 2388 KB Output is correct
80 Correct 31 ms 2388 KB Output is correct
81 Correct 37 ms 2388 KB Output is correct
82 Correct 44 ms 2388 KB Output is correct
83 Correct 4 ms 2388 KB Output is correct
84 Correct 20 ms 2388 KB Output is correct
85 Correct 44 ms 2388 KB Output is correct
86 Runtime error 54 ms 2388 KB Execution failed because the return code was nonzero
87 Halted 0 ms 0 KB -