제출 #1222085

#제출 시각아이디문제언어결과실행 시간메모리
1222085thelegendary08Beech Tree (IOI23_beechtree)C++17
5 / 100
42 ms4272 KiB
#include "beechtree.h" #include<bits/stdc++.h> #define int long long #define f0r(i,n) for(int i = 0; i<n; i++) #define pb push_back #define mp make_pair #define vi vector<int> #define mii map<int,int> #define pii pair<int,int> #define vpii vector<pii> #define FOR(i, k, n) for(int i = k; i<n; i++) #define vb vector<bool> using namespace std; std::vector<signed> beechtree(signed N, signed M, std::vector<signed> P, std::vector<signed> C) { set<int>s; vector<signed>ans(N); ans[N-1] = 1; for(int i = N-1; i>0; i--){ s.insert(C[i]); if(s.size() == 1)ans[i-1] = 1; else break; } 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...