oj.uz

Submission #143226

# Submission time Handle Problem Language Result Execution time Memory
143226 2019-08-13T11:30:33 Z davitmarg Cat in a tree (BOI17_catinatree) C++17
51 / 100
 637 ms 524292 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int n,d,dp[200005][502],upd[200005][502],sz[200005],ans=1,D;
vector<int> g[200005];
void dfs(int v)
{
	sz[v]=1;
	for(int i=0;i<g[v].size();i++)
	{
		int to=g[v][i];
		dfs(to);
	}

	dp[v][0]=1;
	for(int i=0;i<g[v].size();i++)
	{
		int to=g[v][i];
		for(int k1=0;k1<=d && k1<=sz[v];k1++)
			for(int k2=0;k2<=d && k2<=sz[to];k2++)
				if(k1+k2+1>=d)
					upd[v][min(k2+1,k1)]=max(upd[v][min(k2+1,k1)],dp[to][k2]+dp[v][k1]);

		for(int k2=0;k2<=d && k2<=sz[to];k2++)
			upd[v][k2+1]=max(dp[to][k2],upd[v][k2+1]);

		sz[v]+=sz[to];
		for(int k=d;k>=0;k--)
		{
			dp[v][k]=max(dp[v][k],upd[v][k]);
			dp[v][k]=max(dp[v][k],dp[v][k+1]);
			upd[v][k]=0;
		}
	}


	for(int k=0;k<=d;k++)
		ans=max(ans,dp[v][k]);
}


void dfs2(int v)
{
	sz[v]=1;
	for(int i=0;i<g[v].size();i++)
	{
		int to=g[v][i];
		dfs2(to);
	}

	dp[v][1]=0;
	dp[v][0]=mod;

	for(int i=0;i<g[v].size();i++)
	{
		int to=g[v][i];
		for(int k1=0;k1<=D && k1<=sz[v];k1++)
			for(int k2=0;k2<=D && k2<=sz[to];k2++)
				if(dp[v][k1]+dp[to][k2]+1>=d)
					upd[v][k1+k2]=max(upd[v][k1+k2],min(dp[v][k1],dp[to][k2]+1));
		sz[v]+=sz[to];

		for(int k1=0;k1<=D && k1<=sz[v];k1++)
		{
			dp[v][k1]=max(dp[v][k1],upd[v][k1]);
			upd[v][k1]=-mod;
		}
	}
	
	// cout<<"!"<<v<<endl;
	// for(int k1=0;k1<=D && k1<=sz[v];k1++)
	// 	cout<<k1<<" = "<<dp[v][k1]<<endl;
	// cout<<endl;

	for(int k1=1;k1<=D && k1<=sz[v];k1++)
		if(dp[v][k1]>=0)
			ans=max(ans,k1);

}

int main()
{
	cin>>n>>d;
	for(int i=1;i<n;i++)
	{
		int p;
		scanf("%d",&p);
		g[p].PB(i);
	}
	D=(n-1)/d+1;
	D++;
	if(D<=d)
	{
		for(int i=0;i<n;i++)
			for(int j=0;j<=D;j++)
				dp[i][j]=upd[i][j]=-mod;
		dfs2(0);
	}
	else
		dfs(0);

	cout<<ans<<endl;
	return 0;
}
 
/*

2 3
0 

4 3
0
0
0

*/

Compilation message

catinatree.cpp: In function 'void dfs(int)':
catinatree.cpp:31:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[v].size();i++)
              ~^~~~~~~~~~~~
catinatree.cpp:38:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[v].size();i++)
              ~^~~~~~~~~~~~
catinatree.cpp: In function 'void dfs2(int)':
catinatree.cpp:67:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[v].size();i++)
              ~^~~~~~~~~~~~
catinatree.cpp:76:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[v].size();i++)
              ~^~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:109:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&p);
   ~~~~~^~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 8 ms 5084 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 8 ms 5084 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 11 ms 11128 KB Output is correct
22 Correct 8 ms 6624 KB Output is correct
23 Correct 8 ms 6648 KB Output is correct
24 Correct 8 ms 6652 KB Output is correct
25 Correct 10 ms 8284 KB Output is correct
26 Correct 9 ms 8312 KB Output is correct
27 Correct 9 ms 8312 KB Output is correct
28 Correct 12 ms 9976 KB Output is correct
29 Correct 12 ms 10104 KB Output is correct
30 Correct 13 ms 9976 KB Output is correct
31 Correct 12 ms 11004 KB Output is correct
32 Correct 9 ms 8028 KB Output is correct
33 Correct 9 ms 8056 KB Output is correct
34 Correct 9 ms 7928 KB Output is correct
35 Correct 9 ms 7928 KB Output is correct
36 Correct 9 ms 8184 KB Output is correct
37 Correct 9 ms 8176 KB Output is correct
38 Correct 12 ms 11000 KB Output is correct
39 Correct 11 ms 11000 KB Output is correct
40 Correct 12 ms 11128 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 8 ms 5084 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 11 ms 11128 KB Output is correct
22 Correct 8 ms 6624 KB Output is correct
23 Correct 8 ms 6648 KB Output is correct
24 Correct 8 ms 6652 KB Output is correct
25 Correct 10 ms 8284 KB Output is correct
26 Correct 9 ms 8312 KB Output is correct
27 Correct 9 ms 8312 KB Output is correct
28 Correct 12 ms 9976 KB Output is correct
29 Correct 12 ms 10104 KB Output is correct
30 Correct 13 ms 9976 KB Output is correct
31 Correct 12 ms 11004 KB Output is correct
32 Correct 9 ms 8028 KB Output is correct
33 Correct 9 ms 8056 KB Output is correct
34 Correct 9 ms 7928 KB Output is correct
35 Correct 9 ms 7928 KB Output is correct
36 Correct 9 ms 8184 KB Output is correct
37 Correct 9 ms 8176 KB Output is correct
38 Correct 12 ms 11000 KB Output is correct
39 Correct 11 ms 11000 KB Output is correct
40 Correct 12 ms 11128 KB Output is correct
41 Runtime error 637 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -