| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1167813 | thelegendary08 | 트리 (IOI24_tree) | C++17 | 0 ms | 0 KiB |
#include "tree.h"
#include "grader.cpp"
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define vi vector<long long>
#define vvi vector<vector<long long>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
#define ll long long
using namespace std;
int n;
std::vector<int> p, w;
const int mxn = 2e5 + 5;
vvi adj(mxn);
vi c(mxn);
vi cc(mxn);
int times = 0;
int leaves = 0;
void init(std::vector<int> P, std::vector<int> W) {
p = P;
w = W;
n = (int)p.size();
f0r(i,n){
if(i != 0){
adj[i].pb(p[i]);
adj[p[i]].pb(i);
cc[p[i]]++;
}
}
f0r(i,n){
if(cc[i] == 0)times++;
else{
times += cc[i] - 1;
}
}
FOR(i, 1, n){
if(cc[i] == 0)leaves++;
}
}
ll l, r;
ll solve(ll node, ll from){
ll cnt = 0;
ll s= 0;
for(auto u : adj[node]){
if(u != from){
cnt++;
s += solve(u, node);
}
}
if(node != 0 && cnt == 0){
c[node] = l;
}
else{
if(s > r){
c[node] = r - s;
}
}
return s + c[node];
}
long long query(int L, int R) {
l = L;
r = R;
if(n == 1)return l * w[0];
else{
int ini = L * times;
if(R > L * leaves){
return L * leaves;
}
else{
return ini - (R - L);
}
}
}