oj.uz

답안 #527361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527361 2022-02-17T09:46:10 Z jamielim Pipes (CEOI15_pipes) C++14
20 / 100
 1438 ms 12668 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;

const int MAXN=100005;
int n,m;
int par[MAXN],par2[MAXN]; // par, depth
int root(int x){return par[x]=(par[x]==x?x:root(par[x]));}
int root2(int x){return par2[x]=(par2[x]==x?x:root2(par2[x]));}
vector<int> adj[MAXN]; // only stores at most 2*tree

bool vis[MAXN];
int low[MAXN];
int ctr=0;
void dfs(int x){
	vis[x]=1;
	par2[x]=ctr;
	low[x]=ctr++;
	for(int i:adj[x]){
		if(!vis[i]){
			par[i]=x;
			dfs(i);
			if(low[i]>par2[x])printf("%d %d\n",x,i);
			low[x]=min(low[x],low[i]);
		}else if(i!=par[x])low[x]=min(low[x],par2[i]);
	}
}

int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)par[i]=par2[i]=i;
	int a,b;
	for(int i=0;i<m;i++){
		scanf("%d%d",&a,&b);
		//if a,b are in different trees, merge the two trees
		int ra=root(a),rb=root(b);
		if(ra!=rb){
			par[ra]=rb;
			adj[a].pb(b);
			adj[b].pb(a);
			continue;
		}
		//otherwise, take note that later we have to get rid of the entire cycle
		int r2a=root2(a),r2b=root2(b);
		if(r2a!=r2b){
			par2[r2a]=par2[r2b];
			adj[a].pb(b);
			adj[b].pb(a);
		}
	}
	memset(par,-1,sizeof(par));
	memset(par2,-1,sizeof(par2));
	memset(low,-1,sizeof(low));
	for(int i=1;i<=n;i++)if(!vis[i])dfs(i);
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:44:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
pipes.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |   scanf("%d%d",&a,&b);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3788 KB Output is correct
2 Incorrect 2 ms 3788 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4112 KB Output is correct
2 Incorrect 6 ms 3916 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 4088 KB Output is correct
2 Incorrect 111 ms 3956 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 196 ms 4644 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 5832 KB Output is correct
2 Correct 278 ms 5516 KB Output is correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 438 ms 10088 KB Output is correct
2 Incorrect 424 ms 7108 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 10972 KB Output is correct
2 Incorrect 649 ms 8548 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1004 ms 12668 KB Output is correct
2 Incorrect 860 ms 8616 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1164 ms 12612 KB Output is correct
2 Incorrect 1102 ms 8580 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1438 ms 12152 KB Output is correct
2 Correct 1273 ms 9884 KB Output is correct