# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848265 | Plurm | Beech Tree (IOI23_beechtree) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "beechtree.h"
std::vector<int> beechtree(int N, int M, std::vector<int> P,
std::vector<int> C) {
std::vector<int> ret;
bool ok = true;
ret.push_back(1);
ret.push_back(1);
for (int i = N - 3; i >= 0; i--) {
if (C[i + 1] != C[i + 2])
ok = false;
if (ok)
ret.push_back(1);
else
ret.push_back(0);
}
reverse(ret.begin(), ret.end());
return ret;
}