# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1032582 | sleepntsheep | 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.
#include "mushrooms.h"
#include <cassert>
int count_mushrooms(int n) {
if (n <= 227) {
int count = 1, cur = 0;
for (int i = 1; i < n; ++i) {
cur ^= (use_machine({i - 1, i}));
count += !cur;
}
return count;
}
std::vector<int> A = {0}, B;
int count = 1;
int X = 200;
for (int cur = 0, i = 1; i < X; i++) {
cur ^= use_machine({i - 1, i});
if (cur == 0)
++count, A.push_back(i);
else
B.push_back(i);
}
int amogus = std::max(A.size(), B.size());
int chosen = A.size() >= B.size() ? 0 : 1;
int l = X;
while (l < n) {
int r = std::min(n, l + amogus - 1) - 1;
std::vector<int> m;
if (0 == chosen) {
m = {A[0]};
for (int j = l, k = 1; j <= r; ++j, ++k) {
m.push_back(j);
assert(k < A.size());
m.push_back(A[k]);
}
count += (r - l + 1) - use_machine(m) / 2;
} else {
m = {B[0]};
for (int j = l, k = 1; j <= r; ++j, ++k) {
m.push_back(j);
assert(k < B.size());
m.push_back(B[k]);
}
count += use_machine(m) / 2;
}
l = r + 1;
}
return count;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |