#include <bits/stdc++.h>
#include "koala.h"
using namespace std;
typedef long long ll;
int minValue(int n, int w){
int A[102] = {1};
int B[102] = {0};
playRound(A, B);
for(int i=0; i<n; i++){
if(B[i] <= A[i]) return i;
}
exit(1);
}
int maxValue(int n, int W) {
vector<int> candidate;
for(int i=0; i<n; i++) candidate.push_back(i);
while((int)candidate.size() > 1){
int tmp = W / (int)candidate.size();
int A[102] = {0};
int B[102] = {0};
for(auto cand: candidate) A[cand] = tmp;
playRound(A, B);
candidate.clear();
for(int i=0; i<n; i++) if(B[i] > tmp) candidate.push_back(i);
}
return candidate[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.
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
364 KB |
Output is correct |
2 |
Correct |
5 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
4 |
Correct |
6 ms |
380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
364 KB |
Output is correct |
2 |
Correct |
20 ms |
492 KB |
Output is correct |
3 |
Correct |
21 ms |
364 KB |
Output is correct |
4 |
Correct |
20 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |