oj.uz

Submission #382550

# Submission time Handle Problem Language Result Execution time Memory
382550 2021-03-27T16:15:32 Z Mahdi_Shokoufi Pipes (CEOI15_pipes) C++17
0 / 100
 1378 ms 21740 KB 
//In the name of Allah
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

const int N = 1e5 + 10;

int par[2][N], cnt;
bitset < N > mark;
vector < int > adj[N];

int getPar(int t, int v){
    return par[t][v] == v ? v : par[t][v] = getPar(t, par[t][v]);
}

bool merge(int t, int u, int v){
    u = getPar(t, u); v = getPar(t, v);
    if (u == v)
        return false;
    par[t][u] = v;
    return true;
}

void DFS(int v, int p = 0){
    mark[v] = 1;
    par[1][v] = N;
    cnt = 0;
    for (int u : adj[v]){
        if (u == p){
            cnt ++;
            continue;
        }
        if (mark[u])
            par[1][v] = min(par[1][v], par[0][u]);
        else{
            par[0][u] = par[0][v] + 1;
            DFS(u, v);
            par[1][v] = min(par[1][v], par[1][u]);
        }
    }
    if (p && cnt == 1 && par[0][p] < par[1][v])
        cout << p << ' ' << v << '\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < N; i ++)
        par[0][i] = par[1][i] = i;
    for (int i = 0; i < m; i ++){
        int u, v;
        cin >> u >> v;
        if (merge(0, u, v)){
            adj[u].pb(v);
            adj[v].pb(u);
        }
        else if (merge(1, u, v)){
            adj[u].pb(v);
            adj[v].pb(u);
        }
    }
    memset(par, 0, sizeof par);
    for (int v = 1; v <= n; v ++)
        if (!mark[v])
            DFS(v);
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 3436 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 3948 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 9324 KB Output is correct
2 Incorrect 119 ms 4204 KB Wrong number of edges

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 8212 KB Output is correct
2 Incorrect 242 ms 13932 KB Wrong number of edges

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 15468 KB Output is correct
2 Incorrect 287 ms 11884 KB Wrong number of edges

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 11812 KB Output is correct
2 Incorrect 422 ms 12524 KB Wrong number of edges

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 713 ms 13548 KB Output is correct
2 Incorrect 654 ms 13080 KB Wrong number of edges

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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