oj.uz

Submission #874359

# Submission time Handle Problem Language Result Execution time Memory
874359 2023-11-16T17:49:49 Z AHOKA Pipes (CEOI15_pipes) C++14
10 / 100
 2704 ms 65536 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h> 

using namespace std;

#define threesum cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define all(a) a.begin(), a.end()
#define lmx 9223372036854775807;
//#define mod 1000000007
#define F first
#define S second

vector<int> adj[100001];
int par[100001], par2[100001], n, m, seen[100001], d[100001];

int getpar(int v){
    return ((par[v]!=v) ? par[v] = getpar(par[v]) : v);
}

int getpar2(int v){
    return ((par2[v]!=v) ? par2[v] = getpar2(par2[v]) : v);
}

bool merge(int u, int v){
    int u1 = getpar(u), v1 = getpar(v);
    if(u1 == v1){
		int u2 = getpar2(u), v2 = getpar2(v);
    	if(u2 == v2) return 0;
		par2[u2] = v2;
		return 1;
	}
	par[u1] = v1;
	return 1;
}

void dfs(int v, int p){
	seen[v]=seen[p]+1;
	d[v]=seen[v];
	for(auto u:adj[v]){
		if(u==p)continue;
		if(!seen[u])dfs(u, v);
		d[v]=min(d[v], d[u]);
	}
	if(d[v]==seen[v]&&p!=0)cout << v << " " << p << "\n";
}

int main() {
	cin >> n >> m;
	for(int i=1;i<=n;i++)par[i]=i, par2[i]=i;
	for(int i=0;i<m;i++){
		int u, v;cin >> v >> u;
		if(merge(u, v))adj[v].push_back(u), adj[u].push_back(v);
	}
	for(int i=1;i<=n;i++)if(!seen[i])dfs(i, 0);
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4444 KB Output is correct
2 Incorrect 7 ms 4184 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 4304 KB Output is correct
2 Incorrect 209 ms 4188 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 651 ms 6404 KB Output is correct
2 Correct 552 ms 6228 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 822 ms 11084 KB Output is correct
2 Runtime error 720 ms 25916 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1295 ms 12000 KB Output is correct
2 Runtime error 1370 ms 42576 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1731 ms 14052 KB Output is correct
2 Runtime error 1667 ms 50268 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2191 ms 14016 KB Output is correct
2 Runtime error 2078 ms 62344 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2663 ms 13584 KB Output is correct
2 Runtime error 2704 ms 65536 KB Memory limit exceeded
3 Halted 0 ms 0 KB -