#936196 (C++17) No.2563 色ごとのグループ

• 問題: No.2563 色ごとのグループ
• ユーザー: Shibaken28
• 提出日時: 2023-12-04 15:28:32
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 321 ms / 2,000 ms
• コード長: 4,668 bytes
• コンパイル時間: 1,989 ms
• コンパイル使用メモリ: 155,100 KB
• 実行使用メモリ: 26,788 KB
• 最終ジャッジ日時: 2023-12-04 15:28:39
• 合計ジャッジ時間: 6,004 ms
• ジャッジサーバーID （参考情報）: judge13 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,548 KB
testcase_01	AC	2 ms; 6,548 KB
testcase_02	AC	2 ms; 6,548 KB
testcase_03	AC	2 ms; 6,548 KB
testcase_04	AC	2 ms; 6,548 KB
testcase_05	AC	1 ms; 6,548 KB
testcase_06	AC	2 ms; 6,548 KB
testcase_07	AC	2 ms; 6,548 KB
testcase_08	AC	2 ms; 6,548 KB
testcase_09	AC	2 ms; 6,548 KB
testcase_10	AC	1 ms; 6,548 KB
testcase_11	AC	2 ms; 6,548 KB
testcase_12	AC	1 ms; 6,548 KB
testcase_13	AC	2 ms; 6,548 KB
testcase_14	AC	2 ms; 6,548 KB
testcase_15	AC	2 ms; 6,548 KB
testcase_16	AC	2 ms; 6,548 KB
testcase_17	AC	2 ms; 6,548 KB
testcase_18	AC	2 ms; 6,548 KB
testcase_19	AC	4 ms; 6,548 KB
testcase_20	AC	8 ms; 6,548 KB
testcase_21	AC	5 ms; 6,548 KB
testcase_22	AC	4 ms; 6,548 KB
testcase_23	AC	6 ms; 6,548 KB
testcase_24	AC	52 ms; 8,832 KB
testcase_25	AC	46 ms; 9,728 KB
testcase_26	AC	83 ms; 12,928 KB
testcase_27	AC	73 ms; 16,796 KB
testcase_28	AC	77 ms; 13,912 KB
testcase_29	AC	104 ms; 17,540 KB
testcase_30	AC	104 ms; 17,540 KB
testcase_31	AC	105 ms; 17,532 KB
testcase_32	AC	107 ms; 17,528 KB
testcase_33	AC	306 ms; 26,788 KB
testcase_34	AC	321 ms; 26,788 KB
testcase_35	AC	302 ms; 26,788 KB
testcase_36	AC	311 ms; 26,788 KB
testcase_37	AC	303 ms; 26,788 KB

ソースコード

#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>
#include <climits>
#include <cmath>
#include <functional>
#include <numeric>
#include <regex>
#include <array>
#include <fstream>
#include <sstream>

//#include<atcoder/modint>
//using namespace atcoder;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repl(i,l,r) for (int i = l; i < (int)(r); i++)
#define all(a) a.begin(),a.end()
#define Pii pair<int,int>
#define Pll pair<long,long>
#define INFi 1000000001
#define INFl 1000000000000000001
#define ll long long
using namespace std;



template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T> void printArray(vector<T>&A){
    for(T&a:A){
        cout<<a<<" ";
    }
    cout<<endl;
}
template<class T> void printArrayln(vector<T>&A){
    for(T&a:A){
        cout<<a<<endl;
    }
}


template<class T1,class T2> std::ostream &operator<<(std::ostream &out, const pair<T1,T2> &A){
    cout<<"{"<<A.first<<","<<A.second<<"}";
    return out;
}

template<class T1,class T2> std::ostream &operator<<(std::ostream &out, const map<T1,T2> &M){
    for(const auto&A:M){
        cout<<"{"<<A.first<<","<<A.second<<"}";
    }
    return out;
}

template<class T1> std::ostream &operator<<(std::ostream &out, const set<T1> &M){
    cout<<"{";
    for(const auto&A:M){
        cout<<A<<", ";
    }
    cout<<"}"<<endl;
    return out;
}


template<class T1> std::ostream &operator<<(std::ostream &out, const multiset<T1> &M){
    cout<<"{";
    for(const auto&A:M){
        cout<<A<<", ";
    }
    cout<<"}"<<endl;
    return out;
}

template<class T> std::ostream &operator<<(std::ostream &out, const vector<T> &A){
    for(const T &a:A){
        cout<<a<<" ";
    }
    return out;
}

void print() { cout << endl; }
 
template <typename Head, typename... Tail>
void print(Head H, Tail... T) {
  cout << H << " ";
  print(T...);
}


template<class T> std::istream &operator>>(std::istream &in,vector<T>&A){
    for(T&a:A){
        std::cin>>a;
    }
    return in;
}



struct UnionFind {
    vector<int> size, parents;
    UnionFind() {}
    UnionFind(int n) {  // make n trees.
        size.resize(n, 0);
        parents.resize(n, 0);
        for (int i = 0; i < n; i++) {
            makeTree(i);
        }
    }
    void makeTree(int x) {
        parents[x] = x;  // the parent of x is x
        size[x] = 1;
    }
    bool isSame(int x, int y) { return findRoot(x) == findRoot(y); }
    bool unite(int x, int y) {
        x = findRoot(x);
        y = findRoot(y);
        if (x == y) return false;
        if (size[x] > size[y]) {
            parents[y] = x;
            size[x] += size[y];
        } else {
            parents[x] = y;
            size[y] += size[x];
        }
        return true;
    }
    int findRoot(int x) {
        if (x != parents[x]) {
            parents[x] = findRoot(parents[x]);
        }
        return parents[x];
    }
    int treeSize(int x) { return size[findRoot(x)]; }
};




int main(void){
    std::cin.tie(0)->sync_with_stdio(0);
    int N,M;cin>>N>>M;
    vector<vector<int>> C(N);
    vector<int> D(N);
    rep(i,N){
        int c;cin>>c;c--;
        C[c].push_back(i);
        D[i]=c;
    }
    vector<vector<Pii>> E(N);
    rep(i,M){
        int u,v;cin>>u>>v;
        u--;v--;
        if(D[u]==D[v]){
            E[D[v]].push_back({u,v});
        }
    }
    int cnt  = 0;
    for(int i=0;i<N;i++){
        if(C[i].empty())continue;
        UnionFind uf(C[i].size());
        map<int,int> mp;
        int x=0;
        for(int c:C[i]){
            mp[c]=x++;
        }
        for(auto&[u,v]:E[i]){
            uf.unite(mp[u],mp[v]);
        }
        for(int j=0;j<C[i].size();j++){
            if(!uf.isSame(0,j)){
                cnt++;
                uf.unite(0,j);
            }
        }
    }
    cout<<cnt<<endl;
}