oj.uz

Submission #391289

# Submission time Handle Problem Language Result Execution time Memory
391289 2021-04-18T12:46:49 Z Mlxa Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 1201 ms 524292 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define x first
#define y second
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()

const int NODES = 4e6 + 10;
mt19937 rnd;

struct node {
	int x, w, dy, sy, ls, rs;
} pool[NODES];
int ff = 1;

#define getter(f) int &f(int v) { assert(0 <= v && v < NODES); return pool[v].f; }
getter(x) getter(w) getter(dy) getter(sy) getter(ls) getter(rs)

int new_node(int nx, int ny) {
	assert(ff < NODES);
	int v = ff++;
	x(v) = nx;
	w(v) = (int)rnd();
	dy(v) = ny;
	sy(v) = ny;
	ls(v) = rs(v) = 0;
	return v;
}

int pull(int v) {
	sy(v) = sy(ls(v)) + dy(v) + sy(rs(v));
	return v;
}

void to_vector(int t, vector<pair<int, int>> &vec) {
	if (!t) {
		return;
	}
	to_vector(ls(t), vec);
	vec.emplace_back(x(t), dy(t));
	to_vector(rs(t), vec);
}

void print(int t) {
	vector<pair<int, int>> v;
	to_vector(t, v);
	for (auto e : v) {
		cout << "(" << e.x << "; " << e.y << ") ";
	}
	cout << endl;
}


pair<int, int> splitsum(int t, int s) {
	if (!t) {
		return {0, 0};
	}
	// print(t);
	assert(0 <= s && s <= sy(t));
	int lsum = sy(ls(t)), msum = dy(t);
	if (lsum < s && lsum + msum > s) {
		int lt = new_node(x(t), s - lsum), rt = new_node(x(t), msum - dy(lt));
		ls(lt) = ls(t), rs(rt) = rs(t);
		return {pull(lt), pull(rt)};
	}
	int l, r;
	if (s <= lsum) {
		tie(l, ls(t)) = splitsum(ls(t), s);
		r = pull(t);
	} else {
		tie(rs(t), r) = splitsum(rs(t), s - lsum - msum);
		l = pull(t);
	}
	assert(sy(l) == s);
	return {l, r};
}

// (-inf, k], (k, +inf)
pair<int, int> split(int t, int k) {
	if (!t) {
		return {0, 0};
	}
	int l, r;
	if (k < x(t)) {
		tie(l, ls(t)) = split(ls(t), k);
		r = pull(t);
	} else {
		tie(rs(t), r) = split(rs(t), k);
		l = pull(t);
	}
	return {l, r};
}

int merge(int l, int r) {
	if (!l) {
		return r;
	}
	if (!r) {
		return l;
	}
	if (w(l) < w(r)) {
		rs(l) = merge(rs(l), r);
		return pull(l);
	} else {
		ls(r) = merge(l, ls(r));
		return pull(r);
	}
}

int get_value(int t, int x) {
	int l, r;
	tie(l, r) = split(t, x);
	int res = sy(l);
	t = merge(l, r);
	return res;
}

__attribute__((warn_unused_result))
int insert(int t, int nx, int ny) {
	int l, m, r;
	tie(l, m) = split(t, nx - 1);
	tie(m, r) = split(m, nx);
	// cout << "insert " << nx << " " << ny << endl;
	// print(l);
	// print(m);
	// print(r);
	// cout << "---" << endl;
	m = new_node(nx, sy(m) + ny);
	l = merge(l, m);
	// print(l);
	return merge(l, r);
}

__attribute__((warn_unused_result))
int uminpref(int t, int px) {
	int checksum = sy(t);

	int l, m, r;
	tie(l, m) = split(t, px - 1);
	tie(m, r) = split(m, px);
	if (sy(m) <= 0) {
		int p, q;
		tie(p, q) = splitsum(l, sy(l) + sy(m));
		t = merge(p, r);
		assert(sy(t) == checksum);
		return t;
	} else {
		return merge(merge(l, m), r);
	}
}

__attribute__((warn_unused_result))
int add(int tv, int tu) {
	if (!tv) {
		return tu;
	}
	if (!tu) {
		return tv;
	}
	tv = insert(tv, x(tu), dy(tu));
	tv = add(tv, ls(tu));
	tv = add(tv, rs(tu));
	return tv;
}



const int N = 2e5 + 10;
int n, ia[N], ih[N], ic[N], dp[N];
vector<int> g[N];

void dfs(int v) {
	for (int u : g[v]) {
		dfs(u);
		dp[u] = uminpref(dp[u], ih[u]);
		// cout << "v = " << u + 1 << endl;
		// print(dp[u]);
		dp[v] = add(dp[v], dp[u]);
	}
	dp[v] = insert(dp[v], 0, ic[v]);
	dp[v] = insert(dp[v], ih[v], -ic[v]);
	dp[v] = insert(dp[v], ih[v] + 1, ic[v]);

}

signed main() {
#ifdef LC
	assert(freopen("input.txt", "r", stdin));
#endif
	ios::sync_with_stdio(0); cin.tie(0); 

	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> ia[i] >> ih[i] >> ic[i];
		if (--ia[i] == i) {
			continue;
		}
		g[ia[i]].push_back(i);
	}
	dfs(0);
	// print(dp[0]);
	dp[0] = uminpref(dp[0], ih[0]);

	cout << get_value(dp[0], 0) << "\n";


	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 14 ms 6784 KB Output is correct
6 Correct 10 ms 6604 KB Output is correct
7 Correct 9 ms 6476 KB Output is correct
8 Correct 14 ms 6912 KB Output is correct
9 Correct 10 ms 6604 KB Output is correct
10 Correct 8 ms 6508 KB Output is correct
11 Correct 7 ms 6092 KB Output is correct
12 Correct 12 ms 6732 KB Output is correct
13 Correct 9 ms 6732 KB Output is correct
14 Correct 11 ms 6608 KB Output is correct
15 Correct 11 ms 6604 KB Output is correct
16 Correct 14 ms 7132 KB Output is correct
17 Correct 10 ms 6820 KB Output is correct
18 Correct 7 ms 6092 KB Output is correct
19 Correct 12 ms 6476 KB Output is correct
20 Correct 10 ms 6476 KB Output is correct
21 Correct 8 ms 6492 KB Output is correct
22 Correct 9 ms 6260 KB Output is correct
23 Correct 9 ms 6144 KB Output is correct
24 Correct 17 ms 6432 KB Output is correct
25 Correct 10 ms 6476 KB Output is correct
26 Correct 7 ms 6348 KB Output is correct
27 Correct 10 ms 6348 KB Output is correct
28 Correct 11 ms 6476 KB Output is correct
29 Correct 11 ms 6648 KB Output is correct
30 Correct 17 ms 6704 KB Output is correct
31 Correct 16 ms 6732 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6928 KB Output is correct
2 Correct 694 ms 94352 KB Output is correct
3 Correct 444 ms 84164 KB Output is correct
4 Correct 709 ms 98676 KB Output is correct
5 Correct 437 ms 83908 KB Output is correct
6 Correct 281 ms 65140 KB Output is correct
7 Correct 217 ms 52644 KB Output is correct
8 Correct 493 ms 82076 KB Output is correct
9 Correct 423 ms 82136 KB Output is correct
10 Correct 220 ms 82088 KB Output is correct
11 Correct 438 ms 75892 KB Output is correct
12 Correct 432 ms 75880 KB Output is correct
13 Correct 690 ms 111684 KB Output is correct
14 Correct 434 ms 91664 KB Output is correct
15 Correct 149 ms 52208 KB Output is correct
16 Correct 676 ms 67944 KB Output is correct
17 Correct 386 ms 68136 KB Output is correct
18 Correct 185 ms 67944 KB Output is correct
19 Correct 486 ms 54808 KB Output is correct
20 Correct 229 ms 54868 KB Output is correct
21 Correct 721 ms 69076 KB Output is correct
22 Correct 362 ms 68968 KB Output is correct
23 Correct 163 ms 63444 KB Output is correct
24 Correct 422 ms 68060 KB Output is correct
25 Correct 442 ms 74272 KB Output is correct
26 Correct 430 ms 76996 KB Output is correct
27 Correct 1200 ms 79812 KB Output is correct
28 Correct 1201 ms 79860 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 14 ms 6784 KB Output is correct
6 Correct 10 ms 6604 KB Output is correct
7 Correct 9 ms 6476 KB Output is correct
8 Correct 14 ms 6912 KB Output is correct
9 Correct 10 ms 6604 KB Output is correct
10 Correct 8 ms 6508 KB Output is correct
11 Correct 7 ms 6092 KB Output is correct
12 Correct 12 ms 6732 KB Output is correct
13 Correct 9 ms 6732 KB Output is correct
14 Correct 11 ms 6608 KB Output is correct
15 Correct 11 ms 6604 KB Output is correct
16 Correct 14 ms 7132 KB Output is correct
17 Correct 10 ms 6820 KB Output is correct
18 Correct 7 ms 6092 KB Output is correct
19 Correct 12 ms 6476 KB Output is correct
20 Correct 10 ms 6476 KB Output is correct
21 Correct 8 ms 6492 KB Output is correct
22 Correct 9 ms 6260 KB Output is correct
23 Correct 9 ms 6144 KB Output is correct
24 Correct 17 ms 6432 KB Output is correct
25 Correct 10 ms 6476 KB Output is correct
26 Correct 7 ms 6348 KB Output is correct
27 Correct 10 ms 6348 KB Output is correct
28 Correct 11 ms 6476 KB Output is correct
29 Correct 11 ms 6648 KB Output is correct
30 Correct 17 ms 6704 KB Output is correct
31 Correct 16 ms 6732 KB Output is correct
32 Correct 13 ms 6928 KB Output is correct
33 Correct 694 ms 94352 KB Output is correct
34 Correct 444 ms 84164 KB Output is correct
35 Correct 709 ms 98676 KB Output is correct
36 Correct 437 ms 83908 KB Output is correct
37 Correct 281 ms 65140 KB Output is correct
38 Correct 217 ms 52644 KB Output is correct
39 Correct 493 ms 82076 KB Output is correct
40 Correct 423 ms 82136 KB Output is correct
41 Correct 220 ms 82088 KB Output is correct
42 Correct 438 ms 75892 KB Output is correct
43 Correct 432 ms 75880 KB Output is correct
44 Correct 690 ms 111684 KB Output is correct
45 Correct 434 ms 91664 KB Output is correct
46 Correct 149 ms 52208 KB Output is correct
47 Correct 676 ms 67944 KB Output is correct
48 Correct 386 ms 68136 KB Output is correct
49 Correct 185 ms 67944 KB Output is correct
50 Correct 486 ms 54808 KB Output is correct
51 Correct 229 ms 54868 KB Output is correct
52 Correct 721 ms 69076 KB Output is correct
53 Correct 362 ms 68968 KB Output is correct
54 Correct 163 ms 63444 KB Output is correct
55 Correct 422 ms 68060 KB Output is correct
56 Correct 442 ms 74272 KB Output is correct
57 Correct 430 ms 76996 KB Output is correct
58 Correct 1200 ms 79812 KB Output is correct
59 Correct 1201 ms 79860 KB Output is correct
60 Runtime error 364 ms 524292 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -