oj.uz

Submission #532822

# Submission time Handle Problem Language Result Execution time Memory
532822 2022-03-04T03:07:02 Z fhvirus Worst Reporter 4 (JOI21_worst_reporter4) C++17
79 / 100
 414 ms 94628 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#define debug(...) ((void)0)
#endif

const int kN = 200002;
int N, A[kN], H[kN], C[kN];

map<int, ll> dp[kN];

void add(map<int, ll>& mp, int pos, ll val) {
	mp[pos] += val;
	while (val > 0) {
		auto it = mp.lower_bound(pos);
		if (it == begin(mp)) break;
		it = prev(it);
		ll d = min(val, it->ss);
		val -= d;
		it->ss -= d;
		if (it->ss == 0) mp.erase(it);
	}
}
void merge(map<int, ll>& a, map<int, ll>& b) {
	if (a.size() < b.size()) swap(a, b);
	for (const auto& [pos, val]: b)
		a[pos] += val;
}

int indeg[kN];
vector<vector<int>> cycles;

int vis[kN], tot;
void dfs(int u) {
	vis[u] = tot;
	int v = A[u];
	if (vis[v] == 0) dfs(v);
	else if (vis[v] == tot) {
		vector<int> cycle;
		do {
			cycle.emplace_back(v);
			v = A[v];
		} while (v != u);
		cycles.push_back(cycle);
	}
}

signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	cin >> N;
	for (int i = 1; i <= N; ++i) {
		cin >> A[i] >> H[i] >> C[i];
		++indeg[A[i]];
	}

	for (int i = 1; i <= N; ++i)
		if (vis[i] == 0) {
			++tot;
			dfs(i);
		}

	queue<int> q;
	for (int i = 1; i <= N; ++i)
		if (indeg[i] == 0) q.push(i);

	while (!q.empty()) {
		int i = q.front(); q.pop();
		add(dp[i], H[i], C[i]);
		merge(dp[A[i]], dp[i]);
		if ((--indeg[A[i]]) == 0)
			q.push(A[i]);
	}

	ll ans = accumulate(C + 1, C + N + 1, 0ll);
	for (const vector<int>& cycle: cycles) {
		map<int, ll> mp;
		for (const int& u: cycle) {
			merge(mp, dp[u]);
			add(mp, H[u], C[u]);
		}
		for (const auto& [pos, val]: mp)
			ans -= val;
	}

	cout << ans << '\n';

	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9728 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 10 ms 10956 KB Output is correct
6 Correct 8 ms 10444 KB Output is correct
7 Correct 8 ms 10252 KB Output is correct
8 Correct 11 ms 11084 KB Output is correct
9 Correct 9 ms 10572 KB Output is correct
10 Correct 8 ms 10248 KB Output is correct
11 Correct 7 ms 10008 KB Output is correct
12 Correct 8 ms 9932 KB Output is correct
13 Correct 8 ms 9932 KB Output is correct
14 Correct 8 ms 9868 KB Output is correct
15 Correct 8 ms 9880 KB Output is correct
16 Correct 10 ms 11276 KB Output is correct
17 Correct 9 ms 10572 KB Output is correct
18 Correct 7 ms 10040 KB Output is correct
19 Correct 9 ms 10184 KB Output is correct
20 Correct 8 ms 10068 KB Output is correct
21 Correct 7 ms 10060 KB Output is correct
22 Correct 8 ms 10504 KB Output is correct
23 Correct 10 ms 10124 KB Output is correct
24 Correct 11 ms 10236 KB Output is correct
25 Correct 7 ms 10060 KB Output is correct
26 Correct 9 ms 9932 KB Output is correct
27 Correct 9 ms 10372 KB Output is correct
28 Correct 8 ms 10316 KB Output is correct
29 Correct 8 ms 10188 KB Output is correct
30 Correct 9 ms 10384 KB Output is correct
31 Correct 8 ms 10316 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9728 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 10 ms 10956 KB Output is correct
6 Correct 8 ms 10444 KB Output is correct
7 Correct 8 ms 10252 KB Output is correct
8 Correct 11 ms 11084 KB Output is correct
9 Correct 9 ms 10572 KB Output is correct
10 Correct 8 ms 10248 KB Output is correct
11 Correct 7 ms 10008 KB Output is correct
12 Correct 8 ms 9932 KB Output is correct
13 Correct 8 ms 9932 KB Output is correct
14 Correct 8 ms 9868 KB Output is correct
15 Correct 8 ms 9880 KB Output is correct
16 Correct 10 ms 11276 KB Output is correct
17 Correct 9 ms 10572 KB Output is correct
18 Correct 7 ms 10040 KB Output is correct
19 Correct 9 ms 10184 KB Output is correct
20 Correct 8 ms 10068 KB Output is correct
21 Correct 7 ms 10060 KB Output is correct
22 Correct 8 ms 10504 KB Output is correct
23 Correct 10 ms 10124 KB Output is correct
24 Correct 11 ms 10236 KB Output is correct
25 Correct 7 ms 10060 KB Output is correct
26 Correct 9 ms 9932 KB Output is correct
27 Correct 9 ms 10372 KB Output is correct
28 Correct 8 ms 10316 KB Output is correct
29 Correct 8 ms 10188 KB Output is correct
30 Correct 9 ms 10384 KB Output is correct
31 Correct 8 ms 10316 KB Output is correct
32 Correct 10 ms 11084 KB Output is correct
33 Correct 414 ms 84292 KB Output is correct
34 Correct 265 ms 53848 KB Output is correct
35 Correct 352 ms 83692 KB Output is correct
36 Correct 289 ms 53484 KB Output is correct
37 Correct 167 ms 27320 KB Output is correct
38 Correct 128 ms 21968 KB Output is correct
39 Correct 123 ms 15700 KB Output is correct
40 Correct 107 ms 15556 KB Output is correct
41 Correct 77 ms 15464 KB Output is correct
42 Correct 133 ms 15624 KB Output is correct
43 Correct 130 ms 15532 KB Output is correct
44 Correct 303 ms 94628 KB Output is correct
45 Correct 232 ms 59044 KB Output is correct
46 Correct 84 ms 21632 KB Output is correct
47 Correct 185 ms 28316 KB Output is correct
48 Correct 103 ms 21568 KB Output is correct
49 Correct 100 ms 21316 KB Output is correct
50 Correct 238 ms 39748 KB Output is correct
51 Correct 94 ms 27384 KB Output is correct
52 Correct 241 ms 28484 KB Output is correct
53 Correct 95 ms 21452 KB Output is correct
54 Correct 85 ms 15472 KB Output is correct
55 Correct 172 ms 33192 KB Output is correct
56 Correct 123 ms 28600 KB Output is correct
57 Correct 123 ms 27964 KB Output is correct
58 Correct 227 ms 34316 KB Output is correct
59 Correct 187 ms 34168 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9728 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 10 ms 10956 KB Output is correct
6 Correct 8 ms 10444 KB Output is correct
7 Correct 8 ms 10252 KB Output is correct
8 Correct 11 ms 11084 KB Output is correct
9 Correct 9 ms 10572 KB Output is correct
10 Correct 8 ms 10248 KB Output is correct
11 Correct 7 ms 10008 KB Output is correct
12 Correct 8 ms 9932 KB Output is correct
13 Correct 8 ms 9932 KB Output is correct
14 Correct 8 ms 9868 KB Output is correct
15 Correct 8 ms 9880 KB Output is correct
16 Correct 10 ms 11276 KB Output is correct
17 Correct 9 ms 10572 KB Output is correct
18 Correct 7 ms 10040 KB Output is correct
19 Correct 9 ms 10184 KB Output is correct
20 Correct 8 ms 10068 KB Output is correct
21 Correct 7 ms 10060 KB Output is correct
22 Correct 8 ms 10504 KB Output is correct
23 Correct 10 ms 10124 KB Output is correct
24 Correct 11 ms 10236 KB Output is correct
25 Correct 7 ms 10060 KB Output is correct
26 Correct 9 ms 9932 KB Output is correct
27 Correct 9 ms 10372 KB Output is correct
28 Correct 8 ms 10316 KB Output is correct
29 Correct 8 ms 10188 KB Output is correct
30 Correct 9 ms 10384 KB Output is correct
31 Correct 8 ms 10316 KB Output is correct
32 Correct 10 ms 11084 KB Output is correct
33 Correct 414 ms 84292 KB Output is correct
34 Correct 265 ms 53848 KB Output is correct
35 Correct 352 ms 83692 KB Output is correct
36 Correct 289 ms 53484 KB Output is correct
37 Correct 167 ms 27320 KB Output is correct
38 Correct 128 ms 21968 KB Output is correct
39 Correct 123 ms 15700 KB Output is correct
40 Correct 107 ms 15556 KB Output is correct
41 Correct 77 ms 15464 KB Output is correct
42 Correct 133 ms 15624 KB Output is correct
43 Correct 130 ms 15532 KB Output is correct
44 Correct 303 ms 94628 KB Output is correct
45 Correct 232 ms 59044 KB Output is correct
46 Correct 84 ms 21632 KB Output is correct
47 Correct 185 ms 28316 KB Output is correct
48 Correct 103 ms 21568 KB Output is correct
49 Correct 100 ms 21316 KB Output is correct
50 Correct 238 ms 39748 KB Output is correct
51 Correct 94 ms 27384 KB Output is correct
52 Correct 241 ms 28484 KB Output is correct
53 Correct 95 ms 21452 KB Output is correct
54 Correct 85 ms 15472 KB Output is correct
55 Correct 172 ms 33192 KB Output is correct
56 Correct 123 ms 28600 KB Output is correct
57 Correct 123 ms 27964 KB Output is correct
58 Correct 227 ms 34316 KB Output is correct
59 Correct 187 ms 34168 KB Output is correct
60 Correct 5 ms 9676 KB Output is correct
61 Correct 5 ms 9676 KB Output is correct
62 Correct 6 ms 9716 KB Output is correct
63 Correct 6 ms 9728 KB Output is correct
64 Incorrect 358 ms 58664 KB Output isn't correct
65 Halted 0 ms 0 KB -