Submission #1269713

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269713		mariza	Beech Tree (IOI23_beechtree)	C++20	0 / 100	1 ms	328 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll N=200000;

vector<ll> t[N];

bool comp(ll a, ll b){
    return t[a].size()>t[b].size();
}

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c){
    for(ll i=1; i<n; i++){
        t[p[i]].push_back(i);
    }

    vector<int> ans;
    set<ll> s[n];
    for(ll i=0; i<n; i++){
        for(auto j:t[i]){
            s[i].insert(c[j]);
        }
        ans.push_back(s[i].size()==t[i].size());
        ans[0]&=(s[i].size()==t[i].size());
    }

    ll x[n];
    for(ll i=0; i<n; i++){
        x[i]=i;
    }
    sort(x+1,x+n);

    for(ll i=2; i<n; i++){
        for(auto j:s[i]) ans[0]&=(s[i-1].find(j)!=s[i-1].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