oj.uz

답안 #669430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
669430 2022-12-06T12:07:58 Z hamidh100 Pipes (CEOI15_pipes) C++17
100 / 100
 1027 ms 15144 KB 
/* In the name of God */

#include <iostream>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <map>
#include <numeric>
#include <limits>
#include <limits.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef map<int, int> MPII;
typedef vector<int> VI;
typedef vector<ll> VL;
#define PB push_back
#define POP pop_back
#define MP make_pair
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort(all(a))
#define REVERSE(a) reverse(all(a))
#define sep ' '
#define endl '\n'
#define dbg(x) cerr << '[' << #x << ": " << x << "]\n"
#define dbg2(x, y) cerr << '[' << #x << ": " << x << ", " << #y << ": " << y << "]\n"
#define Yes cout << "Yes\n"
#define YES cout << "YES\n"
#define No cout << "No\n"
#define NO cout << "NO\n"
#define OK cout << "OK\n"

const ll INF = (ll)8e18 + 1386;
const ld eps = 0.000000000000001;
const int MOD = 1e9 + 7;

inline int mod_add(int a, int b){ int res = a + b; return (res >= MOD? res - MOD : res); }
inline int mod_neg(int a, int b){ int res = (abs(a - b) < MOD? a - b : (a - b) % MOD); return (res < 0? res + MOD : res); }
inline int mod_mlt(int a, int b){ return (1ll * a * b % MOD); }
inline string intToString(ll a){ char x[100]; sprintf(x, "%lld", a); string s = x; return s; }
inline ll stringToInt(string s){ ll res; char x[100]; strcpy(x, s.c_str()); sscanf(x, "%lld", &res); return res; }
inline void fileIO(string i, string o){ freopen(i.c_str(), "r", stdin); freopen(o.c_str(), "w", stdout); }

const int MAXN = 1e5 + 1;

int n, m, par[MAXN], par2[MAXN], st[MAXN], minb[MAXN], timer;
VI N[MAXN];
bitset<MAXN> mark;
// set<PII> cnt;
// map<PII, int> cnt;

int getpar(int v, bool which = 1){
    return ((which? par : par2)[v] == v ? v : (which? par : par2)[v] = getpar((which? par : par2)[v], which));
}

void dfs(int v, int lst = 0){
    mark[v] = 1;
    st[v] = minb[v] = timer++;
    for (int u : N[v]){
        if (!mark[u]){
            dfs(u, v);
            minb[v] = min(minb[v], minb[u]);
            auto it = lower_bound(N[u].begin(), N[u].end(), v);
            if (it != N[u].end()) it++;
            if (v == *it) continue;
            if (minb[u] > st[v]) cout << u << sep << v << endl;
        } else if (u != lst){
            minb[v] = min(minb[v], st[u]);
        }
    }
}

void merge(int u, int v){
    int p1 = getpar(u), p2 = getpar(v);
    if (p1 == p2){
        p1 = getpar(u, 0), p2 = getpar(v, 0);
        if (p1 != p2){
            // cnt[MP(min(u, v), max(u, v))]++;
            // if (cnt.count(MP(min(u, v), max(u, v)))) cnt.erase(MP(min(u, v), max(u, v)));
            // else cnt.insert(MP(min(u, v), max(u, v)));
            N[u].PB(v), N[v].PB(u);
            par2[p1] = p2;
        }
    } else {
        // cnt[MP(min(u, v), max(u, v))]++;
        // if (cnt.count(MP(min(u, v), max(u, v)))) cnt.erase(MP(min(u, v), max(u, v)));
        // else cnt.insert(MP(min(u, v), max(u, v)));
        N[u].PB(v), N[v].PB(u);
        par[p1] = p2;
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    iota(par, par + MAXN, 0);
    iota(par2, par2 + MAXN, 0);
    cin >> n >> m;
    for (int i = 0; i < m; i++){
        int x, y;
        cin >> x >> y;
        merge(x, y);
    }
    for (int i = 1; i <= n; i++) SORT(N[i]);
    for (int i = 1; i <= n; i++){
        if (!mark[i]){
            dfs(i);
        }
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3924 KB Output is correct
2 Correct 7 ms 3668 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 3728 KB Output is correct
2 Correct 83 ms 3660 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 4476 KB Output is correct
2 Correct 168 ms 3956 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 6192 KB Output is correct
2 Correct 216 ms 5676 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 396 ms 11648 KB Output is correct
2 Correct 294 ms 7500 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 564 ms 12848 KB Output is correct
2 Correct 483 ms 9632 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 681 ms 15144 KB Output is correct
2 Correct 658 ms 9388 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 827 ms 15136 KB Output is correct
2 Correct 820 ms 9384 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1027 ms 14540 KB Output is correct
2 Correct 912 ms 11236 KB Output is correct