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 <iostream>
using namespace std;
int minValue(int N, int W) {
int B[N],R[N];
fill(B,B+N,0);
B[0]=1;
playRound(B,R);
int res=0;
for(int i=0;i<N;i++)
if(R[i]==0)
res=i;
return res;
}
int maxValue(int N, int W) {
}
int greaterValue(int N, int W) {
int B[N],R[N];
fill(B,B+N,0);
fill(R,R+N,0);
while(R[0]==R[1]){
B[0]++;
B[1]++;
playRound(B,R);
}
return R[0]<R[1];
}
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)
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
# | 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... |