-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathBuilding Teams.cpp
64 lines (54 loc) · 1.15 KB
/
Building Teams.cpp
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
#include<bits/stdc++.h>
using namespace std;
#define INF 2047483647
#define INFL 9223372036854775807
#define ll long long
#define pii pair<ll,ll>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ull unsigned long long
#define M 1000000007
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define take(x) scanf("%d",&x)
#define DE(x) printf("\ndebug %d\n",x);
#define vout(x) for(int i=0;i<x.size();i++) printf("%d ",x[i]);
#define pie acos(-1)
#define MOD 998244353
const int N = 1e5+5;
vector<int>adj[N];
int vis[N];
int parent[N];
void printAnswer(int u){
}
void dfs(int u){
vis[u] = 1;
for(auto v:adj[u]){
if( vis[v] == 0 ){
parent[v] = u;
dfs(v);
}else if(vis[v] == 1 and v!=parent[u]){
}
}
}
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
a--;b--;
adj[a].pb(b);
adj[b].pb(a);
}
for(int i=0;i<n;i++){
if( vis[i] == 0 ){
color[i] = 1;
dfs(i);
}
}
for(int i=0;i<n;i++){
cout<<color[i]<<" ";
}
}