oj.uz

Submission #152451

# Submission time Handle Problem Language Result Execution time Memory
152451 2019-09-08T03:43:35 Z qkxwsm The Big Prize (IOI17_prize) C++14
20 / 100
 267 ms 11400 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 <= 470; 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 lo = 0, hi = (SZ(cand)) - 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.
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 11256 KB Output is correct
2 Correct 143 ms 11288 KB Output is correct
3 Correct 145 ms 11212 KB Output is correct
4 Correct 145 ms 11324 KB Output is correct
5 Correct 143 ms 11188 KB Output is correct
6 Correct 3 ms 1784 KB Output is correct
7 Correct 140 ms 11288 KB Output is correct
8 Correct 146 ms 11176 KB Output is correct
9 Correct 142 ms 11240 KB Output is correct
10 Correct 148 ms 11256 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 11176 KB Output is correct
2 Correct 146 ms 11252 KB Output is correct
3 Correct 149 ms 11244 KB Output is correct
4 Correct 140 ms 11220 KB Output is correct
5 Correct 144 ms 11196 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 144 ms 11256 KB Output is correct
8 Correct 144 ms 11256 KB Output is correct
9 Correct 141 ms 11352 KB Output is correct
10 Correct 149 ms 11252 KB Output is correct
11 Correct 162 ms 11156 KB Output is correct
12 Correct 142 ms 11288 KB Output is correct
13 Correct 178 ms 11196 KB Output is correct
14 Correct 20 ms 1532 KB Output is correct
15 Correct 162 ms 11176 KB Output is correct
16 Partially correct 246 ms 11272 KB Partially correct - number of queries: 7209
17 Correct 8 ms 1784 KB Output is correct
18 Partially correct 256 ms 11344 KB Partially correct - number of queries: 8349
19 Correct 10 ms 1784 KB Output is correct
20 Correct 93 ms 5776 KB Output is correct
21 Correct 187 ms 11256 KB Output is correct
22 Correct 155 ms 11256 KB Output is correct
23 Correct 144 ms 11304 KB Output is correct
24 Correct 142 ms 11220 KB Output is correct
25 Correct 208 ms 11196 KB Output is correct
26 Correct 197 ms 11148 KB Output is correct
27 Correct 154 ms 11296 KB Output is correct
28 Partially correct 242 ms 11264 KB Partially correct - number of queries: 7887
29 Partially correct 228 ms 11256 KB Partially correct - number of queries: 6096
30 Partially correct 234 ms 11340 KB Partially correct - number of queries: 8306
31 Correct 5 ms 1848 KB Output is correct
32 Correct 167 ms 11256 KB Output is correct
33 Correct 2 ms 248 KB Output is correct
34 Correct 181 ms 11208 KB Output is correct
35 Correct 161 ms 11336 KB Output is correct
36 Correct 182 ms 11160 KB Output is correct
37 Correct 148 ms 11324 KB Output is correct
38 Correct 144 ms 11304 KB Output is correct
39 Correct 201 ms 11260 KB Output is correct
40 Partially correct 230 ms 11256 KB Partially correct - number of queries: 7199
41 Partially correct 206 ms 11192 KB Partially correct - number of queries: 5190
42 Partially correct 188 ms 11200 KB Partially correct - number of queries: 5190
43 Correct 205 ms 11236 KB Output is correct
44 Correct 178 ms 11256 KB Output is correct
45 Correct 178 ms 11332 KB Output is correct
46 Correct 8 ms 1788 KB Output is correct
47 Correct 195 ms 11220 KB Output is correct
48 Partially correct 231 ms 11304 KB Partially correct - number of queries: 6313
49 Correct 154 ms 11256 KB Output is correct
50 Partially correct 244 ms 11148 KB Partially correct - number of queries: 8352
51 Correct 197 ms 11256 KB Output is correct
52 Correct 145 ms 11228 KB Output is correct
53 Correct 168 ms 11252 KB Output is correct
54 Correct 197 ms 11188 KB Output is correct
55 Correct 9 ms 1784 KB Output is correct
56 Partially correct 254 ms 11280 KB Partially correct - number of queries: 8352
57 Partially correct 219 ms 11400 KB Partially correct - number of queries: 6228
58 Partially correct 223 ms 11200 KB Partially correct - number of queries: 6301
59 Partially correct 211 ms 11256 KB Partially correct - number of queries: 5186
60 Correct 203 ms 11244 KB Output is correct
61 Correct 169 ms 11176 KB Output is correct
62 Correct 146 ms 11168 KB Output is correct
63 Correct 168 ms 11360 KB Output is correct
64 Correct 149 ms 11264 KB Output is correct
65 Correct 166 ms 11204 KB Output is correct
66 Correct 175 ms 11236 KB Output is correct
67 Correct 144 ms 11256 KB Output is correct
68 Correct 11 ms 1848 KB Output is correct
69 Correct 177 ms 11256 KB Output is correct
70 Correct 142 ms 11264 KB Output is correct
71 Partially correct 249 ms 11156 KB Partially correct - number of queries: 8210
72 Correct 171 ms 11256 KB Output is correct
73 Partially correct 257 ms 11268 KB Partially correct - number of queries: 8136
74 Partially correct 258 ms 11280 KB Partially correct - number of queries: 8165
75 Correct 172 ms 11256 KB Output is correct
76 Partially correct 251 ms 11288 KB Partially correct - number of queries: 7090
77 Partially correct 259 ms 11256 KB Partially correct - number of queries: 8393
78 Correct 174 ms 11212 KB Output is correct
79 Correct 208 ms 11304 KB Output is correct
80 Partially correct 253 ms 11288 KB Partially correct - number of queries: 8368
81 Partially correct 267 ms 11268 KB Partially correct - number of queries: 8383
82 Partially correct 254 ms 11256 KB Partially correct - number of queries: 8326
83 Correct 172 ms 11256 KB Output is correct
84 Partially correct 218 ms 11320 KB Partially correct - number of queries: 6940
85 Partially correct 255 ms 11224 KB Partially correct - number of queries: 8364
86 Incorrect 248 ms 11248 KB Incorrect
87 Halted 0 ms 0 KB -