oj.uz

Submission #288626

# Submission time Handle Problem Language Result Execution time Memory
288626 2020-09-01T17:02:41 Z dlwocks31 Magic Tree (CEOI19_magictree) C++17
100 / 100
 220 ms 32376 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
template<typename T> int SIZE(T (&t)){ return t.size(); } template<typename T, size_t N> int SIZE(T (&t)[N]){ return N; } string to_string(char t){ return "'" + string({t}) + "'"; } string to_string(bool t){ return t ? "true" : "false"; } string to_string(const string &t, int x1=0, int x2=1e9){ string ret = ""; for(int i = min(x1,SIZE(t)), _i = min(x2,SIZE(t)-1); i <= _i; ++i){ ret += t[i]; } return '"' + ret + '"'; } string to_string(const char* t){ string ret(t); return to_string(ret); } template<size_t N> string to_string(const bitset<N> &t, int x1=0, int x2=1e9){ string ret = ""; for(int i = min(x1,SIZE(t)); i <= min(x2,SIZE(t)-1); ++i){ ret += t[i] + '0'; } return to_string(ret); } template<typename T, typename... Coords> string to_string(const T (&t), int x1=0, int x2=1e9, Coords... C); template<typename T, typename S> string to_string(const pair<T, S> &t){ return "(" + to_string(t.first) + ", " + to_string(t.second) + ")"; } template<typename T, typename... Coords> string to_string(const T (&t), int x1, int x2, Coords... C){ string ret = "["; x1 = min(x1, SIZE(t)); auto e = begin(t); advance(e,x1); for(int i = x1, _i = min(x2,SIZE(t)-1); i <= _i; ++i){ ret += to_string(*e, C...) + (i != _i ? ", " : ""); e = next(e); } return ret + "]"; } template<int Index, typename... Ts> struct print_tuple{ string operator() (const tuple<Ts...>& t) { string ret = print_tuple<Index - 1, Ts...>{}(t); ret += (Index ? ", " : ""); return ret + to_string(get<Index>(t)); } }; template<typename... Ts> struct print_tuple<0, Ts...> { string operator() (const tuple<Ts...>& t) { return to_string(get<0>(t)); } }; template<typename... Ts> string to_string(const tuple<Ts...>& t) { const auto Size = tuple_size<tuple<Ts...>>::value; return print_tuple<Size - 1, Ts...>{}(t); } void dbgr(){;} template<typename Heads, typename... Tails> void dbgr(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgr(T...); } void dbgs(){;} template<typename Heads, typename... Tails> void dbgs(Heads H, Tails... T){ cout << H << " "; dbgs(T...); } 
#define dbgv(...) cout << to_string(__VA_ARGS__) << endl;
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgv(__VA_ARGS__);
const int MX = 1e5+1;
vector<int> adj[MX];
pair<int, int> fruit[MX];
multiset<pair<int, int>> ms[MX];
void merge(multiset<pair<int, int>>& st, pair<int, int> pr) {
	auto [d, w] = pr;
	auto it = st.lower_bound(make_pair(d+1, -1));
	while(w > 0 && it != st.end()) {
		if(w >= it->second) {
			w -= it->second;
			it = st.erase(it);
		} else {
			st.insert({it->first, it->second - w});
			st.erase(it);
			w = 0;
			break;
		}
	}
	st.insert(pr);
}
void dfs(int i, int p) {
	int leaf = 1;
	for(int a: adj[i]) {
		if(a == p) continue;
		leaf = 0;
		dfs(a, i);
	}
	if(leaf) {
		if(fruit[i].first)
			ms[i] = {fruit[i]};
	} else {
		int mx = 0;
		for(int a: adj[i]) {
			if(a == p) continue;
			if(ms[a].size() > ms[mx].size())
				mx = a;
		}
		ms[i] = move(ms[mx]);
		for(int a: adj[i]) {
			if(a == p || a == mx) continue;
			for(auto pr: ms[a]) {
				ms[i].insert(pr);
			}
			ms[a].clear();
		}
		if(fruit[i].first) 
			merge(ms[i], fruit[i]);
	}
}
int32_t main() {
	ios::sync_with_stdio(0);cin.tie(0);
	int n, m, k;
	cin >> n >> m >> k;
	for(int i=2; i<=n; i++) {
		int p;
		cin >> p;
		adj[p].push_back(i);
		adj[i].push_back(p);
	}
	for(int i=0; i<m; i++) {
		int v, d, w;
		cin >> v >> d >> w;
		fruit[v] = {d, w};
	}
	dfs(1, 0);
	int ans = 0;
	for(auto [d, w]: ms[1]) {
		ans += w;
	}
	cout << ans;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 5 ms 7328 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 14968 KB Output is correct
2 Correct 58 ms 18552 KB Output is correct
3 Correct 187 ms 20728 KB Output is correct
4 Correct 138 ms 18664 KB Output is correct
5 Correct 192 ms 20344 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7552 KB Output is correct
2 Correct 6 ms 7552 KB Output is correct
3 Correct 7 ms 7552 KB Output is correct
4 Correct 74 ms 26232 KB Output is correct
5 Correct 106 ms 32376 KB Output is correct
6 Correct 89 ms 26360 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 18296 KB Output is correct
2 Correct 220 ms 22136 KB Output is correct
3 Correct 140 ms 24824 KB Output is correct
4 Correct 139 ms 20204 KB Output is correct
5 Correct 119 ms 31096 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 5 ms 7328 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 144 ms 17272 KB Output is correct
11 Correct 144 ms 17640 KB Output is correct
12 Correct 90 ms 19944 KB Output is correct
13 Correct 94 ms 18668 KB Output is correct
14 Correct 80 ms 26688 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8576 KB Output is correct
2 Correct 75 ms 13048 KB Output is correct
3 Correct 58 ms 13048 KB Output is correct
4 Correct 57 ms 13176 KB Output is correct
5 Correct 22 ms 13044 KB Output is correct
6 Correct 47 ms 16120 KB Output is correct
7 Correct 41 ms 18424 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 5 ms 7328 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 7 ms 7552 KB Output is correct
11 Correct 6 ms 7552 KB Output is correct
12 Correct 7 ms 7552 KB Output is correct
13 Correct 74 ms 26232 KB Output is correct
14 Correct 106 ms 32376 KB Output is correct
15 Correct 89 ms 26360 KB Output is correct
16 Correct 144 ms 17272 KB Output is correct
17 Correct 144 ms 17640 KB Output is correct
18 Correct 90 ms 19944 KB Output is correct
19 Correct 94 ms 18668 KB Output is correct
20 Correct 80 ms 26688 KB Output is correct
21 Correct 26 ms 9728 KB Output is correct
22 Correct 109 ms 15736 KB Output is correct
23 Correct 109 ms 15480 KB Output is correct
24 Correct 149 ms 17656 KB Output is correct
25 Correct 91 ms 18668 KB Output is correct
26 Correct 121 ms 20856 KB Output is correct
27 Correct 96 ms 19832 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 5 ms 7328 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 83 ms 14968 KB Output is correct
11 Correct 58 ms 18552 KB Output is correct
12 Correct 187 ms 20728 KB Output is correct
13 Correct 138 ms 18664 KB Output is correct
14 Correct 192 ms 20344 KB Output is correct
15 Correct 7 ms 7552 KB Output is correct
16 Correct 6 ms 7552 KB Output is correct
17 Correct 7 ms 7552 KB Output is correct
18 Correct 74 ms 26232 KB Output is correct
19 Correct 106 ms 32376 KB Output is correct
20 Correct 89 ms 26360 KB Output is correct
21 Correct 213 ms 18296 KB Output is correct
22 Correct 220 ms 22136 KB Output is correct
23 Correct 140 ms 24824 KB Output is correct
24 Correct 139 ms 20204 KB Output is correct
25 Correct 119 ms 31096 KB Output is correct
26 Correct 144 ms 17272 KB Output is correct
27 Correct 144 ms 17640 KB Output is correct
28 Correct 90 ms 19944 KB Output is correct
29 Correct 94 ms 18668 KB Output is correct
30 Correct 80 ms 26688 KB Output is correct
31 Correct 16 ms 8576 KB Output is correct
32 Correct 75 ms 13048 KB Output is correct
33 Correct 58 ms 13048 KB Output is correct
34 Correct 57 ms 13176 KB Output is correct
35 Correct 22 ms 13044 KB Output is correct
36 Correct 47 ms 16120 KB Output is correct
37 Correct 41 ms 18424 KB Output is correct
38 Correct 26 ms 9728 KB Output is correct
39 Correct 109 ms 15736 KB Output is correct
40 Correct 109 ms 15480 KB Output is correct
41 Correct 149 ms 17656 KB Output is correct
42 Correct 91 ms 18668 KB Output is correct
43 Correct 121 ms 20856 KB Output is correct
44 Correct 96 ms 19832 KB Output is correct
45 Correct 29 ms 9856 KB Output is correct
46 Correct 117 ms 17456 KB Output is correct
47 Correct 110 ms 17016 KB Output is correct
48 Correct 171 ms 20472 KB Output is correct
49 Correct 102 ms 20588 KB Output is correct
50 Correct 153 ms 23416 KB Output is correct
51 Correct 122 ms 22428 KB Output is correct