Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int n,m;
- int tplt[1005];
- vector<int> adj[1005];
- vector<int> part[1005];
- bool xuatphat[1005];
- bool chuaxet[1005];
- int cnt = 0, stt=0;
- vector<int> res;
- void init(){
- cin >> n >> m;
- memset(xuatphat,false,sizeof(xuatphat));
- memset(chuaxet,true,sizeof(chuaxet));
- for(int i = 1; i<=m; i++){
- int t1, t2; cin >> t1 >> t2;
- adj[t1].push_back(t2);
- adj[t2].push_back(t1);
- xuatphat[t1] = true;
- }
- }
- void DFS(int u){
- tplt[u] = stt;
- part[stt].push_back(u);
- chuaxet[u] = false;
- for(int x : adj[u]){
- if(chuaxet[x]){
- DFS(x);
- }
- }
- }
- void DemTPLT(){
- for(int i = 1; i<=n; i++){
- if(chuaxet[i]){
- stt++;
- DFS(i);
- }
- }
- }
- void solve(){
- for(int i = 1; i <= stt; i++){
- if(part[i].size()==1){
- cout << part[i][0] << " ";
- }else{
- int res = 0, adjres=0;
- for(auto it:part[i]){
- if(adjres < adj[it].size()){
- adjres = adj[it].size();
- res = it;
- }
- }
- cout << res << " ";
- }
- }
- }
- int main(){
- init();
- DemTPLT();
- solve();
- cout << "Lost Teach" << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement