Submission #912479

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
912479	2024-01-19T14:17:46 Z	mickey080929	Worst Reporter 4 (JOI21_worst_reporter4)	C++17	79 / 100	373 ms	149708 KB

worst_reporter2

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const ll inf = 2e18;

ll nxt[200010];
vector<ll> rev[200010];
ll H[200010], C[200010];
ll vis[200010];
ll st = -1;
ll cy[200010];
vector<ll> v[200010];

void dfs(ll x, ll num) {
	vis[x] = num;
	if (vis[nxt[x]] == num) {
		st = num;
		return;
	}
	if (vis[nxt[x]]) return;
	dfs(nxt[x], num);
}

void push_cycle(ll x, ll num) {
	cy[x] = num;
	v[num].push_back(x);
	if (cy[nxt[x]]) return;
	push_cycle(nxt[x], num);
}

ll par[200010];
multiset<pair<ll,ll>> ms[200010];

ll Find(ll x) {
	if (x == par[x]) return x;
	return par[x] = Find(par[x]);
}

void Union(ll x, ll y) {
	x = Find(x);
	y = Find(y);
	if (x == y) return;
	if (ms[x].size() < ms[y].size()) swap(x, y);
	for (auto &[i, add] : ms[y]) {
		ms[x].insert({i, add});
	}
	par[y] = x;
}

void dfs2(ll x) {
	for (auto &y : rev[x]) {
		dfs2(y);
		Union(x, y);
	}
	ll X = Find(x);
	ll cur = C[x];
	for (auto it = ms[X].upper_bound({H[x], inf}); it != ms[X].end(); ) {
		if (cur < it->second) {
			auto t = *it;
			ms[X].erase(it);
			ms[X].insert({t.first, t.second - cur});
			break;
		}
		cur -= it->second;
		it = ms[X].erase(it);
	}
	ms[X].insert({H[x], C[x]});
}

int main() {
	ios_base :: sync_with_stdio(false); cin.tie(NULL); 
	ll n;
	cin >> n;
	ll ans = 0;
	for (ll i=1; i<=n; i++) {
		cin >> nxt[i] >> H[i] >> C[i];
		H[i] *= -1;
		rev[nxt[i]].push_back(i);
		ans += C[i];
		par[i] = i;
	}
	ll num = 0, num2 = 0;
	for (ll i=1; i<=n; i++) {
		if (vis[i]) continue;
		st = -1;
		dfs(i, ++num);
		if (st != -1) {
			push_cycle(st, ++num2);
		}
	}
	for (ll i=1; i<=num2; i++) {
		map<ll,ll> mp;
		ll pv = -1;
		for (auto &x : v[i]) {
			for (auto &y : rev[x]) {
				if (cy[y]) continue;
				dfs2(y);
				if (pv == -1) pv = y;
				else Union(pv, y);
			}
			if (mp.find(H[i]) != mp.end()) {
				mp[H[i]] += C[i];
			}
			else {
				mp[H[i]] = C[i];
			}
		}
		ll mx = 0;
		if (pv == -1) {
			for (auto &[i, add] : mp)
				mx = max(mx, add);
		}
		else {
			pv = Find(pv);
			vector<pair<ll,ll>> func;
			for (auto &[i, add] : ms[pv]) {
				func.push_back({i, add});
			}
			for (ll i=0; i+1<func.size(); i++) {
				func[i+1].second += func[i].second;
			}
			
			for (auto &[i, add] : mp) {
				ll idx = upper_bound(func.begin(), func.end(), make_pair(i, inf)) - func.begin() - 1;
				if (idx == -1) mx = max(mx, add);
				else mx = max(mx, func[idx].second + add);
			}
			mx = max(mx, func.back().second);
		}
		ans -= mx;
	}
	cout << ans << '\n';
}

Compilation message

worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:121:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |    for (ll i=0; i+1<func.size(); i++) {
      |                 ~~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	25180 KB	Output is correct
2	Correct	7 ms	25180 KB	Output is correct
3	Correct	7 ms	25180 KB	Output is correct
4	Correct	7 ms	25180 KB	Output is correct
5	Correct	13 ms	26460 KB	Output is correct
6	Correct	12 ms	26460 KB	Output is correct
7	Correct	13 ms	26460 KB	Output is correct
8	Correct	11 ms	26456 KB	Output is correct
9	Correct	13 ms	26712 KB	Output is correct
10	Correct	12 ms	26408 KB	Output is correct
11	Correct	17 ms	26968 KB	Output is correct
12	Correct	10 ms	26200 KB	Output is correct
13	Correct	9 ms	26036 KB	Output is correct
14	Correct	9 ms	25692 KB	Output is correct
15	Correct	12 ms	25692 KB	Output is correct
16	Correct	12 ms	26972 KB	Output is correct
17	Correct	15 ms	26972 KB	Output is correct
18	Correct	12 ms	27484 KB	Output is correct
19	Correct	11 ms	26204 KB	Output is correct
20	Correct	11 ms	25944 KB	Output is correct
21	Correct	10 ms	26144 KB	Output is correct
22	Correct	10 ms	26196 KB	Output is correct
23	Correct	10 ms	26200 KB	Output is correct
24	Correct	9 ms	26168 KB	Output is correct
25	Correct	9 ms	26204 KB	Output is correct
26	Correct	10 ms	26164 KB	Output is correct
27	Correct	11 ms	26312 KB	Output is correct
28	Correct	10 ms	26204 KB	Output is correct
29	Correct	10 ms	26480 KB	Output is correct
30	Correct	10 ms	26504 KB	Output is correct
31	Correct	9 ms	26496 KB	Output is correct

Subtask #2
65.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	25180 KB	Output is correct
2	Correct	7 ms	25180 KB	Output is correct
3	Correct	7 ms	25180 KB	Output is correct
4	Correct	7 ms	25180 KB	Output is correct
5	Correct	13 ms	26460 KB	Output is correct
6	Correct	12 ms	26460 KB	Output is correct
7	Correct	13 ms	26460 KB	Output is correct
8	Correct	11 ms	26456 KB	Output is correct
9	Correct	13 ms	26712 KB	Output is correct
10	Correct	12 ms	26408 KB	Output is correct
11	Correct	17 ms	26968 KB	Output is correct
12	Correct	10 ms	26200 KB	Output is correct
13	Correct	9 ms	26036 KB	Output is correct
14	Correct	9 ms	25692 KB	Output is correct
15	Correct	12 ms	25692 KB	Output is correct
16	Correct	12 ms	26972 KB	Output is correct
17	Correct	15 ms	26972 KB	Output is correct
18	Correct	12 ms	27484 KB	Output is correct
19	Correct	11 ms	26204 KB	Output is correct
20	Correct	11 ms	25944 KB	Output is correct
21	Correct	10 ms	26144 KB	Output is correct
22	Correct	10 ms	26196 KB	Output is correct
23	Correct	10 ms	26200 KB	Output is correct
24	Correct	9 ms	26168 KB	Output is correct
25	Correct	9 ms	26204 KB	Output is correct
26	Correct	10 ms	26164 KB	Output is correct
27	Correct	11 ms	26312 KB	Output is correct
28	Correct	10 ms	26204 KB	Output is correct
29	Correct	10 ms	26480 KB	Output is correct
30	Correct	10 ms	26504 KB	Output is correct
31	Correct	9 ms	26496 KB	Output is correct
32	Correct	11 ms	26472 KB	Output is correct
33	Correct	340 ms	96724 KB	Output is correct
34	Correct	344 ms	96216 KB	Output is correct
35	Correct	315 ms	93812 KB	Output is correct
36	Correct	343 ms	95192 KB	Output is correct
37	Correct	341 ms	94408 KB	Output is correct
38	Correct	373 ms	107968 KB	Output is correct
39	Correct	139 ms	64460 KB	Output is correct
40	Correct	145 ms	64496 KB	Output is correct
41	Correct	128 ms	68124 KB	Output is correct
42	Correct	125 ms	52052 KB	Output is correct
43	Correct	132 ms	51980 KB	Output is correct
44	Correct	310 ms	119924 KB	Output is correct
45	Correct	274 ms	121292 KB	Output is correct
46	Correct	312 ms	149708 KB	Output is correct
47	Correct	246 ms	64000 KB	Output is correct
48	Correct	196 ms	59832 KB	Output is correct
49	Correct	166 ms	62436 KB	Output is correct
50	Correct	274 ms	64384 KB	Output is correct
51	Correct	221 ms	64564 KB	Output is correct
52	Correct	226 ms	65096 KB	Output is correct
53	Correct	271 ms	63628 KB	Output is correct
54	Correct	105 ms	64440 KB	Output is correct
55	Correct	203 ms	70152 KB	Output is correct
56	Correct	173 ms	74452 KB	Output is correct
57	Correct	183 ms	76484 KB	Output is correct
58	Correct	205 ms	75572 KB	Output is correct
59	Correct	177 ms	76040 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	25180 KB	Output is correct
2	Correct	7 ms	25180 KB	Output is correct
3	Correct	7 ms	25180 KB	Output is correct
4	Correct	7 ms	25180 KB	Output is correct
5	Correct	13 ms	26460 KB	Output is correct
6	Correct	12 ms	26460 KB	Output is correct
7	Correct	13 ms	26460 KB	Output is correct
8	Correct	11 ms	26456 KB	Output is correct
9	Correct	13 ms	26712 KB	Output is correct
10	Correct	12 ms	26408 KB	Output is correct
11	Correct	17 ms	26968 KB	Output is correct
12	Correct	10 ms	26200 KB	Output is correct
13	Correct	9 ms	26036 KB	Output is correct
14	Correct	9 ms	25692 KB	Output is correct
15	Correct	12 ms	25692 KB	Output is correct
16	Correct	12 ms	26972 KB	Output is correct
17	Correct	15 ms	26972 KB	Output is correct
18	Correct	12 ms	27484 KB	Output is correct
19	Correct	11 ms	26204 KB	Output is correct
20	Correct	11 ms	25944 KB	Output is correct
21	Correct	10 ms	26144 KB	Output is correct
22	Correct	10 ms	26196 KB	Output is correct
23	Correct	10 ms	26200 KB	Output is correct
24	Correct	9 ms	26168 KB	Output is correct
25	Correct	9 ms	26204 KB	Output is correct
26	Correct	10 ms	26164 KB	Output is correct
27	Correct	11 ms	26312 KB	Output is correct
28	Correct	10 ms	26204 KB	Output is correct
29	Correct	10 ms	26480 KB	Output is correct
30	Correct	10 ms	26504 KB	Output is correct
31	Correct	9 ms	26496 KB	Output is correct
32	Correct	11 ms	26472 KB	Output is correct
33	Correct	340 ms	96724 KB	Output is correct
34	Correct	344 ms	96216 KB	Output is correct
35	Correct	315 ms	93812 KB	Output is correct
36	Correct	343 ms	95192 KB	Output is correct
37	Correct	341 ms	94408 KB	Output is correct
38	Correct	373 ms	107968 KB	Output is correct
39	Correct	139 ms	64460 KB	Output is correct
40	Correct	145 ms	64496 KB	Output is correct
41	Correct	128 ms	68124 KB	Output is correct
42	Correct	125 ms	52052 KB	Output is correct
43	Correct	132 ms	51980 KB	Output is correct
44	Correct	310 ms	119924 KB	Output is correct
45	Correct	274 ms	121292 KB	Output is correct
46	Correct	312 ms	149708 KB	Output is correct
47	Correct	246 ms	64000 KB	Output is correct
48	Correct	196 ms	59832 KB	Output is correct
49	Correct	166 ms	62436 KB	Output is correct
50	Correct	274 ms	64384 KB	Output is correct
51	Correct	221 ms	64564 KB	Output is correct
52	Correct	226 ms	65096 KB	Output is correct
53	Correct	271 ms	63628 KB	Output is correct
54	Correct	105 ms	64440 KB	Output is correct
55	Correct	203 ms	70152 KB	Output is correct
56	Correct	173 ms	74452 KB	Output is correct
57	Correct	183 ms	76484 KB	Output is correct
58	Correct	205 ms	75572 KB	Output is correct
59	Correct	177 ms	76040 KB	Output is correct
60	Incorrect	7 ms	25244 KB	Output isn't correct
61	Halted	0 ms	0 KB	-

Submission #912479

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 65.0 / 65.0

Subtask #3 0 / 21.0

Subtask #1
14.0 / 14.0

Subtask #2
65.0 / 65.0

Subtask #3
0 / 21.0