Submission #152453

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
152453	2019-09-08T03:45:50 Z	qkxwsm	The Big Prize (IOI17_prize)	C++14	97.6 / 100	66 ms	2092 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(237, N); i++)
	{
		get(i);
		ckmax(M, quer[i].fi + quer[i].se);
	}
	for (int i = 0; i < min(237, 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	7 ms	376 KB	Output is correct
2	Correct	5 ms	392 KB	Output is correct
3	Correct	7 ms	376 KB	Output is correct
4	Correct	7 ms	248 KB	Output is correct
5	Correct	4 ms	328 KB	Output is correct
6	Correct	6 ms	248 KB	Output is correct
7	Correct	5 ms	332 KB	Output is correct
8	Correct	4 ms	328 KB	Output is correct
9	Correct	4 ms	328 KB	Output is correct
10	Correct	7 ms	376 KB	Output is correct

Subtask #2

77.6 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	376 KB	Output is correct
2	Correct	8 ms	312 KB	Output is correct
3	Correct	8 ms	328 KB	Output is correct
4	Correct	6 ms	248 KB	Output is correct
5	Correct	5 ms	408 KB	Output is correct
6	Correct	6 ms	248 KB	Output is correct
7	Correct	8 ms	308 KB	Output is correct
8	Correct	7 ms	312 KB	Output is correct
9	Correct	8 ms	376 KB	Output is correct
10	Correct	7 ms	376 KB	Output is correct
11	Correct	8 ms	1064 KB	Output is correct
12	Correct	14 ms	1076 KB	Output is correct
13	Correct	10 ms	1064 KB	Output is correct
14	Correct	16 ms	504 KB	Output is correct
15	Correct	57 ms	1964 KB	Output is correct
16	Partially correct	30 ms	2004 KB	Partially correct - number of queries: 5125
17	Partially correct	41 ms	1992 KB	Partially correct - number of queries: 5093
18	Partially correct	58 ms	1960 KB	Partially correct - number of queries: 5095
19	Correct	62 ms	1960 KB	Output is correct
20	Correct	36 ms	1144 KB	Output is correct
21	Partially correct	57 ms	1960 KB	Partially correct - number of queries: 5085
22	Correct	41 ms	2040 KB	Output is correct
23	Correct	10 ms	652 KB	Output is correct
24	Correct	12 ms	1016 KB	Output is correct
25	Correct	46 ms	1912 KB	Output is correct
26	Correct	49 ms	1980 KB	Output is correct
27	Correct	7 ms	508 KB	Output is correct
28	Correct	56 ms	1912 KB	Output is correct
29	Correct	30 ms	1832 KB	Output is correct
30	Partially correct	56 ms	1984 KB	Partially correct - number of queries: 5069
31	Partially correct	51 ms	1980 KB	Partially correct - number of queries: 5063
32	Correct	13 ms	1076 KB	Output is correct
33	Correct	3 ms	376 KB	Output is correct
34	Partially correct	41 ms	2000 KB	Partially correct - number of queries: 5107
35	Correct	10 ms	684 KB	Output is correct
36	Partially correct	66 ms	1976 KB	Partially correct - number of queries: 5037
37	Correct	12 ms	1016 KB	Output is correct
38	Correct	7 ms	504 KB	Output is correct
39	Partially correct	49 ms	2040 KB	Partially correct - number of queries: 5040
40	Correct	44 ms	2044 KB	Output is correct
41	Partially correct	62 ms	1996 KB	Partially correct - number of queries: 5084
42	Partially correct	30 ms	2072 KB	Partially correct - number of queries: 5084
43	Correct	51 ms	1976 KB	Output is correct
44	Partially correct	58 ms	2040 KB	Partially correct - number of queries: 5108
45	Correct	48 ms	1948 KB	Output is correct
46	Partially correct	34 ms	2028 KB	Partially correct - number of queries: 5091
47	Correct	28 ms	2060 KB	Output is correct
48	Partially correct	60 ms	2008 KB	Partially correct - number of queries: 5081
49	Partially correct	57 ms	2040 KB	Partially correct - number of queries: 5076
50	Partially correct	48 ms	2040 KB	Partially correct - number of queries: 5103
51	Partially correct	51 ms	2060 KB	Partially correct - number of queries: 5095
52	Partially correct	58 ms	2004 KB	Partially correct - number of queries: 5113
53	Correct	8 ms	564 KB	Output is correct
54	Partially correct	45 ms	2088 KB	Partially correct - number of queries: 5078
55	Partially correct	51 ms	2040 KB	Partially correct - number of queries: 5096
56	Partially correct	30 ms	2092 KB	Partially correct - number of queries: 5077
57	Partially correct	56 ms	2044 KB	Partially correct - number of queries: 5076
58	Partially correct	30 ms	2028 KB	Partially correct - number of queries: 5085
59	Partially correct	58 ms	2000 KB	Partially correct - number of queries: 5092
60	Partially correct	49 ms	2040 KB	Partially correct - number of queries: 5036
61	Correct	9 ms	576 KB	Output is correct
62	Correct	5 ms	580 KB	Output is correct
63	Correct	8 ms	632 KB	Output is correct
64	Correct	9 ms	632 KB	Output is correct
65	Correct	9 ms	248 KB	Output is correct
66	Correct	6 ms	392 KB	Output is correct
67	Correct	10 ms	376 KB	Output is correct
68	Correct	5 ms	388 KB	Output is correct
69	Correct	9 ms	248 KB	Output is correct
70	Correct	9 ms	248 KB	Output is correct
71	Partially correct	54 ms	1960 KB	Partially correct - number of queries: 5233
72	Correct	15 ms	1016 KB	Output is correct
73	Partially correct	56 ms	2028 KB	Partially correct - number of queries: 5170
74	Partially correct	39 ms	1952 KB	Partially correct - number of queries: 5197
75	Correct	10 ms	572 KB	Output is correct
76	Correct	47 ms	2040 KB	Output is correct
77	Partially correct	31 ms	2072 KB	Partially correct - number of queries: 5233
78	Correct	14 ms	1016 KB	Output is correct
79	Correct	29 ms	1956 KB	Output is correct
80	Partially correct	47 ms	2036 KB	Partially correct - number of queries: 5240
81	Partially correct	57 ms	2028 KB	Partially correct - number of queries: 5187
82	Partially correct	51 ms	2060 KB	Partially correct - number of queries: 5125
83	Correct	8 ms	552 KB	Output is correct
84	Correct	44 ms	2056 KB	Output is correct
85	Partially correct	62 ms	2016 KB	Partially correct - number of queries: 5182
86	Correct	6 ms	376 KB	Output is correct
87	Correct	8 ms	324 KB	Output is correct
88	Correct	10 ms	376 KB	Output is correct
89	Correct	7 ms	252 KB	Output is correct
90	Correct	7 ms	376 KB	Output is correct
91	Correct	8 ms	376 KB	Output is correct
92	Correct	8 ms	396 KB	Output is correct
93	Correct	7 ms	772 KB	Output is correct
94	Correct	11 ms	888 KB	Output is correct
95	Correct	10 ms	760 KB	Output is correct
96	Correct	10 ms	760 KB	Output is correct
97	Correct	8 ms	376 KB	Output is correct