Submission #1198670

#	Time	Username	Problem	Language	Result	Execution time	Memory
1198670		anmattroi	Tree (IOI24_tree)	C++17	7 / 100	42 ms	5412 KiB

tree

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

int n;
vector<int> par, w;
int deg[maxn], cnt = 0;

void init(vector<int> P, vector<int> W) {
    n = P.size();
    for (int i = 1; i < n; i++) {
        ++deg[P[i]];
        ++deg[i];
    }
    for (int i = 0; i < n; i++)
        if (deg[i] - (P[i] != -1) == 0) ++cnt;
}

long long query(int L, int R) {
    return 1LL * L * cnt + max(int64_t(1) * L * cnt, int64_t(R)) - 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