Submission #1151095

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151095		Zicrus	Tree (IOI24_tree)	C++20	7 / 100	41 ms	6292 KiB

tree

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

typedef long long ll;

int n;
vector<int> p, w;
vector<bool> leaf;
ll leaves;

void init(vector<int> P, vector<int> W) {
    p = P;
    w = W;
    n = (int)p.size();
    leaf = vector<bool>(n, true);
    leaves = n;
    for (auto &e : p) {
        if (e == -1) continue;
        leaves -= leaf[e];
        leaf[e] = false;
    }
}

ll query(int L, int R) {
    ll leafStuff = leaves * L;
    if (leafStuff > R) {
        return 2*leafStuff - R;
    }
    return leafStuff;
}

• 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