oj.uz

Submission #525036

# Submission time Handle Problem Language Result Execution time Memory
525036 2022-02-10T14:35:34 Z amunduzbaev Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 199 ms 197152 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
typedef long long ll;
const int N = 5005;
vector<int> edges[N];
int a[N], h[N], c[N];
int used[N], is[N];
ll dp[N][N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin>>n;
	vector<int> p(n);
	for(int i=0;i<n;i++){
		cin>>a[i]>>h[i]>>c[i];
		a[i]--; p[i] = i;
	} sort(p.begin(), p.end(), [&](int i, int j) { return (h[i] < h[j]); });
	for(int i=0, last=0;i<n;){
		int j = i;
		while(j<n && h[p[i]] == h[p[j]]) j++;
		while(i < j) h[p[i]] = last, i++;
		last++;
	}
 	
	vector<vector<int>> cc;
	for(int i=0;i<n;i++){
		if(used[i]) continue;
		vector<int> ss;
		int u = i;
		while(!used[u]){
			used[u] = 1;
			ss.push_back(u);
			u = a[u];
		}
		
		vector<int> tmp = {u};
		while(!ss.empty() && ss.back() != u){
			tmp.push_back(ss.back());
			ss.pop_back();
		}
		
		if(ss.empty()) continue;
		for(auto x : tmp) is[x] = 1;
		cc.push_back(tmp);
	}
	
	//~ for(int i=0;i<n;i++) cout<<is[i]<<" ";
	//~ cout<<"\n";
	
	for(int i=0;i<n;i++){
		if(is[i] && is[a[i]]) continue;
		edges[a[i]].push_back(i);
	}
	//~ for(int i=0;i<n;i++){
		//~ cout<<i<<" : ";
		//~ for(auto x : edges[i]) cout<<x<<" ";
		//~ cout<<"\n";
	//~ }
	
	function<void(int)> dfs = [&](int u){
		dp[u][h[u]] += c[u];
		for(auto x : edges[u]){
			dfs(x);
			for(int j=0;j<n;j++){
				dp[u][j] += dp[x][j];
			}
		}
		
		for(int j=n-1;~j;j--){
			dp[u][j] = max(dp[u][j], dp[u][j+1]);
		}
	};
	//~ for(int i=0;i<n;i++) cout<<h[i]<<" ";
	//~ cout<<"\n";
	for(int i=0;i<n;i++){
		if(!is[i]) continue;
		dfs(i);
	}
	
	//~ for(int i=0;i<n;i++){
		//~ for(int j=0;j<n;j++) cout<<dp[i][j]<<" ";
		//~ cout<<"\n";
	//~ }
	
	ll res = accumulate(c, c+n, 0ll);
	//~ cout<<res<<"\n";
	for(auto v : cc){
		ll tot = 0;
		for(int j=0;j<n;j++){
			ll rr = 0;
			for(auto x : v){
				rr += dp[x][j];
			} tot = max(tot, rr);
		} res -= tot;
	}
	
	cout<<res<<"\n";
}

