[c++] 1043번 거짓말 (유니온 파인드)

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<cstdbool>
#include<stack>
#include<vector>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 987654321
#define LINF 321321321321
#define MAX 1100
 
int parent[1001000];
int n,m;
 
int t;
int True[60];
vector<int> party[61];
void init() {
    for (int i = 1; i <= n; i++) {
        parent[i] = i;
    }
}
 
int Find(int s) {
 
    if (parent[s] == s)
        return s;
    return parent[s] = Find(parent[s]);
}
 
 
void Merge(int a, int b) {
 
    a = Find(a);
    b = Find(b);
 
    if (a < b) {
        parent[b] = a;
    }
    else
        parent[a] = b;
}
 
 
int main(void) {
    
    cin >> n >> m;
    init();
    cin >> t;
 
    for (int i = 0; i < t; i++) {
        cin >> True[i];
    }
    for (int i = 0; i < m; i++) {
        int cnt;
        cin >> cnt;
        int tmp;
        for (int j = 0; j < cnt; j++) {
            cin >> tmp;
            party[i].push_back(tmp);
            if (j >= 1) {
                Merge(party[i][j - 1], party[i][j]);
            }
        }
    }
    int answer = 0;
    for (int i = 0; i < m; i++) {
        int cnt = party[i].size();
        bool flag = true;
        for (int j = 0; j < cnt; j++) {
            int tmp = Find(party[i][j]);
            for (int i = 0; i < t; i++) {
                if (tmp == Find(True[i])) {
                    flag = false;
                    break;
                }
            }
            if (!flag)
                break;
        }
        if (flag)
            answer++;
    }
    cout << answer;
    return 0;
}
 
 

출처: https://www.acmicpc.net/problem/1043