oj.uz

Submission #162926

# Submission time Handle Problem Language Result Execution time Memory
162926 2019-11-10T09:40:28 Z MvC Cat in a tree (BOI17_catinatree) C++11
100 / 100
 907 ms 409868 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int n,k,v[nmax],f[nmax][500],x,y,i,sf[nmax],pr[nmax],r,rs,sz[nmax];
vector<int>a[nmax];
void dfs(int x)
{
	int sm=0;
	for(int i=0;i<(int)a[x].size();i++)
	{
		int y=a[x][i];
		dfs(y);
		sm+=f[y][k-1];
	}
	f[x][0]=1+sm;
	for(int i=1;i<=k;i++)
	{
		for(int j=0;j<(int)a[x].size();j++)
		{
			int y=a[x][j];
			pr[j]=f[y][max(i-1,k-i-1)];
			if(j)pr[j]+=pr[j-1];
		}
		for(int j=(int)a[x].size()-1;j>=0;j--)
		{
			int y=a[x][j];
			sf[j]=f[y][max(i-1,k-i-1)];
			if(j<(int)a[x].size()-1)sf[j]+=sf[j+1];
		}
		for(int j=0;j<(int)a[x].size();j++)
		{
			int y=a[x][j];
			sm=f[y][i-1];
			if(j)sm+=pr[j-1];
			if(j<(int)a[x].size()-1)sm+=sf[j+1];
			f[x][i]=max(f[x][i],sm);
		}
	}
	for(int i=k;i>=0;i--)f[x][i]=max(f[x][i],f[x][i+1]);
}
void rfs(int x)
{
	sz[x]=1;
	for(int i=0;i<(int)a[x].size();i++)
	{
		int y=a[x][i];
		rfs(y);
	}
	for(int j=0;j<=r;j++)f[x][j]=-inf;
	f[x][1]=0;
	f[x][0]=inf;
	for(int i=0;i<(int)a[x].size();i++)
	{
		int y=a[x][i];
		for(int j=min(sz[x],r);j>=0;j--)
		{
			for(int t=0;t<=min(sz[y],r-j);t++)
			{
				if(f[x][j]+f[y][t]+1>=k)
				{
					f[x][j+t]=max(f[x][j+t],min(f[x][j],f[y][t]+1));
				}
			}
		}
		sz[x]+=sz[y];
	}
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>k;
	for(i=2;i<=n;i++)
	{
		cin>>x;
		x++;
		a[x].pb(i);
	}
	if(k*k<=n)
	{
		dfs(1);
		rs=f[1][0];
	}
	else
	{
		r=n/k+1;
		rfs(1);
		for(i=0;i<=r;i++)if(f[1][i]>=0)rs=i;
	}
	cout<<rs<<endl;
	return 0;
}

Compilation message

catinatree.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
catinatree.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5084 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 7 ms 5116 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 5112 KB Output is correct
8 Correct 7 ms 5112 KB Output is correct
9 Correct 7 ms 5112 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 7 ms 5240 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 5140 KB Output is correct
14 Correct 7 ms 5112 KB Output is correct
15 Correct 7 ms 5084 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 7 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 7 ms 5112 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 8 ms 6008 KB Output is correct
23 Correct 8 ms 6008 KB Output is correct
24 Correct 7 ms 6008 KB Output is correct
25 Correct 8 ms 7032 KB Output is correct
26 Correct 9 ms 7032 KB Output is correct
27 Correct 9 ms 7032 KB Output is correct
28 Correct 10 ms 8056 KB Output is correct
29 Correct 10 ms 8056 KB Output is correct
30 Correct 10 ms 8056 KB Output is correct
31 Correct 10 ms 8056 KB Output is correct
32 Correct 10 ms 7932 KB Output is correct
33 Correct 10 ms 7928 KB Output is correct
34 Correct 10 ms 7800 KB Output is correct
35 Correct 10 ms 7772 KB Output is correct
36 Correct 10 ms 8056 KB Output is correct
37 Correct 10 ms 7928 KB Output is correct
38 Correct 10 ms 8056 KB Output is correct
39 Correct 10 ms 8056 KB Output is correct
40 Correct 10 ms 8184 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5084 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 7 ms 5116 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 5112 KB Output is correct
8 Correct 7 ms 5112 KB Output is correct
9 Correct 7 ms 5112 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 7 ms 5240 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 5140 KB Output is correct
14 Correct 7 ms 5112 KB Output is correct
15 Correct 7 ms 5084 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 7 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 7 ms 5112 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 8 ms 6008 KB Output is correct
23 Correct 8 ms 6008 KB Output is correct
24 Correct 7 ms 6008 KB Output is correct
25 Correct 8 ms 7032 KB Output is correct
26 Correct 9 ms 7032 KB Output is correct
27 Correct 9 ms 7032 KB Output is correct
28 Correct 10 ms 8056 KB Output is correct
29 Correct 10 ms 8056 KB Output is correct
30 Correct 10 ms 8056 KB Output is correct
31 Correct 10 ms 8056 KB Output is correct
32 Correct 10 ms 7932 KB Output is correct
33 Correct 10 ms 7928 KB Output is correct
34 Correct 10 ms 7800 KB Output is correct
35 Correct 10 ms 7772 KB Output is correct
36 Correct 10 ms 8056 KB Output is correct
37 Correct 10 ms 7928 KB Output is correct
38 Correct 10 ms 8056 KB Output is correct
39 Correct 10 ms 8056 KB Output is correct
40 Correct 10 ms 8184 KB Output is correct
41 Correct 399 ms 381088 KB Output is correct
42 Correct 225 ms 202332 KB Output is correct
43 Correct 237 ms 202360 KB Output is correct
44 Correct 272 ms 202360 KB Output is correct
45 Correct 348 ms 202432 KB Output is correct
46 Correct 438 ms 399736 KB Output is correct
47 Correct 540 ms 399928 KB Output is correct
48 Correct 628 ms 399864 KB Output is correct
49 Correct 907 ms 399708 KB Output is correct
50 Correct 182 ms 201336 KB Output is correct
51 Correct 198 ms 201336 KB Output is correct
52 Correct 231 ms 201464 KB Output is correct
53 Correct 366 ms 397688 KB Output is correct
54 Correct 403 ms 397688 KB Output is correct
55 Correct 425 ms 397656 KB Output is correct
56 Correct 11 ms 9848 KB Output is correct
57 Correct 47 ms 49144 KB Output is correct
58 Correct 212 ms 212440 KB Output is correct
59 Correct 475 ms 409868 KB Output is correct
60 Correct 384 ms 391236 KB Output is correct
61 Correct 746 ms 380928 KB Output is correct