Submission #736614

# Submission time Handle Problem Language Result Execution time Memory
736614 2023-05-06T02:43:56 Z josanneo22 Cat in a tree (BOI17_catinatree) C++17
100 / 100
13 ms 6300 KB
#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define pii pair<int,int>
const int inf=1000000010;
const int MAXN=200010, LOG=20;
char buf[1<<23],*p1=buf,*p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline int rd()
{
	int s=0;
	char ch=getchar(),last;
	while(ch<'0'||ch>'9') last=ch,ch=getchar();
	while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();
	return last=='-'?-s:s;
}
int num[100];
inline void rt(int x)
{
	if(x<0) putchar('-'),x=-x;;
	int len=0;
	do num[len++]=x%10;while(x/=10);
	while(len--) putchar(num[len]+'0');
}

int n, D;
int par[MAXN];
pii dp[MAXN][2], dpt[2];
 
inline void Add(int v, int u){
	for (int i:{0, 1}) dpt[i]=dp[v][i];
	for (int i:{0, 1}) for (int j:{0, 1}) if (dpt[i].second+dp[u][j].second>=D){
		pii p={dpt[i].first+dp[u][j].first, min(dpt[i].second, dp[u][j].second)};
		if (p>dp[v][0]) swap(dp[v][0], p);
		if (p.first!=dp[v][0].first && p>dp[v][1]) swap(dp[v][1], p);
	}
}

void solve(){
	n=rd(),D=rd();
	for (int i=1; i<n; i++)par[i]=rd();
	for (int i=0; i<n; i++) dp[i][0]={1, 0}, dp[i][1]={0, inf};
	for (int i=n-1; i; i--){
		dp[i][0].second++;
		dp[i][1].second++;
		Add(par[i], i);
	}
	rt(dp[0][0].first);
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	solve();
}

Compilation message

catinatree.cpp: In function 'int rd()':
catinatree.cpp:16:18: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
   16 |  return last=='-'?-s:s;
      |         ~~~~~~~~~^~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 7 ms 5872 KB Output is correct
42 Correct 6 ms 3284 KB Output is correct
43 Correct 8 ms 3412 KB Output is correct
44 Correct 5 ms 3284 KB Output is correct
45 Correct 5 ms 3284 KB Output is correct
46 Correct 13 ms 6188 KB Output is correct
47 Correct 10 ms 6228 KB Output is correct
48 Correct 11 ms 6228 KB Output is correct
49 Correct 10 ms 6216 KB Output is correct
50 Correct 3 ms 3028 KB Output is correct
51 Correct 4 ms 3028 KB Output is correct
52 Correct 4 ms 3008 KB Output is correct
53 Correct 7 ms 5764 KB Output is correct
54 Correct 7 ms 5644 KB Output is correct
55 Correct 7 ms 5716 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 980 KB Output is correct
58 Correct 4 ms 3332 KB Output is correct
59 Correct 10 ms 6300 KB Output is correct
60 Correct 8 ms 6060 KB Output is correct
61 Correct 10 ms 5944 KB Output is correct