# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409336 | Carmel_Ab1 | Counting Mushrooms (IOI20_mushrooms) | C++17 | 22 ms | 704 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"
//#include "stub.cpp"
using namespace std;
#define pb push_back
typedef vector<int> vi;
typedef long long ll;
int count_mushrooms(int n) {
int ans=1;
vi o,z,a(n,-1);
a[0]=0;
z.pb(0);
if(n<=226){
for(int i=1; i<n; i++)
ans+=1- use_machine({0,i});
return ans;
}
const int k=200;
int first=1;
for(int i=1; o.size()<k && z.size()<k;first++, i++){
if(use_machine({0,i}))
o.pb(i),a[i]=1;
else
ans++,z.pb(i),a[i]=0;
}
vi left;
for(int i=first; i<n;i++)
left.pb(i);
if(o.size()>z.size()){
for(int i=k,j=0; i<n;j=0, i++){
vi cur;
while(left.size() && cur.size()+3<=n && cur.size()+2<=o.size()){
cur.pb(o[j]);
cur.pb(left.back());
left.pop_back();
cur.pb(o[j+1]);
j+=2;
}
if(cur.size()>=2)
ans+= use_machine(cur)/2;
}
}
else{
for(int i=k,j=0; i<n;j=0, i++){
int in=0;
vi cur;
while(left.size() && cur.size()+3<=n && cur.size()+2<=z.size()){
cur.pb(z[j]);
cur.pb(left.back());
left.pop_back();
cur.pb(z[j+1]);
j+=2;
in++;
}
if(cur.size()>=2)
ans+= in-use_machine(cur)/2;
}
}
while(left.size()){
ans+= use_machine({0,left.back()});
left.pop_back();
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |