oj.uz

Submission #951730

# Submission time Handle Problem Language Result Execution time Memory
951730 2024-03-22T11:54:19 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
3 / 100
 249 ms 114088 KB 
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define ll long long
#define int ll

struct node{
	ll x = 0;
	node *l = nullptr, *r = nullptr;
	node(){}
};


vector<int> q[200100];
vector<pii> h[200100];
int n, m, k;
node *d[200100];
int dp[200100][2];


void upd(node *v, int l, int r, int pos, int x){
	if(l == r){
		v -> x += x;
		return;
	}
	int mid=(l + r) / 2;
	if(mid >= pos){
		if(!v -> l) v -> l = new node();
		upd(v -> l, l, mid, pos, x);
	}
	else{                               
		if(!v -> r) v -> r = new node();
		upd(v -> r, mid+1, r, pos, x);
	}
	v -> x = (v -> l ?v -> l -> x :0) + (v -> r ?v -> r -> x :0);
}

ll get(node *v, int l, int r, int L, int R){
	if(r < L or R < l){
		return 0;
	}
	if(L <= l and r <= R){
		return v -> x;
	}
	int mid=(l+r)/2;
	ll sum = 0;
	if(v -> l){
		sum += get(v -> l, l, mid, L, R);
	}
	if(v -> r){
		sum += get(v->r, mid+1, r, L, R);
	}
	return sum;

}


void dfs(int v){
	pii g={-1, -1};
	if(h[v].size()) g = h[v][0];
	d[v] = new node();
	upd(d[v], 1, k, g.ff, g.ss);
	for(auto to: q[v]){
		dfs(to);
		if(h[to].size() > h[v].size()){
			swap(h[to], h[v]);
			swap(d[v], d[to]);
		}
		for(auto dd: h[to]){
			upd(d[v], 1, k, dd.ff, dd.ss);	
		} 
		dp[v][0] += max(dp[to][0], dp[to][1]);
	}                     
	if(g.ff != -1){
		dp[v][1] = get(d[v], 1, k, 1, g.ff);
	}
	else{
		dp[v][1] = 0;
	}
	//cout<<v<<' '<<dp[v][0]<<' '<<dp[v][1]<<'\n';
}


void solve(){    
	cin>>n>>m>>k;
	for(int i=2; i<=n; i++){
		int x;
		cin>>x;
		q[x].pb(i);
	}
	for(int i=1; i<=m; i++){
		int v, l, r;
		cin>>v>>l>>r;
		//dp[v][0] = 1;
		h[v].pb({l, r});
	}
	dfs(1);         
	cout<<max(dp[1][0], dp[1][1]);
}


signed main(){
	solve();
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Incorrect 3 ms 12124 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 84260 KB Output is correct
2 Correct 118 ms 81328 KB Output is correct
3 Correct 249 ms 114088 KB Output is correct
4 Correct 189 ms 80324 KB Output is correct
5 Correct 231 ms 82036 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 12636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 126 ms 26192 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Incorrect 3 ms 12124 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 25688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Incorrect 3 ms 12124 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Incorrect 3 ms 12124 KB Output isn't correct
3 Halted 0 ms 0 KB -