oj.uz

Submission #779365

# Submission time Handle Problem Language Result Execution time Memory
779365 2023-07-11T11:13:01 Z CSQ31 The Big Prize (IOI17_prize) C++17
20 / 100
 88 ms 10532 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int num = 0;
#define sz(a) (int)(a.size());
vector<int>res[200000];
int cnt = 0;
vector<int> askk(int v){
	cnt++;
	assert(cnt<=9999);
	return ask(v);
}
int solve(int l,int r,int lf = 0,int rg = 0){
	cerr<<l<<" "<<r<<'\n';
	if(l > r)return -1;
	int mid = (l+r)/2;
	int il = mid;
	int ir = mid;
	int cur = mid;
	for(int i=0;i<=r-l+1;i++){
		if(cur < l || cur > r)break;
		res[cur] = askk(cur);
		if(!res[cur][0] && !res[cur][1])return cur;
		else if(res[cur][0]+res[cur][1] == num)break;
		if(i%2 == 0){
			ir++;
			cur = ir;
		}else{
			il--;
			cur = il;
		}
	}
	cerr<<cur<<'\n';
	if(cur < l || cur > r)return -1;
	if(il-1 >= l && res[il][0]-lf > 0){
	    int c = solve(l,il-1,lf,res[il][1]);
	    if(c!=-1)return c;
	}
	if(ir+1<=r && res[ir][1] - rg > 0){
		int c = solve(ir+1,r,res[ir][0],rg);
		if(c!=-1)return c;
	}
	return -1;
		
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int find_best(int n) {
	if(n<=5000){
		for(int i=0;i<n;i++){
			vector<int>res = ask(i);
			if(res[0] == 0 && res[1] == 0)return i;
		}
		
	}
	int p = 0;
	for(int i=0;i<min(n,(int)(sqrt(n)+30)) && num < 22;i++){
		vector<int>res = ask(i);
		if(!res[0] && !res[1])return i;
		if(res[0]  + res[1] > num){
			num = res[0] + res[1];
			p = i;
		}
	}
	//d&c to try all small guys since < #small guys < sqrt(n)
	return solve(p,n-1,p,0);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4988 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4980 KB Output is correct
4 Correct 7 ms 4980 KB Output is correct
5 Correct 6 ms 4976 KB Output is correct
6 Correct 3 ms 4996 KB Output is correct
7 Correct 8 ms 4996 KB Output is correct
8 Correct 9 ms 4980 KB Output is correct
9 Correct 8 ms 4992 KB Output is correct
10 Correct 6 ms 5004 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4944 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4996 KB Output is correct
4 Correct 10 ms 4988 KB Output is correct
5 Correct 9 ms 4996 KB Output is correct
6 Correct 3 ms 4944 KB Output is correct
7 Correct 9 ms 5000 KB Output is correct
8 Correct 7 ms 4944 KB Output is correct
9 Correct 5 ms 4992 KB Output is correct
10 Correct 8 ms 5000 KB Output is correct
11 Correct 7 ms 5000 KB Output is correct
12 Correct 3 ms 4996 KB Output is correct
13 Correct 7 ms 4944 KB Output is correct
14 Correct 5 ms 4944 KB Output is correct
15 Correct 14 ms 5012 KB Output is correct
16 Correct 73 ms 5116 KB Output is correct
17 Correct 4 ms 4996 KB Output is correct
18 Correct 69 ms 5160 KB Output is correct
19 Correct 3 ms 5000 KB Output is correct
20 Correct 18 ms 5020 KB Output is correct
21 Correct 27 ms 5012 KB Output is correct
22 Correct 6 ms 4996 KB Output is correct
23 Correct 6 ms 4944 KB Output is correct
24 Correct 4 ms 4944 KB Output is correct
25 Correct 40 ms 5012 KB Output is correct
26 Correct 34 ms 5064 KB Output is correct
27 Correct 7 ms 4996 KB Output is correct
28 Correct 58 ms 5092 KB Output is correct
29 Correct 40 ms 5072 KB Output is correct
30 Correct 70 ms 5108 KB Output is correct
31 Correct 3 ms 4992 KB Output is correct
32 Correct 7 ms 4984 KB Output is correct
33 Correct 2 ms 4944 KB Output is correct
34 Correct 20 ms 4988 KB Output is correct
35 Correct 9 ms 4996 KB Output is correct
36 Correct 21 ms 5020 KB Output is correct
37 Correct 4 ms 4996 KB Output is correct
38 Correct 5 ms 5000 KB Output is correct
39 Correct 38 ms 5072 KB Output is correct
40 Correct 73 ms 5128 KB Output is correct
41 Correct 41 ms 5024 KB Output is correct
42 Correct 40 ms 5068 KB Output is correct
43 Correct 45 ms 5048 KB Output is correct
44 Correct 29 ms 5016 KB Output is correct
45 Correct 17 ms 5052 KB Output is correct
46 Correct 3 ms 4992 KB Output is correct
47 Correct 30 ms 5020 KB Output is correct
48 Correct 51 ms 5144 KB Output is correct
49 Correct 7 ms 5000 KB Output is correct
50 Correct 72 ms 5116 KB Output is correct
51 Correct 28 ms 5040 KB Output is correct
52 Correct 5 ms 4996 KB Output is correct
53 Correct 10 ms 5004 KB Output is correct
54 Correct 36 ms 5032 KB Output is correct
55 Correct 3 ms 4944 KB Output is correct
56 Correct 59 ms 5200 KB Output is correct
57 Correct 48 ms 5084 KB Output is correct
58 Correct 52 ms 5100 KB Output is correct
59 Correct 38 ms 5064 KB Output is correct
60 Correct 34 ms 5012 KB Output is correct
61 Correct 8 ms 4992 KB Output is correct
62 Correct 8 ms 4976 KB Output is correct
63 Correct 9 ms 4992 KB Output is correct
64 Correct 7 ms 4988 KB Output is correct
65 Correct 3 ms 4992 KB Output is correct
66 Correct 6 ms 5000 KB Output is correct
67 Correct 4 ms 4992 KB Output is correct
68 Correct 6 ms 4988 KB Output is correct
69 Correct 6 ms 5016 KB Output is correct
70 Correct 4 ms 4992 KB Output is correct
71 Correct 77 ms 5192 KB Output is correct
72 Correct 11 ms 5008 KB Output is correct
73 Correct 69 ms 5184 KB Output is correct
74 Correct 61 ms 5156 KB Output is correct
75 Correct 8 ms 5000 KB Output is correct
76 Correct 80 ms 5076 KB Output is correct
77 Correct 57 ms 5160 KB Output is correct
78 Correct 10 ms 5012 KB Output is correct
79 Correct 40 ms 5012 KB Output is correct
80 Correct 70 ms 5208 KB Output is correct
81 Correct 83 ms 5152 KB Output is correct
82 Correct 65 ms 5184 KB Output is correct
83 Correct 12 ms 4944 KB Output is correct
84 Correct 62 ms 5068 KB Output is correct
85 Correct 61 ms 5180 KB Output is correct
86 Runtime error 88 ms 10532 KB Execution killed with signal 6
87 Halted 0 ms 0 KB -