# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303645 | galca | Counting Mushrooms (IOI20_mushrooms) | C++14 | 3 ms | 364 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"
using namespace std;
int count_mushrooms(int n) {
vector<int> knownZeros;
vector<int> knownOnes;
knownZeros.push_back(0);
// find one more, or two 1s
int i = 1;
while ((knownZeros.size() < 2) && (knownOnes.size() < 2)) {
int c = use_machine({ 0, i });
if (c) {
knownOnes.push_back(i);
}
else {
knownZeros.push_back(i);
}
++i;
if (i == n) {
return knownZeros.size();
}
}
vector<int> fours;
bool isZero = false;
if (knownZeros.size() == 2) {
fours.push_back(knownZeros[0]);
fours.push_back(0);
fours.push_back(knownZeros[1]);
fours.push_back(0);
isZero = true;
}
else {
fours.push_back(knownOnes[0]);
fours.push_back(0);
fours.push_back(knownOnes[1]);
fours.push_back(0);
}
if (n <= 200) {
for (; i < n; i++) {
int c = use_machine({ 0, i });
if (c) {
knownOnes.push_back(i);
}
else {
knownZeros.push_back(i);
}
}
return knownZeros.size();
}
//for (; i < 200; i += 2) {
while ((knownZeros.size() < 100) && (knownOnes.size() < 100)) {
fours[1] = i++;
fours[3] = i++;
int c = use_machine(fours);
switch (c) {
case 0:
if (isZero) {
knownZeros.push_back(i);
knownZeros.push_back(i+1);
}
else {
knownOnes.push_back(i);
knownOnes.push_back(i + 1);
}
break;
case 1:
if (isZero) {
knownZeros.push_back(i);
knownOnes.push_back(i+1);
}
else {
knownOnes.push_back(i);
knownZeros.push_back(i + 1);
}
break;
case 2:
if (isZero) {
knownOnes.push_back(i);
knownZeros.push_back(i+1);
}
else {
knownZeros.push_back(i);
knownOnes.push_back(i + 1);
}
break;
case 3:
if (isZero) {
knownOnes.push_back(i);
knownOnes.push_back(i + 1);
}
else {
knownZeros.push_back(i);
knownZeros.push_back(i + 1);
}
break;
}
}
int totalZeros = knownZeros.size();
while (i < n) {
vector<int> m;
if (knownOnes.size() >= knownZeros.size()) {
for (int j = 0; j < knownOnes.size(); j++) {
if ((i + j) < n) {
m.push_back(knownOnes[j]);
m.push_back(i + j);
}
}
i += knownOnes.size();
int c = use_machine(m);
if (c & 1) {
++totalZeros;
--c;
knownZeros.push_back(m[m.size() - 1]);
}
else {
knownOnes.push_back(m[m.size() - 1]);
}
totalZeros += c / 2;
}
else {
for (int j = 0; j < knownZeros.size(); j++) {
if ((i + j) < n) {
m.push_back(knownZeros[j]);
m.push_back(i + j);
}
}
i += knownZeros.size();
int c = use_machine(m);
if (c & 1) {
++c;
knownOnes.push_back(m[m.size() - 1]);
}
else {
knownZeros.push_back(m[m.size() - 1]);
}
totalZeros += (m.size() - c) / 2;
}
}
return totalZeros;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |