oj.uz

Submission #848037

# Submission time Handle Problem Language Result Execution time Memory
848037 2023-09-11T06:22:54 Z TimDee Cat in a tree (BOI17_catinatree) C++17
51 / 100
 365 ms 331040 KB 
//  Esti <3

//\
     šťastia pre nás :)
//   you're already the best
//             _
//   ^ ^      //
// >(O_O)<___//
//   \ __ __  \
//    \\ \\ \\\\
 
#include <bits/stdc++.h>
using namespace std;
 
//#pragma GCC optimize("O3","unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")

using ll = long long;
//#define int long long
#define forn(i,n) for(int i=0; i<(n); ++i)
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second 
#define vii(a,n) vector<int> a(n); forn(i,n) cin>>a[i];
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = 1e18;
const int mod = 998244353;
 
// \
\
:smiling_face_with_3_hearts: :smiling_face_with_3_hearts:  :smiling_face_with_3_hearts:  
 
//vidime sa veľmi skoro, moje slnko

const int N=2e5+5, D=500;

vector<int> adj[N];
vector<vector<int>> dp;


int n,d; 
 
void dfs(int u) {
	dp[u][0]=1;
	vector<int> sum(d);
	for(auto&v:adj[u]) {
		dfs(v);
		int m=0;
		for (int i=d-1; i>=0; --i) {
			m=max(m,dp[v][i]);
			sum[i]+=m;
		}
	}
	for(int i=d-2; i>=0; --i) sum[i]=max(sum[i],sum[i+1]);
 
	for(auto&v:adj[u]) {
		for (int i=0; i<=d-2; ++i) {
			dp[u][i+1]=max(dp[u][i+1],dp[v][i]+sum[max(d-2-i,i)]-dp[v][max(d-i-2,i)]);
		}
		dp[u][d-1]=max(dp[u][d-1],sum[d-2]);
	}
	dp[u][0]=sum[d-1]+1;
	for (int i=d; i>=0; --i) {
		dp[u][i]=max(dp[u][i],dp[u][i+1]);
	}
 
}

void solve() {

	cin>>n>>d;
	if (d==1) {
		cout<<n<<'\n'; return;
	}
	for (int i=1; i<n; ++i) {
		int p; cin>>p;
		adj[p].pb(i); //adj[i].pb(p);
	}
	if (1ll*n*d > 100000000) exit(0);
	dp.assign(n,vector<int>(d+2,0));
	dfs(0);
	cout<<dp[0][0];

}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t=1;
    //cin>>t;
    while (t--) solve();
    return 0;
}

Compilation message

catinatree.cpp:3:1: warning: multi-line comment [-Wcomment]
    3 | //\
      | ^
catinatree.cpp:9:1: warning: multi-line comment [-Wcomment]
    9 | //   \ __ __  \
      | ^
catinatree.cpp:36:1: warning: multi-line comment [-Wcomment]
   36 | // \
      | ^
catinatree.cpp:33:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   33 | const int inf = 1e18;
      |                 ^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 5020 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 17 ms 16984 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 5212 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 1 ms 5160 KB Output is correct
27 Correct 1 ms 5212 KB Output is correct
28 Correct 2 ms 5212 KB Output is correct
29 Correct 2 ms 5160 KB Output is correct
30 Correct 2 ms 5212 KB Output is correct
31 Correct 2 ms 5468 KB Output is correct
32 Correct 2 ms 5412 KB Output is correct
33 Correct 1 ms 5212 KB Output is correct
34 Correct 1 ms 5212 KB Output is correct
35 Correct 1 ms 5208 KB Output is correct
36 Correct 2 ms 5208 KB Output is correct
37 Correct 1 ms 5208 KB Output is correct
38 Correct 2 ms 5720 KB Output is correct
39 Correct 2 ms 5724 KB Output is correct
40 Correct 2 ms 5468 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 5020 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 17 ms 16984 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 5212 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 1 ms 5160 KB Output is correct
27 Correct 1 ms 5212 KB Output is correct
28 Correct 2 ms 5212 KB Output is correct
29 Correct 2 ms 5160 KB Output is correct
30 Correct 2 ms 5212 KB Output is correct
31 Correct 2 ms 5468 KB Output is correct
32 Correct 2 ms 5412 KB Output is correct
33 Correct 1 ms 5212 KB Output is correct
34 Correct 1 ms 5212 KB Output is correct
35 Correct 1 ms 5208 KB Output is correct
36 Correct 2 ms 5208 KB Output is correct
37 Correct 1 ms 5208 KB Output is correct
38 Correct 2 ms 5720 KB Output is correct
39 Correct 2 ms 5724 KB Output is correct
40 Correct 2 ms 5468 KB Output is correct
41 Correct 49 ms 23200 KB Output is correct
42 Correct 1 ms 4956 KB Output is correct
43 Correct 44 ms 18960 KB Output is correct
44 Correct 65 ms 31568 KB Output is correct
45 Correct 120 ms 50260 KB Output is correct
46 Correct 82 ms 20468 KB Output is correct
47 Correct 134 ms 48464 KB Output is correct
48 Correct 177 ms 79956 KB Output is correct
49 Correct 354 ms 173904 KB Output is correct
50 Correct 17 ms 11356 KB Output is correct
51 Correct 25 ms 14568 KB Output is correct
52 Correct 33 ms 16220 KB Output is correct
53 Correct 47 ms 17788 KB Output is correct
54 Correct 65 ms 24212 KB Output is correct
55 Correct 90 ms 30308 KB Output is correct
56 Correct 2 ms 5208 KB Output is correct
57 Correct 365 ms 331040 KB Output is correct
58 Incorrect 11 ms 8536 KB Output isn't correct
59 Halted 0 ms 0 KB -