# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
957962 | salmon | Koala Game (APIO17_koala) | C++14 | 14 ms | 452 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;
}
int greaterValue(int N, int W) {
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |