답안 #152456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152456 2019-09-08T03:54:20 Z qkxwsm 커다란 상품 (IOI17_prize) C++14
97.67 / 100
69 ms 2260 KB
/*
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];
int ans = -1;

void get(int idx)
{
	if (vis[idx])
	{
		return;
	}
	vis[idx] = true;
	vector<int> res = ask(idx);
	quer[idx] = MP(res[0], res[1]);
	if (quer[idx] == MP(0, 0)) ans = idx;
//	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 (ans != -1) return;
	if (quer[L].fi == quer[R].fi) return;
//	cerr << "solve " << L << ' ' << R << endl;
	int mid1, mid2;
	if (rand() % 2)
	{
		mid1 = (L + R)/2;
		for (; mid1 <= R; mid1++)
		{
			get(mid1); if (ans != -1) return;
			if (quer[mid1].fi + quer[mid1].se == M)
			{
				break;
			}
		}
		mid2 = (L + R)/2;
		for (; mid2 >= L; mid2--)
		{
			get(mid2); if (ans != -1) return;
			if (quer[mid2].fi + quer[mid2].se == M)
			{
				break;
			}
		}
	}
	else
	{
		mid2 = (L + R)/2;
		for (; mid2 >= L; mid2--)
		{
			get(mid2); if (ans != -1) return;
			if (quer[mid2].fi + quer[mid2].se == M)
			{
				break;
			}
		}
		mid1 = (L + R)/2;
		for (; mid1 <= R; mid1++)
		{
			get(mid1); if (ans != -1) return;
			if (quer[mid1].fi + quer[mid1].se == M)
			{
				break;
			}
		}
	}
	if (rand() % 2)
	{
		solve(mid1, R); if (ans != -1) return;
		solve(L, mid2); if (ans != -1) return;
	}
	else
	{
		solve(L, mid2); if (ans != -1) return;
		solve(mid1, R); if (ans != -1) return;
	}
	//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); if (ans != -1) return ans;
		ckmax(M, quer[i].fi + quer[i].se);
	}
	for (int i = 0; i < min(237, N); i++)
	{
		get(N - 1 - i); if (ans != -1) return ans;
		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 (ans != -1) return ans;
		if (quer[lt].fi + quer[lt].se == M)
		{
			break;
		}
	}
	for (; rt >= 0; rt--)
	{
		get(rt); if (ans != -1) return ans;
		if (quer[rt].fi + quer[rt].se == M)
		{
			break;
		}
	}
//	cerr << lt << ' ' << rt << endl;
	solve(lt, rt);
	return ans;
	//M is the # of special guys
}
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 380 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 6 ms 380 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 440 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 8 ms 380 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 4 ms 520 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 4 ms 520 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 7 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 392 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Correct 8 ms 248 KB Output is correct
12 Correct 8 ms 760 KB Output is correct
13 Correct 12 ms 1016 KB Output is correct
14 Correct 11 ms 376 KB Output is correct
15 Correct 26 ms 1144 KB Output is correct
16 Correct 45 ms 1684 KB Output is correct
17 Correct 16 ms 1148 KB Output is correct
18 Correct 42 ms 1648 KB Output is correct
19 Correct 23 ms 1036 KB Output is correct
20 Correct 8 ms 628 KB Output is correct
21 Correct 17 ms 700 KB Output is correct
22 Correct 19 ms 888 KB Output is correct
23 Correct 6 ms 504 KB Output is correct
24 Correct 6 ms 676 KB Output is correct
25 Correct 47 ms 1824 KB Output is correct
26 Correct 39 ms 1572 KB Output is correct
27 Correct 5 ms 488 KB Output is correct
28 Correct 43 ms 1668 KB Output is correct
29 Correct 38 ms 1636 KB Output is correct
30 Correct 19 ms 1252 KB Output is correct
31 Correct 11 ms 948 KB Output is correct
32 Correct 13 ms 948 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 18 ms 760 KB Output is correct
35 Correct 5 ms 552 KB Output is correct
36 Correct 26 ms 1068 KB Output is correct
37 Correct 5 ms 488 KB Output is correct
38 Correct 5 ms 520 KB Output is correct
39 Correct 9 ms 376 KB Output is correct
40 Correct 17 ms 1204 KB Output is correct
41 Correct 34 ms 1284 KB Output is correct
42 Correct 19 ms 1376 KB Output is correct
43 Correct 28 ms 1532 KB Output is correct
44 Correct 10 ms 376 KB Output is correct
45 Correct 18 ms 696 KB Output is correct
46 Correct 24 ms 888 KB Output is correct
47 Correct 6 ms 468 KB Output is correct
48 Correct 52 ms 1784 KB Output is correct
49 Correct 16 ms 1156 KB Output is correct
50 Correct 28 ms 1756 KB Output is correct
51 Correct 9 ms 380 KB Output is correct
52 Correct 25 ms 1064 KB Output is correct
53 Correct 7 ms 504 KB Output is correct
54 Correct 7 ms 376 KB Output is correct
55 Correct 27 ms 952 KB Output is correct
56 Correct 25 ms 1816 KB Output is correct
57 Correct 53 ms 2040 KB Output is correct
58 Partially correct 60 ms 2128 KB Partially correct - number of queries: 5030
59 Correct 37 ms 1400 KB Output is correct
60 Correct 51 ms 1920 KB Output is correct
61 Correct 7 ms 504 KB Output is correct
62 Correct 9 ms 504 KB Output is correct
63 Correct 9 ms 504 KB Output is correct
64 Correct 7 ms 504 KB Output is correct
65 Correct 4 ms 248 KB Output is correct
66 Correct 4 ms 312 KB Output is correct
67 Correct 5 ms 328 KB Output is correct
68 Correct 8 ms 308 KB Output is correct
69 Correct 5 ms 316 KB Output is correct
70 Correct 5 ms 416 KB Output is correct
71 Partially correct 56 ms 2012 KB Partially correct - number of queries: 5233
72 Correct 8 ms 1184 KB Output is correct
73 Partially correct 32 ms 2260 KB Partially correct - number of queries: 5170
74 Correct 60 ms 1872 KB Output is correct
75 Correct 8 ms 632 KB Output is correct
76 Correct 52 ms 2004 KB Output is correct
77 Partially correct 31 ms 2052 KB Partially correct - number of queries: 5190
78 Correct 15 ms 1148 KB Output is correct
79 Correct 18 ms 1860 KB Output is correct
80 Partially correct 31 ms 2076 KB Partially correct - number of queries: 5149
81 Partially correct 69 ms 1964 KB Partially correct - number of queries: 5191
82 Partially correct 58 ms 1996 KB Partially correct - number of queries: 5123
83 Correct 9 ms 632 KB Output is correct
84 Correct 34 ms 2024 KB Output is correct
85 Partially correct 58 ms 2092 KB Partially correct - number of queries: 5182
86 Correct 7 ms 376 KB Output is correct
87 Correct 6 ms 400 KB Output is correct
88 Correct 5 ms 324 KB Output is correct
89 Correct 6 ms 328 KB Output is correct
90 Correct 8 ms 316 KB Output is correct
91 Correct 4 ms 388 KB Output is correct
92 Correct 8 ms 376 KB Output is correct
93 Correct 13 ms 760 KB Output is correct
94 Correct 7 ms 876 KB Output is correct
95 Correct 10 ms 892 KB Output is correct
96 Correct 10 ms 888 KB Output is correct
97 Correct 7 ms 376 KB Output is correct