Submission #97139

#	Time	Username	Problem	Language	Result	Execution time	Memory
97139		dndhk	Pipes (CEOI15_pipes)	C++14	100 / 100	1579 ms	12596 KiB

pipes

#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];

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]);
}

bool vst[MAX_N+1];

void dfs(int x){
	bool tf = true;
	up[x] = lv[x];
	vst[x] = true;
	for(int i=0; i<gp[x].size(); i++){
		if(gp[x][i]==p[x] && tf){
			tf = false; 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);
	for(int i=1; i<=N; i++)	g1[i] = g2[i] = i;
	int a, b;
	while(M--){
		scanf("%d%d", &a, &b);
		if(find_g1(a)!=find_g1(b)){
			gp[a].push_back(b);
			gp[b].push_back(a);
			a = find_g1(a); b = find_g1(b);
			g1[a] = b;
		}
		else if(find_g2(a)!=find_g2(b)){
			gp[a].push_back(b);
			gp[b].push_back(a);
			a = find_g2(a); b = find_g2(b);
			g2[a] = b;
		}
	}
	for(int i=1; i<=N; i++){
		if(!vst[i]){
			lv[i] = 1;
			dfs(i);
		}
	}
	return 0;
}

Compilation message (stderr)

pipes.cpp: In function 'void dfs(int)':
pipes.cpp:31: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:50: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:54: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: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10