제출 #876865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
876865		hyakup	Pipes (CEOI15_pipes)	C++17	0 / 100	2780 ms	65536 KiB

pipes

#include <bits/stdc++.h>
using namespace std;
#define bug(x) cout << #x << " " << x << endl;

const int maxn = 1e5 + 10;

vector<int> v, pai( maxn ), tam( maxn, 1 );
vector<pair< int, int >> edge( maxn, pair< int, int>( -1, -1 ) );

int find( int a ){
     if( a == pai[a] ) return a;
     if( edge[a] != make_pair( -1, -1 ) ) v.push_back(a);
     return find(pai[a]);
}

void join( int a, int b ){
     v.clear();
     int _a = find(a);
     int _b = find(b);
     if( _a == _b ){
          for( int x : v ) edge[x] = make_pair( -1, -1 );
          return;
     }
     if( tam[_a] < tam[_b] ) swap( _a, _b );
     tam[_a] += tam[_b];
     pai[_b] = _a;
     edge[_b] = make_pair(a, b);
}

int main(){
     int n, m; cin >> n >> m;
     for( int i = 1;i <= n; i++ ) pai[i] = i;
     while( m-- ){
          int a, b; cin >> a >> b;
          join( a, b );
     }
     for( int i = 1; i <= n; i++ ){
          if( edge[i] != make_pair( -1, -1 ) ) cout << edge[i].first << " " << edge[i].second << endl;
     }
}

• 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