oj.uz

답안 #896241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896241 2024-01-01T05:07:37 Z 8pete8 Magic Tree (CEOI19_magictree) C++17
70 / 100
 100 ms 43420 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];
ll dp[mxn+10][22];
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<=20){
		ans=0;
		dfs(1,-1);
		for(int i=0;i<=k;i++)ans=max(ans,dp[1][i]);
		cout<<ans;
	}
	else{
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 26864 KB Output is correct
2 Correct 38 ms 25428 KB Output is correct
3 Correct 100 ms 40336 KB Output is correct
4 Correct 56 ms 25296 KB Output is correct
5 Correct 78 ms 26196 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 42 ms 29020 KB Output is correct
5 Correct 57 ms 33620 KB Output is correct
6 Correct 51 ms 28836 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 32848 KB Output is correct
2 Correct 45 ms 34224 KB Output is correct
3 Correct 40 ms 38224 KB Output is correct
4 Correct 26 ms 32724 KB Output is correct
5 Correct 37 ms 43420 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 86 ms 31596 KB Output is correct
11 Correct 78 ms 32004 KB Output is correct
12 Correct 52 ms 24152 KB Output is correct
13 Correct 42 ms 23764 KB Output is correct
14 Correct 47 ms 29016 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 17 ms 30552 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 42 ms 29020 KB Output is correct
14 Correct 57 ms 33620 KB Output is correct
15 Correct 51 ms 28836 KB Output is correct
16 Correct 86 ms 31596 KB Output is correct
17 Correct 78 ms 32004 KB Output is correct
18 Correct 52 ms 24152 KB Output is correct
19 Correct 42 ms 23764 KB Output is correct
20 Correct 47 ms 29016 KB Output is correct
21 Correct 19 ms 17812 KB Output is correct
22 Correct 56 ms 25172 KB Output is correct
23 Correct 55 ms 25284 KB Output is correct
24 Correct 83 ms 31316 KB Output is correct
25 Correct 48 ms 23760 KB Output is correct
26 Correct 65 ms 24764 KB Output is correct
27 Correct 59 ms 23732 KB Output is correct

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 56 ms 26864 KB Output is correct
11 Correct 38 ms 25428 KB Output is correct
12 Correct 100 ms 40336 KB Output is correct
13 Correct 56 ms 25296 KB Output is correct
14 Correct 78 ms 26196 KB Output is correct
15 Correct 3 ms 14936 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 3 ms 14940 KB Output is correct
18 Correct 42 ms 29020 KB Output is correct
19 Correct 57 ms 33620 KB Output is correct
20 Correct 51 ms 28836 KB Output is correct
21 Correct 44 ms 32848 KB Output is correct
22 Correct 45 ms 34224 KB Output is correct
23 Correct 40 ms 38224 KB Output is correct
24 Correct 26 ms 32724 KB Output is correct
25 Correct 37 ms 43420 KB Output is correct
26 Correct 86 ms 31596 KB Output is correct
27 Correct 78 ms 32004 KB Output is correct
28 Correct 52 ms 24152 KB Output is correct
29 Correct 42 ms 23764 KB Output is correct
30 Correct 47 ms 29016 KB Output is correct
31 Runtime error 17 ms 30552 KB Execution killed with signal 6
32 Halted 0 ms 0 KB -