Submission #152449

# Submission time Handle Problem Language Result Execution time Memory
152449 2019-09-08T03:40:11 Z qkxwsm The Big Prize (IOI17_prize) C++14
20 / 100
274 ms 11496 KB
#include "prize.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}
template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) ((x).size()))
#define ALL(x) (x).begin(), (x).end()
#define MAXN 200013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N;
pii dp[MAXN];
ordered_set<int> cand;
int ans = -1, rec = 0;

pii query(int idx)
{
	if (dp[idx] != MP(-1, -1)) return dp[idx];
	vi tmp = ask(idx);
	dp[idx] = {tmp[0], tmp[1]};
	if (dp[idx] == MP(0, 0)) ans = idx;
	return dp[idx];
}

int find_best(int n)
{
	// return 0;
	N = n;
	if (N == 1) return 0;
	FOR(i, 0, N) dp[i] = {-1, -1};
	int pos = -1;
	for (int i = 0; i < N && i <= 455; i++)
	{
		pii p = query(i); if (ans != -1) return ans;
		if (pos == -1 || p.fi + p.se > dp[pos].fi + dp[pos].se) pos = i;
	}
	rec = dp[pos].fi + dp[pos].se;
	FOR(i, pos, N) cand.insert(i);
	//find the last guy that still matches it.
	// for (int x : cand)
	// {
	// 	cerr << x << ' ';
	// }
	// cerr << endl;
	while(true)
	{
		pii p = query(pos);
		//find the last guy that's == pos
		int i = 0;
		for (;; i++)
		{
			if ((1 << i) >= SZ(cand)) break;
			int cur = *cand.find_by_order((1 << i));
			pii q = query(cur); if (ans != -1) return ans;
			// cerr << cur << ' ' << q.fi << ' ' << q.se << endl;
			if (p != q) break;
			//find the block that's >= pos
		}
		int lo = 0, hi = min(SZ(cand), (1 << i)) - 1;
		// cerr << lo << ' ' << hi << endl;
		while(hi > lo)
		{
			int mid = (hi + lo + 1) >> 1;
			int cur = *cand.find_by_order(mid);
			pii q = query(cur); if (ans != -1) return ans;
			if (p != q) hi = mid - 1;
			else lo = mid;
		}
		pos = *cand.find_by_order(lo) + 1;
		FOR(i, 0, lo + 1)
		{
			// cerr << "ERASE " << *cand.begin() << endl;
			cand.erase(cand.begin());
		}
		while(true)
		{
			pii p = query(pos); if (ans != -1) return ans;
			if (p.fi + p.se == rec) break;
			cand.erase(cand.begin()); pos++;
		}
	}
	//pos is an example of the least worth guy.
	//so each time you just want to find an example of any guy worth more than it.
}
# Verdict Execution time Memory Grader output
1 Correct 147 ms 11256 KB Output is correct
2 Correct 151 ms 11184 KB Output is correct
3 Correct 145 ms 11292 KB Output is correct
4 Correct 144 ms 11320 KB Output is correct
5 Correct 144 ms 11232 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 147 ms 11308 KB Output is correct
8 Correct 145 ms 11176 KB Output is correct
9 Correct 144 ms 11276 KB Output is correct
10 Correct 147 ms 11252 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 146 ms 11204 KB Output is correct
2 Correct 151 ms 11200 KB Output is correct
3 Correct 149 ms 11176 KB Output is correct
4 Correct 145 ms 11172 KB Output is correct
5 Correct 155 ms 11248 KB Output is correct
6 Correct 4 ms 1848 KB Output is correct
7 Correct 150 ms 11348 KB Output is correct
8 Correct 152 ms 11248 KB Output is correct
9 Correct 153 ms 11192 KB Output is correct
10 Correct 155 ms 11216 KB Output is correct
11 Correct 168 ms 11264 KB Output is correct
12 Correct 143 ms 11224 KB Output is correct
13 Correct 183 ms 11244 KB Output is correct
14 Correct 20 ms 1400 KB Output is correct
15 Correct 165 ms 11344 KB Output is correct
16 Partially correct 240 ms 11220 KB Partially correct - number of queries: 7232
17 Correct 6 ms 1784 KB Output is correct
18 Partially correct 271 ms 11172 KB Partially correct - number of queries: 8644
19 Correct 10 ms 1916 KB Output is correct
20 Correct 95 ms 5672 KB Output is correct
21 Correct 194 ms 11256 KB Output is correct
22 Correct 154 ms 11436 KB Output is correct
23 Correct 145 ms 11240 KB Output is correct
24 Correct 146 ms 11312 KB Output is correct
25 Correct 191 ms 11176 KB Output is correct
26 Correct 199 ms 11192 KB Output is correct
27 Correct 156 ms 11300 KB Output is correct
28 Partially correct 226 ms 11324 KB Partially correct - number of queries: 7743
29 Partially correct 219 ms 11204 KB Partially correct - number of queries: 6130
30 Partially correct 237 ms 11172 KB Partially correct - number of queries: 8497
31 Correct 9 ms 1848 KB Output is correct
32 Correct 174 ms 11180 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 180 ms 11236 KB Output is correct
35 Correct 166 ms 11256 KB Output is correct
36 Correct 165 ms 11384 KB Output is correct
37 Correct 151 ms 11276 KB Output is correct
38 Correct 146 ms 11496 KB Output is correct
39 Correct 193 ms 11260 KB Output is correct
40 Partially correct 249 ms 11256 KB Partially correct - number of queries: 7400
41 Partially correct 211 ms 11224 KB Partially correct - number of queries: 5274
42 Partially correct 209 ms 11212 KB Partially correct - number of queries: 5274
43 Partially correct 217 ms 11240 KB Partially correct - number of queries: 5028
44 Correct 174 ms 11228 KB Output is correct
45 Correct 177 ms 11172 KB Output is correct
46 Correct 6 ms 1784 KB Output is correct
47 Correct 183 ms 11212 KB Output is correct
48 Partially correct 226 ms 11384 KB Partially correct - number of queries: 6271
49 Correct 156 ms 11168 KB Output is correct
50 Partially correct 250 ms 11248 KB Partially correct - number of queries: 8664
51 Correct 194 ms 11208 KB Output is correct
52 Correct 146 ms 11248 KB Output is correct
53 Correct 171 ms 11176 KB Output is correct
54 Correct 193 ms 11236 KB Output is correct
55 Correct 8 ms 1784 KB Output is correct
56 Partially correct 255 ms 11304 KB Partially correct - number of queries: 8650
57 Partially correct 234 ms 11176 KB Partially correct - number of queries: 6257
58 Partially correct 229 ms 11484 KB Partially correct - number of queries: 6382
59 Partially correct 232 ms 11256 KB Partially correct - number of queries: 5274
60 Correct 205 ms 11256 KB Output is correct
61 Correct 170 ms 11224 KB Output is correct
62 Correct 147 ms 11164 KB Output is correct
63 Correct 169 ms 11192 KB Output is correct
64 Correct 164 ms 11392 KB Output is correct
65 Correct 172 ms 11220 KB Output is correct
66 Correct 176 ms 11384 KB Output is correct
67 Correct 146 ms 11384 KB Output is correct
68 Correct 5 ms 1920 KB Output is correct
69 Correct 180 ms 11256 KB Output is correct
70 Correct 148 ms 11172 KB Output is correct
71 Partially correct 257 ms 11336 KB Partially correct - number of queries: 8610
72 Correct 181 ms 11176 KB Output is correct
73 Partially correct 227 ms 11188 KB Partially correct - number of queries: 8514
74 Partially correct 239 ms 11304 KB Partially correct - number of queries: 8556
75 Correct 181 ms 11260 KB Output is correct
76 Partially correct 250 ms 11200 KB Partially correct - number of queries: 7607
77 Partially correct 264 ms 11176 KB Partially correct - number of queries: 8694
78 Correct 178 ms 11180 KB Output is correct
79 Correct 213 ms 11256 KB Output is correct
80 Partially correct 274 ms 11256 KB Partially correct - number of queries: 8633
81 Partially correct 273 ms 11156 KB Partially correct - number of queries: 8644
82 Partially correct 252 ms 11268 KB Partially correct - number of queries: 8574
83 Correct 170 ms 11336 KB Output is correct
84 Partially correct 229 ms 11256 KB Partially correct - number of queries: 7408
85 Partially correct 265 ms 11272 KB Partially correct - number of queries: 8645
86 Incorrect 224 ms 11288 KB Incorrect
87 Halted 0 ms 0 KB -