oj.uz

Submission #143241

# Submission time Handle Problem Language Result Execution time Memory
143241 2019-08-13T11:52:44 Z davitmarg Cat in a tree (BOI17_catinatree) C++17
100 / 100
 757 ms 410988 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[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++)
			upd[k1]=dp[v][k1];
		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)
					dp[v][min(k2+1,k1)]=max(dp[v][min(k2+1,k1)],dp[to][k2]+upd[k1]);

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

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


	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=min(D,sz[v]);k1>=0;k1--)
			for(int k2=0;k2<=D && k2<=sz[to];k2++)
				if(dp[v][k1]+dp[to][k2]+1>=d)
					dp[v][k1+k2]=max(dp[v][k1+k2],min(dp[v][k1],dp[to][k2]+1));
		sz[v]+=sz[to];
	}
	
	// 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]=-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:66:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[v].size();i++)
              ~^~~~~~~~~~~~
catinatree.cpp:75: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:102: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 4984 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 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 8 ms 4856 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 8 ms 5240 KB Output is correct
18 Correct 8 ms 4984 KB Output is correct
19 Correct 6 ms 4984 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 4984 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 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 8 ms 4856 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 8 ms 5240 KB Output is correct
18 Correct 8 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 7 ms 6008 KB Output is correct
23 Correct 7 ms 6008 KB Output is correct
24 Correct 7 ms 6008 KB Output is correct
25 Correct 8 ms 7036 KB Output is correct
26 Correct 8 ms 7032 KB Output is correct
27 Correct 8 ms 7032 KB Output is correct
28 Correct 9 ms 7928 KB Output is correct
29 Correct 9 ms 8056 KB Output is correct
30 Correct 9 ms 7928 KB Output is correct
31 Correct 11 ms 7928 KB Output is correct
32 Correct 9 ms 7928 KB Output is correct
33 Correct 9 ms 7928 KB Output is correct
34 Correct 9 ms 7800 KB Output is correct
35 Correct 9 ms 7800 KB Output is correct
36 Correct 9 ms 8056 KB Output is correct
37 Correct 9 ms 7928 KB Output is correct
38 Correct 9 ms 8056 KB Output is correct
39 Correct 9 ms 8056 KB Output is correct
40 Correct 11 ms 8184 KB Output is correct

Subtask #3
49.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 4984 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 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 8 ms 4856 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 8 ms 5240 KB Output is correct
18 Correct 8 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 7 ms 6008 KB Output is correct
23 Correct 7 ms 6008 KB Output is correct
24 Correct 7 ms 6008 KB Output is correct
25 Correct 8 ms 7036 KB Output is correct
26 Correct 8 ms 7032 KB Output is correct
27 Correct 8 ms 7032 KB Output is correct
28 Correct 9 ms 7928 KB Output is correct
29 Correct 9 ms 8056 KB Output is correct
30 Correct 9 ms 7928 KB Output is correct
31 Correct 11 ms 7928 KB Output is correct
32 Correct 9 ms 7928 KB Output is correct
33 Correct 9 ms 7928 KB Output is correct
34 Correct 9 ms 7800 KB Output is correct
35 Correct 9 ms 7800 KB Output is correct
36 Correct 9 ms 8056 KB Output is correct
37 Correct 9 ms 7928 KB Output is correct
38 Correct 9 ms 8056 KB Output is correct
39 Correct 9 ms 8056 KB Output is correct
40 Correct 11 ms 8184 KB Output is correct
41 Correct 369 ms 383988 KB Output is correct
42 Correct 210 ms 204100 KB Output is correct
43 Correct 235 ms 204124 KB Output is correct
44 Correct 259 ms 204152 KB Output is correct
45 Correct 302 ms 204024 KB Output is correct
46 Correct 443 ms 403180 KB Output is correct
47 Correct 509 ms 403320 KB Output is correct
48 Correct 581 ms 403288 KB Output is correct
49 Correct 757 ms 403344 KB Output is correct
50 Correct 183 ms 202876 KB Output is correct
51 Correct 199 ms 202884 KB Output is correct
52 Correct 197 ms 202872 KB Output is correct
53 Correct 375 ms 400632 KB Output is correct
54 Correct 386 ms 400632 KB Output is correct
55 Correct 409 ms 400672 KB Output is correct
56 Correct 13 ms 9976 KB Output is correct
57 Correct 58 ms 49144 KB Output is correct
58 Correct 199 ms 212312 KB Output is correct
59 Correct 421 ms 410988 KB Output is correct
60 Correct 377 ms 394224 KB Output is correct
61 Correct 686 ms 384332 KB Output is correct