Submission #775767

# Submission time Handle Problem Language Result Execution time Memory
775767 2023-07-06T22:06:30 Z APROHACK The Big Prize (IOI17_prize) C++14
20 / 100
51 ms 420 KB
#include "prize.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int sumMax = 0, start = 900;
struct range{
	int ff, ss, izq, der;
};

bool confirm(vector<int>&t){
	return t[0] + t[1] == 0;
}
int suma(vector<int>&t){return t[0] + t[1];}
int find_best(int n) {
	vector<int>t;
	vector<int>answers;
	for(int i = 0 ; i < start ; i ++){
		t = ask(i);
		answers.pb(suma(t));
		sumMax = max(sumMax, suma(t));
		if(confirm(t))return i;
	}
	int tempp = 0;
	for(auto i : answers){
		if(i < sumMax){
			tempp++;
		}
	}
	queue<range>cola;
	cola.push({start, n-1, tempp, 0});
	while(!cola.empty()){
		range cur = cola.front();
		cola.pop();
		if(cur.ff > cur.ss)continue;
		if(cur.ff == cur.ss){
			t = ask(cur.ff);
			if(confirm(t))return cur.ff;
		}
		int midd = (cur.ff + cur.ss)/2, toL, k, cuenta = 0;
		t = ask(midd);
		k = midd;
		toL = midd-1;
		bool thereIsR = true;
		while(suma(t) != sumMax){
			if(confirm(t))return k;
			k++;
			cuenta ++ ;
			if(k > cur.ss){
				thereIsR = false;
				break;
			}
			t = ask(k);
		}
		if(confirm(t))return k;
		if(t[1] - cur.der > 0 and thereIsR and k+1 <= cur.ss){
			cola.push({k+1, cur.ss, t[0], cur.der});
		}
		if(thereIsR and t[0]-cuenta- cur.izq > 0 and toL >= cur.ff)cola.push({cur.ff, toL, cur.izq, t[1] + cuenta});
		else if(t[0]-cuenta- cur.izq > 0 and toL >= cur.ff){
			cola.push({cur.ff, toL, cur.izq, cur.der + cuenta});
		}
		
		//if(t[0] > 0 and toL >= cur.ff)cola.push({cur.ff, toL});
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 8 ms 208 KB Output is correct
2 Correct 3 ms 304 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 4 ms 308 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 9 ms 276 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 3 ms 304 KB Output is correct
10 Correct 9 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 208 KB Output is correct
2 Correct 4 ms 304 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 6 ms 316 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 8 ms 288 KB Output is correct
8 Correct 9 ms 284 KB Output is correct
9 Correct 3 ms 300 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 5 ms 300 KB Output is correct
12 Correct 5 ms 300 KB Output is correct
13 Correct 11 ms 292 KB Output is correct
14 Correct 15 ms 208 KB Output is correct
15 Partially correct 18 ms 292 KB Partially correct - number of queries: 5210
16 Correct 36 ms 208 KB Output is correct
17 Correct 2 ms 304 KB Output is correct
18 Correct 16 ms 296 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 22 ms 292 KB Output is correct
21 Correct 17 ms 312 KB Output is correct
22 Correct 28 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 5 ms 304 KB Output is correct
25 Correct 23 ms 208 KB Output is correct
26 Correct 40 ms 208 KB Output is correct
27 Correct 4 ms 304 KB Output is correct
28 Correct 20 ms 288 KB Output is correct
29 Correct 33 ms 300 KB Output is correct
30 Correct 37 ms 288 KB Output is correct
31 Correct 2 ms 344 KB Output is correct
32 Correct 10 ms 296 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Partially correct 51 ms 292 KB Partially correct - number of queries: 5381
35 Correct 5 ms 208 KB Output is correct
36 Partially correct 42 ms 292 KB Partially correct - number of queries: 5365
37 Correct 10 ms 284 KB Output is correct
38 Correct 9 ms 288 KB Output is correct
39 Correct 41 ms 304 KB Output is correct
40 Correct 30 ms 288 KB Output is correct
41 Partially correct 17 ms 352 KB Partially correct - number of queries: 5326
42 Partially correct 47 ms 304 KB Partially correct - number of queries: 5326
43 Partially correct 18 ms 308 KB Partially correct - number of queries: 5176
44 Correct 44 ms 308 KB Output is correct
45 Partially correct 20 ms 304 KB Partially correct - number of queries: 5016
46 Correct 3 ms 208 KB Output is correct
47 Correct 32 ms 288 KB Output is correct
48 Correct 35 ms 288 KB Output is correct
49 Partially correct 28 ms 288 KB Partially correct - number of queries: 5133
50 Partially correct 40 ms 284 KB Partially correct - number of queries: 5168
51 Partially correct 46 ms 292 KB Partially correct - number of queries: 5378
52 Partially correct 29 ms 292 KB Partially correct - number of queries: 5470
53 Correct 4 ms 304 KB Output is correct
54 Correct 36 ms 292 KB Output is correct
55 Correct 3 ms 420 KB Output is correct
56 Partially correct 36 ms 292 KB Partially correct - number of queries: 5210
57 Correct 40 ms 300 KB Output is correct
58 Partially correct 18 ms 336 KB Partially correct - number of queries: 5246
59 Partially correct 26 ms 284 KB Partially correct - number of queries: 5322
60 Correct 19 ms 300 KB Output is correct
61 Correct 8 ms 260 KB Output is correct
62 Correct 8 ms 288 KB Output is correct
63 Correct 4 ms 308 KB Output is correct
64 Correct 5 ms 268 KB Output is correct
65 Correct 7 ms 208 KB Output is correct
66 Correct 11 ms 268 KB Output is correct
67 Incorrect 10 ms 288 KB answer is not correct
68 Halted 0 ms 0 KB -