# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
958757 | salmon | 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 <bits/stdc++.h>
#include "koala.h"
using namespace std;
int minValue(int N, int W) {
int res[N];
int in[N];
for(int i = 0; i < N; i++){
in[i] = 0;
}
in[0] = 1;
playRound(in,res);
int p = -1;
for(int i = 0; i < N; i++){
if(res[i] <= in[i]){
p = i;
}
}
return p;
}
int maxValue(int N, int W) {
set<int> sat;
int res[N];
int in[N];
for(int i = 0; i < N; i++){
sat.insert(i);
in[i] = 0;
}
while(sat.size() != 1){
int num = 100 / sat.size();
for(int i = 0; i < N; i++){
in[i] = 0;
}
for(int i : sat){
in[i] = num;
}
playRound(in,res);
for(int i = 0; i < N; i++){
if(res[i] <= in[i] && sat.find(i) != sat.end()){
sat.erase(i);
}
}
}
for(int i : sat) return i;
}
//9 5 3
int greaterValue(int N, int W) {
int in[N];
int res[N];
int it = minValue(N, W);
if(it == 0) return 1;
if(it == 1) return 0;
for(int i = 0; i < N; i++){
in[i] = 0;
}
in[0] = 4;
in[1] = 4;
playRound(in,res);
if(res[0] > in[0] && res[1] <= in[1]) return 0;
if(res[1] > in[1] && res[0] <= in[0]) return 1;
if(res[0] > in[0]){
in[0] = 8;
in[1] = 8;
}
else{
in[0] = 2;
in[1] = 2;
}
playRound(in,res);
if(res[0] > in[0] && res[1] <= in[1]) return 0;
if(res[1] > in[1] && res[0] <= in[0]) return 1;
in[0] = 2;
in[1] = 2;
playRound(in,res);
if(res[0] > in[0] && res[1] <= in[1]) return 0;
if(res[1] > in[1] && res[0] <= in[0]) return 1;
}
bool greater(int a, int b){
int in[N];
int res[N];
for(int i = 0; i < 100; i++){
in[i] = 0;
}
in[a] = 100;
in[b] = 100;
playRound(in,res);
return in[b] < res[b];
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
vector<int> v;
for(int i = 0; i < N; i++){
v.push_back(i);
}
sort(v.begin(),v.end(),greater());
for(int i = 0; i < N; i++){
P[v[i]] = i + 1;
}
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}