제출 #1241556

#제출 시각아이디문제언어결과실행 시간메모리
1241556SalihSahinBeech Tree (IOI23_beechtree)C++20
5 / 100
73 ms5036 KiB
#include "bits/stdc++.h" #include "beechtree.h" #define pb push_back using namespace std; vector<int> beechtree(int N, int M, vector<int> P, vector<int> C){ vector<int> cnt(M+1); int val = 0; for(int i = 1; i < N; i++){ cnt[C[i]]++; if(cnt[C[i]] == 1) val++; } vector<int> ans(N, 1); for(int i = 0; i < N; i++){ if(val > 1) ans[i] = 0; if(i != N-1){ cnt[C[i+1]]--; if(cnt[C[i+1]] == 0) val--; } } 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...