oj.uz

Submission #796513

# Submission time Handle Problem Language Result Execution time Memory
796513 2023-07-28T13:01:30 Z MadokaMagicaFan Cat in a tree (BOI17_catinatree) C++14
11 / 100
 1000 ms 36540 KB 
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

const int N = 2e5;
int p[N];
int h[N];
int __n, d, inf;
vector<int> adj[N];

struct aint {
	int n;
	vector<int> f;

	aint(int _n)
	{
		n = _n;
		f.assign(n<<1, 0);
	}

	int query(int l, int r) {
		l += n;
		r += n+1;
		if (l >= 2*n-1) return 0;
		r = min(r, 2*n);
		int ans = 0;
		for (; l < r; l >>= 1, r >>= 1) {
			if (l&1) ans = max(ans, f[l++]);
			if (r&1) ans = max(ans, f[--r]);
		}

		return ans;
	}

	int getv(int x)
	{
		return f[x+n];
	}

	void upd(int x, int v)
	{
		x += n;
		for (f[x] = max(v, f[x]); x > 1; x>>=1) {
			f[x>>1] = max(f[x], f[x^1]);
		}
	}
};

vector<aint> t;
vector<int> lp[N];
int tp[N];
int mx1[N];
int mx2[N];

void
dfs(int x) {
	if (x) h[x] = h[p[x]] + 1;
	int _h, v, j;
	for (auto u : adj[x])
		dfs(u);
	// v = 1 + t[x].query(h[x]+d, inf);
	// t[x].upd(h[x], v);


	v = 0;
	for (int i = h[x] + d; i < __n; ++i)
		v = max(v, lp[x][i]);
	++v;
	lp[x][h[x]] = max(v, lp[x][h[x]]);


	if (!x) return;
	j = p[x];

	/*
	for (int z = __n-1; z >= h[x]; --z) {
		_h = max(2*h[j] + d - z, h[j]);
		t[j].upd(min(_h, z), t[j].query(_h, inf) + t[x].query(z, inf));
	}

	for (int z = h[x]; z < __n; ++z) {
		if (2*(z - h[j]) >= d)
			t[j].upd(z, t[x].query(z, inf) + t[j].query(z,inf));
	}

	for (int z = __n-1; z >= h[x]; --z) {
		t[j].upd(z, t[x].getv(z));
	}
	*/

	for (int i = 0; i < __n; ++i) tp[i] = 0;
	mx1[__n-1] = lp[x][__n-1];
	mx2[__n-1] = lp[j][__n-1];

	for (int i = __n-2; i >= h[j]; --i) {
		mx1[i] = max(mx1[i+1], lp[x][i]);
		mx2[i] = max(mx2[i+1], lp[j][i]);
	}

	for (int u = h[x]; u < __n; ++u) {
		tp[u] = max(mx1[u], mx2[u]);

		for (int z = u; z < __n; ++z) {
			_h = max(2*h[j] + d - z, h[j]);
			_h = max(u, _h);

			tp[u] = max(tp[u], mx1[z] + mx2[_h]);
		}
	}

	for (int i = h[j]; i < __n; ++i)
		lp[j][i] = tp[i];
}

int32_t main(int32_t argc, char *argv[])
{
	if (argc > 1) freopen(argv[1], "r", stdin);
	int n;
	cin >> n >> d;
	__n = n;
	inf = 2*n + 5;
	p[0] = 0;

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

	for (int i = 0; i <n; ++i)
		t.emplace(t.end() ,n);

	for (int i = 0; i <n; ++i)
		lp[i].assign(n, 0);

	h[0] = 0;

	dfs(0);

	/*
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j)
			cout << t[i].getv(j);
		cout<< endl;
	}

	cout << t[0].query(0, inf) << endl;;
	*/

	int ans = 0;
	for (int i = 0; i < n; ++i)
		ans = max(ans, lp[0][i]);

	cout << ans << endl;
}

Compilation message

catinatree.cpp: In function 'int32_t main(int32_t, char**)':
catinatree.cpp:117:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |  if (argc > 1) freopen(argv[1], "r", stdin);
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9736 KB Output is correct
3 Correct 6 ms 9716 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 4 ms 9712 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 5 ms 9708 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 4 ms 9704 KB Output is correct
20 Correct 4 ms 9684 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9736 KB Output is correct
3 Correct 6 ms 9716 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 4 ms 9712 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 5 ms 9708 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 4 ms 9704 KB Output is correct
20 Correct 4 ms 9684 KB Output is correct
21 Correct 618 ms 36540 KB Output is correct
22 Correct 72 ms 12696 KB Output is correct
23 Correct 72 ms 12696 KB Output is correct
24 Correct 72 ms 12652 KB Output is correct
25 Correct 534 ms 21560 KB Output is correct
26 Correct 549 ms 21560 KB Output is correct
27 Correct 543 ms 21560 KB Output is correct
28 Execution timed out 1075 ms 36272 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9736 KB Output is correct
3 Correct 6 ms 9716 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 4 ms 9712 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 5 ms 9708 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 4 ms 9704 KB Output is correct
20 Correct 4 ms 9684 KB Output is correct
21 Correct 618 ms 36540 KB Output is correct
22 Correct 72 ms 12696 KB Output is correct
23 Correct 72 ms 12696 KB Output is correct
24 Correct 72 ms 12652 KB Output is correct
25 Correct 534 ms 21560 KB Output is correct
26 Correct 549 ms 21560 KB Output is correct
27 Correct 543 ms 21560 KB Output is correct
28 Execution timed out 1075 ms 36272 KB Time limit exceeded
29 Halted 0 ms 0 KB -