Submission #876888

#	Time	Username	Problem	Language	Result	Execution time	Memory
876888		hyakup	Pipes (CEOI15_pipes)	C++17	0 / 100	2598 ms	7612 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 ), tempo( maxn, -1 );
vector<pair< int, int >> edge( maxn, pair< int, int>( -1, -1 ) );
int _a, _b;

int find( int& a ){ return (( a == pai[a] ) ? a : find(pai[a]) ); }
bool query( int& a, int& b ){
     v.clear();
     while( (pai[a] != a || pai[b] != b) && a != b ){
          if( tempo[a] > tempo[b] ){
               if( edge[a] != make_pair( -1, -1 ) ) v.push_back(a);
               a = pai[a];
          }
          else{
               if( edge[b] != make_pair( -1, -1 ) ) v.push_back(b);
               b = pai[b];
          }
     }
     return ( a == b );
}

void join( int& a, int& b, int& t ){
     _a = find(a);
     _b = find(b);
     if( tam[_a] < tam[_b] ) swap( _a, _b );
     tam[_a] += tam[_b];
     pai[_b] = _a;
     tempo[_b] = t + 10;
     edge[_b] = make_pair(a, b);
}

int main(){
     int n, m; cin >> n >> m;
     for( int i = 1; i <= n; i++ ) pai[i] = i;
     int a, b;
     while( m-- ){
          cin >> a >> b;
          if( !query( a, b ) ) join( a, b, m );
          else for( int x : v ) edge[x] = make_pair( -1, -1 );
     }
     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