oj.uz

Submission #874392

# Submission time Handle Problem Language Result Execution time Memory
874392 2023-11-16T20:41:09 Z Hamed_Ghaffari Pipes (CEOI15_pipes) C++17
50 / 100
 756 ms 50500 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long       ll;
typedef pair<int, int>  pii;

#define FastIO          cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define FileIO          freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define F               first
#define S               second
#define max_heap(T)     priority_queue<T>
#define min_heap(T)     priority_queue<T, vector<T>, greater<T>>
#define fr(i,a,b)       for(int i=a;i<b;i++)
#define frr(i,a,b)      for(int i=a;i>b;i--)
#define frin(i,A)       for(auto &i : A)
#define frp(a,b,A)      for(auto [a, b] : A)
#define SZ(x)           (int)x.size()
#define all(A)          A.begin(), A.end()
#define mins(a,b)       a = min(a,b)
#define maxs(a,b)       a = max(a,b)
#define pb              push_back
#define kill(x)         cout << x << '\n', exit(0)
#define md(a)           (a%MOD+MOD)%MOD

const ll  INF  = 2e9;
const ll  MOD  = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int LOG  = 30;

int n, m, par[MAXN][2], hi[MAXN], mn[MAXN], edge;
vector<pii> g[MAXN];

void DSU() {
	fr(i, 1, n+1)
		par[i][0] = par[i][1] = i;
}
int Find(int v, int x) { return v == par[v][x] ? v : par[v][x] = Find(par[v][x], x); }
void Union(int u, int v) {
	if(Find(u, 0) != Find(v, 0)) {
		par[Find(u, 0)][0] = Find(v, 0);
		g[u].pb({v, ++edge});
		g[v].pb({u, edge});
		return;
	}
	if(Find(u, 1) != Find(v, 1)) {
		par[Find(u, 1)][1] = Find(v, 1);
		g[u].pb({v, ++edge});
		g[v].pb({u, edge});
		return;
	}
}

void dfs(int v, int p, int pid) {
	hi[v] = hi[p]+1;
	mn[v] = hi[v];
	frin(u, g[v]) {
		if(u.F == p && u.S == pid)
			continue;
		if(!hi[u.F])
			dfs(u.F, v, u.S);
		mins(mn[v], mn[u.F]);
	}
	if(v != p && mn[v] == hi[v])
		cout << v << ' ' << p << '\n';
}

void solve() {
	cin >> n >> m;
	DSU();
	int u, v;
	while(m--) {
		cin >> u >> v;
		Union(u, v);
	}
	fr(i, 1, n+1)
		if(!hi[i])
			dfs(i, i, 0);
}

int32_t main() {
	FastIO
	int T = 1;
	// cin >> T;
	while(T--)
		solve();
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2656 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3420 KB Output is correct
2 Correct 3 ms 3024 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 3052 KB Output is correct
2 Correct 64 ms 2904 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 4012 KB Output is correct
2 Correct 131 ms 14704 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 5968 KB Output is correct
2 Correct 155 ms 5372 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 12112 KB Output is correct
2 Runtime error 237 ms 17996 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 13392 KB Output is correct
2 Runtime error 376 ms 26864 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 514 ms 15964 KB Output is correct
2 Runtime error 485 ms 32596 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 628 ms 15848 KB Output is correct
2 Runtime error 604 ms 37992 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 756 ms 15356 KB Output is correct
2 Runtime error 743 ms 50500 KB Memory limit exceeded
3 Halted 0 ms 0 KB -