# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
759755 | MilosMilutinovic | Counting Mushrooms (IOI20_mushrooms) | C++14 | 2 ms | 208 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 <bits/stdc++.h>
using namespace std;
const int C = 100;
int count_mushrooms(int n) {
if (n <= 227) {
int ans = 1;
for (int i = 1; i < n; i++) {
ans += !use_machine({0, i});
}
return ans;
}
vector<int> a(1, 0), b;
for (int i = 1; i < min(n, C); i++) {
if (use_machine({0, i}))
b.push_back(i);
else
a.push_back(i);
}
int ans = a.size();
for (int i = C; i < n; i++) {
int sz = max(a.size(), b.size());
vector<int> qv;
for (int j = i; j < min(i + sz + 1, n); j++) {
if (j != i + sz) {
if (a.size() == sz)
qv.push_back(a[j - i]);
else
qv.push_back(b[j - i]);
}
qv.push_back(j);
}
int diff = (use_machine(qv) + 1) / 2;
int same = (qv.size() - sz - diff);
if (a.size() == sz)
ans += same;
else
ans += diff;
i += sz + 1;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |