oj.uz

Submission #540417

# Submission time Handle Problem Language Result Execution time Memory
540417 2022-03-20T10:13:46 Z cheissmart Worst Reporter 4 (JOI21_worst_reporter4) C++14
100 / 100
 307 ms 69132 KB 
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string to_string(pi p) {
	return "(" + to_string(p.F) + ", " + to_string(p.S) + ")";
}

template<class T> string to_string(T t) {
	string s = "[";
	bool f = false;
	for(auto&e:t) {
		if(f) s += ", ";
		s += to_string(e);
		f = true;
	}
	s += "]";
	return s;
}

void dbg() { cerr << "]" << endl; }
template<class H, class...T> void dbg(H h, T... t) {
	cerr << to_string(h);
	if(sizeof...(t)) cerr << ", ";
	dbg(t...);
}

#ifdef CHEISSMART
#define debug(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", dbg(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 1e9 + 7, N = 2e5 + 7;

int p[N], h[N], c[N];
vi G[N];

multiset<pi> dfs(int u) {
	multiset<pi> s;
	for(int v:G[u]) {
		auto t = dfs(v);
		if(SZ(s) < SZ(t)) swap(s, t);
		for(auto& e:t) s.insert(e);
	}
	s.insert({h[u], c[u]});
	auto it = s.lower_bound({h[u] + 1, -INF});
	int res = -c[u], lst = -1;
	while(it != s.end() && res < 0) {
		res += it -> S;
		lst = it -> F;
		it = s.erase(it);
	}
	if(res > 0 && lst != -1)
		s.insert({lst, res});
	return s;
}

int cycle[N], vis[N], incycle[N];
map<int, ll> mp[N];
multiset<pi> s[N];

signed main()
{
	IO_OP;

	int n;
	cin >> n;
	ll tot = 0;
	for(int i = 1; i <= n; i++) {
		cin >> p[i] >> h[i] >> c[i];
		h[i] = 1e9 + 1 - h[i]; // Read carefully...
		G[p[i]].PB(i);
		tot += c[i];
	}
	
	for(int i = 1; i <= n; i++) if(!vis[i]) {
		int u = i;
		vi tt;
		while(!vis[u]) {
			vis[u] = 1;
			tt.PB(u);
			u = p[u];
		}
		if(cycle[u]) {
			for(int v:tt) cycle[v] = cycle[u];
		} else {
			for(int v:tt) cycle[v] = u;
		}
	}
	for(int i = 1; i <= n; i++) {
		if(cycle[i] == i) {
			int u = i;
			do {
				incycle[u] = 1;
				u = p[u];
			} while(u != i);
		}
	}
	for(int i = 1; i <= n; i++) {	
		debug(i, cycle[i], incycle[i]);
	}
	for(int i = 1; i <= n; i++) if(incycle[i]) {
		mp[cycle[i]][h[i]] += c[i];
		auto& ss = s[cycle[i]];
		for(int v:G[i]) if(!incycle[v]) {
			auto tt = dfs(v);
			if(SZ(tt) > SZ(ss)) swap(ss, tt);
			for(auto& e:tt)
				ss.insert(e);
		}
	}
	
	ll ans = 0;
	for(int i = 1; i <= n; i++) if(cycle[i] == i) {
		mp[i][INF] += 0;
		auto& ss = s[i];
		auto it = ss.begin();
		ll sum = 0, mx = 0;
		for(auto[H, cost]:mp[i]) {
			while(it != ss.end() && it -> F <= H) {
				sum += it -> S;
				it++;
			}
			mx = max(mx, sum + cost);
		}
		ans += mx;
	}
	cout << tot - ans << '\n';	
}

Compilation message

worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:133:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  133 |   for(auto[H, cost]:mp[i]) {
      |           ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23824 KB Output is correct
2 Correct 13 ms 23824 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 17 ms 24228 KB Output is correct
6 Correct 17 ms 24208 KB Output is correct
7 Correct 18 ms 24208 KB Output is correct
8 Correct 18 ms 24344 KB Output is correct
9 Correct 18 ms 24276 KB Output is correct
10 Correct 19 ms 24344 KB Output is correct
11 Correct 18 ms 24344 KB Output is correct
12 Correct 18 ms 24856 KB Output is correct
13 Correct 18 ms 24920 KB Output is correct
14 Correct 17 ms 24444 KB Output is correct
15 Correct 17 ms 24460 KB Output is correct
16 Correct 18 ms 24344 KB Output is correct
17 Correct 18 ms 24348 KB Output is correct
18 Correct 18 ms 24368 KB Output is correct
19 Correct 16 ms 24628 KB Output is correct
20 Correct 17 ms 24532 KB Output is correct
21 Correct 15 ms 24480 KB Output is correct
22 Correct 16 ms 24276 KB Output is correct
23 Correct 16 ms 24204 KB Output is correct
24 Correct 15 ms 24596 KB Output is correct
25 Correct 18 ms 24604 KB Output is correct
26 Correct 16 ms 25044 KB Output is correct
27 Correct 16 ms 24532 KB Output is correct
28 Correct 17 ms 24620 KB Output is correct
29 Correct 17 ms 24836 KB Output is correct
30 Correct 18 ms 24884 KB Output is correct
31 Correct 17 ms 24852 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23824 KB Output is correct
2 Correct 13 ms 23824 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 17 ms 24228 KB Output is correct
6 Correct 17 ms 24208 KB Output is correct
7 Correct 18 ms 24208 KB Output is correct
8 Correct 18 ms 24344 KB Output is correct
9 Correct 18 ms 24276 KB Output is correct
10 Correct 19 ms 24344 KB Output is correct
11 Correct 18 ms 24344 KB Output is correct
12 Correct 18 ms 24856 KB Output is correct
13 Correct 18 ms 24920 KB Output is correct
14 Correct 17 ms 24444 KB Output is correct
15 Correct 17 ms 24460 KB Output is correct
16 Correct 18 ms 24344 KB Output is correct
17 Correct 18 ms 24348 KB Output is correct
18 Correct 18 ms 24368 KB Output is correct
19 Correct 16 ms 24628 KB Output is correct
20 Correct 17 ms 24532 KB Output is correct
21 Correct 15 ms 24480 KB Output is correct
22 Correct 16 ms 24276 KB Output is correct
23 Correct 16 ms 24204 KB Output is correct
24 Correct 15 ms 24596 KB Output is correct
25 Correct 18 ms 24604 KB Output is correct
26 Correct 16 ms 25044 KB Output is correct
27 Correct 16 ms 24532 KB Output is correct
28 Correct 17 ms 24620 KB Output is correct
29 Correct 17 ms 24836 KB Output is correct
30 Correct 18 ms 24884 KB Output is correct
31 Correct 17 ms 24852 KB Output is correct
32 Correct 16 ms 24276 KB Output is correct
33 Correct 277 ms 45064 KB Output is correct
34 Correct 296 ms 44364 KB Output is correct
35 Correct 264 ms 43660 KB Output is correct
36 Correct 278 ms 44504 KB Output is correct
37 Correct 265 ms 44636 KB Output is correct
38 Correct 307 ms 45196 KB Output is correct
39 Correct 167 ms 67148 KB Output is correct
40 Correct 169 ms 67160 KB Output is correct
41 Correct 154 ms 68892 KB Output is correct
42 Correct 163 ms 53064 KB Output is correct
43 Correct 167 ms 53048 KB Output is correct
44 Correct 266 ms 44944 KB Output is correct
45 Correct 269 ms 44960 KB Output is correct
46 Correct 306 ms 48356 KB Output is correct
47 Correct 196 ms 55008 KB Output is correct
48 Correct 193 ms 52820 KB Output is correct
49 Correct 163 ms 54016 KB Output is correct
50 Correct 171 ms 42040 KB Output is correct
51 Correct 169 ms 42160 KB Output is correct
52 Correct 204 ms 55584 KB Output is correct
53 Correct 208 ms 54856 KB Output is correct
54 Correct 116 ms 66868 KB Output is correct
55 Correct 168 ms 56220 KB Output is correct
56 Correct 177 ms 65048 KB Output is correct
57 Correct 176 ms 69132 KB Output is correct
58 Correct 178 ms 66472 KB Output is correct
59 Correct 180 ms 66544 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23824 KB Output is correct
2 Correct 13 ms 23824 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 17 ms 24228 KB Output is correct
6 Correct 17 ms 24208 KB Output is correct
7 Correct 18 ms 24208 KB Output is correct
8 Correct 18 ms 24344 KB Output is correct
9 Correct 18 ms 24276 KB Output is correct
10 Correct 19 ms 24344 KB Output is correct
11 Correct 18 ms 24344 KB Output is correct
12 Correct 18 ms 24856 KB Output is correct
13 Correct 18 ms 24920 KB Output is correct
14 Correct 17 ms 24444 KB Output is correct
15 Correct 17 ms 24460 KB Output is correct
16 Correct 18 ms 24344 KB Output is correct
17 Correct 18 ms 24348 KB Output is correct
18 Correct 18 ms 24368 KB Output is correct
19 Correct 16 ms 24628 KB Output is correct
20 Correct 17 ms 24532 KB Output is correct
21 Correct 15 ms 24480 KB Output is correct
22 Correct 16 ms 24276 KB Output is correct
23 Correct 16 ms 24204 KB Output is correct
24 Correct 15 ms 24596 KB Output is correct
25 Correct 18 ms 24604 KB Output is correct
26 Correct 16 ms 25044 KB Output is correct
27 Correct 16 ms 24532 KB Output is correct
28 Correct 17 ms 24620 KB Output is correct
29 Correct 17 ms 24836 KB Output is correct
30 Correct 18 ms 24884 KB Output is correct
31 Correct 17 ms 24852 KB Output is correct
32 Correct 16 ms 24276 KB Output is correct
33 Correct 277 ms 45064 KB Output is correct
34 Correct 296 ms 44364 KB Output is correct
35 Correct 264 ms 43660 KB Output is correct
36 Correct 278 ms 44504 KB Output is correct
37 Correct 265 ms 44636 KB Output is correct
38 Correct 307 ms 45196 KB Output is correct
39 Correct 167 ms 67148 KB Output is correct
40 Correct 169 ms 67160 KB Output is correct
41 Correct 154 ms 68892 KB Output is correct
42 Correct 163 ms 53064 KB Output is correct
43 Correct 167 ms 53048 KB Output is correct
44 Correct 266 ms 44944 KB Output is correct
45 Correct 269 ms 44960 KB Output is correct
46 Correct 306 ms 48356 KB Output is correct
47 Correct 196 ms 55008 KB Output is correct
48 Correct 193 ms 52820 KB Output is correct
49 Correct 163 ms 54016 KB Output is correct
50 Correct 171 ms 42040 KB Output is correct
51 Correct 169 ms 42160 KB Output is correct
52 Correct 204 ms 55584 KB Output is correct
53 Correct 208 ms 54856 KB Output is correct
54 Correct 116 ms 66868 KB Output is correct
55 Correct 168 ms 56220 KB Output is correct
56 Correct 177 ms 65048 KB Output is correct
57 Correct 176 ms 69132 KB Output is correct
58 Correct 178 ms 66472 KB Output is correct
59 Correct 180 ms 66544 KB Output is correct
60 Correct 12 ms 23764 KB Output is correct
61 Correct 12 ms 23836 KB Output is correct
62 Correct 12 ms 23900 KB Output is correct
63 Correct 12 ms 23764 KB Output is correct
64 Correct 262 ms 44332 KB Output is correct
65 Correct 264 ms 43812 KB Output is correct
66 Correct 251 ms 43996 KB Output is correct
67 Correct 259 ms 43504 KB Output is correct
68 Correct 241 ms 43052 KB Output is correct
69 Correct 274 ms 47572 KB Output is correct
70 Correct 238 ms 52292 KB Output is correct
71 Correct 126 ms 40052 KB Output is correct
72 Correct 219 ms 52312 KB Output is correct
73 Correct 123 ms 40152 KB Output is correct
74 Correct 249 ms 47656 KB Output is correct
75 Correct 182 ms 41388 KB Output is correct
76 Correct 178 ms 41352 KB Output is correct
77 Correct 182 ms 48124 KB Output is correct
78 Correct 148 ms 41880 KB Output is correct
79 Correct 246 ms 48928 KB Output is correct
80 Correct 199 ms 42624 KB Output is correct
81 Correct 200 ms 42964 KB Output is correct
82 Correct 237 ms 52716 KB Output is correct
83 Correct 118 ms 64932 KB Output is correct
84 Correct 229 ms 55800 KB Output is correct
85 Correct 239 ms 55808 KB Output is correct
86 Correct 219 ms 52604 KB Output is correct
87 Correct 236 ms 55764 KB Output is correct
88 Correct 275 ms 55784 KB Output is correct