# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
846787 | 2023-09-08T12:29:50 Z | ogkostya | Beech Tree (IOI23_beechtree) | C++17 | 0 ms | 0 KB |
#include "beechtree.h" std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C) { std::vector<int> ans{ }; ans.push_back(1); bool sub2 = true; for (int i = N - 2; i >= 0; i--) { sub2 &= P[i] == i-1 && C[i] == C[N - 1]; ans.push_back(sub2 ? 1 : 0); } std::reverse(ans.begin(), ans.end()); return ans; }