#include <bits/stdc++.h>
#include "koala.h"
int minValue(int N, int W) {
int B[100], R[100];
B[0] = 1;
playRound(B, R);
if (R[0] <= 1) return 0;
for (int i = 1; i < 100; i++) {
if (!R[i]) return i;
}
return 0;
}
int maxValue(int N, int W) {
int B[100], R[100];
bool done[100];
int rem = 100;
while (rem > 1) {
for (int i = 0; i < 100; i++) {
if (!done[i]) B[i] = std::min(W / rem, 13);
else B[i] = 0;
}
playRound(B, R);
for (int i = 0; i < 100; i++) {
if (!done[i] && R[i] <= B[i]) {
done[i] = true;
rem--;
}
}
}
for (int i = 0; i < 100; i++) {
if (!done[i]) return i;
}
return 0;
}
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.
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
344 KB |
Output is correct |
2 |
Correct |
3 ms |
344 KB |
Output is correct |
3 |
Correct |
3 ms |
344 KB |
Output is correct |
4 |
Correct |
3 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |