oj.uz

답안 #417628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417628 2021-06-04T04:38:42 Z maomao90 Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 2000 ms 44636 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 = incre[u], se = incre[v];
		if (fi.size() < se.size()) swap(fi, se);
		for (auto i : se) {
			fi[i.FI] += i.SE;
		}
		incre[u] = fi;
		incre[v].clear();
	}
	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:82:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
worst_reporter2.cpp:84:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |   int a; scanf("%d%d%d", &a, &h[i], &c[i]);
      |          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14396 KB Output is correct
4 Correct 10 ms 14400 KB Output is correct
5 Correct 32 ms 15304 KB Output is correct
6 Correct 18 ms 14668 KB Output is correct
7 Correct 15 ms 14644 KB Output is correct
8 Correct 26 ms 15168 KB Output is correct
9 Correct 18 ms 14652 KB Output is correct
10 Correct 15 ms 14556 KB Output is correct
11 Correct 13 ms 14532 KB Output is correct
12 Correct 66 ms 16124 KB Output is correct
13 Correct 16 ms 16072 KB Output is correct
14 Correct 49 ms 15420 KB Output is correct
15 Correct 30 ms 15308 KB Output is correct
16 Correct 20 ms 15156 KB Output is correct
17 Correct 18 ms 14660 KB Output is correct
18 Correct 13 ms 14632 KB Output is correct
19 Correct 661 ms 15748 KB Output is correct
20 Correct 41 ms 15308 KB Output is correct
21 Correct 14 ms 15328 KB Output is correct
22 Correct 982 ms 15352 KB Output is correct
23 Correct 33 ms 14540 KB Output is correct
24 Correct 1018 ms 15808 KB Output is correct
25 Correct 40 ms 15344 KB Output is correct
26 Correct 14 ms 16056 KB Output is correct
27 Correct 694 ms 15832 KB Output is correct
28 Correct 757 ms 16300 KB Output is correct
29 Correct 1050 ms 16780 KB Output is correct
30 Correct 611 ms 16452 KB Output is correct
31 Correct 622 ms 16296 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14396 KB Output is correct
4 Correct 10 ms 14400 KB Output is correct
5 Correct 32 ms 15304 KB Output is correct
6 Correct 18 ms 14668 KB Output is correct
7 Correct 15 ms 14644 KB Output is correct
8 Correct 26 ms 15168 KB Output is correct
9 Correct 18 ms 14652 KB Output is correct
10 Correct 15 ms 14556 KB Output is correct
11 Correct 13 ms 14532 KB Output is correct
12 Correct 66 ms 16124 KB Output is correct
13 Correct 16 ms 16072 KB Output is correct
14 Correct 49 ms 15420 KB Output is correct
15 Correct 30 ms 15308 KB Output is correct
16 Correct 20 ms 15156 KB Output is correct
17 Correct 18 ms 14660 KB Output is correct
18 Correct 13 ms 14632 KB Output is correct
19 Correct 661 ms 15748 KB Output is correct
20 Correct 41 ms 15308 KB Output is correct
21 Correct 14 ms 15328 KB Output is correct
22 Correct 982 ms 15352 KB Output is correct
23 Correct 33 ms 14540 KB Output is correct
24 Correct 1018 ms 15808 KB Output is correct
25 Correct 40 ms 15344 KB Output is correct
26 Correct 14 ms 16056 KB Output is correct
27 Correct 694 ms 15832 KB Output is correct
28 Correct 757 ms 16300 KB Output is correct
29 Correct 1050 ms 16780 KB Output is correct
30 Correct 611 ms 16452 KB Output is correct
31 Correct 622 ms 16296 KB Output is correct
32 Correct 31 ms 15180 KB Output is correct
33 Correct 1890 ms 44636 KB Output is correct
34 Correct 632 ms 20548 KB Output is correct
35 Execution timed out 2083 ms 40964 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14396 KB Output is correct
4 Correct 10 ms 14400 KB Output is correct
5 Correct 32 ms 15304 KB Output is correct
6 Correct 18 ms 14668 KB Output is correct
7 Correct 15 ms 14644 KB Output is correct
8 Correct 26 ms 15168 KB Output is correct
9 Correct 18 ms 14652 KB Output is correct
10 Correct 15 ms 14556 KB Output is correct
11 Correct 13 ms 14532 KB Output is correct
12 Correct 66 ms 16124 KB Output is correct
13 Correct 16 ms 16072 KB Output is correct
14 Correct 49 ms 15420 KB Output is correct
15 Correct 30 ms 15308 KB Output is correct
16 Correct 20 ms 15156 KB Output is correct
17 Correct 18 ms 14660 KB Output is correct
18 Correct 13 ms 14632 KB Output is correct
19 Correct 661 ms 15748 KB Output is correct
20 Correct 41 ms 15308 KB Output is correct
21 Correct 14 ms 15328 KB Output is correct
22 Correct 982 ms 15352 KB Output is correct
23 Correct 33 ms 14540 KB Output is correct
24 Correct 1018 ms 15808 KB Output is correct
25 Correct 40 ms 15344 KB Output is correct
26 Correct 14 ms 16056 KB Output is correct
27 Correct 694 ms 15832 KB Output is correct
28 Correct 757 ms 16300 KB Output is correct
29 Correct 1050 ms 16780 KB Output is correct
30 Correct 611 ms 16452 KB Output is correct
31 Correct 622 ms 16296 KB Output is correct
32 Correct 31 ms 15180 KB Output is correct
33 Correct 1890 ms 44636 KB Output is correct
34 Correct 632 ms 20548 KB Output is correct
35 Execution timed out 2083 ms 40964 KB Time limit exceeded
36 Halted 0 ms 0 KB -