Submission #846789

#	Time	Username	Problem	Language	Result	Execution time	Memory
846789		ogkostya	Beech Tree (IOI23_beechtree)	C++17	0 / 100	0 ms	344 KiB

beechtree

#include "beechtree.h"
#include <algorithm> 

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+1] == i && C[i] == C[N - 1];
        ans.push_back(sub2 ? 1 : 0);
    }

    std::reverse(ans.begin(), ans.end());
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 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