oj.uz

Submission #550071

# Submission time Handle Problem Language Result Execution time Memory
550071 2022-04-17T07:35:22 Z SmolBrain Pipes (CEOI15_pipes) C++17
20 / 100
 442 ms 43692 KB 
// Om Namah Shivaya
// GM in 107 days

#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

const int maxn = 3e4 + 1;
const int inf1 = 1e9 + 5;

vector<pii> adj[maxn];
vector<int> tin(maxn), low(maxn, inf1);
bitset<maxn> vis;
int timer = 1;

void dfs(int node, int par, int prevedge) {
    vis[node] = 1;
    tin[node] = timer++;

    for (auto [child, id] : adj[node]) {
        if (vis[child]) {
            if (id != prevedge) {
                // back edge
                amin(low[node], tin[child]);
            }
        }
        else {
            // front edge
            dfs(child, node, id);
            amin(low[node], low[child]);

            if (low[child] > tin[node]) {
                cout << node << " " << child << endl;
            }
        }
    }
}

void solve(int test_case)
{
    int n, m; cin >> n >> m;
    rep1(i, m) {
        int u, v; cin >> u >> v;
        adj[u].pb({v, i}), adj[v].pb({u, i});
    }

    rep1(i, n) {
        if (vis[i]) conts;
        dfs(i, -1, -1);
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1876 KB Output is correct
2 Correct 15 ms 1584 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2260 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2260 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2260 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2260 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2260 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -