#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
#define SZ(v) int((v).size())
#define ALL(vec) (vec).begin(),(vec).end()
int B[500], R[500];
int minValue(int n, int w) {
for (int i = 0; i < 100; ++i) {
B[i] = i < 51;
}
playRound(B, R);
int m = -1;
for (int i = 0; i < 51; ++i) {
if (R[i] == 0) {
m = i;
} // else assert (R[i] == 2);
}
for (int i = 0; i < 100; ++i) {
B[i] = i >= 50;
}
B[m] = 1;
if (m == 50) B[49] = 1;
playRound(B, R);
int res = -1;
for (int i = 50; i < 100; ++i) {
if (R[i] == 0) {
res = i;
} // else assert (R[i] == 2);
}
if (res != -1) return res;
if (m == 50) return 49;
else return m;
}
int maxValue(int n, int w) {
return 0;
}
int greaterValue(int n, int w) {
return 0;
}
void allValues(int n, int w, int *P) {
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |