oj.uz

Submission #417629

# Submission time Handle Problem Language Result Execution time Memory
417629 2021-06-04T04:41:35 Z maomao90 Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 2000 ms 73052 KB 
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb emplace_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 200005

int n;
int h[MAXN], c[MAXN];
vi adj[MAXN];
map<int, ll> incre[MAXN];
ll ans;

void dp(int u) {
	for (int v : adj[u]) {
		dp(v);
		auto fi = move(incre[u]), se = move(incre[v]);
		if (fi.size() < se.size()) swap(fi, se);
		for (auto i : se) {
			fi[i.FI] += i.SE;
		}
		incre[u] = fi;
	}
	auto lower = incre[u].lower_bound(h[u]);
	if (lower != incre[u].begin()) {
		lower = prev(lower);
		int remc = c[u];
		while (1) {
			//printf("%d %lld\n", lower -> FI, lower -> SE);
			ll take = min((ll) remc, lower -> SE);
			lower -> SE -= take;
			remc -= take;
			if (lower -> SE == 0) {
				auto tmp = lower;
				bool hv = 0;
				if (tmp != incre[u].begin()) {
					tmp = prev(tmp);
					hv = 1;
				}
				incre[u].erase(lower);
				if (!hv) {
				   	break;
				} else {
					lower = tmp;
				}
			} else {
				break;
			}
		}
	}
	incre[u][h[u]] += c[u];
	//printf("%d:\n", u);
	//for (auto i : incre[u]) {
		//printf(" %d %lld\n", i.FI, i.SE);
	//}
}

int main() {
	scanf("%d", &n);
	REP (i, 1, n + 1) {
		int a; scanf("%d%d%d", &a, &h[i], &c[i]);
		ans += c[i];
		if (a != i) adj[a].pb(i);
	}
	dp(1);
	for (auto i : incre[1]) {
		ans -= i.SE;
	}
	printf("%lld\n", ans);
	return 0;
}

/*
4
1 3 4
1 1 2
2 0 3
3 2 1
*/

Compilation message

worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:81:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
worst_reporter2.cpp:83:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |   int a; scanf("%d%d%d", &a, &h[i], &c[i]);
      |          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 11 ms 14284 KB Output is correct
