oj.uz

Submission #896235

# Submission time Handle Problem Language Result Execution time Memory
896235 2024-01-01T03:59:10 Z 8pete8 Magic Tree (CEOI19_magictree) C++17
70 / 100
 85 ms 37572 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 dp[mxn+10][22],hvy[mxn+10],sz[mxn+10],sum[mxn+10];
pii info[mxn+10];
multiset<int>v[mxn+10];
int n,m,k;
int 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]);
}
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){
		dfs(1,-1);
		ans=0;
		for(int i=0;i<=k;i++)ans=max(ans,dp[1][i]);
		cout<<ans;
	}
	else{//sub 2
		cout<<ans;
	}
	return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 11868 KB Output is correct
2 Correct 16 ms 13568 KB Output is correct
3 Correct 28 ms 13656 KB Output is correct
4 Correct 25 ms 13136 KB Output is correct
5 Correct 28 ms 13752 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Correct 3 ms 12176 KB Output is correct
3 Correct 3 ms 12376 KB Output is correct
4 Correct 47 ms 26516 KB Output is correct
5 Correct 64 ms 31120 KB Output is correct
6 Correct 58 ms 26452 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 28240 KB Output is correct
2 Correct 41 ms 28416 KB Output is correct
3 Correct 39 ms 32080 KB Output is correct
4 Correct 27 ms 27352 KB Output is correct
5 Correct 41 ms 37572 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 2 ms 12124 KB Output is correct
5 Correct 2 ms 12124 KB Output is correct
6 Correct 2 ms 12120 KB Output is correct
7 Correct 2 ms 12124 KB Output is correct
8 Correct 2 ms 12124 KB Output is correct
9 Correct 2 ms 12124 KB Output is correct
10 Correct 78 ms 29192 KB Output is correct
11 Correct 84 ms 29644 KB Output is correct
12 Correct 51 ms 21688 KB Output is correct
13 Correct 41 ms 21452 KB Output is correct
14 Correct 46 ms 26712 KB Output is correct

Subtask #6
0 / 13.0

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

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 2 ms 12124 KB Output is correct
5 Correct 2 ms 12124 KB Output is correct
6 Correct 2 ms 12120 KB Output is correct
7 Correct 2 ms 12124 KB Output is correct
8 Correct 2 ms 12124 KB Output is correct
9 Correct 2 ms 12124 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct
11 Correct 3 ms 12176 KB Output is correct
12 Correct 3 ms 12376 KB Output is correct
13 Correct 47 ms 26516 KB Output is correct
14 Correct 64 ms 31120 KB Output is correct
15 Correct 58 ms 26452 KB Output is correct
16 Correct 78 ms 29192 KB Output is correct
17 Correct 84 ms 29644 KB Output is correct
18 Correct 51 ms 21688 KB Output is correct
19 Correct 41 ms 21452 KB Output is correct
20 Correct 46 ms 26712 KB Output is correct
21 Correct 15 ms 15192 KB Output is correct
22 Correct 56 ms 22864 KB Output is correct
23 Correct 54 ms 22876 KB Output is correct
24 Correct 85 ms 29012 KB Output is correct
25 Correct 54 ms 21712 KB Output is correct
26 Correct 63 ms 22596 KB Output is correct
27 Correct 56 ms 21328 KB Output is correct

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 2 ms 12124 KB Output is correct
5 Correct 2 ms 12124 KB Output is correct
6 Correct 2 ms 12120 KB Output is correct
7 Correct 2 ms 12124 KB Output is correct
8 Correct 2 ms 12124 KB Output is correct
9 Correct 2 ms 12124 KB Output is correct
10 Correct 17 ms 11868 KB Output is correct
11 Correct 16 ms 13568 KB Output is correct
12 Correct 28 ms 13656 KB Output is correct
13 Correct 25 ms 13136 KB Output is correct
14 Correct 28 ms 13752 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 3 ms 12176 KB Output is correct
17 Correct 3 ms 12376 KB Output is correct
18 Correct 47 ms 26516 KB Output is correct
19 Correct 64 ms 31120 KB Output is correct
20 Correct 58 ms 26452 KB Output is correct
21 Correct 40 ms 28240 KB Output is correct
22 Correct 41 ms 28416 KB Output is correct
23 Correct 39 ms 32080 KB Output is correct
24 Correct 27 ms 27352 KB Output is correct
25 Correct 41 ms 37572 KB Output is correct
26 Correct 78 ms 29192 KB Output is correct
27 Correct 84 ms 29644 KB Output is correct
28 Correct 51 ms 21688 KB Output is correct
29 Correct 41 ms 21452 KB Output is correct
30 Correct 46 ms 26712 KB Output is correct
31 Incorrect 4 ms 10328 KB Output isn't correct
32 Halted 0 ms 0 KB -