Submission #1188410

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188410		MatteoArcari	Beech Tree (IOI23_beechtree)	C++20	5 / 100	50 ms	15176 KiB

beechtree

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

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c) {
    vector<vector<int>> adj(n);
    for (int i = 1; i < n; i++) {
        adj[p[i]].push_back(i);
    }
    vector<int> ans(n);
    ans[n - 1] = ans[n - 2] = 1;
    for (int i = n - 3; i >= 0; i--) {
        if (c[i + 2] == c[i + 1]) ans[i] = ans[i + 1];
    }
    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