Submission #1025581

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025581		Gray	Beech Tree (IOI23_beechtree)	C++17	0 / 100	1 ms	348 KiB

beechtree

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

#define ll long long
#define ff first
#define ss second
#define ln "\n"
#define pll pair<ll, ll>
using namespace std;

vector<vector<ll>> A;
vector<int> col;
vector<int> pos;
vector<int> colus;
ll n, m;
void dfs(ll u, ll p){
    bool ispos=1;
    for (auto v:A[u]){
        if (v==p) continue;
        colus[col[v]]++;
        if (colus[col[v]]>=2) ispos=0;
        dfs(v, u);
        ispos&=pos[v];
    }
    pos[u]=ispos;
    for (auto v:A[u]){
        if (v==p) continue;
        colus[col[v]]--;
    }
}

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    n=N; m=M;
    A.resize(n);
    pos.resize(n);
    col=C;
    for (ll i=1; i<n; i++){
        A[P[i]].push_back(i);
    }
    // vector<int> ans(n);
    colus.assign(m+1, 0);
    dfs(0, 0);
    return pos;
}

• 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