oj.uz

Submission #277756

# Submission time Handle Problem Language Result Execution time Memory
277756 2020-08-21T07:12:52 Z Fasho Magic Tree (CEOI19_magictree) C++14
0 / 100
 71 ms 30200 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];

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);
}



int main()
{
	fast;
	cin>>n>>m>>k;
	memset(dp,-1,sizeof(dp));
	fo(i,2,n)
	{
		int a;
		cin>>a;
		// v2[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]=1e10;
	fo(i,1,n)
		if(ar[i])
		{
			v[dad[dad[i]]].pb(i);
			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
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 Incorrect 8 ms 10624 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 71 ms 30200 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 Incorrect 8 ms 10624 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

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 Incorrect 8 ms 10624 KB Output isn't correct
4 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 Incorrect 8 ms 10624 KB Output isn't correct
4 Halted 0 ms 0 KB -