oj.uz

Submission #166367

# Submission time Handle Problem Language Result Execution time Memory
166367 2019-12-01T19:20:39 Z qkxwsm Koala Game (APIO17_koala) C++14
29 / 100
 51 ms 508 KB 
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

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 INF 1000000007
#define LLINF 2696969696969696969

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, Q;
vi arr, rec;
vi ans;

vi ask(vi s)
{
	int tmp[100], tmp1[100];
	FOR(i, 0, N)
	{
		tmp[i] = s[i];
	}
	playRound(tmp, tmp1);
	FOR(i, 0, N)
	{
		s[i] = tmp1[i];
	}
	return s;
}

int minValue(int n, int q)
{
	N = n; Q = q; arr.resize(N);
	arr[0] = 1;
	rec = ask(arr);
	FOR(i, 1, N)
	{
		if (rec[i] == 0) return i;
	}
    return 0;
}

int maxValue(int n, int q)
{
    N = n; Q = q; arr.resize(N);
	vi cands;
	FOR(i, 0, N) cands.PB(i);
	while(SZ(cands) > 1)
	{
		vi tmp;
		FOR(i, 0, N) arr[i] = 0;
		for (int x : cands) arr[x] = N / SZ(cands);
		rec = ask(arr);
		FOR(i, 0, N)
		{
			if (rec[i] > (N / SZ(cands))) tmp.PB(i);
		}
		cands = tmp;
		// for (int x : cands)
		// {
		// 	cerr << x << ' ';
		// }
		// cerr << endl;
	}
	return cands[0];
}

int greaterValue(int n, int q)
{
	N = n; Q = q; arr.resize(N);
	//say you put x on each.
	//they will put 98 on thhe other guys and 0 on both of you.
	//they will put 99-x on the other guys and x+1 on one of you. it's a sacrifice of 1+2+...x-1. for you. but the next one needs x....2x-2
	//they will put 98-2x on everybody else and x+1 on both of you.
	//they put it on the more expensive of you two.
	vi test;
	test.PB(8);
	test.PB(4);
	test.PB(2);
	// test.PB(1);
	for (int x : test)
	{
		arr[0] = x; arr[1] = x;
		rec = ask(arr);
		if (rec[0] > x && rec[1] <= x) return 0;
		if (rec[0] <= x && rec[1] > x) return 1;
	}
    return 0;
}

bool cmp(int a, int b)
{
	//return true if a < b
	FOR(i, 0, N)
	{
		arr[i] = 0;
	}
	arr[a] = N; arr[b] = N;
	rec = ask(arr);
	return (rec[b] > N);
}
vi ord[300];
void build4(int w, int L, int R)
{
	ord[w].clear();
	if (L == R)
	{
		ord[w].PB(L);
		return;
	}
	int mid = (L + R) >> 1;
	build4(w << 1, L, mid);
	build4(w << 1 | 1, mid + 1, R);
}
void solve4(int w, int L, int R)
{
	if (L == R) return;
	int mid = (L + R) >> 1;
	solve4(w << 1, L, mid);
	solve4(w << 1 | 1, mid + 1, R);
	int lt = 0, rt = 0;
	while(lt < SZ(ord[w << 1]) || rt < SZ(ord[w << 1 | 1]))
	{
		if (rt == SZ(ord[w << 1 | 1]) || ((lt != SZ(ord[w << 1]) && cmp(ord[w << 1][lt], ord[w << 1 | 1][rt]))))
		{
			ord[w].PB(ord[w << 1][lt]);
			lt++;
		}
		else
		{
			ord[w].PB(ord[w << 1 | 1][rt]);
			rt++;
		}
	}
}
void allValues(int n, int q, int *res)
{
    N = n; Q = q; arr.resize(N); ans.resize(N);
	if (Q == 2 * N)
	{
		build4(1, 0, N - 1);
		solve4(1, 0, N - 1);
		FOR(i, 0, SZ(ord[1]))
		{
			ans[ord[1][i]] = i + 1;
		}
	}
	//eh we only have N.
	//well you know who the upper half is now.
	FOR(i, 0, N) res[i] = ans[i];
	return;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 376 KB Output is correct
2 Correct 17 ms 376 KB Output is correct
3 Correct 16 ms 376 KB Output is correct
4 Correct 17 ms 376 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 248 KB Output is correct
2 Incorrect 11 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 404 KB Output is correct
2 Correct 35 ms 376 KB Output is correct
3 Correct 40 ms 376 KB Output is correct
4 Correct 33 ms 376 KB Output is correct
5 Correct 33 ms 376 KB Output is correct
6 Correct 34 ms 376 KB Output is correct
7 Correct 34 ms 504 KB Output is correct
8 Correct 34 ms 392 KB Output is correct
9 Correct 33 ms 376 KB Output is correct
10 Correct 33 ms 388 KB Output is correct
11 Correct 34 ms 508 KB Output is correct
12 Correct 21 ms 376 KB Output is correct
13 Correct 34 ms 376 KB Output is correct
14 Correct 32 ms 376 KB Output is correct
15 Correct 31 ms 376 KB Output is correct
16 Correct 30 ms 392 KB Output is correct
17 Correct 30 ms 376 KB Output is correct
18 Correct 32 ms 376 KB Output is correct
19 Correct 30 ms 376 KB Output is correct
20 Correct 31 ms 376 KB Output is correct

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -