Submission #1205010

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205010		PagodePaiva	Beech Tree (IOI23_beechtree)	C++20	0 / 100	2 ms	4932 KiB

beechtree

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

using namespace std;

const int N = 100010;

vector <int> g[N];
vector <int> componentes[N];
int cor[N];
int cnt[N];
int perm[N];
int pai[N];
vector <int> cores;
int res[N];

vector<int> beechtree(int n, int m, std::vector<int> p, std::vector<int> c){
    for(int i = 1;i < n;i++){
        g[i].push_back(p[i]);
        g[p[i]].push_back(i);
        cor[i] = c[i];
        cores.push_back(c[i]);
    }
    vector <int> ans;
    ans.push_back(1);
    int at = c[n-1];
    int res = 1;
    for(int i = n-2;i >= 0;i--){
        ans.push_back(res);
        if(at != cnt[i])
            res = 0;
    }
    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