제출 #1216333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1216333		hengliao	Tree (IOI24_tree)	C++20	7 / 100	59 ms	24644 KiB

tree

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

#define F first
#define S second
#define pll pair<ll, ll>
#define vll vector<ll>
#define pb push_back

typedef long long ll;

namespace{

    const ll mxN=2e5+5;

    ll n, l, r;
    ll sum[mxN];
    multiset<pll> st[mxN];
    ll ans;
    ll p[mxN];
    vll adj[mxN];
    ll w[mxN];
    ll leafcnt;
}

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

long long query(int L, int R) {
    l=L;
    r=R;
    ll curans=leafcnt*l+max(leafcnt*l-r, 0LL);
    return curans;
}

• 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