# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336202 | aanastasov | Counting Mushrooms (IOI20_mushrooms) | C++17 | 3 ms | 492 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 <algorithm>
#include <cassert>
#include <vector>
#include <iostream>
#define DEBUG(x) std::cerr << #x << ": " << x << std::endl
const int PHASE_ONE_COUNT = 142;
template<typename T> void debugVector(std::vector<T> v) {
std::cerr << "{";
for (int i = 0; i < v.size(); ++i) {
if (i > 0) std::cerr << ", ";
std::cerr << v[i];
}
std::cerr << "}" << std::endl;
}
std::pair<std::vector<int>, std::vector<int>> runPhaseOne(int n, int phaseOneCount) {
auto zeroes = std::vector<int>();
auto ones = std::vector<int>();
zeroes.push_back(0);
while (zeroes.size() < 2 && ones.size() < 2) {
int next = zeroes.size() + ones.size();
auto seq = std::vector<int>{0, next};
int count = use_machine(seq);
assert(count >= 0 && count <= 1);
if (count == 0)
zeroes.push_back(next);
else
ones.push_back(next);
}
assert(zeroes.size() == 2 || ones.size() == 2);
while (zeroes.size() < phaseOneCount && ones.size() < phaseOneCount) {
int next0 = zeroes.size() + ones.size();
int next1 = next0 + 1;
if (next1 >= n) break;
bool useKnownZeroes = zeroes.size() >= 2;
auto seq = std::vector<int>();
if (useKnownZeroes)
seq = std::vector<int>{zeroes[0], next0, zeroes[1], next1};
else
seq = std::vector<int>{ones[0], next0, ones[1], next1};
// debugVector(seq);
int count = use_machine(seq);
assert(count >= 0 && count <= 3);
if (useKnownZeroes) {
if (count >= 2) ones.push_back(next0); else zeroes.push_back(next0);
if (count % 2 != 0) ones.push_back(next1); else zeroes.push_back(next1);
} else {
if (count < 2) ones.push_back(next0); else zeroes.push_back(next0);
if (count % 2 != 1) ones.push_back(next1); else zeroes.push_back(next1);
}
}
return {zeroes, ones};
}
int count_mushrooms(int n) {
int phaseOneCount = std::min(n / 2, PHASE_ONE_COUNT);
auto response = runPhaseOne(n, phaseOneCount);
auto zeroesLocs = response.first;
auto onesLocs = response.second;
assert(zeroesLocs.size() == phaseOneCount || onesLocs.size() == phaseOneCount);
int zeroesCount = 0;
int onesCount = 0;
int next = zeroesLocs.size() + onesLocs.size();
while (next < n) {
int len = std::min(n - next, (int)std::max(zeroesLocs.size(), onesLocs.size()));
auto seq = std::vector<int>(2 * len);
auto known = zeroesLocs.size() > onesLocs.size() ? zeroesLocs : onesLocs;
for (int i = 0; i < len; ++i) seq[i * 2] = known[i];
for (int i = 0; i < len; ++i) seq[i * 2 + 1] = next++;
int count = (use_machine(seq) + 1) / 2;
if (known == onesLocs) {
zeroesCount += count;
onesCount += len - count;
} else {
onesCount += count;
zeroesCount += len - count;
}
}
return zeroesCount + zeroesLocs.size();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |