oj.uz

답안 #706743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
706743 2023-03-07T15:50:59 Z finn__ Pipes (CEOI15_pipes) C++17
20 / 100
 1202 ms 14424 KB 
#include <bits/stdc++.h>
using namespace std;

struct Dsu
{
    vector<int> p;

    Dsu(size_t n) { p = vector<int>(n, -1); }

    int repr(int u) { return p[u] < 0 ? u : p[u] = repr(p[u]); }

    bool merge(int i, int j)
    {
        i = repr(i);
        j = repr(j);
        if (i == j)
            return 0;

        if (p[i] > p[j])
            swap(i, j);
        p[i] += p[j];
        p[j] = i;
        return 1;
    }

    bool same_set(int i, int j) { return repr(i) == repr(j); }

    int set_size(int i) { return -p[repr(i)]; }
};

constexpr size_t N = 100000;

vector<unsigned> g[N];
unsigned y[N];

pair<unsigned, unsigned> find_bridges(unsigned u, unsigned p, unsigned i)
{
    y[u] = ++i;
    unsigned lu = y[u];

    for (unsigned const &v : g[u])
    {
        if (!y[v])
        {
            unsigned lv;
            tie(i, lv) = find_bridges(v, u, i);
            lu = min(lu, lv);
            if (lv > y[u])
                printf("%u %u\n", u + 1, v + 1);
        }
        else if (v != p)
            lu = min(lu, y[v]);
    }

    return make_pair(i, lu);
}

int main()
{
    size_t n, m;
    scanf("%zu %zu", &n, &m);

    Dsu d1(n), d2(n);

    while (m--)
    {
        unsigned u, v;
        scanf("%u %u", &u, &v);
        u--, v--;
        if (d1.merge(u, v) || d2.merge(u, v))
            g[u].push_back(v), g[v].push_back(u);
    }

    for (unsigned i = 0; i < n; i++)
        if (!y[i])
            find_bridges(i, UINT_MAX, 0);
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:61:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |     scanf("%zu %zu", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
pipes.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         scanf("%u %u", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 2 ms 2644 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3176 KB Output is correct
2 Incorrect 6 ms 2900 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 4700 KB Output is correct
2 Incorrect 117 ms 4344 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 200 ms 5472 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 330 ms 6624 KB Output is correct
2 Correct 268 ms 5600 KB Output is correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 433 ms 9992 KB Output is correct
2 Incorrect 386 ms 7240 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 747 ms 11256 KB Output is correct
2 Incorrect 640 ms 8972 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 774 ms 13348 KB Output is correct
2 Incorrect 753 ms 9312 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1014 ms 13524 KB Output is correct
2 Incorrect 929 ms 9284 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1202 ms 14424 KB Output is correct
2 Correct 1152 ms 10868 KB Output is correct