結果

問題 No.2563 色ごとのグループ
ユーザー マベマス（mavemas_413）マベマス（mavemas_413）
提出日時 2023-11-26 16:38:46
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 193 ms / 2,000 ms
コード長 3,338 bytes
コンパイル時間 4,056 ms
コンパイル使用メモリ 231,432 KB
実行使用メモリ 13,464 KB
最終ジャッジ日時 2023-12-02 14:01:49
合計ジャッジ時間 7,606 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
11,928 KB
testcase_01 AC 6 ms
11,928 KB
testcase_02 AC 7 ms
11,928 KB
testcase_03 AC 6 ms
11,928 KB
testcase_04 AC 6 ms
11,928 KB
testcase_05 AC 6 ms
11,928 KB
testcase_06 AC 6 ms
11,928 KB
testcase_07 AC 7 ms
11,928 KB
testcase_08 AC 7 ms
11,928 KB
testcase_09 AC 6 ms
11,928 KB
testcase_10 AC 6 ms
11,928 KB
testcase_11 AC 6 ms
11,928 KB
testcase_12 AC 6 ms
11,928 KB
testcase_13 AC 6 ms
11,928 KB
testcase_14 AC 7 ms
11,928 KB
testcase_15 AC 7 ms
11,928 KB
testcase_16 AC 7 ms
11,928 KB
testcase_17 AC 7 ms
11,928 KB
testcase_18 AC 7 ms
11,928 KB
testcase_19 AC 9 ms
11,928 KB
testcase_20 AC 16 ms
12,056 KB
testcase_21 AC 12 ms
12,056 KB
testcase_22 AC 12 ms
11,928 KB
testcase_23 AC 16 ms
12,056 KB
testcase_24 AC 107 ms
12,568 KB
testcase_25 AC 87 ms
12,696 KB
testcase_26 AC 119 ms
12,952 KB
testcase_27 AC 97 ms
13,464 KB
testcase_28 AC 137 ms
13,080 KB
testcase_29 AC 183 ms
13,464 KB
testcase_30 AC 183 ms
13,464 KB
testcase_31 AC 184 ms
13,464 KB
testcase_32 AC 183 ms
13,464 KB
testcase_33 AC 191 ms
13,464 KB
testcase_34 AC 186 ms
13,464 KB
testcase_35 AC 186 ms
13,464 KB
testcase_36 AC 191 ms
13,464 KB
testcase_37 AC 193 ms
13,464 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
// long long
using ll = long long;
// unsigned long long 
using ull = unsigned long long;
// string 
using str = string;
// long double
using ld = long double;
// pair 
using pll = pair < ll, ll >;
// tuple
using tlll = tuple < ll, ll, ll >;
// vector
template < class T > using v = vector < T >;
using vl = v < ll >;
using vbl = v < bool >;
// priority_queue 
template < class T > using pq = priority_queue < T >;
template < class T > using pqg = priority_queue < T, v < T >, greater < T > >;
// unordered_set
template < class T > using uset = unordered_set < T > ;
// unordered_map
template < class T, class U > using umap = unordered_map < T, U > ;
// rep
#define rep(i, a, b) for(ll i = a; i <= b; i ++)
#define Rep(i, a) for(ll i = 0; i < a; i ++)
#define rrep(i, a, b) for(ll i = a; i >= b; i --)
#define repp(i, a, b, c) for(ll i = a; i <= b; i += c)
// binary search
#define lobo(x, k) lower_bound(x.begin(), x.end(), k) - x.begin()
#define Lobo(x, a, b, k) lower_bound(x + a, x + b + 1, k) - x
#define upbo(x, k) upper_bound(x.begin(), x.end(), k) - x.begin()
#define Upbo(x, a, b, k) upper_bound(x + a, x + b + 1, k) - x;
// snippet
#define eruni(x) x.erase(unique(x.begin(), x.end()), x.end())
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define rll(x) x.rbegin(), x.rend()
#define sz(x) (ll)x.size()
#define f first 
#define s second 
#define in insert
#define pf push_front
#define p_f pop_front
#define pb push_back
#define p_b pop_back
#define p_p prev_permutation
#define n_p next_permutation
#define led leader
#define print(a) printf("%.20Lf", a);
// function
template < class T > bool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}
template < class T > bool chmin(T &a, const T &b) {if (b < a) {a = b; return 1;} return 0;}
// out
void Yes(bool f = true) {cout << (f ? "Yes" : "No" ) << endl;}
void No(bool f = true) {cout << (f ? "No" : "Yes" ) << endl;}
void YES(bool f = true) {cout << (f ? "YES" : "NO" ) << endl;}
void NO(bool f = true) {cout << (f ? "NO" : "YES" ) << endl;}
template < class T > void out(T a) {cout << a << endl;}
template < class T > void out1(T a) {cout << a << " ";}
template < class T, class U > void out2(T a, U b) {cout << a << " " << b << endl;}
template < class T> void allout(T &a) {
   for(auto x : a) cout << x << " ";
   cout << endl;
}
template < class T > void allout1(T &a) {
   for(auto x : a) cout << x << endl;
}

// modint
using modi = modint998244353;
using mint = modint1000000007;
// constant
const ll md = 998244353;
const ll mo = 1000000007;
const ld pi = acos(-1);
const ll inf = (1LL << 60);
// grid
const pll ar1[4] = { {0, 0}, {1, 0}, {0, 1}, {1, 1} };
const pll ar2[4] = { {-1, 0}, {0, -1}, {1, 0}, {0, 1} };
const pll ar3[8] = { {-1, 0}, {0, -1}, {1, 0}, {0, 1}, {-1, 1}, {1, -1}, {1, 1}, {-1, -1} };

int main(){
  ll n, m, C[200009], ans = 0;
  vl G[200009], cnt(200009, 0), A(200009, 0);
  dsu uf(200009);
  cin >> n >> m;
  rep(i, 1, n){
    cin >> C[i];
    cnt[C[i]] ++;
  }
  Rep(i, m){
    ll a, b;
    cin >> a >> b;
    if(C[a] == C[b] && !uf.same(a, b)){
      uf.merge(a, b);
      A[C[a]] ++;
    }
  }
  rep(i,1, 200008){
    if(cnt[i] > 1) ans += cnt[i] - 1 - A[i];
  }
  out(ans);
}
0