oj.uz

답안 #95874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
95874 2019-02-03T09:53:42 Z Kastanda Pipes (CEOI15_pipes) C++11
20 / 100
 3050 ms 5240 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 100005, M = N * 2;
int n, cnt, tk, H[N], Mn[N], stk[N], par[N];
int ts, head[N], nxt[M + M];
int m, from[M], to[M];
bitset < M > tree, bridge;
bitset < N > mark;
int v, u;
bool _bool;
inline void Unlaze()
{
    mark = 0; tree = 0;
    memset(H, 0, sizeof(H));
    for (int i = 1; i <= n; i++)
        if (!mark[i])
        {
            tk = 1;
            stk[tk] = i;
            par[tk] = -1;

            /* DFS */
            while (tk)
            {
                v = stk[tk];
                if (mark[v])
                {
                    u = from[head[v] >> 1] ^ to[head[v] >> 1] ^ v;
                    Mn[v] = min(Mn[v], Mn[u]);
                    if (Mn[u] < H[u])
                        bridge[head[v] >> 1] = 0;
                    head[v] = nxt[head[v]];
                }
                if (!mark[v])
                {
                    mark[v] = 1;
                    Mn[v] = H[v];
                }
                for (; head[v] != -1; head[v] = nxt[head[v]])
                    if ((head[v] >> 1) != par[tk])
                    {
                        u = from[head[v] >> 1] ^ to[head[v] >> 1] ^ v;
                        if (mark[u])
                            Mn[v] = min(Mn[v], H[u]), bridge[head[v] >> 1] = 0;
                        else
                        {
                            H[u] = H[v] + 1;
                            tree[head[v] >> 1] = 1;

                            ++ tk;
                            stk[tk] = u;
                            par[tk] = head[v] >> 1;
                            break;
                        }
                    }
                if (head[v] == -1)
                    tk --;
            }
            /* DFS */
        }
    cnt = 0;
    for (int i = 0; i < (ts >> 1); i++)
        if (tree[i])
        {
            _bool = tree[i];
            tree[i] = tree[cnt];
            tree[cnt] = _bool;

            _bool = bridge[i];
            bridge[i] = bridge[cnt];
            bridge[cnt] = _bool;

            from[i] ^= from[cnt];
            from[cnt] ^= from[i];
            from[i] ^= from[cnt];

            to[i] ^= to[cnt];
            to[cnt] ^= to[i];
            to[i] ^= to[cnt];

            cnt ++;
        }
    ts = 0;
    memset(nxt, -1, sizeof(nxt));
    memset(head, -1, sizeof(head));
    for (int i = 0; i < cnt; i++)
    {
        v = from[i]; u = to[i];
        nxt[ts] = head[v]; head[v] = ts;
        nxt[ts|1] = head[u]; head[u] = ts|1;
        ts += 2;
    }
}
int main()
{
    memset(nxt, -1, sizeof(nxt));
    memset(head, -1, sizeof(head));
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++)
    {
        scanf("%d%d", &v, &u);
        bridge[ts >> 1] = 1;

        from[ts >> 1] = v; to[ts >> 1] = u;
        nxt[ts] = head[v]; head[v] = ts;
        nxt[ts|1] = head[u]; head[u] = ts|1;
        ts += 2;

        if (ts >= M + M - 20)
            Unlaze();
    }
    Unlaze();
    for (int i = 0; i < (ts >> 1); i++)
        if (bridge[i])
            printf("%d %d\n", from[i], to[i]);
    return 0;
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:98: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:101:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &v, &u);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2788 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2944 KB Output is correct
2 Correct 6 ms 2864 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 154 ms 4308 KB Output is correct
2 Incorrect 156 ms 4360 KB Mismatched edge

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 4380 KB Output is correct
2 Incorrect 364 ms 4396 KB Wrong number of edges

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 512 ms 4608 KB Output is correct
2 Incorrect 362 ms 4568 KB Wrong number of edges

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 730 ms 5016 KB Output is correct
2 Incorrect 626 ms 4672 KB Wrong number of edges

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1273 ms 5204 KB Output is correct
2 Incorrect 1008 ms 4916 KB Wrong number of edges

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1842 ms 5148 KB Output is correct
2 Incorrect 1685 ms 4800 KB Wrong number of edges

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2577 ms 5204 KB Output is correct
2 Incorrect 2365 ms 4804 KB Wrong number of edges

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3050 ms 5180 KB Output is correct
2 Incorrect 2303 ms 5240 KB Wrong number of edges