Submission #1132835

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132835		SpyrosAliv	Beech Tree (IOI23_beechtree)	C++20	0 / 100	0 ms	324 KiB

beechtree

#include <bits/stdc++.h>
using namespace std;

int n, m;
vector<vector<int>> tree;
vector<int> c;

vector<int> solve_line() {
    vector<int> ans(n, false);
    ans[n-1] = true;
    for (int i = n-2; i >= 0; i--) {
        if (c[i] != c[n-1] && i != 0) break;
        ans[i] = true;
    }
    return ans;
}

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
    n = N;
    m = M;
    c = C;
    tree.clear();
    tree.resize(n);
    bool line = true;
    for (int i = 1; i < n; i++) {
        tree[P[i]].push_back(i);
        if (P[i] != -1) line = false;
    }
    if (line) return solve_line();
    vector<int> ans(n, 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