oj.uz

Submission #278033

# Submission time Handle Problem Language Result Execution time Memory
278033 2020-08-21T09:08:26 Z AKaan37 Magic Tree (CEOI19_magictree) C++17
3 / 100
 131 ms 39524 KB 
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define int long long
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 100005;
const lo mod = 1000000007;
 
int n,m,b[li],a[li],k,flag,t,dp[li][25],tree[li*4],cevap;
int cev;
string s;
PII p[li];
vector<int> v[li];
 
inline void dfs(int node,int ata){
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i];
		if(go==ata)continue;
		dfs(go,node);
	}
	
	if(p[node].fi!=0){
		for(int i=p[node].fi;i<=p[node].fi;i++){
			dp[node][i]=max(dp[node][i],(dp[node][p[node].fi]+p[node].se));
		}
	}
	for(int i=1;i<=k;i++)dp[node][i]=max(dp[node][i],dp[node][i-1]);
	//~ cout
	for(int i=1;i<=k;i++){
		dp[ata][i]+=(dp[node][i]);
	}
}

inline void update(int node,int start,int end,int l,int r,int val){
	if(start>end || start>r || end<l)return ;
	if(start>=l && end<=r){tree[node]+=val;return ;}
	update(node*2,start,mid,l,r,val),update(node*2+1,mid+1,end,l,r,val);
	tree[node]=tree[node*2]+tree[node*2+1];
}

inline int query(int node,int start,int end,int l,int r){
	if(start>end || start>r || end<l)return 0;
	if(start>=l && end<=r)return tree[node];
	return query(node*2,start,mid,l,r)+query(node*2+1,mid+1,end,l,r);
}
 
inline void solve(int node,int ata){
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i];
		if(go==ata)continue;
		solve(go,node);
	}
	if(p[node].fi!=0){
		update(1,1,n,p[node].fi,p[node].fi,p[node].se);
		cevap=max(cevap,query(1,1,n,1,p[node].fi));
	}
}

main(void){
	scanf("%lld %lld %lld",&n,&m,&k);
	int yes=0;
	for(int i=2;i<=n;i++){
		int x;
		scanf("%lld",&x);
		v[i].pb(x);
		v[x].pb(i);
		if(x==i-1)yes++;
	}
	for(int i=1;i<=m;i++){
		int x,y,z;
		scanf("%lld %lld %lld",&x,&y,&z);
		cev+=z;
		p[x].fi=y;
		p[x].se=z;
	}
	if(k<=20){
		cev=0;
		dfs(1,0);
		for(int i=1;i<=k;i++)cev=max(cev,dp[i][k]);
	}
	if(yes==n-1){
		solve(1,0);
		printf("%lld\n",cevap);
		return 0;
	}
	printf("%lld\n",cev);
	return 0;
}

Compilation message

magictree.cpp:80:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   80 | main(void){
      |          ^
magictree.cpp: In function 'int main()':
magictree.cpp:81:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   81 |  scanf("%lld %lld %lld",&n,&m,&k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:85:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   85 |   scanf("%lld",&x);
      |   ~~~~~^~~~~~~~~~~
magictree.cpp:92:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   92 |   scanf("%lld %lld %lld",&x,&y,&z);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Incorrect 2 ms 2688 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 8056 KB Output is correct
2 Correct 50 ms 6396 KB Output is correct
3 Correct 78 ms 8440 KB Output is correct
4 Correct 95 ms 8172 KB Output is correct
5 Correct 75 ms 8440 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 27544 KB Output is correct
2 Correct 131 ms 27512 KB Output is correct
3 Correct 103 ms 29048 KB Output is correct
4 Correct 71 ms 27752 KB Output is correct
5 Incorrect 124 ms 39524 KB Output isn't correct

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Incorrect 2 ms 2688 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Incorrect 2 ms 2688 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Incorrect 2 ms 2688 KB Output isn't correct
7 Halted 0 ms 0 KB -