Submission #856163

#	Time	Username	Problem	Language	Result	Execution time	Memory
856163		Sorting	Beech Tree (IOI23_beechtree)	C++17	0 / 100	2 ms	5468 KiB

beechtree

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

using namespace std;

const int N = 2e5 + 3;

int n, m, c[N];
vector<int> adj[N];

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    n = N, m = M;
    copy(C.begin(), C.end(), c);
    for(int i = 1; i < n; ++i){
        adj[P[i]].push_back(i);
    }

    vector<int> ans;
    ans.push_back(1);
    int same = 0, col = -1;
    for(int i = n - 1; i > 0; --i){
        if(c[i] != col){
            same = 1;
            col = c[i];
        }
        else{
            ++same;
        }
        ans.push_back(same == n - i);
    }
    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