oj.uz

Submission #106591

# Submission time Handle Problem Language Result Execution time Memory
106591 2019-04-19T07:01:53 Z teomrn Pipes (CEOI15_pipes) C++14
50 / 100
 5000 ms 7892 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <numeric>
#include <assert.h>
using namespace std;

const int NMAX = 100010;

struct UF {
    int g[NMAX];
    int tata[NMAX];

    UF() {
        iota(tata, tata + NMAX, 0);
        fill(g, g + NMAX, 1);
    }

    int find(int x) {
        if (tata[tata[x]] != tata[x])
            tata[x] = find(tata[x]);
        return tata[x];
    }

    bool unite(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b)
            return 0;
        if (g[a] < g[b])
            swap(a, b);
        g[a] += g[b];
        tata[b] = a;

        return 1;
    }
} simple, strong;

namespace Tree {
    int h[NMAX];
    int father[NMAX];
    int up[NMAX]; /// ultimul cu care stiu sigur ca m-am unit
    vector <int> adia[NMAX]; /// suma ar trebui sa fie max NMAX :)
    vector <pair <int, int>> single;
    int n;

    int find(int nod) {
        if (up[up[nod]] != up[nod])
            up[nod] = find(up[nod]);
        return up[nod];
    }

    void make_strong(int a, int b) {
        a = find(a);
        b = find(b);
        while (1) {
            if (a == b)
                return;

            if (h[a] < h[b])
                swap(a, b);
            /// acum il unesc pe a cu tatal sau
            assert(strong.find(a) != strong.find(father[a]));
            assert(father[a] != 0);
            strong.unite(a, father[a]);
            up[a] = father[a];
            a = find(a);
        }
    }

    void dfs(int nod, int tata) {
        father[nod] = tata;
        h[nod] = 1 + h[tata];
        up[nod] = (strong.find(nod) == strong.find(tata) ? find(tata) : nod);
        for (auto i : adia[nod])
            if (i != tata)
                dfs(i, nod);
    }

    void add_edge(int a, int b) {
        if (simple.unite(a, b)) {
            if (simple.g[simple.find(a)] < simple.g[simple.find(b)])
                swap(a, b);
            adia[a].push_back(b);
            adia[b].push_back(a);
            dfs(b, a);
        }
        else
            make_strong(a, b);
    }

    void dfs_ans(int nod, int tata) {
        for (auto i : adia[nod]) {
            if (i == tata)
                continue;
            if (strong.find(i) != strong.find(nod))
                single.push_back({ nod, i });
            dfs_ans(i, nod);
        }
    }

    void get_ans() {
        for (int i = 1; i <= n; i++)
            if (father[i] == 0)
                dfs_ans(i, 0);
    }

}

int main()
{
    int n, m, a, b;
    scanf("%d%d", &n, &m);
    Tree::n = n;
    iota(Tree::up, Tree::up + NMAX, 0);

    while (m--) {
        scanf("%d%d", &a, &b);
        Tree::add_edge(a, b);
    }

    Tree::get_ans();

    for (auto i : Tree::single)
        printf("%d %d\n", i.first, i.second);

    return 0;
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:113: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:118: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 4608 KB Output is correct
2 Correct 5 ms 4608 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 4824 KB Output is correct
2 Correct 36 ms 4736 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 4856 KB Output is correct
2 Correct 121 ms 4792 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 688 ms 5232 KB Output is correct
2 Correct 300 ms 4988 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3948 ms 5772 KB Output is correct
2 Correct 2119 ms 5908 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5047 ms 7140 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5048 ms 7336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5034 ms 7892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5076 ms 7832 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5081 ms 7712 KB Time limit exceeded
2 Halted 0 ms 0 KB -