/*

6
1 6 5
1 3 6
1 8 4
3 4 9
2 2 5
2 5 6

*/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 416 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 182 ms 196412 KB Output is correct
6 Correct 180 ms 196564 KB Output is correct
7 Correct 179 ms 196500 KB Output is correct
8 Correct 177 ms 196564 KB Output is correct
9 Correct 181 ms 196580 KB Output is correct
10 Correct 180 ms 196560 KB Output is correct
11 Correct 180 ms 196492 KB Output is correct
12 Correct 168 ms 197088 KB Output is correct
13 Correct 165 ms 197152 KB Output is correct
14 Correct 167 ms 196804 KB Output is correct
15 Correct 167 ms 196908 KB Output is correct
16 Correct 178 ms 196580 KB Output is correct
17 Correct 180 ms 196724 KB Output is correct
18 Correct 179 ms 196544 KB Output is correct
19 Correct 181 ms 196712 KB Output is correct
20 Correct 186 ms 196800 KB Output is correct
21 Correct 183 ms 196840 KB Output is correct
22 Correct 198 ms 196512 KB Output is correct
23 Correct 199 ms 196512 KB Output is correct
24 Correct 183 ms 196840 KB Output is correct
25 Correct 185 ms 196908 KB Output is correct
26 Correct 164 ms 197040 KB Output is correct
27 Correct 187 ms 196664 KB Output is correct
28 Correct 179 ms 196804 KB Output is correct
29 Correct 171 ms 196920 KB Output is correct
30 Correct 165 ms 196804 KB Output is correct
31 Correct 164 ms 196804 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 416 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 182 ms 196412 KB Output is correct
6 Correct 180 ms 196564 KB Output is correct
7 Correct 179 ms 196500 KB Output is correct
8 Correct 177 ms 196564 KB Output is correct
9 Correct 181 ms 196580 KB Output is correct
10 Correct 180 ms 196560 KB Output is correct
11 Correct 180 ms 196492 KB Output is correct
12 Correct 168 ms 197088 KB Output is correct
13 Correct 165 ms 197152 KB Output is correct
14 Correct 167 ms 196804 KB Output is correct
15 Correct 167 ms 196908 KB Output is correct
16 Correct 178 ms 196580 KB Output is correct
17 Correct 180 ms 196724 KB Output is correct
18 Correct 179 ms 196544 KB Output is correct
19 Correct 181 ms 196712 KB Output is correct
20 Correct 186 ms 196800 KB Output is correct
21 Correct 183 ms 196840 KB Output is correct
22 Correct 198 ms 196512 KB Output is correct
23 Correct 199 ms 196512 KB Output is correct
24 Correct 183 ms 196840 KB Output is correct
25 Correct 185 ms 196908 KB Output is correct
26 Correct 164 ms 197040 KB Output is correct
27 Correct 187 ms 196664 KB Output is correct
28 Correct 179 ms 196804 KB Output is correct
29 Correct 171 ms 196920 KB Output is correct
30 Correct 165 ms 196804 KB Output is correct
31 Correct 164 ms 196804 KB Output is correct
32 Correct 179 ms 196544 KB Output is correct
33 Runtime error 14 ms 3308 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 416 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 182 ms 196412 KB Output is correct
6 Correct 180 ms 196564 KB Output is correct
7 Correct 179 ms 196500 KB Output is correct
8 Correct 177 ms 196564 KB Output is correct
9 Correct 181 ms 196580 KB Output is correct
10 Correct 180 ms 196560 KB Output is correct
11 Correct 180 ms 196492 KB Output is correct
12 Correct 168 ms 197088 KB Output is correct
13 Correct 165 ms 197152 KB Output is correct
14 Correct 167 ms 196804 KB Output is correct
15 Correct 167 ms 196908 KB Output is correct
16 Correct 178 ms 196580 KB Output is correct
17 Correct 180 ms 196724 KB Output is correct
18 Correct 179 ms 196544 KB Output is correct
19 Correct 181 ms 196712 KB Output is correct
20 Correct 186 ms 196800 KB Output is correct
21 Correct 183 ms 196840 KB Output is correct
22 Correct 198 ms 196512 KB Output is correct
23 Correct 199 ms 196512 KB Output is correct
24 Correct 183 ms 196840 KB Output is correct
25 Correct 185 ms 196908 KB Output is correct
26 Correct 164 ms 197040 KB Output is correct
27 Correct 187 ms 196664 KB Output is correct
28 Correct 179 ms 196804 KB Output is correct
29 Correct 171 ms 196920 KB Output is correct
30 Correct 165 ms 196804 KB Output is correct
31 Correct 164 ms 196804 KB Output is correct
32 Correct 179 ms 196544 KB Output is correct
33 Runtime error 14 ms 3308 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -