Submission #1313953

#	Time	Username	Problem	Language	Result	Execution time	Memory
1313953		nicolo_010	Tree (IOI24_tree)	C++20	7 / 100	58 ms	23032 KiB

tree

#include <bits/stdc++.h>
#include "tree.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int n;
std::vector<int> p, w;
ll k;

vector<vector<int>> adj;

void dfs(int n, int p=-1) {
    bool leaf = true;
    for (auto x : adj[n]) {
        if (x==p) continue;
        leaf = false;
        dfs(x, n);
    }
    if (leaf) k++;
}

void init(std::vector<int> P, std::vector<int> W) {
    p = P;
    w = W;
    n = (int)p.size();
    adj.assign(n, {});
    for (int i=1; i<n; i++) {
        int a = i;
        int b = p[i];
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    k=0;
    dfs(0);
}

long long query(int L, int R) {
    return k*L+(max(0ll, k*L-R));
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 18
• Subtask 4: 7 / 7
• Subtask 5: 0 / 11
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19