oj.uz

Submission #896239

# Submission time Handle Problem Language Result Execution time Memory
896239 2024-01-01T05:04:10 Z 8pete8 Magic Tree (CEOI19_magictree) C++17
58 / 100
 110 ms 40896 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<float.h>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
//#define int long long
#define double long double
const int mod=998244353,mxn=1e5,lg=22;//inf=1e18,minf=-1e18,Mxn=100000;
vector<int>adj[mxn+10];
int hvy[mxn+10],sz[mxn+10],sum[mxn+10];
vector<vector<ll>>dp;
map<ll,ll>mp[mxn+10];
pii info[mxn+10];
multiset<int>v[mxn+10];
int n,m,k;
ll ans=0;
void init(int cur,int p){
	sz[cur]=1;
	for(auto i:adj[cur]){
		init(i,cur);
		sz[cur]+=sz[i];
	}
	for(auto i:adj[cur])if(sz[hvy[cur]]<sz[i])hvy[cur]=i;
}
void dfs(int cur,int p){
	for(auto i:adj[cur])dfs(i,cur);
	for(auto i:adj[cur])for(int j=0;j<=k;j++)dp[cur][j]+=dp[i][j];
	dp[cur][info[cur].f]+=info[cur].s;
	for(int j=1;j<=k;j++)dp[cur][j]=max(dp[cur][j],dp[cur][j-1]);
}
ll mx=0;
void dfs2(int cur,int p){
	for(auto i:adj[cur])dfs2(i,cur);
	if(hvy[cur])swap(mp[cur],mp[hvy[cur]]);
	for(auto i:adj[cur]){
		if(i==hvy[cur])continue;
		for(auto j:mp[i])mp[cur][j.f]+=j.s;
	}
	mp[cur][info[cur].f]+=info[cur].s;
	auto it=mp[cur].upper_bound(info[cur].f);
	while(it!=mp[cur].end()&&info[cur].s>0){
		if(info[cur].s>=it->s)info[cur].s-=it->s,mp[cur].erase(it);
		else {it->s-=info[cur].s;break;}
	}
}
void solve(int cur,int p){
	for(auto i:adj[cur])solve(i,cur);
	if(hvy[cur])swap(v[cur],v[hvy[cur]]);
	for(auto i:adj[cur])if(i!=hvy[cur])for(auto j:v[i])v[cur].insert(j);
	if(info[cur].s==0)return;
	auto it=v[cur].upper_bound(info[cur].f);
	if(it!=v[cur].end())v[cur].erase(it);
	v[cur].insert(info[cur].f);

}
int32_t main(){
    fastio
	cin>>n>>m>>k;
	for(int i=2;i<=n;i++){
		int p;cin>>p;
		adj[p].pb(i);
	}
	bool yes=true;
	for(int i=0;i<m;i++){
		int v,d,w;cin>>v>>d>>w;
		info[v]={d,w};
		ans+=w;
		if(w!=1)yes=false;
	}
	if(yes){//w=1
		init(1,-1);
		solve(1,-1);
		cout<<v[1].size();
	}
	else if(k<=1){
		ans=0;
		init(1,-1);
		dfs(1,-1);
		for(int i=0;i<=k;i++)ans=max(ans,dp[1][i]);
		cout<<ans;
	}
	else{//sub 2
		ans=0;
		init(1,-1);
		dfs2(1,-1);
		for(auto i:mp[1])ans+=i.s;
		cout<<ans;
	}
	return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13912 KB Output is correct
2 Correct 3 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 3 ms 13916 KB Output is correct
5 Correct 3 ms 14008 KB Output is correct
6 Correct 3 ms 13916 KB Output is correct
7 Correct 3 ms 13916 KB Output is correct
8 Correct 3 ms 13916 KB Output is correct
9 Correct 3 ms 13916 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 26664 KB Output is correct
2 Correct 35 ms 25168 KB Output is correct
3 Correct 110 ms 40896 KB Output is correct
4 Correct 54 ms 25692 KB Output is correct
5 Correct 77 ms 26956 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14168 KB Output is correct
2 Correct 3 ms 14172 KB Output is correct
3 Correct 3 ms 14168 KB Output is correct
4 Correct 44 ms 29528 KB Output is correct
5 Correct 59 ms 34136 KB Output is correct
6 Correct 51 ms 29308 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 32856 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13912 KB Output is correct
2 Correct 3 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 3 ms 13916 KB Output is correct
5 Correct 3 ms 14008 KB Output is correct
6 Correct 3 ms 13916 KB Output is correct
7 Correct 3 ms 13916 KB Output is correct
8 Correct 3 ms 13916 KB Output is correct
9 Correct 3 ms 13916 KB Output is correct
10 Correct 86 ms 31608 KB Output is correct
11 Correct 79 ms 32088 KB Output is correct
12 Correct 52 ms 24404 KB Output is correct
13 Correct 42 ms 23628 KB Output is correct
14 Correct 47 ms 29264 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 29020 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13912 KB Output is correct
2 Correct 3 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 3 ms 13916 KB Output is correct
5 Correct 3 ms 14008 KB Output is correct
6 Correct 3 ms 13916 KB Output is correct
7 Correct 3 ms 13916 KB Output is correct
8 Correct 3 ms 13916 KB Output is correct
9 Correct 3 ms 13916 KB Output is correct
10 Correct 3 ms 14168 KB Output is correct
11 Correct 3 ms 14172 KB Output is correct
12 Correct 3 ms 14168 KB Output is correct
13 Correct 44 ms 29528 KB Output is correct
14 Correct 59 ms 34136 KB Output is correct
15 Correct 51 ms 29308 KB Output is correct
16 Correct 86 ms 31608 KB Output is correct
17 Correct 79 ms 32088 KB Output is correct
18 Correct 52 ms 24404 KB Output is correct
19 Correct 42 ms 23628 KB Output is correct
20 Correct 47 ms 29264 KB Output is correct
21 Correct 16 ms 16984 KB Output is correct
22 Correct 61 ms 24404 KB Output is correct
23 Correct 56 ms 24468 KB Output is correct
24 Correct 92 ms 30544 KB Output is correct
25 Correct 47 ms 22992 KB Output is correct
26 Correct 64 ms 23988 KB Output is correct
27 Correct 54 ms 23120 KB Output is correct

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13912 KB Output is correct
2 Correct 3 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 3 ms 13916 KB Output is correct
5 Correct 3 ms 14008 KB Output is correct
6 Correct 3 ms 13916 KB Output is correct
7 Correct 3 ms 13916 KB Output is correct
8 Correct 3 ms 13916 KB Output is correct
9 Correct 3 ms 13916 KB Output is correct
10 Correct 56 ms 26664 KB Output is correct
11 Correct 35 ms 25168 KB Output is correct
12 Correct 110 ms 40896 KB Output is correct
13 Correct 54 ms 25692 KB Output is correct
14 Correct 77 ms 26956 KB Output is correct
15 Correct 3 ms 14168 KB Output is correct
16 Correct 3 ms 14172 KB Output is correct
17 Correct 3 ms 14168 KB Output is correct
18 Correct 44 ms 29528 KB Output is correct
19 Correct 59 ms 34136 KB Output is correct
20 Correct 51 ms 29308 KB Output is correct
21 Runtime error 46 ms 32856 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -