Submission #346060

#TimeUsernameProblemLanguageResultExecution timeMemory
346060lLab_Counting Mushrooms (IOI20_mushrooms)C++14
0 / 100
1 ms492 KiB
#include "mushrooms.h" #include <bits/stdc++.h> using namespace std; set<int> A = {0}; set<int> B; int N; bool ia[20020]; int cu = 1; int recur(){ int ns = A.size()*2; int nA = A.size(); //int S[min(nA*2,N-nA-cu+1)]; vector<int> S; set<int>::iterator itr; for(int i=1;i<=nA*2;++i){ if(i%2 == 1){ S.push_back(*itr); itr++; } else{ while(ia[cu]){ cu++; } S.push_back(cu); cu++; } } int ty = use_machine(S); if(ty%2 == 1){ A.insert(ns-1); ia[ns-1] = true; } return ns-((ty+1)/2)-nA; } int count_mushrooms(int n) { N = n; ia[0] = true; int sum = 1; while(cu < n){ sum += recur(); } return sum; }
#Verdict Execution timeMemoryGrader output
Fetching results...