제출 #271417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
271417		MarcoMeijer	Pipes (CEOI15_pipes)	C++14	0 / 100	2385 ms	65536 KiB

pipes

#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

//===================//
//  Added libraries  //
//===================//

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 1e5+10;
const int MX2 = 6e6+10;

int n, m;

int p[MX], r[MX], s[MX];
bitset<MX> visited;
bitset<MX2> usedE;
vi adj[MX];
void buildDSU(int N) {
    RE(i,N) p[i]=i, r[i]=1, s[i]=0;
}
int get(int i) {return i==p[i] ? i : p[i] = get(p[i]);}
bool isSameSet(int i, int j) {return get(i)==get(j);}
void unionSet(int i, int j) {
    i = p[i], j = p[j];
    if(r[i] > r[j]) {
        p[j] = i;
    } else {
        p[i] = j;
        if(r[i] == r[j]) r[j]++;
    }
}

int num[MX], low[MX], cnt=0;
void dfs(int u) {
    if(visited[u]) return;
    visited[u] = 1;
    num[u] = low[u] = cnt++;
    FOR(v,adj[u])
        dfs(v);
}
void dfs2(int u) {
    if(visited[u]) return;
    visited[u] = 1;
    FOR(v, adj[u]) {
        if(!visited[v]) {
            dfs2(v);
            if(low[v] > num[u]) {
                OUTLS(u+1, v+1);
            }
            low[u] = min(low[u], low[v]);
        }
    }
}

void program() {
    IN(n, m);
    buildDSU(n);
    usedE.reset();
    RE(i,m) {
        int u, v; IN(u, v); u--; v--;
        if(!isSameSet(u,v)) {
            unionSet(u, v);
            adj[u].pb(v);
            adj[v].pb(u);
            usedE[i] = 1;
        }
    }

    visited.reset();
    RE(i,n) dfs(i);

    cin.seekg(0);
    IN(n, m);
    RE(i,m) {
        int u, v; IN(u, v); u--; v--;
        if(!usedE[i]) {
            low[u] = min(low[u], num[v]);
            low[v] = min(low[v], num[u]);
        }
    }

    visited.reset();
    RE(i,n) dfs2(i);
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10