Submission #980916

#TimeUsernameProblemLanguageResultExecution timeMemory
980916FZ_MeloBeech Tree (IOI23_beechtree)C++17
0 / 100
1 ms348 KiB
#include "beechtree.h" #include <bits/stdc++.h> using namespace std; int buc[200000]; std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C){ int n=N, m=M; vector<int> ans(n); for(int i=n-1; i>=0; i--){ for(int j=1; i<=m; j++){ if(buc[j]==n-i-1){ ans[i]=1; break; } } buc[C[i]]++; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...