oj.uz

Submission #595587

# Submission time Handle Problem Language Result Execution time Memory
595587 2022-07-13T20:45:44 Z inksamurai Worst Reporter 4 (JOI21_worst_reporter4) C++17
100 / 100
 399 ms 112168 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+1);
	vi g(n+1);
	vec(vi) rg(n+1);
	rep(i,n){
		int u,h,c;
		cin>>u>>h>>c;
		u-=1;
		g[i]=u;
		rg[u].pb(i);
		a[i]={h,c};
	}

	vec(std::map<int,int>) dp(n+1);
	vi center(n+1);
	rep(v,n+1){
		center[v]=v;
	}
	auto evaluate=[&](int rt,vi&usd){
		vi topo;
		{
			queue<int> que;
			que.push(rt);
			while(sz(que)){
				int v=que.front();
				que.pop();
				topo.pb(v);
				for(auto u:rg[v]){
					que.push(u);
				}
			}
		}
		for(auto v:topo){
			usd[v]=1;
			// print(v);
		}
		// print(".....");
		per(i,sz(topo)){
			int v=topo[i];
			auto [h,c]=a[v];
			dp[center[v]][h]+=c;
			// perform dp update
			{
				auto it=dp[center[v]].find(h);
				if(it!=dp[center[v]].begin()){
					it=prev(it);
					while(1){
						auto nit=it;
						bool lok=0;
						if(it==dp[center[v]].begin()){
							lok=1;
						}else{
							it=prev(it);
						}
						pii _p=*nit;
						if(c>=_p.se){
							c-=_p.se;
							dp[center[v]].erase(nit);
						}else{
							_p.se-=c;
							dp[center[v]].erase(nit);
							dp[center[v]][_p.fi]+=_p.se;
							break;
						}
						if(lok){
							break;
						}
					}
				}
			}
			if(!i){
				break;
			}
			// merge to parent node
			int up=g[v];
			int u0=center[up],u1=center[v];
			if(sz(dp[u0])<sz(dp[u1])){
				swap(u0,u1);
				center[up]=center[v];
			}
			for(auto p:dp[u1]){
				dp[u0][p.fi]+=p.se;
			}
		}
		int v=center[topo[0]];
		vec(pii) evs;
		for(auto p:dp[v]){
			if(p.fi){
				evs.pb(p);
			}
		}
		per(i,sz(evs)-1){
			evs[i].se+=evs[i+1].se;
		}
		return evs;
	};

	const int extra_node=n;
	vi usd(n+1),incyc(n+1);
	int res=0;
	rep(rt,n){
		if(usd[rt]){
			continue;
		}
		// print(rt);
		vi way,cyc;
		{
			int v=rt;
			while(1){
				usd[v]=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;	
				}
				v=u;
			}
			for(auto v:cyc){
				incyc[v]=1;
			}
		}
		vi rbts;
		{
			for(auto v:cyc){
				for(auto u:rg[v]){
					if(!incyc[u]){
						rbts.pb(u);
					}
				}
			}
		}
		// unite cycle and add edge from every rabbit to extra
		{
			usd[extra_node]=0;
			rg[extra_node].clear();
			dp[extra_node].clear();
			g[extra_node]=0;
			center[extra_node]=extra_node;
		}
		for(auto v:rbts){
			g[v]=extra_node;
			rg[extra_node].pb(v);
		}
		vec(pii) evs=evaluate(extra_node,usd);
		int now=sz(evs)?evs[0].se:0;
		std::map<int,int> mp;
		for(auto v:cyc){
			mp[a[v].fi]+=a[v].se;
		}
		for(auto p:mp){
			int need=p.fi;
			auto it=lower_bound(evs.begin(), evs.end(),pii(need,-1));
			if(it==evs.end()){
				now=max(now,p.se);
			}else{
				now=max(now,p.se+(*it).se);
			}
		}
		// print(now);
		res+=now;
	}
	rep(v,n){
		res-=a[v].se;
	}
	print(-res);
