oj.uz

Submission #1004690

# Submission time Handle Problem Language Result Execution time Memory
1004690 2024-06-21T12:37:28 Z Valaki2 Pipes (CEOI15_pipes) C++14
40 / 100
 681 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int maxn = 1e5;

int n, m;
vector<int> graph[1 + maxn];

int par[1 + maxn];
int sz[1 + maxn];

int par2[1 + maxn];
int sz2[1 + maxn];

void make_set2(int a) {
    par2[a] = a;
    sz2[a] = 1;
}

int find_set2(int a) {
    if(a == par2[a]) {
        return a;
    }
    return par2[a] = find_set2(par2[a]);
}

void union_sets2(int a, int b) {
    a = find_set2(a), b = find_set2(b);
    if(a == b) {
        return;
    }
    if(sz2[a] < sz2[b]) {
        swap(a, b);
    }
    par2[b] = a;
    sz2[a] += sz2[b];
}

void make_set(int a) {
    par[a] = a;
    sz[a] = 1;
}

int find_set(int a) {
    if(a == par[a]) {
        return a;
    }
    return par[a] = find_set(par[a]);
}

void union_sets(int a, int b) {
    int ax = a, bx = b;
    a = find_set(a), b = find_set(b);
    if(a == b) {
        union_sets2(ax, bx);
        return;
    }
    graph[ax].pb(bx);
    graph[bx].pb(ax);
    if(sz[a] < sz[b]) {
        swap(a, b);
    }
    par[b] = a;
    sz[a] += sz[b];
}

bool vis[1 + maxn];
int l[1 + maxn];
int d[1 + maxn];
int timer;

void dfs(int cur, int parent) {
    timer++;
    l[cur] = d[cur] = timer;
    vis[cur] = true;
    for(int nei : graph[cur]) {
        if(nei == parent) {
            continue;
        }
        if(vis[nei]) {
            l[cur] = min(l[cur], d[nei]);
        } else {
            dfs(nei, cur);
            l[cur] = min(l[cur], l[nei]);
            if(l[nei] > d[cur] && cur <= n && nei <= n) {
                cout << cur << " " << nei << "\n";
            }
        }
    }
}

void solve() {
    cin >> n >> m;
    int x, y;
    for(int i = 1; i <= n; i++) {
        make_set(i);
    }
    for(int i = 1; i <= n; i++) {
        make_set2(i);
    }
    for(int i = 1; i <= m; i++) {
        cin >> x >> y;
        union_sets(x, y);
    }
    for(int i = 1; i <= n; i++) {
        int j = find_set2(i) + n;
        graph[i].pb(j);
        graph[j].pb(i);
    }
    for(int i = 1; i <= 2 * n; i++) {
        if(!vis[i]) {
            dfs(i, -1);
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

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 2652 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3160 KB Output is correct
2 Correct 4 ms 3164 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 8348 KB Output is correct
2 Correct 58 ms 8276 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 13040 KB Output is correct
2 Correct 129 ms 14632 KB Output is correct

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 223 ms 35432 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 356 ms 49180 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 464 ms 58704 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 569 ms 65536 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 681 ms 65536 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -