oj.uz

Submission #97598

# Submission time Handle Problem Language Result Execution time Memory
97598 2019-02-17T12:17:06 Z dalgerok Pipes (CEOI15_pipes) C++14
60 / 100
 1396 ms 20396 KB 
#include<bits/stdc++.h>
using namespace std;


const int N = 1e5 + 1;



int n, m;
int p[2][N];
int tin[N], fup[N], timer;
bitset < N > used;
vector < int > g[N], e[N];

int dsu_get(int x, int v){
    return p[x][v] == v ? v : p[x][v] = dsu_get(x, p[x][v]);
}

void dfs(int v, int pr = 0){
    tin[v] = fup[v] = ++timer;
    used[v] = true;
    for(int i = 0; i < (int)g[v].size(); i++){
        int to = g[v][i], ind = e[v][i];
        if(ind == pr){
            continue;
        }
        if(!used[to]){
            dfs(to, ind);
            if(fup[to] > tin[v]){
                cout << v << " " << to << "\n";
            }
            fup[v] = min(fup[v], fup[to]);
        }
        else{
            fup[v] = min(fup[v], tin[to]);
        }
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        p[0][i] = p[1][i] = i;
    }
    for(int i = 1; i <= m; i++){
        int x, y;
        cin >> x >> y;
        if(dsu_get(0, x) == dsu_get(0, y)){
            if(dsu_get(1, x) == dsu_get(1, y)){
                continue;
            }
            p[1][dsu_get(1, x)] = dsu_get(1, y);
        }
        else{
            p[0][dsu_get(0, x)] = dsu_get(0, y);
        }
        g[x].push_back(y);
        e[x].push_back(i);
        g[y].push_back(x);
        e[y].push_back(i);
    }
    for(int i = 1; i <= n; i++){
        if(!used[i]){
            dfs(i);
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 5760 KB Output is correct
2 Correct 10 ms 5504 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 5540 KB Output is correct
2 Correct 107 ms 5400 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 6584 KB Output is correct
2 Correct 194 ms 6008 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 8696 KB Output is correct
2 Correct 279 ms 8388 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 15892 KB Output is correct
2 Correct 483 ms 12372 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 753 ms 17424 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1010 ms 20384 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1163 ms 20396 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1396 ms 19564 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -