Submission #980571

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
980571	2024-05-12T08:50:48 Z	happy_node	Worst Reporter 4 (JOI21_worst_reporter4)	C++17	79 / 100	289 ms	57452 KB

worst_reporter2

#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){
			return H[i]>H[j];
		});

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

	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:91:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |   for(int i=0;i+1<cyc.size();i++) {
      |               ~~~^~~~~~~~~~~

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	16732 KB	Output is correct
2	Correct	3 ms	16732 KB	Output is correct
3	Correct	3 ms	16732 KB	Output is correct
4	Correct	3 ms	16840 KB	Output is correct
5	Correct	8 ms	17312 KB	Output is correct
6	Correct	7 ms	17244 KB	Output is correct
7	Correct	7 ms	17244 KB	Output is correct
8	Correct	7 ms	17332 KB	Output is correct
9	Correct	8 ms	17244 KB	Output is correct
10	Correct	9 ms	17244 KB	Output is correct
11	Correct	8 ms	17356 KB	Output is correct
12	Correct	7 ms	17756 KB	Output is correct
13	Correct	9 ms	17756 KB	Output is correct
14	Correct	7 ms	17364 KB	Output is correct
15	Correct	6 ms	17244 KB	Output is correct
16	Correct	9 ms	17192 KB	Output is correct
17	Correct	7 ms	17244 KB	Output is correct
18	Correct	8 ms	17488 KB	Output is correct
19	Correct	7 ms	17500 KB	Output is correct
20	Correct	7 ms	17500 KB	Output is correct
21	Correct	6 ms	17500 KB	Output is correct
22	Correct	5 ms	17240 KB	Output is correct
23	Correct	6 ms	17244 KB	Output is correct
24	Correct	6 ms	17500 KB	Output is correct
25	Correct	7 ms	17500 KB	Output is correct
26	Correct	7 ms	17500 KB	Output is correct
27	Correct	7 ms	17500 KB	Output is correct
28	Correct	6 ms	17512 KB	Output is correct
29	Correct	7 ms	17756 KB	Output is correct
30	Correct	8 ms	17756 KB	Output is correct
31	Correct	7 ms	17756 KB	Output is correct

Subtask #2
65.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	16732 KB	Output is correct
2	Correct	3 ms	16732 KB	Output is correct
3	Correct	3 ms	16732 KB	Output is correct
4	Correct	3 ms	16840 KB	Output is correct
5	Correct	8 ms	17312 KB	Output is correct
6	Correct	7 ms	17244 KB	Output is correct
7	Correct	7 ms	17244 KB	Output is correct
8	Correct	7 ms	17332 KB	Output is correct
9	Correct	8 ms	17244 KB	Output is correct
10	Correct	9 ms	17244 KB	Output is correct
11	Correct	8 ms	17356 KB	Output is correct
12	Correct	7 ms	17756 KB	Output is correct
13	Correct	9 ms	17756 KB	Output is correct
14	Correct	7 ms	17364 KB	Output is correct
15	Correct	6 ms	17244 KB	Output is correct
16	Correct	9 ms	17192 KB	Output is correct
17	Correct	7 ms	17244 KB	Output is correct
18	Correct	8 ms	17488 KB	Output is correct
19	Correct	7 ms	17500 KB	Output is correct
20	Correct	7 ms	17500 KB	Output is correct
21	Correct	6 ms	17500 KB	Output is correct
22	Correct	5 ms	17240 KB	Output is correct
23	Correct	6 ms	17244 KB	Output is correct
24	Correct	6 ms	17500 KB	Output is correct
25	Correct	7 ms	17500 KB	Output is correct
26	Correct	7 ms	17500 KB	Output is correct
27	Correct	7 ms	17500 KB	Output is correct
28	Correct	6 ms	17512 KB	Output is correct
29	Correct	7 ms	17756 KB	Output is correct
30	Correct	8 ms	17756 KB	Output is correct
31	Correct	7 ms	17756 KB	Output is correct
32	Correct	6 ms	17244 KB	Output is correct
33	Correct	228 ms	35444 KB	Output is correct
34	Correct	245 ms	34340 KB	Output is correct
35	Correct	265 ms	33416 KB	Output is correct
36	Correct	254 ms	34768 KB	Output is correct
37	Correct	253 ms	36780 KB	Output is correct
38	Correct	289 ms	35824 KB	Output is correct
39	Correct	142 ms	51380 KB	Output is correct
40	Correct	142 ms	51412 KB	Output is correct
41	Correct	143 ms	54408 KB	Output is correct
42	Correct	125 ms	38888 KB	Output is correct
43	Correct	135 ms	38808 KB	Output is correct
44	Correct	204 ms	35260 KB	Output is correct
45	Correct	223 ms	35428 KB	Output is correct
46	Correct	269 ms	39928 KB	Output is correct
47	Correct	171 ms	42540 KB	Output is correct
48	Correct	198 ms	46364 KB	Output is correct
49	Correct	182 ms	46932 KB	Output is correct
50	Correct	144 ms	33160 KB	Output is correct
51	Correct	132 ms	33220 KB	Output is correct
52	Correct	174 ms	43212 KB	Output is correct
53	Correct	263 ms	47052 KB	Output is correct
54	Correct	77 ms	51156 KB	Output is correct
55	Correct	144 ms	45032 KB	Output is correct
56	Correct	129 ms	53140 KB	Output is correct
57	Correct	141 ms	57088 KB	Output is correct
58	Correct	153 ms	57424 KB	Output is correct
59	Correct	169 ms	57452 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	16732 KB	Output is correct
2	Correct	3 ms	16732 KB	Output is correct
3	Correct	3 ms	16732 KB	Output is correct
4	Correct	3 ms	16840 KB	Output is correct
5	Correct	8 ms	17312 KB	Output is correct
6	Correct	7 ms	17244 KB	Output is correct
7	Correct	7 ms	17244 KB	Output is correct
8	Correct	7 ms	17332 KB	Output is correct
9	Correct	8 ms	17244 KB	Output is correct
10	Correct	9 ms	17244 KB	Output is correct
11	Correct	8 ms	17356 KB	Output is correct
12	Correct	7 ms	17756 KB	Output is correct
13	Correct	9 ms	17756 KB	Output is correct
14	Correct	7 ms	17364 KB	Output is correct
15	Correct	6 ms	17244 KB	Output is correct
16	Correct	9 ms	17192 KB	Output is correct
17	Correct	7 ms	17244 KB	Output is correct
18	Correct	8 ms	17488 KB	Output is correct
19	Correct	7 ms	17500 KB	Output is correct
20	Correct	7 ms	17500 KB	Output is correct
21	Correct	6 ms	17500 KB	Output is correct
22	Correct	5 ms	17240 KB	Output is correct
23	Correct	6 ms	17244 KB	Output is correct
24	Correct	6 ms	17500 KB	Output is correct
25	Correct	7 ms	17500 KB	Output is correct
26	Correct	7 ms	17500 KB	Output is correct
27	Correct	7 ms	17500 KB	Output is correct
28	Correct	6 ms	17512 KB	Output is correct
29	Correct	7 ms	17756 KB	Output is correct
30	Correct	8 ms	17756 KB	Output is correct
31	Correct	7 ms	17756 KB	Output is correct
32	Correct	6 ms	17244 KB	Output is correct
33	Correct	228 ms	35444 KB	Output is correct
34	Correct	245 ms	34340 KB	Output is correct
35	Correct	265 ms	33416 KB	Output is correct
36	Correct	254 ms	34768 KB	Output is correct
37	Correct	253 ms	36780 KB	Output is correct
38	Correct	289 ms	35824 KB	Output is correct
39	Correct	142 ms	51380 KB	Output is correct
40	Correct	142 ms	51412 KB	Output is correct
41	Correct	143 ms	54408 KB	Output is correct
42	Correct	125 ms	38888 KB	Output is correct
43	Correct	135 ms	38808 KB	Output is correct
44	Correct	204 ms	35260 KB	Output is correct
45	Correct	223 ms	35428 KB	Output is correct
46	Correct	269 ms	39928 KB	Output is correct
47	Correct	171 ms	42540 KB	Output is correct
48	Correct	198 ms	46364 KB	Output is correct
49	Correct	182 ms	46932 KB	Output is correct
50	Correct	144 ms	33160 KB	Output is correct
51	Correct	132 ms	33220 KB	Output is correct
52	Correct	174 ms	43212 KB	Output is correct
53	Correct	263 ms	47052 KB	Output is correct
54	Correct	77 ms	51156 KB	Output is correct
55	Correct	144 ms	45032 KB	Output is correct
56	Correct	129 ms	53140 KB	Output is correct
57	Correct	141 ms	57088 KB	Output is correct
58	Correct	153 ms	57424 KB	Output is correct
59	Correct	169 ms	57452 KB	Output is correct
60	Incorrect	3 ms	16728 KB	Output isn't correct
61	Halted	0 ms	0 KB	-

Submission #980571

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 65.0 / 65.0

Subtask #3 0 / 21.0

Subtask #1
14.0 / 14.0

Subtask #2
65.0 / 65.0

Subtask #3
0 / 21.0