#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 102;
int B[N], R[N];
int minValue(int N, int W) {
memset(B, 0, N * sizeof *B);
B[0] = 1;
playRound(B, R);
for(int i = 0; i < N; ++i) {
if(R[i] <= B[i]) {
return i;
}
}
}
int maxValue(int N, int W) {
vector<int> S(N);
iota(S.begin(), S.end(), 0);
while((int)S.size() > 1) {
memset(B, 0, N * sizeof *B);
for(int i : S) {
B[i] = N / S.size();
}
playRound(B, R);
vector<int> T;
for(int i : S) {
if(R[i] > B[i]) {
T.push_back(i);
}
}
S.swap(T);
}
return S[0];
}
int greaterValue(int N, int W) {
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
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
20 | }
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
208 KB |
Output is correct |
2 |
Correct |
4 ms |
208 KB |
Output is correct |
3 |
Correct |
4 ms |
208 KB |
Output is correct |
4 |
Correct |
4 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
208 KB |
Output is correct |
2 |
Correct |
12 ms |
320 KB |
Output is correct |
3 |
Correct |
13 ms |
208 KB |
Output is correct |
4 |
Correct |
12 ms |
320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
296 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |