# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021636 | HappyCapybara | Counting Mushrooms (IOI20_mushrooms) | C++17 | 6 ms | 1124 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> as = {0}, bs;
int i = 1, res = 1;
while (i < n){
vector<int> m;
if (as.size() >= bs.size()){
int j = 0;
while (i < n && j < as.size()){
m.push_back(as[j]);
m.push_back(i);
i++;
j++;
}
int x = use_machine(m);
if (x % 2) bs.push_back(m.back());
else {
as.push_back(m.back());
res++;
}
res += (m.size()/2 - x/2 - 1);
if (x/2 == 0){
for (int k=1; k<m.size()-1; k+=2) as.push_back(m[k]);
}
if ((x/2)*2 == m.size()-2){
for (int k=1; k<m.size()-1; k+=2) bs.push_back(m[k]);
}
}
else {
int j = 0;
while (i < n && j < bs.size()){
m.push_back(bs[j]);
m.push_back(i);
i++;
j++;
}
int x = use_machine(m);
if (x % 2){
as.push_back(m.back());
res++;
}
else bs.push_back(m.back());
res += (x/2);
if (x/2 == 0){
for (int k=1; k<m.size()-1; k+=2) bs.push_back(m[k]);
}
if ((x/2)*2 == m.size()-2){
for (int k=1; k<m.size()-1; k+=2) as.push_back(m[k]);
}
}
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |