oj.uz

Submission #244544

# Submission time Handle Problem Language Result Execution time Memory
244544 2020-07-04T09:27:59 Z oolimry Pipes (CEOI15_pipes) C++14
100 / 100
 1327 ms 14032 KB 
//HAPPY BIRTHDAY!!!
#include <bits/stdc++.h>
#define push_back emplace_back
using namespace std;
typedef pair<int,int> ii;

struct UFDS{
	int n;
	int p[100005];
	
	void init(int _n){
		n = _n;
		for(int i = 1;i <= n;i++) p[i] = i;
	}
	
	int find(int u){
		if(p[u] == u) return u;
		else{
			p[u] = find(p[u]);
			return p[u];
		}
	}
	
	void unionSet(int u, int P){
		u = find(u); P = find(P);
		if(u == P) return;
		p[u] = P;
	}
} tree, bridge;

vector<int> nodes[100005];
int p[100005];
int depth[100005];
vector<ii> possible;

void reroot(int u){
	
	vector<int> order; order.push_back(0);
	while(u != 0){
		order.push_back(u);
		u = p[u];
	}
	
	int sz = order.size(); 
	for(int i = 0;i < sz-1;i++){
		p[order[i+1]] = order[i];
	}
	p[order[0]] = 0;
	order.clear();
}

vector<int> adj[100005];
void dfs(int u){
	for(int v : adj[u]){
		depth[v] = depth[u] + 1;
		dfs(v);
	}
}

void redepth(int u, int U){
	vector<int> V = nodes[U];
	
	for(int x : V){
		if(p[x] != 0) adj[p[x]].push_back(x);
	}
	
	depth[u] = 0;
	dfs(u);
	
	for(int x : V){
		adj[x].clear();
	}
}



signed main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	int n, E; cin >> n >> E;
	
	tree.init(n+2); bridge.init(n+2);
	
	for(int i = 1;i <= n;i++) nodes[i].emplace_back(i);
	
	while(E--){
		int u, v; cin >> u >> v;
		if(bridge.find(u) == bridge.find(v)) continue;
		
		if(tree.find(u) == tree.find(v)){ ///bridge formed
			
			vector<int> path;
			
			while(u != v){
				if(depth[u] > depth[v]) swap(u,v); ///v is deeper now
				
				path.push_back(v);
				v = p[v];
			}
			
			int P = u;
			//cout << P << "\n";
			for(int x : path){
				p[x] = P;
				p[x] = P;
				depth[x] = depth[P]+1;
				bridge.unionSet(x, P);
			}
		}
		else{ ///connect two trees to 1 tree
			int U = tree.find(u), V = tree.find(v);
			
			if(nodes[U].size() > nodes[V].size()){
				swap(U,V);
				swap(u,v);
			}

			tree.p[U] = V;
			reroot(u);
			redepth(u, U);
			p[u] = v;

			
			
			while(!nodes[U].empty()){
				int B = nodes[U].back();
				depth[B] += depth[v] + 1;
				nodes[V].emplace_back(B);
				nodes[U].pop_back();
			}
		
			possible.push_back(ii(u,v));
		}
	}
	
	for(ii e : possible){
		
		if(bridge.find(e.first) != bridge.find(e.second)){
			cout << e.first << " " << e.second << "\n";;
		}
		
		
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5504 KB Output is correct
2 Correct 12 ms 5504 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 5376 KB Output is correct
2 Correct 102 ms 5368 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 5888 KB Output is correct
2 Correct 194 ms 5888 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 6900 KB Output is correct
2 Correct 274 ms 7540 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 10864 KB Output is correct
2 Correct 409 ms 11564 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 692 ms 11412 KB Output is correct
2 Correct 667 ms 12076 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 909 ms 12692 KB Output is correct
2 Correct 863 ms 13804 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1088 ms 12648 KB Output is correct
2 Correct 1072 ms 13932 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1327 ms 12296 KB Output is correct
2 Correct 1306 ms 14032 KB Output is correct