Submission #1167766

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167766		thelegendary08	Tree (IOI24_tree)	C++17	10 / 100	2093 ms	26012 KiB

tree

#include "tree.h"
#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);
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);
  	}
  }
}
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) {
	
	f0r(i,n)c[i] = 0;	
	l = L;
	r = R;
  	if(n == 1)return l * w[0];
  	else{
  		ll ans = 0;
  		solve(0, -1);
  		f0r(i,n)ans += abs(c[i]) * w[i];
  		return ans;
  	}
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 18
• Subtask 4: 0 / 7
• Subtask 5: 0 / 11
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19