# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1074243 | TheQuantiX | 버섯 세기 (IOI20_mushrooms) | C++17 | 9 ms | 612 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 <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
using ll = long long;
constexpr ll C = 200;
ll n, m, q, k, x, y, a, b, c;
int count_mushrooms(int n) {
vector<ll> va(1, 0), vb;
for (int i = 1; i < n && i < C; i++) {
if (use_machine({0, i}) == 0) {
va.push_back(i);
}
else {
vb.push_back(i);
}
}
int ans = va.size();
if (va.size() > vb.size()) {
ll pos = C;
while (pos < n) {
vector<int> vec;
ll cnt = 0;
while (pos != n && cnt != va.size()) {
vec.push_back(va[cnt]);
vec.push_back(pos);
cnt++;
pos++;
}
ll num = use_machine(vec);
ans += cnt - (num + 1) / 2;
}
}
else {
ll pos = C;
while (pos < n) {
vector<int> vec;
ll cnt = 0;
while (pos != n && cnt != vb.size()) {
vec.push_back(vb[cnt]);
vec.push_back(pos);
cnt++;
pos++;
}
ll num = use_machine(vec);
ans += (num + 1) / 2;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |