Submission #466818

#	Time	Username	Problem	Language	Result	Execution time	Memory
466818		flappybird	Koala Game (APIO17_koala)	C++14	19 / 100	107 ms	448 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;

int minValue(int N, int W) {
	int b[100];
	int r[100];
	ll i;
	for (i = 0; i < N; i++) b[i] = 0;
	b[0] = 1;
	playRound(b, r);
	for (i = 0; i < N; i++) {
		if (r[i] == 0) return i;
	}
    return 0;
}

int maxValue(int N, int W) {
	ll b[100];
	ll r[100];
	ll i;
	for (i = 0; i < N; i++) b[i] = 1;
	playRound(b, r);
	ll k = 0;
	while (1) {
		ll cnt = 0;
		ll v = -1;
		for (i = 0; i < N; i++) if (r[i] > k) cnt++, v = i;
		if (cnt == 1) return v;
		for (i = 0; i < N; i++) {
			if (r[i] > k) b[i] = N / cnt;
			else b[i] = 0;
		}
		k = N / cnt;
		playRound(b, r);
	}
    return 0;
}

int greaterValue(int N, int W) {
	ll low, high;
	low = 0, high = N / 2;
	ll i;
	ll b[100], r[100];
	for (i = 0; i < N; i++) b[i] = 0;
	while (low < high) {
		ll mid = (low + high) / 2;
		b[0] = b[1] = mid;
		playRound(b, r);
		if (r[0] > mid && r[1] > mid) low = mid + 1;
		else if (r[0] <= mid && r[1] <= mid) high = mid - 1;
		else {
			if (r[0] > mid) return 0;
			else return 1;
		}
	}
    return 0;
}

struct query {
	ll l, r;
	ll num;
	vector<ll> arr;
};

void allValues(int N, int W, int *P) {
	ll i;
	ll b[100], r[100];
	for (i = 0; i < 100; i++) b[i] = 0;
	queue<query> qq;
	query q1;
	q1.l = 1, q1.r = N;
	q1.arr = vector<ll>();
	q1.num = 1;
	for (i = 0; i < N; i++) q1.arr.push_back(i);
	qq.push(q1);
	while (!qq.empty()) {
		query t = qq.front();
		qq.pop();
		if (t.l == t.r) {
			P[t.arr[0]] = t.l;
			continue;
		}
		for (i = 0; i < N; i++) b[i] = 0;
		for (auto x : t.arr) b[x] = t.num;
		playRound(b, r);
		query ql, qr;
		ql.num = t.num;
		qr.num = t.num + 1;
		ql.arr = qr.arr = vector<ll>();
		for (auto x : t.arr) {
			if (r[x] > b[x]) qr.arr.push_back(x);
			else ql.arr.push_back(x);
		}
		ll mid = t.l + ql.arr.size() - 1;
		ql.l = t.l;
		ql.r = mid;
		qr.l = mid + 1;
		qr.r = t.r;
		qq.push(ql);
		qq.push(qr);
	}
}

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53