Submission #1201105

#	Time	Username	Problem	Language	Result	Execution time	Memory
1201105		Nelt	Tree (IOI24_tree)	C++20	7 / 100	43 ms	7720 KiB

tree

#include <bits/stdc++.h>
#include "tree.h"
#define ll long long
#define endl "\n"
using namespace std;
int n;
std::vector<int> p, w;
ll cnt = 0;

void init(std::vector<int> P, std::vector<int> W)
{
    p = P;
    w = W;
    n = (int)p.size();
    ll leaf[n];
    for (ll i = 0; i < n; i++) leaf[i] = 1;
    for (ll i : p) 
        if (i >= 0) leaf[i] = false;
    for (ll i = 0; i < n; i++) cnt += leaf[i];
}

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

• 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