This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
int B[105], R[105];
int minValue(int N, int W) {
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
int maxValue(int N, int W) {
vector<int> vec = {1, 2, 4, 11};
vector<int> good(N);
iota(good.begin(), good.end(), 0);
for(auto v: vec){
fill(B, B + N, 0);
for(auto id: good)B[id] = v;
playRound(B, R);
good.clear();
for(int i = 0; i < N; i++)if(R[i] > v)good.push_back(i);
}
return good.back();
}
int greaterValue(int N, int W) {
B[0] = B[1] = 3;
playRound(B, R);
if (R[0] > 3 and R[1] <= 3) return 0;
if (R[1] > 3 and R[0] <= 3) return 1;
B[0] = B[1] = 6;
playRound(B, R);
if (R[0] > 6 and R[1] <= 6) return 0;
if (R[1] > 6 and R[0] <= 6) return 1;
B[0] = B[1] = 10;
playRound(B, R);
if (R[0] > 10 and R[1] <= 10) return 0;
if (R[1] > 10 and R[0] <= 10) return 1;
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
// k p0 <= sum (k+1)so dau tien < p1
}
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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |