oj.uz

Submission #1021665

# Submission time Handle Problem Language Result Execution time Memory
1021665 2024-07-13T02:11:02 Z idiotcomputer Pipes (CEOI15_pipes) C++11
0 / 100
 709 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz size 
 
const int mxN = 1e5;
vector<int> adj[mxN];
int d[mxN];
int low[mxN];
 
void dfs(int c, int depth, int p){
	d[c] = depth;
	low[c] = d[c];
	int op = p;
	for (int i : adj[c]){
		if (i == p){p = -1; continue;}
		if (d[i] != -1){ low[c] = min(low[c],d[i]); continue;}
		dfs(i,depth+1,c);
		low[c] = min(low[c], low[i]);
	}
	if (low[c] >= depth && op != -1) cout << c+1 << " " << op+1 << '\n';
}
 
int p[mxN][2];
int ssize[mxN][2];
 
int gpar(int c, int w){
	if (p[c][w] == c) return c;
	p[c][w] = gpar(p[c][w],w);
	return p[c][w];
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
 
	int n,m;
	cin >> n >> m;
	for (int i = 0; i < n; i++) for (int j = 0; j < 2; j++) {p[i][j] = i; ssize[i][j] = 1;}
 
	int a,b;
	int x,y;
	int cnt = 0;
	for (int i = 0; i < m; i++){
		cin >> a >> b;
		a -= 1;
		b -= 1;
		x = gpar(a,0);
		y = gpar(b,0);
		if (x != y){
			//adj[a].pb(b);
		//	adj[b].pb(a);
			cnt++;
			if (ssize[x][0] < ssize[y][0]) swap(x,y);
			ssize[x][0] += ssize[y][0];
			p[y][0] = x;
			continue;
		}
		x = gpar(a,1);
		y = gpar(b,1);
		if (x == y) continue;
		if (ssize[x][1] < ssize[y][1]) swap(x,y);
		ssize[x][1] += ssize[y][1];
		p[y][1] = x;
		//adj[a].pb(b);
	//	adj[b].pb(a);
		cnt++;
	}
	if (cnt > 2*n-2) while(true) continue;
	for (int i = 0; i < n; i++) d[i] = -1;
	for (int i = 0; i < n; i++) if (d[i] == -1) dfs(i,0,-1);
	return 0;	
}



/*
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz size 

const int mxN = 1e5;
vector<int> adj[mxN];
//int d[mxN];
//int low[mxN];
int p[mxN][2];
int ss[mxN][2];

void dfs(int c, int depth, int par){
	p[c][0] = depth;
	p[c][1] = depth;
	int op = par;
	for (int i : adj[c]){
		if (i == par){par = -1; continue;}
		if (p[i][0] != -1){ p[c][1] = min(p[c][1],p[i][0]); continue;}
		dfs(i,depth+1,c);
		p[c][1] = min(p[c][1], p[i][1]);
	}
	if (p[c][1]>= depth && op != -1) cout << c+1 << " " << op+1 << '\n';
}



int gpar(int c, int w){
	if (p[c][w] == c) return c;
	p[c][w] = gpar(p[c][w],w);
	return p[c][w];
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n,m;
	cin >> n >> m;
	for (int i = 0; i < n; i++) for (int j = 0; j < 2; j++) {p[i][j] = i; ss[i][j] = 1;}

	int a,b;
	int x,y;
	int cnt = 0;
	for (int i = 0; i < m; i++){
		cin >> a >> b;
		a -= 1;
		b -= 1;
		x = gpar(a,0);
		y = gpar(b,0);
		if (x != y){
			adj[a].pb(b);
			adj[b].pb(a);
			cnt++;
			if (ss[x][0] < ss[y][0]) swap(x,y);
			ss[x][0] += ss[y][0];
			p[y][0] = x;
			continue;
		}
		cout << x << " 1 " << y << '\n';
		x = gpar(a,1);
		y = gpar(b,1);
		if (x==y)cout << "Je\n";
		if (x == y) continue;
		cout << x << " " << y << '\n';
		if (ss[x][1] < ss[y][1]) swap(x,y);
		ss[x][1] += ss[y][1];
		p[y][1] = x;
		adj[a].pb(b);
		adj[b].pb(a);
		cnt++;
	}
	for (int i = 0; i < n; i++) p[i][0] = -1;
	for (int i = 0; i < n; i++) if (p[i][0] == -1) dfs(i,0,-1);
	return 0;	
}


*/

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2824 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 8272 KB Output is correct
2 Incorrect 59 ms 8224 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 12532 KB Output is correct
2 Incorrect 122 ms 14188 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 163 ms 19280 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 216 ms 24880 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 339 ms 37696 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 445 ms 48860 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 576 ms 60240 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 709 ms 65536 KB Memory limit exceeded
2 Halted 0 ms 0 KB -