oj.uz

Submission #169418

# Submission time Handle Problem Language Result Execution time Memory
169418 2019-12-20T09:54:10 Z gs18103 Pipes (CEOI15_pipes) C++11
80 / 100
 1572 ms 65536 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define eb emplace_back
#define em emplace

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 100010;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;

struct UFT {
    int p[MAX];
    UFT(int n) {
        for(int i = 1; i <= n; i++) p[i] = i;
    }

    int find(int x) {
        return p[x] == x ? p[x] : p[x] = find(p[x]);
    }
    void uni(int x, int y) {
        p[find(x)] = find(y);
    }
};

vector <int> g[MAX];
int low[MAX], ord[MAX], pa[MAX], cnt = 0;

void dfs(int x) {
    ord[x] = low[x] = ++cnt;
    bool was = false;
    for(auto i : g[x]) {
        if(i == pa[x] && !was) {
            was = true;
            continue;
        }
        if(ord[i] == 0) {
            pa[i] = x;
            dfs(i);
            low[x] = min(low[x], low[i]);
            if(low[i] > ord[x]) cout << x << ' ' << i << '\n';
        }
        else if(ord[i] < ord[x]) {
            low[x] = min(low[x], ord[i]);
        }
    }
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    int n, m;
    cin >> n >> m;
    UFT t1(n), t2(n);
    for(int i = 1; i <= m; i++) {
        int u, v; cin >> u >> v;
        if(t1.find(u) != t1.find(v)) {
            t1.uni(u, v);
            g[u].eb(v), g[v].eb(u);
        }
        else if(t2.find(u) != t2.find(v)) {
            t2.uni(u, v);
            g[u].eb(v), g[v].eb(u);
        }
    }
    for(int i = 1; i <= n; i++) {
        if(ord[i] == 0) dfs(i);
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3448 KB Output is correct
2 Correct 9 ms 3064 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 5176 KB Output is correct
2 Correct 127 ms 5052 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 5756 KB Output is correct
2 Correct 249 ms 4836 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 6904 KB Output is correct
2 Correct 315 ms 5624 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 532 ms 12216 KB Output is correct
2 Correct 468 ms 8192 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 783 ms 12368 KB Output is correct
2 Correct 743 ms 9336 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1074 ms 14792 KB Output is correct
2 Correct 994 ms 9724 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1331 ms 15788 KB Output is correct
2 Runtime error 1242 ms 62784 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1572 ms 14396 KB Output is correct
2 Runtime error 1482 ms 65536 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)