oj.uz

Submission #537118

# Submission time Handle Problem Language Result Execution time Memory
537118 2022-03-14T14:52:55 Z Cantfindme Cat in a tree (BOI17_catinatree) C++17
100 / 100
 409 ms 272560 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()

const int maxn = 200010;
const int INF = LLONG_MAX/2;
const int mod = 1e9+7;

int n, K;

//https://codeforces.com/blog/entry/70822

struct dat {
	deque <int> dp;
	dat (int v = 0) {
		dp = {v};
	}

	int size() const {
		return (int) dp.size();
	}
};
vector <int> adjlist[maxn];
vector <dat> ans;

void extend(dat &root) {
	root.dp.push_front(root.dp.front());
}

void attach(dat &a, dat &b) {
	if (a.size() < b.size()) { //b is the smaller one
		swap(a, b);
	}

	//We will at most modify the first b.dp.size values of a
	vector <int> v = vector<int>(all(b.dp));

	for (int x = 0; x < b.size(); x++) {
		int miny = max(K - x, x);
		if (miny < b.size()) {
			v[x] = max(v[x], a.dp[x] + b.dp[miny]);
		}

		if (miny < a.size()) {
			v[x] = max(v[x], b.dp[x] + a.dp[miny]);
		}
	}

	for (int i = v.size() - 1; i >= 0; i--) {
		if (i+1 < v.size()) v[i] = max(v[i], v[i+1]);
		a.dp[i] = max(a.dp[i], v[i]);
	}
}

//Return reference to dat for x
dat& dpf(int x, int p) {
	dat &res = ans[x]; //reference to thingy
	res = dat(1);

	for (auto i : adjlist[x]) if (i != p) {
		dat &u = dpf(i,x);
		extend(u);
		attach(res, u);
	}

	return res;
}

int32_t main() {
	FAST
	// ifstream cin("input.txt");

	cin >> n >> K;

	for (int i = 2; i <= n; i++) {
		int p; cin >> p;
		p++;
		adjlist[p].push_back(i);
	}

	ans.assign(n+1, {});
	cout << dpf(1, -1).dp.front();
}

Compilation message

catinatree.cpp: In function 'void attach(dat&, dat&)':
catinatree.cpp:55:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |   if (i+1 < v.size()) v[i] = max(v[i], v[i+1]);
      |       ~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4952 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 7124 KB Output is correct
22 Correct 3 ms 5588 KB Output is correct
23 Correct 3 ms 5588 KB Output is correct
24 Correct 3 ms 5588 KB Output is correct
25 Correct 4 ms 6228 KB Output is correct
26 Correct 4 ms 6228 KB Output is correct
27 Correct 4 ms 6228 KB Output is correct
28 Correct 4 ms 6740 KB Output is correct
29 Correct 5 ms 6740 KB Output is correct
30 Correct 5 ms 6816 KB Output is correct
31 Correct 5 ms 6812 KB Output is correct
32 Correct 4 ms 6688 KB Output is correct
33 Correct 4 ms 6740 KB Output is correct
34 Correct 4 ms 6612 KB Output is correct
35 Correct 4 ms 6612 KB Output is correct
36 Correct 4 ms 6740 KB Output is correct
37 Correct 4 ms 6812 KB Output is correct
38 Correct 4 ms 6868 KB Output is correct
39 Correct 4 ms 6860 KB Output is correct
40 Correct 4 ms 7124 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4952 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 7124 KB Output is correct
22 Correct 3 ms 5588 KB Output is correct
23 Correct 3 ms 5588 KB Output is correct
24 Correct 3 ms 5588 KB Output is correct
25 Correct 4 ms 6228 KB Output is correct
26 Correct 4 ms 6228 KB Output is correct
27 Correct 4 ms 6228 KB Output is correct
28 Correct 4 ms 6740 KB Output is correct
29 Correct 5 ms 6740 KB Output is correct
30 Correct 5 ms 6816 KB Output is correct
31 Correct 5 ms 6812 KB Output is correct
32 Correct 4 ms 6688 KB Output is correct
33 Correct 4 ms 6740 KB Output is correct
34 Correct 4 ms 6612 KB Output is correct
35 Correct 4 ms 6612 KB Output is correct
36 Correct 4 ms 6740 KB Output is correct
37 Correct 4 ms 6812 KB Output is correct
38 Correct 4 ms 6868 KB Output is correct
39 Correct 4 ms 6860 KB Output is correct
40 Correct 4 ms 7124 KB Output is correct
41 Correct 264 ms 236168 KB Output is correct
42 Correct 184 ms 126296 KB Output is correct
43 Correct 178 ms 126336 KB Output is correct
44 Correct 180 ms 126384 KB Output is correct
45 Correct 187 ms 126572 KB Output is correct
46 Correct 409 ms 247856 KB Output is correct
47 Correct 388 ms 247940 KB Output is correct
48 Correct 371 ms 247868 KB Output is correct
49 Correct 388 ms 247884 KB Output is correct
50 Correct 132 ms 125336 KB Output is correct
51 Correct 140 ms 125292 KB Output is correct
52 Correct 125 ms 125308 KB Output is correct
53 Correct 262 ms 245900 KB Output is correct
54 Correct 261 ms 245800 KB Output is correct
55 Correct 266 ms 245708 KB Output is correct
56 Correct 6 ms 8148 KB Output is correct
57 Correct 31 ms 35736 KB Output is correct
58 Correct 133 ms 149296 KB Output is correct
59 Correct 317 ms 272560 KB Output is correct
60 Correct 279 ms 242496 KB Output is correct
61 Correct 272 ms 236896 KB Output is correct