Submission #1045212

# Submission time Handle Problem Language Result Execution time Memory
1045212 2024-08-05T19:03:56 Z beaconmc The Big Prize (IOI17_prize) C++14
90 / 100
61 ms 2160 KB
#include "prize.h"

#include <bits/stdc++.h>
 
typedef int ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;


map<ll, vector<ll>> cache;

vector<ll> query(int n){

	if (cache.count(n)) return cache[n];
	else return cache[n] = ask(n);
}


int find_best(int n) {
	cache.clear();
	vector<ll> stuff(n);

	FOR(i,0,n) stuff[i] = i;
	ll maxi = -1;
	FOR(i,0,min(500, n)){
		vector<ll> sus = query(i);
		maxi = max(maxi, sus[0]+sus[1]);
	}
	

	vector<ll> found;

	ll ans = -1;


	while (ans == -1){


		ll lo = 0;
		ll hi = stuff.size()-1;
		bool skip = false;

		while (lo < hi){




			ll mid = (lo+hi)/2;


			vector<ll> sus = query(stuff[mid]);


			if (sus[0] + sus[1] < maxi){
					
				if (sus[0]+sus[1]==0) return stuff[mid];
				found.push_back(stuff[mid]);
				stuff.erase(stuff.begin()+mid);
				skip = true;
				break;
			}else{
				sort(found.begin(), found.end());
				ll idk = upper_bound(found.begin(), found.end(), stuff[mid]) - found.begin();

				if (idk < sus[0]){
					hi = mid;
				}else{
					lo = mid+1;
				}
			}
		}

		if (skip) continue;

		vector<ll> sus = query(stuff[lo]);
		if (sus[0]+sus[1] == maxi) break;
		if (sus[0]+sus[1]==0) return stuff[lo];
		found.push_back(stuff[lo]);
		stuff.erase(stuff.begin()+lo);

	}

	return 0;

}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 3 ms 1112 KB Output is correct
3 Correct 2 ms 1112 KB Output is correct
4 Correct 3 ms 1112 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 3 ms 1112 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 1112 KB Output is correct
10 Correct 3 ms 1368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 2 ms 1112 KB Output is correct
3 Correct 3 ms 1244 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 3 ms 1112 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 2 ms 1112 KB Output is correct
10 Correct 3 ms 1112 KB Output is correct
11 Correct 3 ms 1112 KB Output is correct
12 Correct 3 ms 1252 KB Output is correct
13 Correct 5 ms 1112 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 7 ms 1540 KB Output is correct
16 Partially correct 43 ms 1684 KB Partially correct - number of queries: 5022
17 Correct 2 ms 1368 KB Output is correct
18 Partially correct 34 ms 1848 KB Partially correct - number of queries: 6007
19 Correct 3 ms 1112 KB Output is correct
20 Correct 8 ms 964 KB Output is correct
21 Correct 12 ms 1828 KB Output is correct
22 Correct 5 ms 1112 KB Output is correct
23 Correct 3 ms 1260 KB Output is correct
24 Correct 3 ms 1112 KB Output is correct
25 Correct 23 ms 1380 KB Output is correct
26 Correct 23 ms 2160 KB Output is correct
27 Correct 4 ms 1112 KB Output is correct
28 Partially correct 44 ms 1796 KB Partially correct - number of queries: 5524
29 Correct 24 ms 1812 KB Output is correct
30 Partially correct 39 ms 1640 KB Partially correct - number of queries: 5923
31 Correct 2 ms 1112 KB Output is correct
32 Correct 4 ms 1112 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 12 ms 1368 KB Output is correct
35 Correct 3 ms 1112 KB Output is correct
36 Correct 10 ms 1368 KB Output is correct
37 Correct 3 ms 1112 KB Output is correct
38 Correct 3 ms 1112 KB Output is correct
39 Correct 19 ms 1624 KB Output is correct
40 Partially correct 31 ms 1912 KB Partially correct - number of queries: 5163
41 Correct 22 ms 1556 KB Output is correct
42 Correct 23 ms 1800 KB Output is correct
43 Correct 21 ms 1624 KB Output is correct
44 Correct 17 ms 1368 KB Output is correct
45 Correct 12 ms 1444 KB Output is correct
46 Correct 4 ms 1112 KB Output is correct
47 Correct 19 ms 1524 KB Output is correct
48 Correct 31 ms 1900 KB Output is correct
49 Correct 7 ms 1332 KB Output is correct
50 Partially correct 41 ms 1948 KB Partially correct - number of queries: 5979
51 Correct 13 ms 1368 KB Output is correct
52 Correct 3 ms 1112 KB Output is correct
53 Correct 4 ms 1264 KB Output is correct
54 Correct 15 ms 1516 KB Output is correct
55 Correct 3 ms 1112 KB Output is correct
56 Partially correct 44 ms 1856 KB Partially correct - number of queries: 5984
57 Correct 29 ms 1616 KB Output is correct
58 Correct 39 ms 1616 KB Output is correct
59 Correct 19 ms 1616 KB Output is correct
60 Correct 20 ms 1704 KB Output is correct
61 Correct 3 ms 1112 KB Output is correct
62 Correct 3 ms 1112 KB Output is correct
63 Correct 4 ms 1284 KB Output is correct
64 Correct 3 ms 1112 KB Output is correct
65 Correct 4 ms 1112 KB Output is correct
66 Correct 24 ms 1596 KB Output is correct
67 Correct 7 ms 1112 KB Output is correct
68 Correct 5 ms 1112 KB Output is correct
69 Correct 28 ms 1804 KB Output is correct
70 Correct 6 ms 1340 KB Output is correct
71 Partially correct 61 ms 1868 KB Partially correct - number of queries: 6654
72 Correct 4 ms 1112 KB Output is correct
73 Partially correct 52 ms 1984 KB Partially correct - number of queries: 6565
74 Partially correct 45 ms 1940 KB Partially correct - number of queries: 6610
75 Correct 3 ms 1112 KB Output is correct
76 Partially correct 34 ms 1888 KB Partially correct - number of queries: 5769
77 Partially correct 34 ms 1816 KB Partially correct - number of queries: 6054
78 Correct 3 ms 1260 KB Output is correct
79 Correct 21 ms 1620 KB Output is correct
80 Partially correct 56 ms 2068 KB Partially correct - number of queries: 6129
81 Partially correct 34 ms 1872 KB Partially correct - number of queries: 6096
82 Partially correct 42 ms 1948 KB Partially correct - number of queries: 6023
83 Correct 3 ms 1112 KB Output is correct
84 Partially correct 33 ms 1616 KB Partially correct - number of queries: 5108
85 Partially correct 42 ms 1940 KB Partially correct - number of queries: 6083
86 Correct 32 ms 1616 KB Output is correct
87 Correct 6 ms 1368 KB Output is correct
88 Correct 36 ms 1596 KB Output is correct
89 Correct 32 ms 1552 KB Output is correct
90 Correct 3 ms 1112 KB Output is correct
91 Correct 15 ms 1336 KB Output is correct
92 Correct 39 ms 1612 KB Output is correct
93 Correct 37 ms 1744 KB Output is correct
94 Correct 31 ms 1648 KB Output is correct
95 Correct 35 ms 1692 KB Output is correct
96 Correct 42 ms 1852 KB Output is correct
97 Correct 31 ms 1624 KB Output is correct