oj.uz

Submission #896234

# Submission time Handle Problem Language Result Execution time Memory
896234 2024-01-01T03:56:06 Z 8pete8 Magic Tree (CEOI19_magictree) C++17
67 / 100
 91 ms 38632 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];
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};
		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);
		for(int i=0;i<=k;i++)ans=max(ans,dp[1][i]);
		cout<<ans;
		

	}
	return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 3.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9308 KB Output is correct
2 Correct 3 ms 9308 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 39 ms 25424 KB Output is correct
5 Correct 54 ms 30036 KB Output is correct
6 Correct 60 ms 27216 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 29520 KB Output is correct
2 Correct 39 ms 29532 KB Output is correct
3 Correct 37 ms 33368 KB Output is correct
4 Correct 26 ms 28756 KB Output is correct
5 Correct 33 ms 38632 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9308 KB Output is correct
2 Correct 3 ms 9308 KB Output is correct
3 Correct 2 ms 9228 KB Output is correct
4 Correct 4 ms 9304 KB Output is correct
5 Correct 2 ms 9308 KB Output is correct
6 Correct 2 ms 9308 KB Output is correct
7 Correct 2 ms 9308 KB Output is correct
8 Correct 2 ms 9308 KB Output is correct
9 Correct 2 ms 9308 KB Output is correct
10 Correct 78 ms 28244 KB Output is correct
11 Correct 79 ms 28728 KB Output is correct
12 Correct 75 ms 20560 KB Output is correct
13 Correct 39 ms 20428 KB Output is correct
14 Correct 46 ms 25684 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 9560 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 9308 KB Output is correct
2 Correct 3 ms 9308 KB Output is correct
3 Correct 2 ms 9228 KB Output is correct
4 Correct 4 ms 9304 KB Output is correct
5 Correct 2 ms 9308 KB Output is correct
6 Correct 2 ms 9308 KB Output is correct
7 Correct 2 ms 9308 KB Output is correct
8 Correct 2 ms 9308 KB Output is correct
9 Correct 2 ms 9308 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 3 ms 9308 KB Output is correct
12 Correct 2 ms 9564 KB Output is correct
13 Correct 39 ms 25424 KB Output is correct
14 Correct 54 ms 30036 KB Output is correct
15 Correct 60 ms 27216 KB Output is correct
16 Correct 78 ms 28244 KB Output is correct
17 Correct 79 ms 28728 KB Output is correct
18 Correct 75 ms 20560 KB Output is correct
19 Correct 39 ms 20428 KB Output is correct
20 Correct 46 ms 25684 KB Output is correct
21 Correct 16 ms 14684 KB Output is correct
22 Correct 73 ms 23064 KB Output is correct
23 Correct 78 ms 23120 KB Output is correct
24 Correct 91 ms 29928 KB Output is correct
25 Correct 63 ms 21968 KB Output is correct
26 Correct 81 ms 23228 KB Output is correct
27 Correct 54 ms 22128 KB Output is correct

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9308 KB Output is correct
2 Correct 3 ms 9308 KB Output is correct
3 Correct 2 ms 9228 KB Output is correct
4 Correct 4 ms 9304 KB Output is correct
5 Correct 2 ms 9308 KB Output is correct
6 Correct 2 ms 9308 KB Output is correct
7 Correct 2 ms 9308 KB Output is correct
8 Correct 2 ms 9308 KB Output is correct
9 Correct 2 ms 9308 KB Output is correct
10 Incorrect 17 ms 11352 KB Output isn't correct
11 Halted 0 ms 0 KB -