# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239112 | urd05 | 코알라 (APIO17_koala) | C++14 | 10 ms | 384 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 b[100];
b[0]=1;
int r[100];
playRound(b,r);
int ret;
if (r[0]==2) {
for(int i=1;i<N;i++) {
if (r[i]==0) {
return i;
}
}
}
else {
return 0;
}
return 0;
}
int maxValue(int N, int W) {
bool alive[100];
int b[100];
for(int i=0;i<N;i++) {
alive[i]=true;
}
while (1) {
memset(b,0,sizeof(b));
for(int i=0;i<N;i++) {
if (alive[i]) {
b[i]=1;
}
}
int r[100];
playRound(b,r);
for(int i=0;i<N;i++) {
if (r[i]<=b[i]) {
alive[i]=false;
}
}
int cnt=0;
for(int i=0;i<N;i++) {
if (alive[i]) {
cnt++;
}
}
if (cnt==1) {
break;
}
}
for(int i=0;i<N;i++) {
if (alive[i]) {
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... |