oj.uz

Submission #874366

# Submission time Handle Problem Language Result Execution time Memory
874366 2023-11-16T18:12:02 Z AHOKA Pipes (CEOI15_pipes) C++14
100 / 100
 2650 ms 15188 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<pair<int, int>> adj[100001];
int par[100001], par2[100001], edges, 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, edges++;
		return 1;
	}
	par[u1] = v1, edges++;
	return 1;
}

void dfs(int& v, int p, int pid){
	seen[v]=seen[p]+1;
	d[v]=seen[v];
	for(auto& [u, id]:adj[v]){
		if(u==p && pid==id)continue;
		if(!seen[u])dfs(u, v, id);
		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, edges}), adj[u].push_back({v, edges});
	}
	for(int i=1;i<=n;i++)if(!seen[i])dfs(i, 0, 0);
}

Compilation message

pipes.cpp: In function 'void dfs(int&, int, int)':
pipes.cpp:41:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   41 |  for(auto& [u, id]:adj[v]){
      |            ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4184 KB Output is correct
2 Correct 1 ms 4188 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4444 KB Output is correct
2 Correct 7 ms 4444 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 4376 KB Output is correct
2 Correct 212 ms 4356 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 4992 KB Output is correct
2 Correct 492 ms 4732 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 631 ms 6992 KB Output is correct
2 Correct 541 ms 6128 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 820 ms 11704 KB Output is correct
2 Correct 726 ms 9300 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1345 ms 12880 KB Output is correct
2 Correct 1311 ms 9712 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1707 ms 15032 KB Output is correct
2 Correct 1620 ms 10948 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2157 ms 15188 KB Output is correct
2 Correct 2066 ms 10928 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2650 ms 14540 KB Output is correct
2 Correct 2627 ms 11568 KB Output is correct