#include <bits/stdc++.h> using namespace std; struct City { City( int i=0, int n=0 ) : index(i) , n(n) {} int index; int n; bool operator< ( const City & c ) const { if ( n != c.n ) return n < c.n; return index < c.index; } }; void solve( int minD, vector<vector<int> > & connections, vector<int> & cities, vector<int> & connQuantity ) { set<City> cityQueue; for ( int i : cities ) { if ( connections[i].size() ) cityQueue.insert(City(i, connections[i].size())); } while( !cityQueue.empty( ) && cityQueue.begin( )->n < minD ) { const City c = *cityQueue.begin( ); cityQueue.erase( cityQueue.begin( ) ); connQuantity[c.index] = -1; int toRemove = c.index; for (int i = 0; i < connections[toRemove].size(); ++i) { int neighbour = connections[toRemove][i]; if (connQuantity[neighbour] == -1) continue; City newC(neighbour, connQuantity[neighbour]); auto neib = cityQueue.find(newC); cityQueue.erase(neib); connQuantity[neighbour] -= 1; newC.n -= 1; cityQueue.insert(newC); } continue; } for( int i=0; i<cities.size( ); ) { if ( connQuantity[ cities[i] ] < minD ) { swap(cities[i], cities.back()); cities.pop_back( ); } else { ++i; } } } int main() { ios::sync_with_stdio(0); int cityQ, connectionsQ, minD; cin >> cityQ >> connectionsQ >> minD; vector<vector<int> > connections( cityQ ); vector<int> connQuantity( cityQ ); for ( int i=0; i<connectionsQ; ++i ) { int from, to; cin >> from >> to; --from; --to; connections[from].push_back(to); connections[to].push_back(from); connQuantity[from] += 1; connQuantity[to] += 1; } vector<int> used( cityQ, 0 ); vector<vector<int> > islands; vector<int> toAnalize; for ( int i=0; i<cityQ; ++i ) { if ( used[i] ) continue; used[i] = 1; islands.push_back( vector<int>( 1, i ) ); toAnalize.clear( ); toAnalize.push_back( i ); for( int a=0; a<toAnalize.size( ); ++a ) { int ta = toAnalize[a]; vector<int> & conn = connections[ta]; for ( int c=0; c<conn.size( ); ++c ) { int n = conn[c]; if ( used[n] ) continue; used[n] = 1; islands.back( ).push_back(n); toAnalize.push_back(n); } } } int bestIsland = -1; int bestValue = 0; for ( int i=0; i<islands.size( ); ++i ) { solve( minD, connections, islands[i], connQuantity ); if ( islands[i].size( ) > bestValue ) { bestValue = islands[i].size( ); bestIsland = i; } } if ( bestIsland != -1 ) { printf( "%d\n", (int)islands[bestIsland].size( ) ); sort( islands[bestIsland].begin( ), islands[bestIsland].end( ) ); for ( int i : islands[bestIsland] ) printf( "%d ", i+1 ); putchar( '\n' ); } else { printf( "NIE\n" ); } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 | #include <bits/stdc++.h> using namespace std; struct City { City( int i=0, int n=0 ) : index(i) , n(n) {} int index; int n; bool operator< ( const City & c ) const { if ( n != c.n ) return n < c.n; return index < c.index; } }; void solve( int minD, vector<vector<int> > & connections, vector<int> & cities, vector<int> & connQuantity ) { set<City> cityQueue; for ( int i : cities ) { if ( connections[i].size() ) cityQueue.insert(City(i, connections[i].size())); } while( !cityQueue.empty( ) && cityQueue.begin( )->n < minD ) { const City c = *cityQueue.begin( ); cityQueue.erase( cityQueue.begin( ) ); connQuantity[c.index] = -1; int toRemove = c.index; for (int i = 0; i < connections[toRemove].size(); ++i) { int neighbour = connections[toRemove][i]; if (connQuantity[neighbour] == -1) continue; City newC(neighbour, connQuantity[neighbour]); auto neib = cityQueue.find(newC); cityQueue.erase(neib); connQuantity[neighbour] -= 1; newC.n -= 1; cityQueue.insert(newC); } continue; } for( int i=0; i<cities.size( ); ) { if ( connQuantity[ cities[i] ] < minD ) { swap(cities[i], cities.back()); cities.pop_back( ); } else { ++i; } } } int main() { ios::sync_with_stdio(0); int cityQ, connectionsQ, minD; cin >> cityQ >> connectionsQ >> minD; vector<vector<int> > connections( cityQ ); vector<int> connQuantity( cityQ ); for ( int i=0; i<connectionsQ; ++i ) { int from, to; cin >> from >> to; --from; --to; connections[from].push_back(to); connections[to].push_back(from); connQuantity[from] += 1; connQuantity[to] += 1; } vector<int> used( cityQ, 0 ); vector<vector<int> > islands; vector<int> toAnalize; for ( int i=0; i<cityQ; ++i ) { if ( used[i] ) continue; used[i] = 1; islands.push_back( vector<int>( 1, i ) ); toAnalize.clear( ); toAnalize.push_back( i ); for( int a=0; a<toAnalize.size( ); ++a ) { int ta = toAnalize[a]; vector<int> & conn = connections[ta]; for ( int c=0; c<conn.size( ); ++c ) { int n = conn[c]; if ( used[n] ) continue; used[n] = 1; islands.back( ).push_back(n); toAnalize.push_back(n); } } } int bestIsland = -1; int bestValue = 0; for ( int i=0; i<islands.size( ); ++i ) { solve( minD, connections, islands[i], connQuantity ); if ( islands[i].size( ) > bestValue ) { bestValue = islands[i].size( ); bestIsland = i; } } if ( bestIsland != -1 ) { printf( "%d\n", (int)islands[bestIsland].size( ) ); sort( islands[bestIsland].begin( ), islands[bestIsland].end( ) ); for ( int i : islands[bestIsland] ) printf( "%d ", i+1 ); putchar( '\n' ); } else { printf( "NIE\n" ); } return 0; } |