oj.uz

Submission #106605

# Submission time Handle Problem Language Result Execution time Memory
106605 2019-04-19T08:05:58 Z teomrn Pipes (CEOI15_pipes) C++14
100 / 100
 1611 ms 8704 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 :)
    int cnt = 0;
    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.g[simple.find(a)] < simple.g[simple.find(b)])
            swap(a, b);

        if (simple.unite(a, b)) {
            adia[a].push_back(b);
            adia[b].push_back(a);
            dfs(b, a);
            cnt++;
            assert(cnt < n);
        }
        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))
                printf("%d %d\n", i, nod);
            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();

    return 0;
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:117: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:122: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 4580 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 8 ms 4864 KB Output is correct
2 Correct 9 ms 4736 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 4736 KB Output is correct
2 Correct 114 ms 4860 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 4992 KB Output is correct
2 Correct 238 ms 5028 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 5592 KB Output is correct
2 Correct 295 ms 5752 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 486 ms 7416 KB Output is correct
2 Correct 449 ms 7416 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 755 ms 7804 KB Output is correct
2 Correct 710 ms 7968 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1027 ms 8564 KB Output is correct
2 Correct 936 ms 8684 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1155 ms 8704 KB Output is correct
2 Correct 1151 ms 8592 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1611 ms 8372 KB Output is correct
2 Correct 1382 ms 8616 KB Output is correct