oj.uz

Submission #382545

# Submission time Handle Problem Language Result Execution time Memory
382545 2021-03-27T16:07:43 Z Mahdi_Shokoufi Pipes (CEOI15_pipes) C++17
90 / 100
 1416 ms 23288 KB 
//In the name of Allah
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define X first
#define Y second

typedef pair < int , int > pii;

const int N = 1e5 + 10;

int par[2][N];
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;
    int 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
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3948 KB Output is correct
2 Correct 7 ms 3692 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 9452 KB Output is correct
2 Correct 113 ms 4076 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 9324 KB Output is correct
2 Correct 240 ms 8812 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 10988 KB Output is correct
2 Correct 294 ms 7720 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 10860 KB Output is correct
2 Correct 463 ms 9836 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 741 ms 12984 KB Output is correct
2 Correct 723 ms 12396 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 976 ms 15552 KB Output is correct
2 Correct 937 ms 12860 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1206 ms 15524 KB Output is correct
2 Correct 1223 ms 14224 KB Output is correct

Subtask #10
0 / 10.0

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