3 Correct 10 ms 14284 KB Output is correct
4 Correct 10 ms 14284 KB Output is correct
5 Correct 24 ms 14948 KB Output is correct
6 Correct 16 ms 14548 KB Output is correct
7 Correct 14 ms 14528 KB Output is correct
8 Correct 21 ms 14940 KB Output is correct
9 Correct 16 ms 14540 KB Output is correct
10 Correct 14 ms 14412 KB Output is correct
11 Correct 12 ms 14520 KB Output is correct
12 Correct 39 ms 15844 KB Output is correct
13 Correct 15 ms 15792 KB Output is correct
14 Correct 30 ms 15124 KB Output is correct
15 Correct 25 ms 15180 KB Output is correct
16 Correct 22 ms 15008 KB Output is correct
17 Correct 15 ms 14504 KB Output is correct
18 Correct 12 ms 14456 KB Output is correct
19 Correct 374 ms 15388 KB Output is correct
20 Correct 29 ms 15140 KB Output is correct
21 Correct 13 ms 15088 KB Output is correct
22 Correct 704 ms 15060 KB Output is correct
23 Correct 29 ms 14412 KB Output is correct
24 Correct 559 ms 15476 KB Output is correct
25 Correct 29 ms 15052 KB Output is correct
26 Correct 14 ms 15724 KB Output is correct
27 Correct 424 ms 15468 KB Output is correct
28 Correct 430 ms 15616 KB Output is correct
29 Correct 517 ms 16144 KB Output is correct
30 Correct 297 ms 15924 KB Output is correct
31 Correct 295 ms 15924 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 11 ms 14284 KB Output is correct
3 Correct 10 ms 14284 KB Output is correct
4 Correct 10 ms 14284 KB Output is correct
5 Correct 24 ms 14948 KB Output is correct
6 Correct 16 ms 14548 KB Output is correct
7 Correct 14 ms 14528 KB Output is correct
8 Correct 21 ms 14940 KB Output is correct
9 Correct 16 ms 14540 KB Output is correct
10 Correct 14 ms 14412 KB Output is correct
11 Correct 12 ms 14520 KB Output is correct
12 Correct 39 ms 15844 KB Output is correct
13 Correct 15 ms 15792 KB Output is correct
14 Correct 30 ms 15124 KB Output is correct
15 Correct 25 ms 15180 KB Output is correct
16 Correct 22 ms 15008 KB Output is correct
17 Correct 15 ms 14504 KB Output is correct
18 Correct 12 ms 14456 KB Output is correct
19 Correct 374 ms 15388 KB Output is correct
20 Correct 29 ms 15140 KB Output is correct
21 Correct 13 ms 15088 KB Output is correct
22 Correct 704 ms 15060 KB Output is correct
23 Correct 29 ms 14412 KB Output is correct
24 Correct 559 ms 15476 KB Output is correct
25 Correct 29 ms 15052 KB Output is correct
26 Correct 14 ms 15724 KB Output is correct
27 Correct 424 ms 15468 KB Output is correct
28 Correct 430 ms 15616 KB Output is correct
29 Correct 517 ms 16144 KB Output is correct
30 Correct 297 ms 15924 KB Output is correct
31 Correct 295 ms 15924 KB Output is correct
32 Correct 24 ms 15080 KB Output is correct
33 Correct 1415 ms 40844 KB Output is correct
34 Correct 488 ms 19728 KB Output is correct
35 Correct 1479 ms 38772 KB Output is correct
36 Correct 541 ms 20376 KB Output is correct
37 Correct 207 ms 19948 KB Output is correct
38 Correct 206 ms 19996 KB Output is correct
39 Execution timed out 2069 ms 73052 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 11 ms 14284 KB Output is correct
3 Correct 10 ms 14284 KB Output is correct
4 Correct 10 ms 14284 KB Output is correct
5 Correct 24 ms 14948 KB Output is correct
6 Correct 16 ms 14548 KB Output is correct
7 Correct 14 ms 14528 KB Output is correct
8 Correct 21 ms 14940 KB Output is correct
9 Correct 16 ms 14540 KB Output is correct
10 Correct 14 ms 14412 KB Output is correct
11 Correct 12 ms 14520 KB Output is correct
12 Correct 39 ms 15844 KB Output is correct
13 Correct 15 ms 15792 KB Output is correct
14 Correct 30 ms 15124 KB Output is correct
15 Correct 25 ms 15180 KB Output is correct
16 Correct 22 ms 15008 KB Output is correct
17 Correct 15 ms 14504 KB Output is correct
18 Correct 12 ms 14456 KB Output is correct
19 Correct 374 ms 15388 KB Output is correct
20 Correct 29 ms 15140 KB Output is correct
21 Correct 13 ms 15088 KB Output is correct
22 Correct 704 ms 15060 KB Output is correct
23 Correct 29 ms 14412 KB Output is correct
24 Correct 559 ms 15476 KB Output is correct
25 Correct 29 ms 15052 KB Output is correct
26 Correct 14 ms 15724 KB Output is correct
27 Correct 424 ms 15468 KB Output is correct
28 Correct 430 ms 15616 KB Output is correct
29 Correct 517 ms 16144 KB Output is correct
30 Correct 297 ms 15924 KB Output is correct
31 Correct 295 ms 15924 KB Output is correct
32 Correct 24 ms 15080 KB Output is correct
33 Correct 1415 ms 40844 KB Output is correct
34 Correct 488 ms 19728 KB Output is correct
35 Correct 1479 ms 38772 KB Output is correct
36 Correct 541 ms 20376 KB Output is correct
37 Correct 207 ms 19948 KB Output is correct
38 Correct 206 ms 19996 KB Output is correct
39 Execution timed out 2069 ms 73052 KB Time limit exceeded
40 Halted 0 ms 0 KB -