oj.uz

답안 #585639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
585639 2022-06-29T07:02:13 Z 1zaid1 Pipes (CEOI15_pipes) C++14
10 / 100
 2219 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int M = 1e5+1;
vector<int> node[M];
int a[M], d[M], tt = 1;
bitset<100005> vis;
vector<pair<int, int>> ans;

void dfs(int s, int p = 1) {
    a[s] = tt++;
    vis[s] = true;
    for (int i:node[s]) {
        if (!vis[i]) {
            dfs(i, s);
            if (a[i] > a[s]) ans.push_back({s, i});
        }
    }

    for (int i:node[s]) if (i != p) a[s] = min(a[s], a[i]);
    d[s] = tt++;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;

        node[a].push_back(b);
        node[b].push_back(a);
    }

    for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i); vis = 0;
    for (auto [a, b]:ans) cout << a << ' ' << b << endl;

    return 0;
}
/*
10 11
1 7
1 8
1 6
2 8
6 7
5 8
2 5
2 3
2 4
3 4
10 9

*/

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:38:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   38 |     for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i); vis = 0;
      |     ^~~
pipes.cpp:38:55: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   38 |     for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i); vis = 0;
      |                                                       ^~~
pipes.cpp:39:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   39 |     for (auto [a, b]:ans) cout << a << ' ' << b << endl;
      |               ^

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 11976 KB Output is correct
2 Correct 145 ms 15608 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 227 ms 15240 KB Output is correct
2 Runtime error 272 ms 30056 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 431 ms 26460 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 758 ms 32668 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1191 ms 65536 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1379 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1865 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2219 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -