oj.uz

Submission #540698

# Submission time Handle Problem Language Result Execution time Memory
540698 2022-03-21T12:37:29 Z Vladth11 Pipes (CEOI15_pipes) C++14
100 / 100
 1059 ms 14108 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <long double, pii> muchie;

const ll NMAX = 100001;
const ll VMAX = 1000001;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 1000000;
const ll nr_of_bits = 16;

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 7 ms 3156 KB Output is correct
2 Correct 7 ms 2940 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 2960 KB Output is correct
2 Correct 85 ms 2824 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 3772 KB Output is correct
2 Correct 190 ms 3240 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 5352 KB Output is correct
2 Correct 247 ms 4928 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 397 ms 10768 KB Output is correct
2 Correct 358 ms 6932 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 577 ms 11880 KB Output is correct
2 Correct 516 ms 8956 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 769 ms 14108 KB Output is correct
2 Correct 687 ms 8780 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 918 ms 14092 KB Output is correct
2 Correct 831 ms 8752 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1059 ms 13704 KB Output is correct
2 Correct 981 ms 10440 KB Output is correct