제출 #1241381

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241381		dosts	참나무 (IOI23_beechtree)	C++20	5 / 100	95 ms	34748 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
//#define int long long
#define pii pair<int,int> 
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " << 
#define all(x) x.begin(),x.end()
using namespace std;

const int LIM = 2e5+1;
vector<pii> edges[LIM];
vi ans(LIM,0),C,P;

int N;
vi ctr(LIM,0);


int dfs(int node) {
    for (auto it : edges[node]) dfs(it.ff);
    if (edges[node].empty()) ans[node] = 1;
    else {
        if (ans[edges[node][0].ff] == 0) {
            ans[node] = 0;
        }
        else {
            ans[node] = 1;
            ans[node]&=(ctr[edges[node][0].ss] == N-node-1);
        }
    }
    ctr[C[node]]++;
    return ans[node];
}

std::vector<int> beechtree(int N_, int M, std::vector<int> P_, std::vector<int> C_)
{
    N = N_;
    P = P_,C = C_;
    ans.assign(N_,0);
    for (int i = 0;i<N;i++) edges[i].clear(); 
    vi v;
    for (auto it : C) v.push_back(it);
    sort(all(v));
    v.erase(unique(all(v)),v.end());
    for (auto& it : C) it = lower_bound(all(v),it)-v.begin();
    for (int i = 1;i<N;i++) {
        edges[P[i]].push_back({i,C[i]});
    }
    dfs(0);
    return ans;
}

• 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