# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
817400 | math_rabbit_1028 | Counting Mushrooms (IOI20_mushrooms) | C++14 | 1 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;
int count_mushrooms(int n) {
int b = max((int)sqrt(n), 2);
vector<int> Alist, Blist;
Alist.push_back(0);
int i;
for (i = 1; i < n; i++) {
if (use_machine({i, Alist[0]}) == 0) Alist.push_back(i);
else Blist.push_back(i);
if (Alist.size() == b || Blist.size() == b) break;
}
i++;
int ans = Alist.size();
for (; i < n; i += (b-1)) {
vector<int> seq;
if (Alist.size() == b) {
seq.push_back(Alist[0]);
for (int j = i; j < min(i + b - 1, n); j++) {
seq.push_back(j);
seq.push_back(Alist[j - i + 1]);
}
ans += b - 1 - use_machine(seq) / 2;
}
else {
seq.push_back(Blist[0]);
for (int j = i; j < min(i + b - 1, n); j++) {
seq.push_back(j);
seq.push_back(Blist[j - i + 1]);
}
ans += use_machine(seq) / 2;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |