oj.uz

답안 #96884

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96884 2019-02-12T15:41:16 Z Retro3014 Pipes (CEOI15_pipes) C++17
20 / 100
 1556 ms 11616 KB 
#include <iostream>
#include <vector>
#include <stdio.h>
#include <algorithm>

#define MAX_N 100000

using namespace std;

int N, M;
vector<int> gp[MAX_N+1];
int g1[MAX_N+1], g2[MAX_N+1];
int up[MAX_N+1], lv[MAX_N+1], p[MAX_N+1];

void init(){
	for(int i=1; i<=N; i++)	g1[i] = g2[i] = i;
}

int find_g1(int x){
	if(x==g1[x])	return x;
	return g1[x] = find_g1(g1[x]);
}

int find_g2(int x){
	if(x==g2[x])	return x;
	return g2[x] = find_g2(g2[x]);
}

void union_g1(int x, int y){
	x = find_g1(x); y = find_g1(y);
	g1[x] = y;
}

void union_g2(int x, int y){
	x = find_g2(x); y = find_g2(y);
	g2[x] = y;
}

bool vst[MAX_N+1];

void dfs(int x){
	up[x] = lv[x];
	vst[x] = true;
	for(int i=0; i<gp[x].size(); i++){
		if(gp[x][i]==p[x])	continue;
		if(vst[gp[x][i]]){
			up[x] = min(up[x], lv[gp[x][i]]);
		}else{
			p[gp[x][i]] = x;
			lv[gp[x][i]] = lv[x]+1;
			dfs(gp[x][i]);
			if(up[gp[x][i]]>lv[x]){
				printf("%d %d\n", gp[x][i], x);
			}
			up[x] = min(up[x], up[gp[x][i]]);
		}
	}
}

int main(){
	scanf("%d %d", &N, &M);
	init();
	int a, b;
	while(M--){
		scanf("%d%d", &a, &b);
		if(find_g1(a)!=find_g1(b)){
			union_g1(a, b);
			gp[a].push_back(b);
			gp[b].push_back(a);
		}
		else if(find_g2(a)!=find_g2(b)){
			union_g2(a, b);
			gp[a].push_back(b);
			gp[b].push_back(a);
		}
	}
	for(int i=1; i<=N; i++){
		if(!vst[i]){
			lv[i] = 1;
			dfs(i);
		}
	}
	return 0;
}

Compilation message

pipes.cpp: In function 'void dfs(int)':
pipes.cpp:44:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<gp[x].size(); i++){
               ~^~~~~~~~~~~~~
pipes.cpp: In function 'int main()':
pipes.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 4764 KB Output is correct
2 Correct 283 ms 4728 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1556 ms 11092 KB Output is correct
2 Correct 1441 ms 9592 KB Output is correct