# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499935 | Khizri | Counting Mushrooms (IOI20_mushrooms) | C++17 | 197 ms | 200 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;
#define pb push_back
int count_mushrooms(int n) {
int k=0;
int x=1;
int ans=0;
while(k<n){
int l=k,r=min(n-1,k+7);
int q=k;
while(l<=r){
int m=(l+r)/2;
vector<int>vt;
for(int i=q;i<=m;i++){
vt.pb(i);
}
int kk=0;
if(vt.size()>1){
kk=use_machine(vt);
}
if(kk==vt.size()-1&&kk!=0){
if(x){
ans+=q-k+1;
}
for(int i=q+1;i<=m;i++){
x=1-x;
if(x){
ans++;
}
}
k=m+1;
if(m+1<n&&use_machine({m,m+1})){
x=1-x;
}
goto loop;
}
if(kk==0){
l=m+1;
q=m;
}
else{
r=m-1;
}
}
if(x){
ans+=(l-1-k+1);
}
if(l-1<k){
x=1-x;
}
else if(l<n&&use_machine({l-1,l})){
x=1-x;
}
k=l;
loop:;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |