Submission #980908

#	Time	Username	Problem	Language	Result	Execution time	Memory
980908		vjudge1	Beech Tree (IOI23_beechtree)	C++17	5 / 100	55 ms	7112 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;

vi beechtree (int n, int m, vi p, vi c) {
    vi ans(n, -15);
    ans[n-1] = 1;
    ll cc = c[n-1];
    for (ll i = n-1; i > 0; i--) {
        ans[p[i]] = ans[i] && (c[i] == cc);
    }
    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