oj.uz

Submission #669376

# Submission time Handle Problem Language Result Execution time Memory
669376 2022-12-06T10:29:29 Z ShaShi Pipes (CEOI15_pipes) C++17
20 / 100
 985 ms 15316 KB 
#include <bits/stdc++.h>
#define lint long long int
#define dint long double
#define ll long long
#define endl "\n"
#define pii pair<int, int>
#define pb push_back
#define F first
#define S second

using namespace std;

const int MOD = (int)1e9 + 23;
const int MAXN = (int)1e5 + 23;
const int MAX_LOG = 17 + 1;
const int INF = (int)1e9 + 23;

int n, m, tmp, tmp2, u, v;
int par1[MAXN], par2[MAXN], sz1[MAXN], sz2[MAXN], h[MAXN], dp[MAXN], seen[MAXN];
vector<pii> adj[MAXN];


int get_par1(int v) {
    return (par1[v] == -1? v : par1[v] = get_par1(par1[v]));
}

int get_par2(int v) {
    return (par2[v] == -1? v : par2[v] = get_par2(par2[v]));
}

bool merge1(int u, int v) {
    u = get_par1(u);
    v = get_par1(v);

    if (u == v) return 0;

    par1[u] = v;

    return 1;
}

bool merge2(int u, int v) {
    u = get_par2(u);
    v = get_par2(v);

    if (u == v) return 0;

    par2[u] = v;

    return 1;
}

void DFS(int v, int par, int index){
	dp[v] = h[v];
	seen[v] = 1;


	for(auto w:adj[v]) {
        int u = w.F;
        int ind=w.S;


		if(!seen[u]) {
			h[u] = h[v]+1;
			DFS(u,v,ind);
			dp[v] = min(dp[v], dp[u]);
		} else if(u!=par){
			dp[v] = min(dp[v], h[u]);
		}
	}

	if (par!=-1 && dp[v]==h[v]){
		cout << par << " " << v << endl;
	}
}

int32_t main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    
    cin >> n >> m;

    fill(par1, par1+n+1, -1);
    fill(par2, par2+n+1, -1);
    fill(seen, seen+n+1, 0);
    tmp = 1;

    for (int i=1; i<=m; i++) {
        cin >> u >> v;

        if (merge1(u, v)) {
            adj[u].pb({v, tmp});
            adj[v].pb({u, tmp});
            tmp++;
        } else if (merge2(u, v)) {
            adj[u].pb({v, tmp});
            adj[v].pb({u, tmp});
            tmp++;
        }
    }

    for (int i=1; i<=n; i++) {
        if (!seen[i]) {
            DFS(i, -1, 0);
        }
    }

    
    


    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 140 ms 3908 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 242 ms 5660 KB Output is correct
2 Correct 202 ms 5192 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 985 ms 14692 KB Output is correct
2 Correct 887 ms 11484 KB Output is correct