# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
448268 | dxz05 | Counting Mushrooms (IOI20_mushrooms) | C++14 | 13 ms | 328 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) {
vector<int> vec;
int k = 94;
vector<int> A = {0}, B;
for (int i = 1; i <= min(n - 1, 2 * k - 2); i++){
if (use_machine({0, i})) B.push_back(i); else
A.push_back(i);
}
int beg = 2 * k - 1;
k = max(A.size(), B.size());
bool ok = A.size() >= B.size();
int ans = A.size();
for (int i = beg; i < n; i++){
vec.clear();
for (int j = i; j < min(n, i + k); j++){
vec.push_back(ok ? A[j - i] : B[j - i]);
vec.push_back(j);
}
i += k - 1;
int res = use_machine(vec);
if (ok){
ans += vec.size() / 2 - (res + 1) / 2;
} else {
ans += (res + 1) / 2;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |