| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 598108 | ogibogi2004 | Counting Mushrooms (IOI20_mushrooms) | C++14 | 14 ms | 432 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;
const int K=50;
int count_mushrooms(int n) {
    vector<int>A,B;
    A.push_back(0);
    int cnta=1;
    int decided=-1;
    for(int i=1;i<n;)
    {
        int last=i;
        if(decided==0)
        {
            vector<int>v;
            for(int j=0;j<A.size()&&j<K&&i+j<n;j++)
            {
                last=i+j;
                if(i+j>=n)break;
                v.push_back(i+j);
                v.push_back(A[j]);
            }
            int f=use_machine(v);
            cnta+=v.size()/2-(f+1)/2;
            if(f%2==0)
            {
                A.push_back(i);
            }
            else
            {
                B.push_back(i);
            }
        }
        else if(decided==1)
        {
            vector<int>v;
            for(int j=0;j<B.size()&&j<K&&i+j<n;j++)
            {
                last=i+j;
                if(i+j>=n)break;
                v.push_back(i+j);
                v.push_back(B[j]);
            }
            int f=use_machine(v);
            cnta+=(f+1)/2;
            if(f%2==0)
            {
                B.push_back(i);
            }
            else
            {
                A.push_back(i);
            }
        }
        else
        {
            if(A.size()>B.size())
            {
                vector<int>v;
                for(int j=0;j<A.size()&&j<K&&i+j<n;j++)
                {
                    last=i+j;
                    if(i+j>=n)break;
                    v.push_back(i+j);
                    v.push_back(A[j]);
                }
                int f=use_machine(v);
                cnta+=v.size()/2-(f+1)/2;
                if(f%2==0)
                {
                    A.push_back(i);
                }
                else
                {
                    B.push_back(i);
                }
            }
            else
            {
                vector<int>v;
                for(int j=0;j<B.size()&&j<K&&i+j<n;j++)
                {
                    last=i+j;
                    if(i+j>=n)break;
                    v.push_back(i+j);
                    v.push_back(B[j]);
                }
                int f=use_machine(v);
                cnta+=(f+1)/2;
                if(f%2==0)
                {
                    B.push_back(i);
                }
                else
                {
                    A.push_back(i);
                }
            }
            if(A.size()==K)decided=0;
            else if(B.size()==K)decided=1;
        }
        //cout<<last<<" "<<cnta<<endl;
        i=last+1;
    }
    return cnta;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
