#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);
int l=0,r=min(N,8),m;
while(l<r){
m=(l+r)/2;
B[0]=B[1]=m;
playRound(B,R);
if(R[0]!=R[1])
return R[0]<R[1];
if(R[0]==0)
r=m;
else
l=m+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
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
252 KB |
Output is correct |
2 |
Correct |
7 ms |
368 KB |
Output is correct |
3 |
Correct |
7 ms |
452 KB |
Output is correct |
4 |
Correct |
11 ms |
800 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
800 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
800 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
800 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
800 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |