oj.uz

Submission #277835

# Submission time Handle Problem Language Result Execution time Memory
277835 2020-08-21T07:41:21 Z Fasho Magic Tree (CEOI19_magictree) C++14
19 / 100
 77 ms 30456 KB 
#include <bits/stdc++.h>
#define N 100005
#define ll long long int
#define fo(i,x,y)	for(int i=x;i<=y;i++)
#define fs(ar,n) fo(i,1,n) cin>>ar[i]
#define sp " "
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll> 
#define mod 1000000007
using namespace std;

ll n,m,ar[N],sum,t,k,dp[1005][1005],val[N],dad[N],tut[N];

vector<int> v[N];
// vector<int> v2[N];

ll f(int ind,int back,int l)
{
	if(dp[ind][l]!=-1)
		return dp[ind][l];
	ll t1=0;
	ll t2=0;
	for(int i=0;i<v[ind].size();i++)
		t1+=f(v[ind][i],ind,l);
	if(ar[ind]<ar[l] && ar[ind]!=0)
		for(int i=0;i<v[ind].size();i++)
			t2+=f(v[ind][i],ind,ind);

	if(ar[ind]<ar[l] && ar[ind]!=0)
		t2+=val[ind];
	if(ar[ind]==ar[l] && ar[l]!=0)
		t1+=val[ind];
	// cout<<ind<<sp<<l<<sp<<t1<<sp<<t2<<endl;
	return dp[ind][l]=max(t1,t2);
}
// ll f(int ind,int back,int l)
// {
// 	if(dp[ind][l]!=-1)
// 		return dp[ind][l];
// 	ll t1=0;
// 	ll t2=0;
// 	for(int i=0;i<v[ind].size();i++)
// 		t1+=f(v[ind][i],ind,l);
// 	if(ar[ind]<l && ar[ind]!=0)
// 		for(int i=0;i<v[ind].size();i++)
// 			t2+=f(v[ind][i],ind,ar[ind]);
 
// 	if(ar[ind]<l && ar[ind]!=0)
// 		t2+=val[ind];
// 	if(ar[ind]==l && l!=0)
// 		t1+=val[ind];
// 	// cout<<ind<<sp<<l<<sp<<t1<<sp<<t2<<endl;
// 	return dp[ind][l]=max(t1,t2);
// }
 
ll find(int x)
{
	if(dad[x]==x)
		return x;
	return dad[x]=find(dad[x]);
}

int main()
{
	fast;
	cin>>n>>m>>k;
	memset(dp,-1,sizeof(dp));
	fo(i,2,n)
	{
		int a;
		cin>>a;
		// v[a].pb(i);
		dad[i]=a;
	}
	fo(i,1,m)
	{
		ll a,b,c;
		cin>>a>>b>>c;
		ar[a]=b;
		val[a]=c;
	}
	dad[1]=1;
	ar[0]=1e7;
 	ll cnt=1;
 	tut[1]=1;
	fo(i,2,n)
		if(ar[i])
		{
			cnt++;
			v[tut[find(i)]].pb(cnt);
			tut[i]=cnt;
			ar[cnt]=ar[i];
			val[cnt]=val[i];
			// cout<<i<<sp<<tut[find(i)]<<endl;
			dad[i]=i;
		}
	cout<<f(1,1,0);
	// fo(i,1,n)
	// 	sum+=val[i];
	// cout<<sum<<endl;
	// cout<<endl;

	// fo(i,1,n)
	// cout<<val[i]<<sp;
	// cout<<endl;


}

Compilation message

magictree.cpp: In function 'long long int f(int, int, int)':
magictree.cpp:28:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i=0;i<v[ind].size();i++)
      |              ~^~~~~~~~~~~~~~
magictree.cpp:31:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for(int i=0;i<v[ind].size();i++)
      |               ~^~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 57 ms 28024 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 10752 KB Output is correct
2 Correct 12 ms 10752 KB Output is correct
3 Correct 13 ms 10752 KB Output is correct
4 Incorrect 70 ms 18808 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 77 ms 30456 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10624 KB Output is correct
2 Correct 7 ms 10624 KB Output is correct
3 Correct 8 ms 10624 KB Output is correct
4 Correct 7 ms 10624 KB Output is correct
5 Correct 7 ms 10624 KB Output is correct
6 Correct 8 ms 10624 KB Output is correct
7 Correct 9 ms 10624 KB Output is correct
8 Correct 7 ms 10624 KB Output is correct
9 Correct 7 ms 10624 KB Output is correct
10 Runtime error 67 ms 30456 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 11264 KB Output is correct
2 Correct 20 ms 14284 KB Output is correct
3 Correct 18 ms 14208 KB Output is correct
4 Correct 22 ms 14336 KB Output is correct
5 Correct 15 ms 13952 KB Output is correct
6 Correct 25 ms 14336 KB Output is correct
7 Correct 23 ms 14336 KB Output is correct

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10624 KB Output is correct
2 Correct 7 ms 10624 KB Output is correct
3 Correct 8 ms 10624 KB Output is correct
4 Correct 7 ms 10624 KB Output is correct
5 Correct 7 ms 10624 KB Output is correct
6 Correct 8 ms 10624 KB Output is correct
7 Correct 9 ms 10624 KB Output is correct
8 Correct 7 ms 10624 KB Output is correct
9 Correct 7 ms 10624 KB Output is correct
10 Correct 12 ms 10752 KB Output is correct
11 Correct 12 ms 10752 KB Output is correct
12 Correct 13 ms 10752 KB Output is correct
13 Incorrect 70 ms 18808 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10624 KB Output is correct
2 Correct 7 ms 10624 KB Output is correct
3 Correct 8 ms 10624 KB Output is correct
4 Correct 7 ms 10624 KB Output is correct
5 Correct 7 ms 10624 KB Output is correct
6 Correct 8 ms 10624 KB Output is correct
7 Correct 9 ms 10624 KB Output is correct
8 Correct 7 ms 10624 KB Output is correct
9 Correct 7 ms 10624 KB Output is correct
10 Runtime error 57 ms 28024 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -