oj.uz

Submission #389080

# Submission time Handle Problem Language Result Execution time Memory
389080 2021-04-13T15:27:24 Z Return_0 Cat in a tree (BOI17_catinatree) C++17
100 / 100
 337 ms 41376 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll; typedef long long lol;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 2e5 + 7, lg = 18;

struct segtree {
	ll l, r;
	lol mx, lz;
	segtree *lt, *rt;
	inline segtree (cl &L = 1, cl &R = N - 2) : l(L), r(R), mx(0), lz(0) {}

	void build () {
		if (l == r) return;
		lt = new segtree (l, mid);
		rt = new segtree (mid + 1, r);
		lt->build();
		rt->build();
	}

	inline void push (const lol &x) {   mx += x; lz += x;    }
	inline void shift () {  lt->push(lz);   rt->push(lz);   lz = 0; }

	void upd (cl &ql, cl &qr, cl &x) {
		if (r < ql || qr < l)   return;
		if (ql <= l && r <= qr) {
			push(x);
			return;
		}
		shift();
		lt->upd(ql, qr, x);
		rt->upd(ql, qr, x);
		mx = max(lt->mx, rt->mx);
	}

	ll ask () {
		if (l == r) return l;
		shift();
		if (mx == lt->mx) return lt->ask();
		return rt->ask();
	}

	lol ask2 (cl &ql, cl & qr) {
		if (r < ql || qr < l) return -inf;
		if (ql <= l && r <= qr) return mx;
		shift();
		return max(lt->ask2(ql, qr), rt->ask2(ql, qr));
	}
} seg;

ll h [N], par [N], tin [N], rtin [N], tout [N], T, n, D, ans;
vector <ll> adj [N];

void DFS (cl &v = 0, cl &pr = -1) {
	tin[v] = ++T;
	rtin[T] = v;
	par[v] = pr;
	for (auto &u : adj[v]) if (u != pr) h[u] = h[v] + 1, DFS(u, v);
	seg.upd(tin[v], tin[v], h[v]);
	tout[v] = T;
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> D;
	for (ll i = 1, v; i < n; i++) {
		cin>> v;
		adj[v].push_back(i);
	}

	seg.r = n; seg.build();
	DFS();

	for (ll v; seg.mx >= 0;) {
		v = rtin[seg.ask()];
		ans++;
		for (ll i = 0; ~v && seg.ask2(tin[v], tout[v]) + i - h[v] < D; i++, v = par[v]) seg.upd(tin[v], tout[v], -N);
	}

	cout<< ans << endl;

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
4 3
0
0
1

<+
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4944 KB Output is correct
4 Correct 4 ms 4968 KB Output is correct
5 Correct 4 ms 4940 KB Output is correct
6 Correct 5 ms 5024 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Correct 4 ms 5028 KB Output is correct
15 Correct 4 ms 5024 KB Output is correct
16 Correct 4 ms 5028 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 5 ms 5324 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 5 ms 5068 KB Output is correct
24 Correct 4 ms 5024 KB Output is correct
25 Correct 5 ms 5068 KB Output is correct
26 Correct 4 ms 5156 KB Output is correct
27 Correct 5 ms 5140 KB Output is correct
28 Correct 5 ms 5196 KB Output is correct
29 Correct 5 ms 5196 KB Output is correct
30 Correct 4 ms 5196 KB Output is correct
31 Correct 4 ms 5200 KB Output is correct
32 Correct 4 ms 5196 KB Output is correct
33 Correct 4 ms 5196 KB Output is correct
34 Correct 4 ms 5196 KB Output is correct
35 Correct 4 ms 5196 KB Output is correct
36 Correct 4 ms 5196 KB Output is correct
37 Correct 4 ms 5196 KB Output is correct
38 Correct 4 ms 5164 KB Output is correct
39 Correct 6 ms 5172 KB Output is correct
40 Correct 5 ms 5420 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4944 KB Output is correct
4 Correct 4 ms 4968 KB Output is correct
5 Correct 4 ms 4940 KB Output is correct
6 Correct 5 ms 5024 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Correct 4 ms 5028 KB Output is correct
15 Correct 4 ms 5024 KB Output is correct
16 Correct 4 ms 5028 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 5 ms 5324 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 5 ms 5068 KB Output is correct
24 Correct 4 ms 5024 KB Output is correct
25 Correct 5 ms 5068 KB Output is correct
26 Correct 4 ms 5156 KB Output is correct
27 Correct 5 ms 5140 KB Output is correct
28 Correct 5 ms 5196 KB Output is correct
29 Correct 5 ms 5196 KB Output is correct
30 Correct 4 ms 5196 KB Output is correct
31 Correct 4 ms 5200 KB Output is correct
32 Correct 4 ms 5196 KB Output is correct
33 Correct 4 ms 5196 KB Output is correct
34 Correct 4 ms 5196 KB Output is correct
35 Correct 4 ms 5196 KB Output is correct
36 Correct 4 ms 5196 KB Output is correct
37 Correct 4 ms 5196 KB Output is correct
38 Correct 4 ms 5164 KB Output is correct
39 Correct 6 ms 5172 KB Output is correct
40 Correct 5 ms 5420 KB Output is correct
41 Correct 194 ms 31328 KB Output is correct
42 Correct 183 ms 18628 KB Output is correct
43 Correct 83 ms 18448 KB Output is correct
44 Correct 71 ms 18492 KB Output is correct
45 Correct 67 ms 18500 KB Output is correct
46 Correct 337 ms 32112 KB Output is correct
47 Correct 147 ms 32104 KB Output is correct
48 Correct 153 ms 32092 KB Output is correct
49 Correct 167 ms 32108 KB Output is correct
50 Correct 62 ms 17292 KB Output is correct
51 Correct 52 ms 17176 KB Output is correct
52 Correct 54 ms 17276 KB Output is correct
53 Correct 109 ms 29424 KB Output is correct
54 Correct 110 ms 29440 KB Output is correct
55 Correct 108 ms 29404 KB Output is correct
56 Correct 7 ms 5452 KB Output is correct
57 Correct 25 ms 10060 KB Output is correct
58 Correct 128 ms 28272 KB Output is correct
59 Correct 216 ms 41376 KB Output is correct
60 Correct 200 ms 32456 KB Output is correct
61 Correct 187 ms 31784 KB Output is correct