oj.uz

Submission #948557

# Submission time Handle Problem Language Result Execution time Memory
948557 2024-03-18T07:52:45 Z vjudge1 Pipes (CEOI15_pipes) C++17
10 / 100
 1319 ms 65536 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
//#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m; cin >> n >> m;
    vector <vector<int>> G(n);
    for ( int i = 0; i < m; i++ ){
        int u, v; cin >> u >> v;
        --u, --v;
        G[u].pb(v), G[v].pb(u);
    }
    vector <int> tin(n), low(n);
    int ct = 0;
    auto dfs = [&](auto dfs, int u, int p) -> void{
        tin[u] = low[u] = ++ct;
        for ( auto &v: G[u] ){
            if ( v == p ) continue;
            if ( tin[v] > 0 ){
                chmin(low[u], tin[v]);
            } else{
                dfs(dfs, v, u);
                chmin(low[u], low[v]);
                if ( low[v] > tin[u] ){
                    cout << u + 1 << " " << v + 1 << ln;
                }
            }
        }
    };
    for ( int i = 0; i < n; i++ ){
        if ( !tin[i] ){
            dfs(dfs, i, -1);
        }
    }

    cout << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1192 KB Output is correct
2 Incorrect 3 ms 860 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 8624 KB Output is correct
2 Correct 75 ms 8020 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 12520 KB Output is correct
2 Runtime error 212 ms 16504 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 251 ms 24224 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 422 ms 32820 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 766 ms 58196 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 992 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1176 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1319 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -