oj.uz

답안 #848040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848040 2023-09-11T07:06:53 Z TimDee Cat in a tree (BOI17_catinatree) C++17
51 / 100
 384 ms 335668 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]);
	}
 
}


vector<pi> z[N]; // z[u][k] = {dist, val}

void dfs2(int u) {
	z[u].pb({0,1});
	for(auto&v:adj[u]) {
		dfs2(v);
		z[u][0].f = max(z[u][0].f, z[v][0].f+1);
	}
}

void bigD() {
	dp.assign(n,vector<int>(2*n/d+2,0));
	exit(0);
	dfs2(0);
}

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 > 150000000) bigD();
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9816 KB Output is correct
4 Correct 2 ms 9816 KB Output is correct
5 Correct 2 ms 9824 KB Output is correct
6 Correct 2 ms 10016 KB Output is correct
7 Correct 2 ms 9816 KB Output is correct
8 Correct 2 ms 9816 KB Output is correct
9 Correct 3 ms 9816 KB Output is correct
10 Correct 2 ms 9816 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 3 ms 9820 KB Output is correct
13 Correct 2 ms 9816 KB Output is correct
14 Correct 2 ms 9816 KB Output is correct
15 Correct 2 ms 9816 KB Output is correct
16 Correct 2 ms 9820 KB Output is correct
17 Correct 3 ms 9816 KB Output is correct
18 Correct 2 ms 9816 KB Output is correct
19 Correct 2 ms 9816 KB Output is correct
20 Correct 2 ms 9816 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9816 KB Output is correct
4 Correct 2 ms 9816 KB Output is correct
5 Correct 2 ms 9824 KB Output is correct
6 Correct 2 ms 10016 KB Output is correct
7 Correct 2 ms 9816 KB Output is correct
8 Correct 2 ms 9816 KB Output is correct
9 Correct 3 ms 9816 KB Output is correct
10 Correct 2 ms 9816 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 3 ms 9820 KB Output is correct
13 Correct 2 ms 9816 KB Output is correct
14 Correct 2 ms 9816 KB Output is correct
15 Correct 2 ms 9816 KB Output is correct
16 Correct 2 ms 9820 KB Output is correct
17 Correct 3 ms 9816 KB Output is correct
18 Correct 2 ms 9816 KB Output is correct
19 Correct 2 ms 9816 KB Output is correct
20 Correct 2 ms 9816 KB Output is correct
21 Correct 18 ms 21592 KB Output is correct
22 Correct 2 ms 9816 KB Output is correct
23 Correct 2 ms 9816 KB Output is correct
24 Correct 2 ms 9820 KB Output is correct
25 Correct 2 ms 9816 KB Output is correct
26 Correct 3 ms 9816 KB Output is correct
27 Correct 2 ms 9820 KB Output is correct
28 Correct 3 ms 9816 KB Output is correct
29 Correct 2 ms 9816 KB Output is correct
30 Correct 3 ms 9816 KB Output is correct
31 Correct 3 ms 10072 KB Output is correct
32 Correct 3 ms 9820 KB Output is correct
33 Correct 3 ms 9816 KB Output is correct
34 Correct 3 ms 9816 KB Output is correct
35 Correct 2 ms 9820 KB Output is correct
36 Correct 4 ms 9820 KB Output is correct
37 Correct 3 ms 9816 KB Output is correct
38 Correct 3 ms 10072 KB Output is correct
39 Correct 4 ms 10328 KB Output is correct
40 Correct 2 ms 10072 KB Output is correct

Subtask #3
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9816 KB Output is correct
4 Correct 2 ms 9816 KB Output is correct
5 Correct 2 ms 9824 KB Output is correct
6 Correct 2 ms 10016 KB Output is correct
7 Correct 2 ms 9816 KB Output is correct
8 Correct 2 ms 9816 KB Output is correct
9 Correct 3 ms 9816 KB Output is correct
10 Correct 2 ms 9816 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 3 ms 9820 KB Output is correct
13 Correct 2 ms 9816 KB Output is correct
14 Correct 2 ms 9816 KB Output is correct
15 Correct 2 ms 9816 KB Output is correct
16 Correct 2 ms 9820 KB Output is correct
17 Correct 3 ms 9816 KB Output is correct
18 Correct 2 ms 9816 KB Output is correct
19 Correct 2 ms 9816 KB Output is correct
20 Correct 2 ms 9816 KB Output is correct
21 Correct 18 ms 21592 KB Output is correct
22 Correct 2 ms 9816 KB Output is correct
23 Correct 2 ms 9816 KB Output is correct
24 Correct 2 ms 9820 KB Output is correct
25 Correct 2 ms 9816 KB Output is correct
26 Correct 3 ms 9816 KB Output is correct
27 Correct 2 ms 9820 KB Output is correct
28 Correct 3 ms 9816 KB Output is correct
29 Correct 2 ms 9816 KB Output is correct
30 Correct 3 ms 9816 KB Output is correct
31 Correct 3 ms 10072 KB Output is correct
32 Correct 3 ms 9820 KB Output is correct
33 Correct 3 ms 9816 KB Output is correct
34 Correct 3 ms 9816 KB Output is correct
35 Correct 2 ms 9820 KB Output is correct
36 Correct 4 ms 9820 KB Output is correct
37 Correct 3 ms 9816 KB Output is correct
38 Correct 3 ms 10072 KB Output is correct
39 Correct 4 ms 10328 KB Output is correct
40 Correct 2 ms 10072 KB Output is correct
41 Correct 41 ms 26828 KB Output is correct
42 Correct 2 ms 9816 KB Output is correct
43 Correct 43 ms 23128 KB Output is correct
44 Correct 73 ms 35748 KB Output is correct
45 Correct 113 ms 54484 KB Output is correct
46 Correct 63 ms 23888 KB Output is correct
47 Correct 139 ms 52112 KB Output is correct
48 Correct 187 ms 83536 KB Output is correct
49 Correct 376 ms 177236 KB Output is correct
50 Correct 20 ms 15704 KB Output is correct
51 Correct 29 ms 18776 KB Output is correct
52 Correct 30 ms 20568 KB Output is correct
53 Correct 52 ms 21588 KB Output is correct
54 Correct 73 ms 27992 KB Output is correct
55 Correct 75 ms 34392 KB Output is correct
56 Correct 3 ms 10072 KB Output is correct
57 Correct 384 ms 335668 KB Output is correct
58 Incorrect 18 ms 24408 KB Output isn't correct
59 Halted 0 ms 0 KB -