oj.uz

답안 #244508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244508 2020-07-04T08:17:22 Z dantoh000 Pipes (CEOI15_pipes) C++14
20 / 100
 1385 ms 65540 KB 
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
typedef pair<int,int> ii;
int n,m;
unordered_map<int,bool> M[30005];
vector<ii> G[30005];
int num[30005];
int p[30005];
int low[30005];
int ct = 1;
void dfs(int u){
    low[u] = num[u] = ct++;
    for (auto v : G[u]){
        if (num[v.first] == 0){
            p[v.first] = u;
            dfs(v.first);
            if (low[v.first] > num[u]){
                if (v.second == 0){
                    printf("%d %d\n",u,v);
                }
            }
            low[u] = min(low[u],low[v.first]);
        }
        else if (v.first != p[u]){
            low[u] = min(low[u],num[v.first]);
        }
    }
}
int main(){
    scanf("%d%d",&n,&m);
    for (int i = 0; i < m; i++){
        int u,v;
        scanf("%d%d",&u,&v);
        if (u > v) swap(u,v);
        if (M[u].count(v)){
            M[u][v] = 1;
        }
        else{
            M[u][v] = 0;
        }
    }
    for (int u = 1; u <= n; u++){
        auto it = M[u].begin();
        while (it != M[u].end()){
            int v = it->first, w = it->second;
            G[u].push_back({v,w});
            G[v].push_back({u,w});
            it = M[u].erase(it);
        }
    }
    for (int i = 1; i <= n; i++){
        if (num[i] == 0){
            dfs(i);
        }
    }
}

Compilation message

pipes.cpp: In function 'void dfs(int)':
pipes.cpp:20:41: warning: format '%d' expects argument of type 'int', but argument 3 has type 'std::pair<int, int>' [-Wformat=]
                     printf("%d %d\n",u,v);
                                         ^
pipes.cpp: In function 'int main()':
pipes.cpp:31: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:34:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&u,&v);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3712 KB Output is correct
2 Correct 13 ms 3456 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 661 ms 42336 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1208 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 1385 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 9 ms 5248 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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