oj.uz

Submission #379887

# Submission time Handle Problem Language Result Execution time Memory
379887 2021-03-19T15:45:15 Z soroush Pipes (CEOI15_pipes) C++17
100 / 100
 1354 ms 14300 KB 
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
*/
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int maxn = 1e5 + 1;
const ll mod = 1e9+7;
const ld PI = acos((ld)-1);
 
#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}
 
int par1[maxn] , par2[maxn];
vector < int > adj[maxn];
int n , m;
 
int getpar(int v , int *par){
	return((par[v]) ? par[v] = getpar(par[v] , par) : v);
}
 
void merge(int v , int u){
	if(getpar(u , par1) ^ getpar(v , par1))
		par1[getpar(u , par1)] = getpar(v , par1);
	else if(getpar(u , par2) ^ getpar(v , par2))
		par2[getpar(u , par2)] = getpar(v , par2);
	else
		return;
	adj[u].pb(v);
	adj[v].pb(u);
}
 
void dfs(int v , int p = 0 , int h = 1){
	par1[v] = par2[v] = h;	
	int cnt = 0;
	for(auto u : adj[v])if(u^p){
		if(!par2[u])
			dfs(u , v , h + 1) , par1[v] = min(par1[v] , par1[u]);
		else
			par1[v] = min(par1[v] , par2[u]);
	}else cnt++;
	if(par1[v] == h and p and cnt == 1)
		cout << v << ' ' << p << endl;
}
 
int32_t main(){
	migmig;
	cin >> n >> m;
	for(int i = 1 ; i <= m ; i ++){
		int u , v;
		cin >> u >> v;
		merge(u , v);
	}
	for(int i = 1 ; i <= n ; i ++)par2[i] = 0;
	for(int i = 1 ; i <= n ; i ++)if(!par2[i])dfs(i);
	return(0);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3180 KB Output is correct
2 Correct 8 ms 2924 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 3060 KB Output is correct
2 Correct 108 ms 2924 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 3820 KB Output is correct
2 Correct 217 ms 3180 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 5636 KB Output is correct
2 Correct 294 ms 4972 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 10748 KB Output is correct
2 Correct 413 ms 6792 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 706 ms 12140 KB Output is correct
2 Correct 700 ms 8812 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 916 ms 14188 KB Output is correct
2 Correct 845 ms 8556 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1115 ms 14300 KB Output is correct
2 Correct 1057 ms 8452 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1333 ms 13668 KB Output is correct
2 Correct 1354 ms 10356 KB Output is correct