oj.uz

Submission #527093

# Submission time Handle Problem Language Result Execution time Memory
527093 2022-02-17T01:48:03 Z chicken337 Pipes (CEOI15_pipes) C++17
0 / 100
 967 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;

int v, e, ID = 0;
int num[MAXN], low[MAXN];
int p[2][MAXN], r[2][MAXN];
vector<int> adj[MAXN];

int root(int id, int x){
    if(p[id][x] == x) return x;
    return p[id][x] = root(id, p[id][x]);
}
void connect(int id, int x, int y){
    x = root(id, x), y = root(id, y);
    if(r[id][x] > r[id][y]) swap(x, y);
    p[id][x] = y; r[id][y] ++;
}
bool connected(int id, int x, int y){
    x = root(id, x), y = root(id, y);
    return x == y;
}

void dfs(int x, int par){
    num[x] = low[x] = ID ++;
    int children = 0;
    for(int nxt : adj[x]){
        if(num[nxt] == -1){
            children ++; dfs(nxt, x);
            low[x] = min(low[x], low[nxt]);
            if(low[nxt] > num[x])
                cout << x+1 << ' ' << nxt+1 << '\n';
        } else if(nxt != par){
            low[x] = min(low[x], num[nxt]);
        }
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> v >> e;
    for(int i = 0; i < v; i ++)
        p[0][i] = p[1][i] = i,
        r[0][i] = r[1][i] = 0,
        num[i] = low[i] = -1;
    for(int i = 0; i < e; i ++){
        int a, b; cin >> a >> b;
        if(!connected(0, a-1, b-1)){
            adj[a-1].push_back(b-1);
            adj[b-1].push_back(a-1);
            connect(0, a-1, b-1);
        } else if(!connected(1, a-1, b-1)){
            adj[a-1].push_back(b-1);
            adj[b-1].push_back(a-1);
            connect(1, a-1, b-1);
        }
    }
    for(int i = 0; i < v; i ++)
        if(num[i] == -1)
            dfs(i, -1);
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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