oj.uz

답안 #460929

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
460929 2021-08-09T11:10:55 Z kingfran1907 Pipes (CEOI15_pipes) C++14
0 / 100
 1461 ms 36804 KB 
#include <bits/stdc++.h>
#define X first
#define Y second

using namespace std;
typedef long long llint;

const int maxn = 1e5+10;
const int base = 31337;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int logo = 18;
const int off = 1 << logo;
const int treesiz = off << 1;

struct union_find {
	int parr[maxn];
	
	union_find() {
		for (int i = 0; i < maxn; i++) parr[i] = i;
	}
	
	int fin(int x) {
		if (x == parr[x]) return x;
		return parr[x] = fin(parr[x]);
	}
	
	void merg(int a, int b) {
		a = fin(a);
		b = fin(b);
		if (a == b) return;
		
		int ra = rand() % 2;
		if (ra == 0) parr[b] = a;
		else parr[a] = b;
	}
};

int n, m;
vector< int > graph[maxn];
union_find p, q;
int t = 0;
int dis[maxn], lo[maxn];

void dfs(int x, int parr) {
	dis[x] = t++;
	lo[x] = dis[x];
	//printf("start %d %d\n", x, dis[x]);
	
	for (int tren : graph[x]) {
		if (tren == parr) continue; 
		if (dis[tren] == -1) {
			dfs(tren, x);
			if (lo[tren] > dis[x]) printf("%d %d\n", x, tren);
			lo[x] = min(lo[x], lo[tren]);
		} else {
			lo[x] = min(lo[x], dis[tren]);
		}
	}
	//printf("end %d: %d %d\n", x, dis[x], lo[x]);
}

int main() {
	srand(time(0));
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; i++) {
		int a, b;
		scanf("%d%d", &a, &b);
		
		if (q.fin(a) != q.fin(b)) {
			//printf("%d %d\n", a, b);
			graph[a].push_back(b);
			graph[b].push_back(a);
			
			if (p.fin(a) != p.fin(b)) p.merg(a, b);
			else q.merg(a, b);
		}
	}
	
	memset(dis, -1, sizeof dis);
	for (int i = 1; i <= n; i++) {
		if (dis[i] == -1) dfs(i, 0);
	}
	return 0;
}

Compilation message

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

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 6356 KB Output is correct
2 Runtime error 308 ms 19492 KB Memory limit exceeded

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 502 ms 10960 KB Output is correct
2 Runtime error 477 ms 24772 KB Memory limit exceeded

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 807 ms 11708 KB Output is correct
2 Runtime error 765 ms 36804 KB Memory limit exceeded

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 971 ms 13316 KB Output is correct
2 Runtime error 1043 ms 28712 KB Memory limit exceeded

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1192 ms 13320 KB Output is correct
2 Runtime error 1196 ms 18348 KB Memory limit exceeded

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1461 ms 12976 KB Output is correct
2 Runtime error 1391 ms 21092 KB Memory limit exceeded