oj.uz

Submission #234131

# Submission time Handle Problem Language Result Execution time Memory
234131 2020-05-23T09:11:27 Z PeppaPig Pipes (CEOI15_pipes) C++14
100 / 100
 2164 ms 13452 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5+5;

struct UnionFind {
    int par[N];

    UnionFind() { iota(par, par + N, 0); }

    int find(int x) { return par[x] = x == par[x] ? x : find(par[x]); }

    void unite(int a, int b) {
        a = find(a), b = find(b);
        if(a == b) return;
        par[a] = b;
    }
} d1, d2;

int n, m, idx;
vector<vector<int> > g;
vector<int> pre, low, l, r;

void tarjan(int u, int p) {
    pre[u] = low[u] = ++idx;
    bool chk = false;
    for(int v : g[u]) {
        if(v == p && !chk) chk = true;
        else if(!pre[v]) {
            tarjan(v, u);
            low[u] = min(low[u], low[v]);
            if(low[v] > pre[u]) l.emplace_back(u), r.emplace_back(v);
        } else low[u] = min(low[u], pre[v]);
    }
}

int main() {
    scanf("%d %d", &n, &m);
    g.resize(n + 1), pre.resize(n + 1), low.resize(n + 1);

    for(int i = 1, a, b; i <= m; i++) {
        scanf("%d %d", &a, &b);
        if(d1.find(a) != d1.find(b)) {
            d1.unite(a, b);
            g[a].emplace_back(b), g[b].emplace_back(a);
        } else if(d2.find(a) != d2.find(b)) {
            d2.unite(a, b);
            g[a].emplace_back(b), g[b].emplace_back(a);
        }
    }
    for(int i = 1; i <= n; i++) if(!pre[i]) tarjan(i, 0);
    for(int i = 0; i < l.size(); i++) printf("%d %d\n", l[i], r[i]);

    return 0;
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:53:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < l.size(); i++) printf("%d %d\n", l[i], r[i]);
                    ~~^~~~~~~~~~
pipes.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1792 KB Output is correct
2 Correct 11 ms 1536 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 1864 KB Output is correct
2 Correct 165 ms 1752 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 2528 KB Output is correct
2 Correct 360 ms 13176 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 4344 KB Output is correct
2 Correct 424 ms 4064 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 658 ms 9464 KB Output is correct
2 Correct 623 ms 6520 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1106 ms 11256 KB Output is correct
2 Correct 1049 ms 8328 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1469 ms 13168 KB Output is correct
2 Correct 1405 ms 8980 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1835 ms 13452 KB Output is correct
2 Correct 1751 ms 8952 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2164 ms 12960 KB Output is correct
2 Correct 2084 ms 10488 KB Output is correct