oj.uz

답안 #980615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980615 2024-05-12T09:22:06 Z happy_node Worst Reporter 4 (JOI21_worst_reporter4) C++17
79 / 100
 262 ms 57444 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MX=2e5+5;
int N;
int A[MX],H[MX],C[MX];

vector<int> adj[MX];

multiset<pair<ll,ll>> dp[MX];
int par[MX];

int find(int v) {
	return par[v]==v?v:par[v]=find(par[v]);
}

void merge(int u, int v) {
	u=find(u),v=find(v);
	if(u==v) return;

	if(dp[u].size()>dp[v].size()) swap(u,v);

	for(auto [pos,val]:dp[u]) {
		dp[v].insert({pos,val});
	}

	par[u]=v;
	dp[u].clear();
}

void dfs(int v) {
	int prv=-1;
	for(auto u:adj[v]) {
		dfs(u);
		if(prv!=-1) 
			merge(u,prv);
		prv=u;
	}

	if(prv!=-1) merge(v,prv);

	int pv=find(v);

	auto it=dp[pv].lower_bound(make_pair(H[v],0));

	if(it==dp[pv].begin()) {
		dp[pv].insert(make_pair(H[v],C[v]));
	} else {
		it--;
		ll cur=C[v];
		while(true) {
			if(cur>=it->second) {
 				cur-=it->second;
				it=dp[pv].erase(it);
				if(it==dp[pv].begin()) break;
				it--;
			} else {
				auto [p,q]=*it;
				dp[pv].erase(it);
				dp[pv].insert({p,q-cur});
				cur=0;
				break;
			}
		}
		dp[pv].insert(make_pair(H[v],C[v]));
	}
}

int onstk[MX],degs[MX],head[MX];
vector<int> stk;

void dfs0(int v) {
	onstk[v]=1;
	stk.push_back(v);

	if(onstk[A[v]]==0) {
		dfs0(A[v]);
	} else if(onstk[A[v]]==1) {
		vector<int> cyc;
		for(int i=stk.size()-1;i>=0;i--) {
			cyc.push_back(stk[i]);
			if(stk[i]==A[v]) break;
		}

		sort(cyc.begin(),cyc.end(),[&](int i, int j){
			if(H[i]==H[j]) return C[i]>C[j];
			return H[i]>H[j];
		});

		for(int i=0;i+1<cyc.size();i++) {
			head[cyc[i+1]]=cyc.back();
			A[cyc[i+1]]=cyc[i];
		}
		head[cyc[0]]=cyc.back();
		A[cyc[0]]=cyc[0];
	}

	stk.pop_back();
	onstk[v]=2;
}

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

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

	for(int i=1;i<=N;i++) {
		head[i]=i;
		if(onstk[i]==2) continue;
		dfs0(i);
	}

	// for(int i=1;i<=N;i++) {
	// 	cout<<A[i]<<" -> "<<i<<'\n';
	// 	cout<<head[A[i]]<<" "<<head[i]<<'\n';
	// }

	for(int i=1;i<=N;i++) {
		if(A[i]!=i) {
			if(head[A[i]]!=head[i]) {
				adj[head[A[i]]].push_back(head[i]);
				degs[head[i]]+=1;
			} else { 
				adj[A[i]].push_back(i);
				degs[i]+=1;
			}
		}
	}

	for(int i=1;i<=N;i++) par[i]=i;

	ll ans=0;
	for(int i=1;i<=N;i++) {
		if(degs[i]==0) {
			dfs(i);
			for(auto [pos,val]:dp[find(i)]) 
				ans+=val;
		}
	}

	cout<<sum-ans<<'\n';
}

Compilation message

