Submission #1024862

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024862		Svizel_pritula	Beech Tree (IOI23_beechtree)	C++17	5 / 100	44 ms	6740 KiB

beechtree

#include "beechtree.h"

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    std::vector<int> results(N);

    int color = C.back();
    bool correct = true;

    for (int i = N - 1; i >= 0; i--)
    {
        results[i] = correct;
        correct = correct && C[i] == color;
    }

    return results;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 5 / 5
• Subtask 3: 0 / 9
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12