oj.uz

Submission #527333

# Submission time Handle Problem Language Result Execution time Memory
527333 2022-02-17T08:22:06 Z joelau Pipes (CEOI15_pipes) C++14
70 / 100
 994 ms 17344 KB 
#include <bits/stdc++.h>
using namespace std;

int N,M, ufds[100005], ufds1[100005], low[100005], depth[100005], p[100005];
vector< pair<int,int> > lst[100005];

int findSet(int i) {
    return ufds[i] == i ? i : ufds[i] = findSet(ufds[i]);
}

void unionSet (int i, int j) {
    int a = findSet(i), b = findSet(j);
    if (a != b) ufds[a] = b;
}

int findSet1(int i) {
    return ufds1[i] == i ? i : ufds1[i] = findSet1(ufds1[i]);
}

void unionSet1 (int i, int j) {
    int a = findSet1(i), b = findSet1(j);
    if (a != b) ufds1[a] = b;
}

void dfs (int u, int d) {
    depth[u] = d, low[u] = d;
    for (auto v: lst[u]) {
        if (depth[v.first] == -1) {
            p[v.first] = v.second;
            dfs(v.first,d+1);
            if (low[v.first] > depth[u]) cout << u+1 << ' ' << v.first+1 << '\n';
            low[u] = min(low[u],low[v.first]);
        }
        else if (v.second != p[u])
            low[u] = min(low[u],depth[v.first]);
    }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N >> M;
    for (int i = 0; i < N; ++i) ufds[i] = i, ufds1[i] = i;
    for (int i = 0; i < M; ++i) {
        int u,v; cin >> u >> v; u--, v--;
        if (findSet(u) != findSet(v)) {
            unionSet(u,v);
            lst[u].emplace_back(v,i), lst[v].emplace_back(u,i);
        }
        else if (findSet1(u) != findSet1(v)) {
            unionSet1(u,v);
            lst[u].emplace_back(v,i), lst[v].emplace_back(u,i);
        }
    }
    memset(depth,-1,sizeof(depth));
    for (int i = 0; i < N; ++i) if (depth[i] == -1) dfs(i,0);

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3732 KB Output is correct
2 Correct 5 ms 3416 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 3580 KB Output is correct
2 Correct 86 ms 3320 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 4424 KB Output is correct
2 Correct 164 ms 3844 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 6344 KB Output is correct
2 Correct 203 ms 5836 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 363 ms 12988 KB Output is correct
2 Correct 293 ms 9028 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 536 ms 14608 KB Output is correct
2 Correct 477 ms 10452 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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