結果
| 問題 | No.2563 色ごとのグループ |
| ユーザー |
👑  AngrySadEight
|
| 提出日時 | 2023-12-01 15:21:35 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 404 ms / 2,000 ms |
| コード長 | 4,381 bytes |
| コンパイル時間 | 20,123 ms |
| コンパイル使用メモリ | 270,384 KB |
| 最終ジャッジ日時 | 2025-02-18 02:57:27 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 35 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}ll my_pow(ll x, ll n, ll mod) {// 繰り返し二乗法．x^nをmodで割った余り．ll ret;if (n == 0) {ret = 1;} else if (n % 2 == 1) {ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;} else {ret = my_pow((x * x) % mod, n / 2, mod);}return ret;}ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }int my_gcd(int a, int b) {int ret = 0;if (a < b) {swap(a, b);}if (b == 0) {ret = a;} else {ret = my_gcd(b, a % b);}return ret;}int main() {int N, M;cin >> N >> M;assert(1 <= N && N <= 200000);int min_m;if (N >= 1000) {min_m = 200000;} else {min_m = min(200000, N * (N - 1) / 2);}assert(0 <= M && M <= min_m);vector<int> C(N);for (int i = 0; i < N; i++) {cin >> C[i];assert(1 <= C[i] && C[i] <= N);}vector<int> u(M);vector<int> v(M);map<pii, int> mp;for (int i = 0; i < M; i++) {cin >> u[i] >> v[i];u[i]--;v[i]--;assert(u[i] != v[i]);assert(mp[pii(u[i], v[i])] == 0);mp[pii(u[i], v[i])]++;}dsu tree(N);for (int i = 0; i < M; i++) {if (C[u[i]] == C[v[i]]) {tree.merge(u[i], v[i]);}}vector<vector<ll>> color(N + 1, vector<ll>(0));for (int i = 0; i < N; i++) {color[C[i]].push_back(i);}int ans = 0;for (int i = 0; i <= N; i++) {int cols = 0;for (int j = 0; j < color[i].size(); j++) {if (tree.leader(color[i][j]) == color[i][j]) {cols++;}}if (cols >= 2) {ans += (cols - 1);}}cout << ans << endl;}