oj.uz

Submission #540696

# Submission time Handle Problem Language Result Execution time Memory
540696 2022-03-21T12:36:16 Z Vladth11 Pipes (CEOI15_pipes) C++14
100 / 100
 1069 ms 14112 KB 
#include <bits/stdc++.h>

using namespace std;

const int NMAX = 100001;

vector <int> v[NMAX];
int root;
int lvl[NMAX];
int parent[NMAX];
int parentB[NMAX];

int findR(int a){
    if(parent[a] == a)
        return a;
    return parent[a] = findR(parent[a]);
}

int findRB(int a){
    if(parentB[a] == a)
        return a;
    return parentB[a] = findRB(parentB[a]);
}

void unite(int a, int b){
    a = findR(a);
    b = findR(b);
    parent[a] = b;
}

void uniteB(int a, int b){
    a = findRB(a);
    b = findRB(b);
    parentB[a] = b;
}

map <int, int> dp;

void DFS(int node, int p){
    lvl[node] = lvl[p] + 1;
    for(auto x : v[node]){
        if(lvl[x] == 0){
            DFS(x, node);
        }else if(lvl[x] > lvl[node]){
            dp[node]--;
        }else{
            dp[node]++;
        }
    }
    if(node != root){
        dp[node]--;
    }
    dp[p] += dp[node];
    if(dp[node] == 0 && node != root){
        cout << node << " " << p << "\n";
    }
  dp.erase(node);

}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m, i;
    cin >> n >> m;
    for(i = 1; i <= n; i++){
        parent[i] = i;
        parentB[i] = i;
    }
    for(i = 1; i <= m; i++){
        int a, b;
        cin >> a >> b;
        if(findR(a) != findR(b)){
            v[a].push_back(b);
            v[b].push_back(a);
            unite(a, b);
        }else if(findRB(a) != findRB(b)){
            v[a].push_back(b);
            v[b].push_back(a);
            uniteB(a, b);
        }
    }
    for(i = 1; i <= n; i++){
        if(!lvl[i]){
            root = i;
            DFS(root, 0);
        }
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3156 KB Output is correct
2 Correct 8 ms 3028 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 2972 KB Output is correct
2 Correct 82 ms 2820 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 3764 KB Output is correct
2 Correct 185 ms 3244 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 5344 KB Output is correct
2 Correct 232 ms 4980 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 396 ms 10764 KB Output is correct
2 Correct 334 ms 7000 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 579 ms 12040 KB Output is correct
2 Correct 506 ms 8776 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 767 ms 14092 KB Output is correct
2 Correct 691 ms 8740 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 14112 KB Output is correct
2 Correct 826 ms 8756 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1069 ms 13584 KB Output is correct
2 Correct 966 ms 10468 KB Output is correct