Submission #795608

#TimeUsernameProblemLanguageResultExecution timeMemory
795608alexander707070Counting Mushrooms (IOI20_mushrooms)C++14
56.93 / 100
8 ms340 KiB
#include<bits/stdc++.h> #include "mushrooms.h" #define MAXN 20000 using namespace std; int bucket,res,ans; int color[MAXN],br[2]; vector<int> s1,s2,curr; int count_mushrooms(int N){ bucket=min(int(sqrt(N)*1.414),N); for(int i=1;i<bucket;i++){ color[i]=use_machine({0,i}); } for(int i=0;i<bucket;i++){ br[color[i]]++; if(color[i]==0)s1.push_back(i); else s2.push_back(i); } if(br[0]>=br[1]){ ans=br[0]; for(int i=bucket;i<N;i+=br[0]){ curr.clear(); for(int f=i;f<min(i+br[0],N);f++){ curr.push_back(s1[f-i]); curr.push_back(f); } res=use_machine(curr); ans+=(min(i+br[0],N)-i)-ceil(res/2.0); } }else{ ans=br[0]; for(int i=bucket;i<N;i+=br[1]){ curr.clear(); for(int f=i;f<min(i+br[1],N);f++){ curr.push_back(s2[f-i]); curr.push_back(f); } res=use_machine(curr); ans+=ceil(res/2.0); } } return ans; } /* int main(){ } */
#Verdict Execution timeMemoryGrader output
Fetching results...