//
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 2224 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 5 ms 1364 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 5 ms 1620 KB Output is correct
10 Correct 3 ms 1364 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 4 ms 1108 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 6 ms 2516 KB Output is correct
17 Correct 5 ms 1748 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 4 ms 1364 KB Output is correct
20 Correct 3 ms 1108 KB Output is correct
21 Correct 3 ms 1108 KB Output is correct
22 Correct 3 ms 1876 KB Output is correct
23 Correct 3 ms 1364 KB Output is correct
24 Correct 4 ms 1492 KB Output is correct
25 Correct 4 ms 1108 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 6 ms 1620 KB Output is correct
28 Correct 4 ms 1524 KB Output is correct
29 Correct 4 ms 1492 KB Output is correct
30 Correct 7 ms 1748 KB Output is correct
31 Correct 4 ms 1692 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 2224 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 5 ms 1364 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 5 ms 1620 KB Output is correct
10 Correct 3 ms 1364 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 4 ms 1108 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 6 ms 2516 KB Output is correct
17 Correct 5 ms 1748 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 4 ms 1364 KB Output is correct
20 Correct 3 ms 1108 KB Output is correct
21 Correct 3 ms 1108 KB Output is correct
22 Correct 3 ms 1876 KB Output is correct
23 Correct 3 ms 1364 KB Output is correct
24 Correct 4 ms 1492 KB Output is correct
25 Correct 4 ms 1108 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 6 ms 1620 KB Output is correct
28 Correct 4 ms 1524 KB Output is correct
29 Correct 4 ms 1492 KB Output is correct
30 Correct 7 ms 1748 KB Output is correct
31 Correct 4 ms 1692 KB Output is correct
32 Correct 6 ms 2260 KB Output is correct
33 Correct 382 ms 99480 KB Output is correct
34 Correct 290 ms 65368 KB Output is correct
35 Correct 367 ms 97888 KB Output is correct
36 Correct 399 ms 65196 KB Output is correct
37 Correct 183 ms 40572 KB Output is correct
38 Correct 170 ms 35260 KB Output is correct
39 Correct 158 ms 32252 KB Output is correct
40 Correct 141 ms 32232 KB Output is correct
41 Correct 94 ms 32252 KB Output is correct
42 Correct 165 ms 32164 KB Output is correct
43 Correct 176 ms 32136 KB Output is correct
44 Correct 352 ms 112168 KB Output is correct
45 Correct 218 ms 72368 KB Output is correct
46 Correct 96 ms 34720 KB Output is correct
47 Correct 288 ms 44728 KB Output is correct
48 Correct 141 ms 34804 KB Output is correct
49 Correct 107 ms 34744 KB Output is correct
50 Correct 270 ms 59360 KB Output is correct
51 Correct 110 ms 42672 KB Output is correct
52 Correct 303 ms 45732 KB Output is correct
53 Correct 125 ms 35628 KB Output is correct
54 Correct 96 ms 32176 KB Output is correct
55 Correct 238 ms 51956 KB Output is correct
56 Correct 168 ms 47736 KB Output is correct
57 Correct 154 ms 47476 KB Output is correct
58 Correct 232 ms 54600 KB Output is correct
59 Correct 216 ms 54548 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 2224 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 5 ms 1364 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 5 ms 1620 KB Output is correct
10 Correct 3 ms 1364 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 4 ms 1108 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 6 ms 2516 KB Output is correct
17 Correct 5 ms 1748 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 4 ms 1364 KB Output is correct
20 Correct 3 ms 1108 KB Output is correct
21 Correct 3 ms 1108 KB Output is correct
22 Correct 3 ms 1876 KB Output is correct
23 Correct 3 ms 1364 KB Output is correct
24 Correct 4 ms 1492 KB Output is correct
25 Correct 4 ms 1108 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 6 ms 1620 KB Output is correct
28 Correct 4 ms 1524 KB Output is correct
29 Correct 4 ms 1492 KB Output is correct
30 Correct 7 ms 1748 KB Output is correct
31 Correct 4 ms 1692 KB Output is correct
32 Correct 6 ms 2260 KB Output is correct
33 Correct 382 ms 99480 KB Output is correct
34 Correct 290 ms 65368 KB Output is correct
35 Correct 367 ms 97888 KB Output is correct
36 Correct 399 ms 65196 KB Output is correct
37 Correct 183 ms 40572 KB Output is correct
38 Correct 170 ms 35260 KB Output is correct
39 Correct 158 ms 32252 KB Output is correct
40 Correct 141 ms 32232 KB Output is correct
41 Correct 94 ms 32252 KB Output is correct
42 Correct 165 ms 32164 KB Output is correct
43 Correct 176 ms 32136 KB Output is correct
44 Correct 352 ms 112168 KB Output is correct
45 Correct 218 ms 72368 KB Output is correct
46 Correct 96 ms 34720 KB Output is correct
47 Correct 288 ms 44728 KB Output is correct
48 Correct 141 ms 34804 KB Output is correct
49 Correct 107 ms 34744 KB Output is correct
50 Correct 270 ms 59360 KB Output is correct
51 Correct 110 ms 42672 KB Output is correct
52 Correct 303 ms 45732 KB Output is correct
53 Correct 125 ms 35628 KB Output is correct
54 Correct 96 ms 32176 KB Output is correct
55 Correct 238 ms 51956 KB Output is correct
56 Correct 168 ms 47736 KB Output is correct
57 Correct 154 ms 47476 KB Output is correct
58 Correct 232 ms 54600 KB Output is correct
59 Correct 216 ms 54548 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 0 ms 316 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 357 ms 76336 KB Output is correct
65 Correct 252 ms 54940 KB Output is correct
66 Correct 380 ms 71100 KB Output is correct
67 Correct 256 ms 56316 KB Output is correct
68 Correct 207 ms 41672 KB Output is correct
69 Correct 151 ms 37968 KB Output is correct
70 Correct 203 ms 46004 KB Output is correct
71 Correct 135 ms 37512 KB Output is correct
72 Correct 242 ms 50952 KB Output is correct
73 Correct 125 ms 39768 KB Output is correct
74 Correct 248 ms 55492 KB Output is correct
75 Correct 181 ms 42316 KB Output is correct
76 Correct 143 ms 42204 KB Output is correct
77 Correct 207 ms 56296 KB Output is correct
78 Correct 119 ms 43100 KB Output is correct
79 Correct 308 ms 71072 KB Output is correct
80 Correct 197 ms 52472 KB Output is correct
81 Correct 203 ms 41764 KB Output is correct
82 Correct 149 ms 51064 KB Output is correct
83 Correct 122 ms 35200 KB Output is correct
84 Correct 261 ms 51820 KB Output is correct
85 Correct 239 ms 51940 KB Output is correct
86 Correct 233 ms 48712 KB Output is correct
87 Correct 278 ms 51968 KB Output is correct
88 Correct 238 ms 52160 KB Output is correct