oj.uz

Submission #527141

# Submission time Handle Problem Language Result Execution time Memory
527141 2022-02-17T02:37:28 Z chicken337 Pipes (CEOI15_pipes) C++14
80 / 100
 974 ms 50780 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];
char 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;
    if(r[id][x] == r[id][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 ++;
    for(int nxt : adj[x]){
        if(num[nxt] == -1){
            dfs(nxt, x);
            if(num[x] < low[nxt])
                cout << x+1 << ' ' << nxt+1 << '\n';
            low[x] = min(low[x], low[nxt]);
        } else if(nxt != par){
            low[x] = min(low[x], num[nxt]);
        } else par = -1;
    }
}
 
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
 
    cin >> v >> e; int a, b;
    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 ++){
        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
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3276 KB Output is correct
2 Correct 4 ms 3068 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 3832 KB Output is correct
2 Correct 121 ms 3860 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 5604 KB Output is correct
2 Correct 229 ms 6596 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 8560 KB Output is correct
2 Correct 241 ms 6648 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 11876 KB Output is correct
2 Correct 333 ms 7484 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 13460 KB Output is correct
2 Correct 570 ms 9764 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 673 ms 15832 KB Output is correct
2 Runtime error 708 ms 50780 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 974 ms 15184 KB Output is correct
2 Correct 900 ms 13168 KB Output is correct