Submission #151801

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
151801	2019-09-04T17:55:55 Z	qkxwsm	The Big Prize (IOI17_prize)	C++14	95.29 / 100	74 ms	2196 KB

prize

/*
PROG: template
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
 */
#include <bits/stdc++.h>
#include "prize.h"

using namespace std;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long randomize(long long mod)
{
	return ((1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}

#define MP make_pair
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-20;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 200013

long long normalize(long long x, long long mod = INF)
{
	return (((x % mod) + mod) % mod);
}

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int N, M;
bool vis[MAXN];
pii quer[MAXN];

void get(int idx)
{
	if (vis[idx])
	{
		return;
	}
	vis[idx] = true;
	vector<int> res = ask(idx);
	quer[idx] = MP(res[0], res[1]);
//	cerr << idx << ' ' << quer[idx].fi << ' ' << quer[idx].se << endl;
//	if (quer[idx].fi + quer[idx].se != M)
//	{
//		special[idx] = true;
////		cerr << "special " << idx << endl;
//	}
	return;
}
void solve(int L, int R)
{
	//guarantee that neither L, R are special and both are queried
	if (L > R) return;
	if (quer[L].fi == quer[R].fi) return;
//	cerr << "solve " << L << ' ' << R << endl;
	int mid;
	mid = (L + R)/2;
	for (; mid <= R; mid++)
	{
		get(mid);
		if (quer[mid].fi + quer[mid].se == M)
		{
			break;
		}
	}
	solve(mid, R);
	mid = (L + R)/2;
	for (; mid >= L; mid--)
	{
		get(mid);
		if (quer[mid].fi + quer[mid].se == M)
		{
			break;
		}
	}
	solve(L, mid);
	//at least one special guy in L...lmid - 1
}
int find_best(int n)
{
	//at most 6 distinct prizes
	//711 guys are not 6
	//query 712 times, then you get to know the location of a max
	//1, 2, 5, 26, 677, whatever
	//1, 3, 8, 34, 711, 200000
	N = n;
	if (N == 1) return 0;
	//question is: you want to query at most 5000 times and find the 1
	//find the locations of all the not1's in O(fast)
	//there are 711 flags in an array of 200000, can you find the locations of all of them, given how many are <= x
	for (int i = 0; i < min(356, N); i++)
	{
		get(i);
		ckmax(M, quer[i].fi + quer[i].se);
	}
	for (int i = 0; i < min(356, N); i++)
	{
		get(N - 1 - i);
		ckmax(M, quer[N - 1 - i].fi + quer[N - 1 - i].se);
	}
//	cerr << M << endl;
	int lt = 0, rt = N - 1;
	for (; lt < N; lt++)
	{
		get(lt);
		if (quer[lt].fi + quer[lt].se == M)
		{
			break;
		}
	}
	for (; rt >= 0; rt--)
	{
		get(rt);
		if (quer[rt].fi + quer[rt].se == M)
		{
			break;
		}
	}
//	cerr << lt << ' ' << rt << endl;
	solve(lt, rt);
	for (int i = 0; i < N; i++)
	{
		if (vis[i] && (quer[i].fi + quer[i].se != M))
		{
			get(i);
			if (quer[i].fi + quer[i].se == 0)
			{
				return i;
			}
		}
	}
	assert(false);
	//M is the # of special guys
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	376 KB	Output is correct
2	Correct	11 ms	376 KB	Output is correct
3	Correct	7 ms	376 KB	Output is correct
4	Correct	10 ms	244 KB	Output is correct
5	Correct	11 ms	312 KB	Output is correct
6	Correct	10 ms	376 KB	Output is correct
7	Correct	8 ms	376 KB	Output is correct
8	Correct	10 ms	396 KB	Output is correct
9	Correct	10 ms	248 KB	Output is correct
10	Correct	10 ms	380 KB	Output is correct

Subtask #2

75.29 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	440 KB	Output is correct
2	Correct	11 ms	376 KB	Output is correct
3	Correct	6 ms	408 KB	Output is correct
4	Correct	6 ms	404 KB	Output is correct
5	Correct	7 ms	332 KB	Output is correct
6	Correct	10 ms	424 KB	Output is correct
7	Correct	10 ms	376 KB	Output is correct
8	Correct	9 ms	296 KB	Output is correct
9	Correct	9 ms	248 KB	Output is correct
10	Correct	9 ms	376 KB	Output is correct
11	Correct	15 ms	1144 KB	Output is correct
12	Correct	18 ms	1036 KB	Output is correct
13	Correct	17 ms	992 KB	Output is correct
14	Correct	12 ms	504 KB	Output is correct
15	Partially correct	37 ms	1996 KB	Partially correct - number of queries: 5109
16	Partially correct	36 ms	2064 KB	Partially correct - number of queries: 5363
17	Partially correct	53 ms	1944 KB	Partially correct - number of queries: 5331
18	Partially correct	37 ms	2024 KB	Partially correct - number of queries: 5333
19	Partially correct	59 ms	1980 KB	Partially correct - number of queries: 5052
20	Correct	37 ms	1080 KB	Output is correct
21	Partially correct	52 ms	1996 KB	Partially correct - number of queries: 5323
22	Correct	40 ms	1992 KB	Output is correct
23	Correct	18 ms	572 KB	Output is correct
24	Correct	15 ms	888 KB	Output is correct
25	Correct	39 ms	1964 KB	Output is correct
26	Correct	47 ms	1888 KB	Output is correct
27	Correct	10 ms	564 KB	Output is correct
28	Correct	52 ms	1904 KB	Output is correct
29	Correct	50 ms	1912 KB	Output is correct
30	Partially correct	58 ms	2016 KB	Partially correct - number of queries: 5307
31	Partially correct	31 ms	2056 KB	Partially correct - number of queries: 5301
32	Correct	14 ms	1208 KB	Output is correct
33	Correct	3 ms	376 KB	Output is correct
34	Partially correct	35 ms	2032 KB	Partially correct - number of queries: 5345
35	Correct	10 ms	732 KB	Output is correct
36	Partially correct	57 ms	2040 KB	Partially correct - number of queries: 5275
37	Correct	16 ms	848 KB	Output is correct
38	Correct	11 ms	524 KB	Output is correct
39	Partially correct	65 ms	2076 KB	Partially correct - number of queries: 5278
40	Correct	54 ms	2040 KB	Output is correct
41	Partially correct	59 ms	2196 KB	Partially correct - number of queries: 5322
42	Partially correct	59 ms	1972 KB	Partially correct - number of queries: 5322
43	Partially correct	60 ms	1988 KB	Partially correct - number of queries: 5225
44	Partially correct	31 ms	2024 KB	Partially correct - number of queries: 5346
45	Correct	46 ms	1992 KB	Output is correct
46	Partially correct	65 ms	1960 KB	Partially correct - number of queries: 5329
47	Correct	60 ms	1912 KB	Output is correct
48	Partially correct	53 ms	2044 KB	Partially correct - number of queries: 5319
49	Partially correct	74 ms	2040 KB	Partially correct - number of queries: 5314
50	Partially correct	58 ms	2068 KB	Partially correct - number of queries: 5341
51	Partially correct	59 ms	2040 KB	Partially correct - number of queries: 5333
52	Partially correct	60 ms	2024 KB	Partially correct - number of queries: 5351
53	Correct	11 ms	652 KB	Output is correct
54	Partially correct	37 ms	2056 KB	Partially correct - number of queries: 5316
55	Partially correct	54 ms	2040 KB	Partially correct - number of queries: 5334
56	Partially correct	33 ms	2056 KB	Partially correct - number of queries: 5315
57	Partially correct	42 ms	2052 KB	Partially correct - number of queries: 5314
58	Partially correct	56 ms	1960 KB	Partially correct - number of queries: 5323
59	Partially correct	57 ms	2000 KB	Partially correct - number of queries: 5330
60	Partially correct	52 ms	1980 KB	Partially correct - number of queries: 5274
61	Correct	6 ms	584 KB	Output is correct
62	Correct	11 ms	632 KB	Output is correct
63	Correct	10 ms	568 KB	Output is correct
64	Correct	11 ms	564 KB	Output is correct
65	Correct	11 ms	420 KB	Output is correct
66	Correct	11 ms	248 KB	Output is correct
67	Correct	9 ms	416 KB	Output is correct
68	Correct	10 ms	248 KB	Output is correct
69	Correct	11 ms	376 KB	Output is correct
70	Correct	11 ms	248 KB	Output is correct
71	Partially correct	48 ms	2044 KB	Partially correct - number of queries: 5471
72	Correct	15 ms	1176 KB	Output is correct
73	Partially correct	60 ms	2040 KB	Partially correct - number of queries: 5408
74	Partially correct	32 ms	2172 KB	Partially correct - number of queries: 5435
75	Correct	11 ms	588 KB	Output is correct
76	Correct	35 ms	2072 KB	Output is correct
77	Partially correct	61 ms	1980 KB	Partially correct - number of queries: 5449
78	Correct	17 ms	1076 KB	Output is correct
79	Correct	23 ms	1944 KB	Output is correct
80	Partially correct	59 ms	2040 KB	Partially correct - number of queries: 5439
81	Partially correct	68 ms	1960 KB	Partially correct - number of queries: 5408
82	Partially correct	40 ms	1964 KB	Partially correct - number of queries: 5350
83	Correct	7 ms	580 KB	Output is correct
84	Correct	27 ms	1988 KB	Output is correct
85	Partially correct	59 ms	2132 KB	Partially correct - number of queries: 5451
86	Correct	9 ms	376 KB	Output is correct
87	Correct	9 ms	376 KB	Output is correct
88	Correct	11 ms	320 KB	Output is correct
89	Correct	9 ms	376 KB	Output is correct
90	Correct	10 ms	408 KB	Output is correct
91	Correct	11 ms	376 KB	Output is correct
92	Correct	10 ms	376 KB	Output is correct
93	Correct	12 ms	888 KB	Output is correct
94	Correct	15 ms	888 KB	Output is correct
95	Correct	8 ms	1048 KB	Output is correct
96	Correct	15 ms	764 KB	Output is correct
97	Correct	9 ms	376 KB	Output is correct