worst_reporter2.cpp: In function 'void dfs0(int)':
worst_reporter2.cpp:92:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |   for(int i=0;i+1<cyc.size();i++) {
      |               ~~~^~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 9 ms 17244 KB Output is correct
6 Correct 6 ms 17244 KB Output is correct
7 Correct 7 ms 17156 KB Output is correct
8 Correct 8 ms 17240 KB Output is correct
9 Correct 10 ms 17244 KB Output is correct
10 Correct 7 ms 17244 KB Output is correct
11 Correct 7 ms 17240 KB Output is correct
12 Correct 7 ms 17496 KB Output is correct
13 Correct 8 ms 17756 KB Output is correct
14 Correct 6 ms 17244 KB Output is correct
15 Correct 6 ms 17244 KB Output is correct
16 Correct 7 ms 17244 KB Output is correct
17 Correct 7 ms 17244 KB Output is correct
18 Correct 11 ms 17404 KB Output is correct
19 Correct 6 ms 17536 KB Output is correct
20 Correct 7 ms 17500 KB Output is correct
21 Correct 6 ms 17500 KB Output is correct
22 Correct 6 ms 17148 KB Output is correct
23 Correct 6 ms 17244 KB Output is correct
24 Correct 8 ms 17500 KB Output is correct
25 Correct 6 ms 17500 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 8 ms 17532 KB Output is correct
28 Correct 6 ms 17496 KB Output is correct
29 Correct 6 ms 17756 KB Output is correct
30 Correct 9 ms 17756 KB Output is correct
31 Correct 7 ms 17752 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 9 ms 17244 KB Output is correct
6 Correct 6 ms 17244 KB Output is correct
7 Correct 7 ms 17156 KB Output is correct
8 Correct 8 ms 17240 KB Output is correct
9 Correct 10 ms 17244 KB Output is correct
10 Correct 7 ms 17244 KB Output is correct
11 Correct 7 ms 17240 KB Output is correct
12 Correct 7 ms 17496 KB Output is correct
13 Correct 8 ms 17756 KB Output is correct
14 Correct 6 ms 17244 KB Output is correct
15 Correct 6 ms 17244 KB Output is correct
16 Correct 7 ms 17244 KB Output is correct
17 Correct 7 ms 17244 KB Output is correct
18 Correct 11 ms 17404 KB Output is correct
19 Correct 6 ms 17536 KB Output is correct
20 Correct 7 ms 17500 KB Output is correct
21 Correct 6 ms 17500 KB Output is correct
22 Correct 6 ms 17148 KB Output is correct
23 Correct 6 ms 17244 KB Output is correct
24 Correct 8 ms 17500 KB Output is correct
25 Correct 6 ms 17500 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 8 ms 17532 KB Output is correct
28 Correct 6 ms 17496 KB Output is correct
29 Correct 6 ms 17756 KB Output is correct
30 Correct 9 ms 17756 KB Output is correct
31 Correct 7 ms 17752 KB Output is correct
32 Correct 7 ms 17244 KB Output is correct
33 Correct 250 ms 35576 KB Output is correct
34 Correct 232 ms 34428 KB Output is correct
35 Correct 229 ms 33360 KB Output is correct
36 Correct 262 ms 34620 KB Output is correct
37 Correct 257 ms 37056 KB Output is correct
38 Correct 262 ms 35876 KB Output is correct
39 Correct 141 ms 51328 KB Output is correct
40 Correct 138 ms 51284 KB Output is correct
41 Correct 150 ms 54516 KB Output is correct
42 Correct 123 ms 38748 KB Output is correct
43 Correct 127 ms 39024 KB Output is correct
44 Correct 201 ms 35412 KB Output is correct
45 Correct 219 ms 35444 KB Output is correct
46 Correct 255 ms 39764 KB Output is correct
47 Correct 176 ms 42492 KB Output is correct
48 Correct 203 ms 46184 KB Output is correct
49 Correct 157 ms 46880 KB Output is correct
50 Correct 127 ms 33228 KB Output is correct
51 Correct 138 ms 33176 KB Output is correct
52 Correct 167 ms 43024 KB Output is correct
53 Correct 206 ms 47052 KB Output is correct
54 Correct 90 ms 51216 KB Output is correct
55 Correct 139 ms 44828 KB Output is correct
56 Correct 134 ms 53320 KB Output is correct
57 Correct 126 ms 57164 KB Output is correct
58 Correct 169 ms 57444 KB Output is correct
59 Correct 168 ms 57424 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16732 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 9 ms 17244 KB Output is correct
6 Correct 6 ms 17244 KB Output is correct
7 Correct 7 ms 17156 KB Output is correct
8 Correct 8 ms 17240 KB Output is correct
9 Correct 10 ms 17244 KB Output is correct
10 Correct 7 ms 17244 KB Output is correct
11 Correct 7 ms 17240 KB Output is correct
12 Correct 7 ms 17496 KB Output is correct
13 Correct 8 ms 17756 KB Output is correct
14 Correct 6 ms 17244 KB Output is correct
15 Correct 6 ms 17244 KB Output is correct
16 Correct 7 ms 17244 KB Output is correct
17 Correct 7 ms 17244 KB Output is correct
18 Correct 11 ms 17404 KB Output is correct
19 Correct 6 ms 17536 KB Output is correct
20 Correct 7 ms 17500 KB Output is correct
21 Correct 6 ms 17500 KB Output is correct
22 Correct 6 ms 17148 KB Output is correct
23 Correct 6 ms 17244 KB Output is correct
24 Correct 8 ms 17500 KB Output is correct
25 Correct 6 ms 17500 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 8 ms 17532 KB Output is correct
28 Correct 6 ms 17496 KB Output is correct
29 Correct 6 ms 17756 KB Output is correct
30 Correct 9 ms 17756 KB Output is correct
31 Correct 7 ms 17752 KB Output is correct
32 Correct 7 ms 17244 KB Output is correct
33 Correct 250 ms 35576 KB Output is correct
34 Correct 232 ms 34428 KB Output is correct
35 Correct 229 ms 33360 KB Output is correct
36 Correct 262 ms 34620 KB Output is correct
37 Correct 257 ms 37056 KB Output is correct
38 Correct 262 ms 35876 KB Output is correct
39 Correct 141 ms 51328 KB Output is correct
40 Correct 138 ms 51284 KB Output is correct
41 Correct 150 ms 54516 KB Output is correct
42 Correct 123 ms 38748 KB Output is correct
43 Correct 127 ms 39024 KB Output is correct
44 Correct 201 ms 35412 KB Output is correct
45 Correct 219 ms 35444 KB Output is correct
46 Correct 255 ms 39764 KB Output is correct
47 Correct 176 ms 42492 KB Output is correct
48 Correct 203 ms 46184 KB Output is correct
49 Correct 157 ms 46880 KB Output is correct
50 Correct 127 ms 33228 KB Output is correct
51 Correct 138 ms 33176 KB Output is correct
52 Correct 167 ms 43024 KB Output is correct
53 Correct 206 ms 47052 KB Output is correct
54 Correct 90 ms 51216 KB Output is correct
55 Correct 139 ms 44828 KB Output is correct
56 Correct 134 ms 53320 KB Output is correct
57 Correct 126 ms 57164 KB Output is correct
58 Correct 169 ms 57444 KB Output is correct
59 Correct 168 ms 57424 KB Output is correct
60 Correct 3 ms 16732 KB Output is correct
61 Correct 3 ms 16892 KB Output is correct
62 Correct 3 ms 16732 KB Output is correct
63 Correct 3 ms 16820 KB Output is correct
64 Incorrect 211 ms 32572 KB Output isn't correct
65 Halted 0 ms 0 KB -