# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624978 | QwertyPi | Koala Game (APIO17_koala) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "koala.h"
#include <bits/stdc++.h>
const int N = 100;
using namespace std;
int minValue(int N, int W) {
int a[N], b[N];
a[0] = 1;
for(int i = 1; i < N; i++){
a[i] = 0;
}
playRound(a, b);
if(b[0] <= 1){
return 0;
}else{
for(int i = 1; i < N; i++){
if(b[i] == 0){
return i;
}
}
}
}
int getMax(int N, int W, vector<int> v){
int a[N], b[N];
int st = v.size();
while(v.size() != 1){
for(int i = 0; i < N; i++) a[i] = 0;
int k = v.size();
int sq = 0; while((sq + 1) * (sq + 2) / 2 < st) sq++;
for(auto i : v){
a[i] = min(st - 1, min(W / k, k + sq - 1));
}
playRound(a, b);
vector<int> nv;
for(int i = 0; i < N; i++){
if(a[i] != 0 && b[i] > a[i]){
nv.push_back(i);
}
}
assert(nv.size() != 0 && v.size() != nv.size());
v = nv;
}
return v[0];
}
int maxValue(int N, int W) {
int a[N], b[N];
while(v.size() != 1){
for(int i = 0; i < N; i++) a[i] = 0;
int k = v.size();
int sq = 0; while((sq + 1) * (sq + 2) / 2 < N - k + 1) sq++;
for(auto i : v){
a[i] = min(W / k, k + W - N + sq - 1);
}
playRound(a, b);
vector<int> nv;
for(int i = 0; i < N; i++){
if(a[i] != 0 && b[i] > a[i]){
nv.push_back(i);
}
}
v = nv;
}
return v[0];
}
int greaterValue(int N, int W) {
int a[N], b[N];
int l = 1, r = 8;
for(int k = 1; k <= 4; k++){
int mid = (l + r + 1) / 2;
a[0] = a[1] = mid;
for(int i = 2; i < N; i++){
a[i] = 0;
}
playRound(a, b);
if(b[0] > mid && mid >= b[1]){
return 0;
}else if(b[0] <= mid && mid < b[1]){
return 1;
}else{
if(b[0] <= mid){
r = mid - 1;
}else{
l = mid;
}
}
}
}
void allValues(int N, int W, int *P) {
if(W == N * 2){
vector<int> Q;
vector<int> v;
for(int i = 0; i < N; i++){
v.push_back(i);
}
for(int i = 0; i < N; i++){
int mx = getMax(N, W, v);
Q.push_back(mx);
int idx = 0;
for(int i = 0; i < N; i++){
if(v[i] == mx) idx = i;
}
swap(v[idx], v[(int) v.size() - 1]);
v.resize(N - i - 1);
}
for(int i = 0; i < N; i++){
P[Q[i]] = N - i;
}
}else{
vector<int> Q;
vector<int> v;
for(int i = 0; i < N; i++){
v.push_back(i);
}
for(int i = 0; i < N; i++){
int mx = getMax(N, W, v);
Q.push_back(mx);
int idx = 0;
for(int i = 0; i < N; i++){
if(v[i] == mx) idx = i;
}
swap(v[idx], v[(int) v.size() - 1]);
v.resize(N - i - 1);
}
for(int i = 0; i < N; i++){
P[Q[i]] = N - i;
}
}
}