# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
354196 | juggernaut | Counting Mushrooms (IOI20_mushrooms) | C++14 | 10 ms | 512 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"
#ifndef EVAL
#include"stub.cpp"
#endif
#include<bits/stdc++.h>
using namespace std;
int count_mushrooms(int n){
vector<int>a,b;
a.push_back(0);
int id=1;
while(max(a.size(),b.size())<110&&id<n){
if(a.size()>=3&&b.size()>=2&&id+4<n){
int ans1=use_machine({a[0],id,a[1],id+1,a[2],id+2});
if(ans1&1)b.push_back(id+2);
else a.push_back(id+2);
ans1>>=1;
if(ans1==0){
a.push_back(id);
a.push_back(id+1);
id+=3;
}else if(ans1==2){
b.push_back(id);
b.push_back(id+1);
id+=3;
}else{
int ans2=use_machine({b[0],id,b[1],a[0],id+1,a[1],id+3,a[2],id+4})-1;
if(ans2&1)b.push_back(id+4);
else a.push_back(id+4);
ans2>>=1;
if(ans2&1)b.push_back(id+3);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |