Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- using ll = long long;
- constexpr int N = 1e6 + 5;
- constexpr ll Inf = 1e17;
- int n, m;
- vector<int> adj[N];
- int a[N];
- void Read()
- {
- cin >> n >> m;
- for (int i = 1; i <= m; ++i)
- {
- int u, v;
- cin >> u >> v;
- if (u < v)
- swap(u, v);
- adj[u].emplace_back(v);
- }
- }
- void Solve()
- {
- for (int i = 1; i <= n; ++i)
- {
- vector<int> b;
- for (auto j : adj[i])
- b.emplace_back(a[j]);
- sort(b.begin(), b.end());
- b.resize(unique(b.begin(), b.end()) - b.begin());
- a[i] = b.size();
- for (int j = 0; j < (int)b.size(); ++j)
- if (b[j] != j)
- {
- a[i] = j;
- break;
- }
- cout << a[i] << " ";
- }
- }
- int32_t main()
- {
- ios::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- Read();
- Solve();
- }
Advertisement
Add Comment
Please, Sign In to add comment