Submission #303478

#TimeUsernameProblemLanguageResultExecution timeMemory
303478galcaCounting Mushrooms (IOI20_mushrooms)C++14
0 / 100
1 ms256 KiB
#include "mushrooms.h" using namespace std; int count_mushrooms(int n) { vector<int> knownZeros; vector<int> knownOnes; knownZeros.push_back(0); if (n <= 128) { for (int i = 0; i < n; i++) { int c = use_machine({ 0, i }); if (c) { knownOnes.push_back(i); } else { knownZeros.push_back(i); } } return knownZeros.size(); } for (int i = 1; i < 128; i++) { int c = use_machine({ 0, i }); if (c) { knownOnes.push_back(i); } else { knownZeros.push_back(i); } } if (knownOnes.size() >= knownZeros.size()) { int totalZeros = knownZeros.size(); for (int i = 128; i < n; i+=64) { vector<int> m; for (int j = 0; j < 64; j++) { if ((i + j) < n) { m.push_back(knownOnes[j]); m.push_back(i+j); } } int c = use_machine(m); if (c % 1) { ++totalZeros; --c; } totalZeros += c / 2; m.erase(m.begin(), m.end()); } return totalZeros; } else { int totalOnes = knownOnes.size(); for (int i = 128; i < n; i += 64) { vector<int> m; for (int j = 0; j < 64; j++) { if ((i + j) < n) { m.push_back(knownZeros[j]); m.push_back(i + j); } } int c = use_machine(m); if (c % 1) { ++totalOnes; --c; } totalOnes += c / 2; m.erase(m.begin(), m.end()); } return n - totalOnes; } }
#Verdict Execution timeMemoryGrader output
Fetching results...