oj.uz

답안 #224104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224104 2020-04-17T08:06:18 Z kshitij_sodani Pipes (CEOI15_pipes) C++17
10 / 100
 2546 ms 65540 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
int n,m;
int par[100001];
int par2[100001];
int find(int no){
	if(par[no]==no){
		return no;
	}
	par[no]=find(par[no]);
	return par[no];
}
int find2(int no){
	if(par2[no]==no){
		return no;
	}
	par2[no]=find2(par2[no]);
	return par2[no];
}
vector<int> adj[100001];
int cco=1;
void dfs(int no,int par3=-1){
	par[no]=cco;
	cco+=1;
	for(auto nn:adj[no]){
		if(par[nn]>0){
			if(nn==par3 or par[nn]>=par[no]){
				continue;
			}
			par2[nn]-=1;
			par2[no]+=1;
		}
		else{
			dfs(nn,no);
			if(par2[nn]==0){
				cout<<no+1<<" "<<nn+1<<endl;

			}
			par2[no]+=par2[nn];
		}
	}

}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m;
	for(int i=0;i<n;i++){
		par[i]=i;
		par2[i]=i;
	}
	int aa,bb;
	int cc,dd;
	int e,f;
	for(int i=0;i<m;i++){
		cin>>cc>>dd;
		cc-=1;
		dd-=1;
		adj[cc].pb(dd);
			adj[dd].pb(cc);
			continue;
		//cout<<cc<<" "<<dd<<endl;
		aa=find(cc);
	//	cout<<aa;
		bb=find(dd);
	//	cout<<"::"<<bb<<endl;
		if(aa==bb){
			e=find2(cc);
			f=find2(dd);
			if(e==f){
				continue;
			}
			adj[cc].pb(dd);
			adj[dd].pb(cc);
			par2[e]=f;
		}
		else{
			par[aa]=bb;
			adj[cc].pb(dd);
			adj[dd].pb(cc);
		}
	//	cout<<cc<<",,,,,,,,"<<dd<<endl;
	}
	//vis=par
	//dp=par2
	for(int i=0;i<n;i++){
		par[i]=0;
		par2[i]=0;
	}
	for(int i=0;i<n;i++){
		if(par[i]==0){
			dfs(i);
		}
	}
	return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Incorrect 6 ms 2688 KB Wrong number of edges

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3328 KB Output is correct
2 Incorrect 10 ms 3072 KB Wrong number of edges

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 11384 KB Output is correct
2 Correct 126 ms 10616 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 242 ms 14656 KB Output is correct
2 Runtime error 333 ms 29992 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 526 ms 25324 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 754 ms 30784 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1416 ms 52356 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2117 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2546 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2373 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -