제출 #469624

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
469624		flappybird	코알라 (APIO17_koala)	C++14	96 / 100	57 ms	440 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 = 16;
	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;
		else if (r[0] <= mid && r[1] <= mid) high = mid;
		else {
			if (r[0] > mid) return 0;
			else return 1;
		}
	}
	return 0;
}

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

ll getsum(ll x, ll y) {
	x = max(x, 1);
	y = max(y, 1);
	ll i;
	ll sum = 0;
	for (i = x; i <= y; i++) sum += i;
	return sum;
}

void allValues(int N, int W, int* P) {
	ll i;
	ll b[100], r[100];
	if (W == N * 2) {
		for (i = 0; i < N; i++) b[i] = 0;
		queue<query> qq;
		query q1;
		q1.l = 1, q1.r = N;
		q1.up = vector<ll>();
		q1.arr = vector<ll>();
		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 asdf : t.up) b[asdf] = 1;
			ll num;
			ll aa, bb;
			aa = t.l - 1;
			for (num = 2; num <= N; num++) {
				if (t.l == 1) break;
				ll xx = t.r - t.l + 1;
				if (num * xx > 2 * t.r) break;
				ll rr = (2 * t.r - xx * (num - 1));
				if (t.l <= getsum(t.l - rr - num, t.l - rr - 1)) break;
			}
			num--;
			if (t.l == 1) num = 2;
			for (auto x : t.arr) b[x] = num;
			playRound(b, r);
			query ql, qr;
			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;
			ql.up = qr.up = t.up;
			for (auto asdf : qr.arr) ql.up.push_back(asdf);
			qq.push(ql);
			qq.push(qr);
		}
	}
	else {
		for (i = 0; i < 100; i++) b[i] = 0;
		queue<query> qq;
		query q1;
		q1.l = 1, q1.r = N;
		q1.arr = vector<ll>();
		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;
			ll num;
			ll aa, bb;
			aa = t.l - 1;
			for (num = 2; num <= N; num++) {
				if (!t.l) break;
				ll xx = t.r - t.l + 1;
				if (num * xx > t.r) break;
				ll rr = t.r - xx * num;
				if (t.l <= getsum(t.l - rr - num, t.l - rr - 1)) break;
			}
			num--;
			if (!t.l) num = 1;
			for (auto x : t.arr) b[x] = num;
			playRound(b, r);
			query ql, qr;
			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);
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:97:7: warning: variable 'aa' set but not used [-Wunused-but-set-variable]
   97 |    ll aa, bb;
      |       ^~
koala.cpp:97:11: warning: unused variable 'bb' [-Wunused-variable]
   97 |    ll aa, bb;
      |           ^~
koala.cpp:144:7: warning: variable 'aa' set but not used [-Wunused-but-set-variable]
  144 |    ll aa, bb;
      |       ^~
koala.cpp:144:11: warning: unused variable 'bb' [-Wunused-variable]
  144 |    ll aa, bb;
      |           ^~

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