# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1072857 | Ignut | Counting Mushrooms (IOI20_mushrooms) | C++17 | 7 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int use_machine(vector<int> x);
int count_mushrooms(int n) {
int res = 1;
vector<int> A = {0}, B = {};
vector<int> vec;
for (int i = 1; i < n; i ++) vec.push_back(i);
int Q = 200;
for (int i = 0; i < Q; i ++) {
if (vec.empty()) {
return res;
}
int v = vec.back(); vec.pop_back();
if (use_machine({0, v}) == 0) {
res ++;
A.push_back(v);
}
else {
B.push_back(v);
}
}
while (!vec.empty()) {
int ind = 1;
vector<int> ask = {(A.size() >= B.size() ? A[0] : B[0])};
while (ind < max(A.size(), B.size()) && !vec.empty()) {
int v = vec.back(); vec.pop_back();
ask.push_back(v);
ask.push_back(A.size() >= B.size() ? A[ind] : B[ind]);
ind ++;
}
int val = use_machine(ask);
int cnt = ind - 1;
if (A.size() >= B.size())
res += cnt - val / 2;
else
res += val / 2;
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |