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"
using namespace std;
#include <bitset>
#include <vector>
bitset<100> buy(int* a, int* b) {
bitset<100> ans;
for (int i = 0; i < 100; i++)if (b[i] > a[i])ans[i] = 1;
return ans;
}
int maxValue(int N, int W) {
bitset<100> can; for (int i = 0; i < N; i++)can[i] = 1;
while (can.count() > 1) {
int a[100], b[100];
for (int i = 0; i < 100; i++)if (can[i])a[i] = 100 / can.count(); else a[i] = 0;
playRound(a, b); can = can&buy(a, b);
}
for (int i = 0; i < N; i++)if (can[i])return i;
}
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 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.
}
}
Compilation message (stderr)
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:21:1: warning: control reaches end of non-void function [-Wreturn-type]
21 | }
| ^
# | 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... |