oj.uz

답안 #244630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244630 2020-07-04T13:05:18 Z tqbfjotld Pipes (CEOI15_pipes) C++14
0 / 100
 731 ms 65540 KB 
#include <bits/stdc++.h>
using namespace std;

bool isBridge[100005];
int p[100005];
int sz[100005];
int depth[100005];
vector<int> adjl[100005];
int p2[100005];

void dfs(int node, int parent){
    for (int x : adjl[node]){
        if (x==parent) continue;
        depth[x] = depth[node]+1;
        dfs(x,node);
        if(p2[x]!=node){
            isBridge[x] = isBridge[node];
            p2[x] = node;
        }
    }
}

int root(int a){
    return p[a]==a?a:p[a]=root(p[a]);
}

int func(int a, int b){
    if (a==b) return a;
    if (depth[b]<depth[a]) swap(a,b);
    isBridge[b] = false;
    int t = func(a,p[b]);
    p[a] = t;
    p[b] = t;
}

int n,e;

int main(){
    scanf("%d%d",&n,&e);
    for (int x = 0; x<n; x++){
        isBridge[x] = false;
        p[x] = x;
        sz[x] = 1;
        depth[x] = 0;
    }
    for (int x = 0; x<e; x++){
        int a,b;
        scanf("%d%d",&a,&b);
        if (root(a)==root(b)){
            func(a,b);
        }
        else{
            if (sz[root(b)]>sz[root(a)]) swap(a,b);
            sz[root(a)] += sz[root(b)];
            adjl[b].push_back(a);
            adjl[a].push_back(b);
            depth[b] = depth[a]+1;
            p2[b] = a;
            p[b] = a;
            dfs(b,a);
            isBridge[b] = true;
        }
    }
    for (int x = 0; x<n; x++){
        if (isBridge[x]){
            printf("%d %d\n",x,p2[x]);
        }
    }
}

Compilation message

pipes.cpp: In function 'int func(int, int)':
pipes.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
pipes.cpp: In function 'int main()':
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,&e);
     ~~~~~^~~~~~~~~~~~~~
pipes.cpp:48: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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 54 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 197 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 70 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 731 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 170 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 120 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 93 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 151 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 153 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 126 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -