Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- void dfs(int v, int& c, vector<int>& colors, vector<vector<int>>& g) {
- colors[v] = c;
- for (int i = 0; i < g[v].size(); ++i) {
- int to = g[v][i];
- if (colors[to] == 0) {
- dfs(to, c, colors, g);
- }
- }
- }
- int main() {
- int n, m;
- cin >> n >> m;
- vector<vector<int>> g(n);
- vector<int> colors(n, 0);
- for (int i = 0; i < m; ++i) {
- int a, b;
- cin >> a >> b;
- --a, --b;
- g[a].push_back(b);
- g[b].push_back(a);
- }
- int c = 0;
- for (int i = 0; i < n; ++i) {
- if (colors[i] == 0) {
- dfs(i, ++c, colors, g);
- }
- }
- cout << c << endl;
- for (auto x : colors) cout << x << " ";
- }
Add Comment
Please, Sign In to add comment