| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 307078 | 2020-09-27T01:17:19 Z | daniel920712 | Counting Mushrooms (IOI20_mushrooms) | C++14 | 0 ms | 256 KB |
#include "mushrooms.h"
#include <vector>
#include <math.h>
using namespace std;
vector < int > A,B;
vector < int > temp;
vector < int > fin;
int count_mushrooms(int N)
{
int k=floor(sqrt(2*N)+0.5),ans=0,x=0,y=0,i,now,tt;
for(i=1;i<=min(N-1,k);i+=2)
{
temp.clear();
temp.push_back(0);
temp.push_back(i);
if(i+1<=min(N-1,k))
{
temp.push_back(i+1);
tt=use_machine(temp);
if(tt==0)
{
A.push_back(i);
A.push_back(i+1);
y+=2;
ans+=2;
}
else if(tt==2)
{
A.push_back(i+1);
B.push_back(i);
x++;
y++;
ans++;
}
else
{
B.push_back(i+1);
x++;
fin.push_back(i);
fin.push_back(i+1);
}
}
else
{
if(use_machine(temp))
{
x++;
B.push_back(i);
}
else
{
y++;
ans++;
A.push_back(i);
}
}
}
if(!fin.empty())
{
tt=use_machine(fin);
ans+=(tt+1)/2;
/*if(tt%2)
{
A.push_back(*temp.begin());
y++;
}
else*/
if(tt%2==0)
{
B.push_back(*temp.begin());
x++;
}
}
now=k+1;
while(now<N)
{
if(x>y)
{
temp.clear();
for(auto i:B)
{
temp.push_back(i);
if(now<N)
{
temp.push_back(now);
now++;
}
}
if(temp.size()>=2)
{
tt=use_machine(temp);
ans+=(tt+1)/2;
if(tt%2==0)
{
B.push_back(*prev(temp.end()));
x++;
}
else
{
A.push_back(*prev(temp.end()));
y++;
}
}
}
else
{
temp.clear();
for(auto i:A)
{
temp.push_back(i);
if(now<N)
{
temp.push_back(now);
now++;
}
}
if(temp.size()>=2)
{
tt=use_machine(temp);
ans+=(temp.size()-y-(tt+1)/2);
if(tt%2==0)
{
A.push_back(*prev(temp.end()));
y++;
}
else
{
B.push_back(*prev(temp.end()));
x++;
}
}
}
}
//ans+=y;*/
return ans+1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 256 KB | Output is correct |
| 2 | Correct | 0 ms | 256 KB | Output is correct |
| 3 | Incorrect | 0 ms | 256 KB | Answer is not correct. |
| 4 | Halted | 0 ms | 0 KB | - |