oj.uz

Submission #595577

# Submission time Handle Problem Language Result Execution time Memory
595577 2022-07-13T20:39:48 Z inksamurai Worst Reporter 4 (JOI21_worst_reporter4) C++17
79 / 100
 415 ms 112236 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;
		}
		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){
				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: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);
			}
		}
		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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 2260 KB Output is correct
6 Correct 5 ms 1620 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 4 ms 1648 KB Output is correct
10 Correct 5 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 3 ms 1108 KB Output is correct
14 Correct 4 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 7 ms 2516 KB Output is correct
17 Correct 6 ms 1748 KB Output is correct
18 Correct 4 ms 1100 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 3 ms 1108 KB Output is correct
26 Correct 4 ms 1108 KB Output is correct
27 Correct 4 ms 1620 KB Output is correct
28 Correct 4 ms 1492 KB Output is correct
29 Correct 4 ms 1492 KB Output is correct
30 Correct 8 ms 1712 KB Output is correct
31 Correct 6 ms 1748 KB Output is correct

Subtask #2
65.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 256 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 2260 KB Output is correct
6 Correct 5 ms 1620 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 4 ms 1648 KB Output is correct
10 Correct 5 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 3 ms 1108 KB Output is correct
14 Correct 4 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 7 ms 2516 KB Output is correct
17 Correct 6 ms 1748 KB Output is correct
18 Correct 4 ms 1100 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 3 ms 1108 KB Output is correct
26 Correct 4 ms 1108 KB Output is correct
27 Correct 4 ms 1620 KB Output is correct
28 Correct 4 ms 1492 KB Output is correct
29 Correct 4 ms 1492 KB Output is correct
30 Correct 8 ms 1712 KB Output is correct
31 Correct 6 ms 1748 KB Output is correct
32 Correct 7 ms 2260 KB Output is correct
33 Correct 395 ms 99484 KB Output is correct
34 Correct 317 ms 65200 KB Output is correct
35 Correct 415 ms 97860 KB Output is correct
36 Correct 326 ms 65240 KB Output is correct
37 Correct 242 ms 40524 KB Output is correct
38 Correct 165 ms 35312 KB Output is correct
39 Correct 157 ms 32232 KB Output is correct
40 Correct 158 ms 32192 KB Output is correct
41 Correct 100 ms 32336 KB Output is correct
42 Correct 168 ms 32176 KB Output is correct
43 Correct 161 ms 32204 KB Output is correct
44 Correct 299 ms 112236 KB Output is correct
45 Correct 262 ms 72400 KB Output is correct
46 Correct 93 ms 34720 KB Output is correct
47 Correct 261 ms 44808 KB Output is correct
48 Correct 145 ms 34752 KB Output is correct
49 Correct 97 ms 34716 KB Output is correct
50 Correct 304 ms 59264 KB Output is correct
51 Correct 105 ms 42616 KB Output is correct
52 Correct 258 ms 45740 KB Output is correct
53 Correct 122 ms 35716 KB Output is correct
54 Correct 106 ms 32240 KB Output is correct
55 Correct 227 ms 51908 KB Output is correct
56 Correct 159 ms 47740 KB Output is correct
57 Correct 160 ms 47464 KB Output is correct
58 Correct 231 ms 54644 KB Output is correct
59 Correct 225 ms 54580 KB Output is correct

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 256 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 2260 KB Output is correct
6 Correct 5 ms 1620 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 4 ms 1648 KB Output is correct
10 Correct 5 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 3 ms 1108 KB Output is correct
14 Correct 4 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 7 ms 2516 KB Output is correct
17 Correct 6 ms 1748 KB Output is correct
18 Correct 4 ms 1100 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 3 ms 1108 KB Output is correct
26 Correct 4 ms 1108 KB Output is correct
27 Correct 4 ms 1620 KB Output is correct
28 Correct 4 ms 1492 KB Output is correct
29 Correct 4 ms 1492 KB Output is correct
30 Correct 8 ms 1712 KB Output is correct
31 Correct 6 ms 1748 KB Output is correct
32 Correct 7 ms 2260 KB Output is correct
33 Correct 395 ms 99484 KB Output is correct
34 Correct 317 ms 65200 KB Output is correct
35 Correct 415 ms 97860 KB Output is correct
36 Correct 326 ms 65240 KB Output is correct
37 Correct 242 ms 40524 KB Output is correct
38 Correct 165 ms 35312 KB Output is correct
39 Correct 157 ms 32232 KB Output is correct
40 Correct 158 ms 32192 KB Output is correct
41 Correct 100 ms 32336 KB Output is correct
42 Correct 168 ms 32176 KB Output is correct
43 Correct 161 ms 32204 KB Output is correct
44 Correct 299 ms 112236 KB Output is correct
45 Correct 262 ms 72400 KB Output is correct
46 Correct 93 ms 34720 KB Output is correct
47 Correct 261 ms 44808 KB Output is correct
48 Correct 145 ms 34752 KB Output is correct
49 Correct 97 ms 34716 KB Output is correct
50 Correct 304 ms 59264 KB Output is correct
51 Correct 105 ms 42616 KB Output is correct
52 Correct 258 ms 45740 KB Output is correct
53 Correct 122 ms 35716 KB Output is correct
54 Correct 106 ms 32240 KB Output is correct
55 Correct 227 ms 51908 KB Output is correct
56 Correct 159 ms 47740 KB Output is correct
57 Correct 160 ms 47464 KB Output is correct
58 Correct 231 ms 54644 KB Output is correct
59 Correct 225 ms 54580 KB Output is correct
60 Incorrect 0 ms 212 KB Output isn't correct
61 Halted 0 ms 0 KB -