#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int qa[MAXN], ra[MAXN];
int minValue(int N, int W){ // N = 100, W = 100, 2 times
qa[0] = 1;
for (int i = 1; i < N; i++) qa[i] = 0;
playRound(qa, ra);
if (ra[0] <= 1) return 0;
for (int i = 1; i < N; i++)
if (ra[i] == 0)
return i;
}
int maxValue(int N, int W){ // N = 100, W = 100, 4 times
vector<int> loc;
for (int i = 0; i < N; i++) loc.push_back(i);
while (loc.size() > 1){ // 100, 50, 25, 9, 1
int amt = W / loc.size();
for (int i = 0; i < N; i++) qa[i] = 0;
for (int x : loc) qa[x] = amt;
playRound(qa, ra);
vector<int> ori; swap(ori, loc);
for (int x : ori)
if (ra[x] > amt)
loc.push_back(x);
}
return loc[0];
}
int greaterValue(int N, int W){ // N = 100, W = 100, 3 times
for (int i = 0; i < N; i++) qa[i] = 0;
int lo = 1, hi = 9;
while (lo <= hi){
int m = (lo + hi) >> 1;
qa[0] = qa[1] = m;
playRound(qa, ra);
if (ra[0] > m != ra[1] > m) return ra[1] > m;
else if (ra[0] > m) lo = m + 1;
else hi = 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 greaterValue(int, int)':
koala.cpp:41:13: warning: suggest parentheses around comparison in operand of '!=' [-Wparentheses]
41 | if (ra[0] > m != ra[1] > m) return ra[1] > m;
| ~~~~~~^~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:16:1: warning: control reaches end of non-void function [-Wreturn-type]
16 | }
| ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:45:1: warning: control reaches end of non-void function [-Wreturn-type]
45 | }
| ^
# |
Verdict |
Execution time |
Memory |
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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
344 KB |
Output is correct |
2 |
Correct |
10 ms |
452 KB |
Output is correct |
3 |
Correct |
11 ms |
344 KB |
Output is correct |
4 |
Correct |
10 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
468 KB |
Output is correct |
2 |
Correct |
49 ms |
476 KB |
Output is correct |
3 |
Correct |
42 ms |
476 KB |
Output is correct |
4 |
Correct |
41 ms |
464 KB |
Output is correct |
5 |
Correct |
42 ms |
476 KB |
Output is correct |
6 |
Correct |
41 ms |
476 KB |
Output is correct |
7 |
Correct |
42 ms |
488 KB |
Output is correct |
8 |
Correct |
42 ms |
468 KB |
Output is correct |
9 |
Correct |
42 ms |
480 KB |
Output is correct |
10 |
Correct |
40 ms |
484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
596 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |