oj.uz

Submission #595318

# Submission time Handle Problem Language Result Execution time Memory
595318 2022-07-13T15:26:14 Z inksamurai Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 325 ms 524288 KB 
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3uHasSr ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

const int inf=1e18;

signed main(){
_3uHasSr;
	int n;
	cin>>n;
	vec(pii) a(n);
	vi g(n);
	vec(vi) rg(n);
	rep(i,n){
		int u,h,c;
		cin>>u>>h>>c;
		u-=1;
		g[i]=u;
		rg[u].pb(i);
		a[i]={h,c};
	}
	vi tmp;
	rep(i,n){
		tmp.pb(a[i].fi);
	}
	tmp.pb(1);
	sort(tmp.begin(), tmp.end());
	tmp.erase(unique(tmp.begin(), tmp.end()),tmp.end());
	const int m=sz(tmp);
	vi usd(n,0),incyc(n,0);
	vi cyc,way;
	vec(vi) dp(n,vi(m,inf));
	auto dfs=[&](auto self,int v)->void{
		usd[v]=1;
		for(auto u:rg[v]){
			if(usd[u]==0){
				self(self,u);
			}
		}
		rep(i,m){
			dp[v][i]=(tmp[i]!=a[v].fi?a[v].se:0);
			for(auto u:rg[v]){
				dp[v][i]+=dp[u][i];
			}
		}
		per(i,m-1){
			dp[v][i]=min(dp[v][i],dp[v][i+1]);
		}

	};
	int ans=0;
	rep(v,n){
		if(usd[v]){
			continue;
		}
		cyc=way={};
		{
			while(1){
				way.pb(v);
				int u=g[v];
				if(usd[u]){
					while(way.back()!=u){
						cyc.pb(way.back());
						way.pop_back();
					}
					cyc.pb(way.back());
					way.pop_back();
					reverse(cyc.begin(), cyc.end());
					break;	
				}
				usd[v]=1;
				v=u;
			}
			for(auto _v:way){
				usd[_v]=0;
			}
			for(auto _v:cyc){
				usd[_v]=0;
				incyc[_v]=1;
			}
		}
		// evaluate dp outside of cycle
		vi rbts;
		for(auto _v:cyc){
			for(auto _u:rg[_v]){
				if(incyc[_u]) continue;
				rbts.pb(_u);
				if(usd[_u]==0){
					dfs(dfs,_u);
				}
			}
		}
		int sun=0;
		for(auto _v:cyc){
			usd[_v]=1;
			sun+=a[_v].se;
		}
		std::map<int,int> mp;
		for(auto _v:cyc){
			mp[a[_v].fi]+=a[_v].se;
		}
		if(mp.find(1)==mp.end()){
			mp[1]=0;
		}
		int res=inf;
		for(auto p:mp){
			int current=p.fi;
			int cosu=sun-p.se;
			// print(current,cosu,p.se);
			// every node has color current in cycle
			int id=(int)(lower_bound(tmp.begin(), tmp.end(),current)-tmp.begin());
			for(auto _v:rbts){
				// print(_v);
				cosu+=dp[_v][id];
			}
			res=min(res,cosu);
		}
		ans+=res;
	}
	print(ans);
//
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 213 ms 196560 KB Output is correct
6 Correct 8 ms 4948 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 233 ms 196820 KB Output is correct
9 Correct 8 ms 4896 KB Output is correct
10 Correct 3 ms 1364 KB Output is correct
11 Correct 3 ms 1132 KB Output is correct
12 Correct 216 ms 197332 KB Output is correct
13 Correct 5 ms 2004 KB Output is correct
14 Correct 222 ms 197172 KB Output is correct
15 Correct 7 ms 5204 KB Output is correct
16 Correct 212 ms 196816 KB Output is correct
17 Correct 8 ms 4948 KB Output is correct
18 Correct 4 ms 1108 KB Output is correct
19 Correct 232 ms 197092 KB Output is correct
20 Correct 7 ms 5204 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 184 ms 196752 KB Output is correct
23 Correct 6 ms 5024 KB Output is correct
24 Correct 325 ms 197096 KB Output is correct
25 Correct 7 ms 5204 KB Output is correct
26 Correct 208 ms 197324 KB Output is correct
27 Correct 212 ms 196972 KB Output is correct
28 Correct 207 ms 197068 KB Output is correct
29 Correct 207 ms 197276 KB Output is correct
30 Correct 210 ms 196984 KB Output is correct
31 Correct 212 ms 197192 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 213 ms 196560 KB Output is correct
6 Correct 8 ms 4948 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 233 ms 196820 KB Output is correct
9 Correct 8 ms 4896 KB Output is correct
10 Correct 3 ms 1364 KB Output is correct
11 Correct 3 ms 1132 KB Output is correct
12 Correct 216 ms 197332 KB Output is correct
13 Correct 5 ms 2004 KB Output is correct
14 Correct 222 ms 197172 KB Output is correct
15 Correct 7 ms 5204 KB Output is correct
16 Correct 212 ms 196816 KB Output is correct
17 Correct 8 ms 4948 KB Output is correct
18 Correct 4 ms 1108 KB Output is correct
19 Correct 232 ms 197092 KB Output is correct
20 Correct 7 ms 5204 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 184 ms 196752 KB Output is correct
23 Correct 6 ms 5024 KB Output is correct
24 Correct 325 ms 197096 KB Output is correct
25 Correct 7 ms 5204 KB Output is correct
26 Correct 208 ms 197324 KB Output is correct
27 Correct 212 ms 196972 KB Output is correct
28 Correct 207 ms 197068 KB Output is correct
29 Correct 207 ms 197276 KB Output is correct
30 Correct 210 ms 196984 KB Output is correct
31 Correct 212 ms 197192 KB Output is correct
32 Correct 220 ms 196944 KB Output is correct
33 Runtime error 305 ms 524288 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 213 ms 196560 KB Output is correct
6 Correct 8 ms 4948 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 233 ms 196820 KB Output is correct
9 Correct 8 ms 4896 KB Output is correct
10 Correct 3 ms 1364 KB Output is correct
11 Correct 3 ms 1132 KB Output is correct
12 Correct 216 ms 197332 KB Output is correct
13 Correct 5 ms 2004 KB Output is correct
14 Correct 222 ms 197172 KB Output is correct
15 Correct 7 ms 5204 KB Output is correct
16 Correct 212 ms 196816 KB Output is correct
17 Correct 8 ms 4948 KB Output is correct
18 Correct 4 ms 1108 KB Output is correct
19 Correct 232 ms 197092 KB Output is correct
20 Correct 7 ms 5204 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 184 ms 196752 KB Output is correct
23 Correct 6 ms 5024 KB Output is correct
24 Correct 325 ms 197096 KB Output is correct
25 Correct 7 ms 5204 KB Output is correct
26 Correct 208 ms 197324 KB Output is correct
27 Correct 212 ms 196972 KB Output is correct
28 Correct 207 ms 197068 KB Output is correct
29 Correct 207 ms 197276 KB Output is correct
30 Correct 210 ms 196984 KB Output is correct
31 Correct 212 ms 197192 KB Output is correct
32 Correct 220 ms 196944 KB Output is correct
33 Runtime error 305 ms 524288 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -