Submission #69465

# Submission time Handle Problem Language Result Execution time Memory
69465 2018-08-21T01:41:53 Z Diuven The Big Prize (IOI17_prize) C++14
20 / 100
72 ms 2436 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;

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

int search(int s, int e, int l, int r){
	if(s>e) return 0;

	int m=(s+e)/2, ans=0;

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

void get(){
	for(int i=0; i<min(500, n); i++){
		my_ask(i);
		sum=max(sum, L[i]+R[i]);
	}
}

int find_best(int _n){
	n=_n;
	get();
	return search(0,n-1,0,0);
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 296 KB Output is correct
2 Correct 5 ms 308 KB Output is correct
3 Correct 6 ms 472 KB Output is correct
4 Correct 4 ms 564 KB Output is correct
5 Correct 7 ms 564 KB Output is correct
6 Correct 6 ms 576 KB Output is correct
7 Correct 6 ms 576 KB Output is correct
8 Correct 6 ms 576 KB Output is correct
9 Correct 7 ms 576 KB Output is correct
10 Correct 6 ms 576 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 624 KB Output is correct
2 Correct 5 ms 624 KB Output is correct
3 Correct 6 ms 624 KB Output is correct
4 Correct 6 ms 624 KB Output is correct
5 Correct 6 ms 624 KB Output is correct
6 Correct 6 ms 624 KB Output is correct
7 Correct 7 ms 624 KB Output is correct
8 Correct 6 ms 624 KB Output is correct
9 Correct 7 ms 624 KB Output is correct
10 Correct 7 ms 624 KB Output is correct
11 Correct 13 ms 1468 KB Output is correct
12 Correct 6 ms 1468 KB Output is correct
13 Correct 10 ms 1468 KB Output is correct
14 Correct 13 ms 1468 KB Output is correct
15 Correct 46 ms 2236 KB Output is correct
16 Partially correct 70 ms 2364 KB Partially correct - number of queries: 5138
17 Partially correct 50 ms 2364 KB Partially correct - number of queries: 5108
18 Partially correct 29 ms 2364 KB Partially correct - number of queries: 5109
19 Correct 59 ms 2364 KB Output is correct
20 Correct 41 ms 2364 KB Output is correct
21 Partially correct 36 ms 2364 KB Partially correct - number of queries: 5104
22 Correct 39 ms 2364 KB Output is correct
23 Correct 5 ms 2364 KB Output is correct
24 Correct 16 ms 2364 KB Output is correct
25 Correct 56 ms 2364 KB Output is correct
26 Correct 69 ms 2364 KB Output is correct
27 Correct 9 ms 2364 KB Output is correct
28 Correct 25 ms 2364 KB Output is correct
29 Correct 61 ms 2364 KB Output is correct
30 Partially correct 32 ms 2364 KB Partially correct - number of queries: 5081
31 Partially correct 47 ms 2364 KB Partially correct - number of queries: 5085
32 Correct 14 ms 2364 KB Output is correct
33 Correct 5 ms 2364 KB Output is correct
34 Partially correct 42 ms 2364 KB Partially correct - number of queries: 5124
35 Correct 11 ms 2364 KB Output is correct
36 Partially correct 72 ms 2364 KB Partially correct - number of queries: 5058
37 Correct 14 ms 2364 KB Output is correct
38 Correct 5 ms 2364 KB Output is correct
39 Partially correct 47 ms 2364 KB Partially correct - number of queries: 5051
40 Correct 47 ms 2364 KB Output is correct
41 Partially correct 33 ms 2404 KB Partially correct - number of queries: 5097
42 Partially correct 24 ms 2404 KB Partially correct - number of queries: 5097
43 Partially correct 68 ms 2404 KB Partially correct - number of queries: 5001
44 Partially correct 56 ms 2436 KB Partially correct - number of queries: 5124
45 Correct 42 ms 2436 KB Output is correct
46 Partially correct 43 ms 2436 KB Partially correct - number of queries: 5110
47 Correct 42 ms 2436 KB Output is correct
48 Partially correct 51 ms 2436 KB Partially correct - number of queries: 5093
49 Partially correct 51 ms 2436 KB Partially correct - number of queries: 5087
50 Partially correct 53 ms 2436 KB Partially correct - number of queries: 5118
51 Partially correct 47 ms 2436 KB Partially correct - number of queries: 5107
52 Partially correct 43 ms 2436 KB Partially correct - number of queries: 5128
53 Correct 8 ms 2436 KB Output is correct
54 Partially correct 31 ms 2436 KB Partially correct - number of queries: 5097
55 Partially correct 58 ms 2436 KB Partially correct - number of queries: 5116
56 Partially correct 24 ms 2436 KB Partially correct - number of queries: 5125
57 Partially correct 64 ms 2436 KB Partially correct - number of queries: 5091
58 Partially correct 52 ms 2436 KB Partially correct - number of queries: 5093
59 Partially correct 64 ms 2436 KB Partially correct - number of queries: 5102
60 Partially correct 59 ms 2436 KB Partially correct - number of queries: 5066
61 Correct 12 ms 2436 KB Output is correct
62 Correct 9 ms 2436 KB Output is correct
63 Correct 6 ms 2436 KB Output is correct
64 Correct 8 ms 2436 KB Output is correct
65 Correct 8 ms 2436 KB Output is correct
66 Correct 11 ms 2436 KB Output is correct
67 Incorrect 10 ms 2436 KB answer is not correct
68 Halted 0 ms 0 KB -