oj.uz

Submission #442000

# Submission time Handle Problem Language Result Execution time Memory
442000 2021-07-06T17:16:49 Z JovanB Pipes (CEOI15_pipes) C++17
90 / 100
 2871 ms 27952 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
 
const int BLOCK = 32000;
const int MAXN = 100000;
 
vector <pair <int, tuple <int, int, int>>> graf[MAXN+5];
vector <pair <int, tuple <int, int, int>>> ngraf[MAXN+5];
bool visited[MAXN+5];
int in[MAXN+5];
int up[MAXN+5];
int gde[MAXN+5];
int ide[MAXN+5];
 
int tjm;
 
void dfs_bridges(int v, int gr){
    visited[v] = 1;
    in[v] = ++tjm;
    up[v] = in[v];
    for(auto c : graf[v]){
        if(visited[c.first]){
            if(get<2>(c.second) == gr) continue;
            up[v] = min(up[v], up[c.first]);
        }
        else{
            dfs_bridges(c.first, get<2>(c.second));
            up[v] = min(up[v], up[c.first]);
        }
    }
}
 
void dfs_connect(int v, tuple <int, int, int> p, int lst){
    int sd = lst;
    visited[v] = 1;
    ide[v] = v;
    if(up[v] >= in[v]){
        if(lst){
            ngraf[v].push_back({lst, p});
            swap(get<0>(p), get<1>(p));
            ngraf[lst].push_back({v, p});
        }
        sd = v;
    }
    else ide[v] = gde[lst];
    for(auto c : graf[v]){
        if(!visited[c.first]) dfs_connect(c.first, c.second, sd);
    }
}
 
int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;
 
    int n, m;
    cin >> n >> m;
    for(int i=1; i<=n; i++){
        gde[i] = i;
    }
    int svih = 0;
    while(m > 0){
        for(int i=1; i<=min(m, BLOCK); i++){
            int a, b;
            cin >> a >> b;
            ++svih;
            graf[gde[a]].push_back({gde[b], {a, b, svih}});
            graf[gde[b]].push_back({gde[a], {b, a, svih}});
        }
        tjm = 0;
        for(int i=1; i<=n; i++) visited[i] = 0;
        for(int i=1; i<=n; i++) ngraf[i].clear();
        for(int i=1; i<=n; i++){
            if(!visited[gde[i]]) dfs_bridges(gde[i], 0);
        }
        for(int i=1; i<=n; i++) visited[i] = 0;
        for(int i=1; i<=n; i++){
            if(!visited[gde[i]]) dfs_connect(gde[i], {0, 0, 0}, 0);
        }
        for(int i=1; i<=n; i++){
            gde[i] = ide[gde[i]];
            vector <pair <int, tuple <int, int, int>>>().swap(graf[i]);
            for(auto c : ngraf[i]) graf[i].push_back(c);
            vector <pair <int, tuple <int, int, int>>>().swap(ngraf[i]);
        }
        m -= BLOCK;
    }
    for(int i=1; i<=n; i++){
        for(auto c : graf[i]) if(get<0>(c.second) < get<1>(c.second)) cout << get<0>(c.second) << " " << get<1>(c.second) << "\n";
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5964 KB Output is correct
2 Correct 8 ms 5708 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 8536 KB Output is correct
2 Correct 155 ms 8168 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 9060 KB Output is correct
2 Correct 277 ms 7856 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 9588 KB Output is correct
2 Correct 410 ms 9944 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 572 ms 14084 KB Output is correct
2 Correct 585 ms 12540 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 869 ms 14464 KB Output is correct
2 Correct 1367 ms 13124 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1222 ms 15992 KB Output is correct
2 Correct 1178 ms 15136 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1516 ms 15948 KB Output is correct
2 Correct 1407 ms 15440 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1692 ms 15432 KB Output is correct
2 Runtime error 2871 ms 27952 KB Memory limit exceeded