Submission #1678174

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>

#define INF (int)1e09

using std::cin;
using std::cout;
using std::endl;
using std::setprecision;
using std::fixed;
using std::pair;
using std::make_pair;
using std::min;
using std::max;
using std::string;
using std::vector;
using std::list;
using std::map;
using std::set; // insert erase find count
using std::queue;
using std::priority_queue;
using std::stack;

template <typename T> using Vec = vector<T>; // c++11
typedef pair<int, int> PII;
typedef pair<int, pair<int, int> > PIII;

int main(void) {
    int n;
    int m;
    cin >> n >> m;
    Vec<Vec<int> > pers(n);
    Vec<Vec<int> > lang(m);
    for (int i = 0; i < n; i++) {
        int times;
        cin >> times;
        for (int j = 0; j < times; j++) {
            int l;
            cin >> l;
            l--;
            pers[i].push_back(l);
            lang[l].push_back(i);
        }
    }

    Vec<bool> check(n, false);
    int init = lang[0].size();
    for (int i = 0; i < init; i++) {
        check[lang[0][i]] = true;
    }

    while (1) {
        bool change = false;
        for (int i = 1; i < m; i++) {
            if (lang[i].size() == 0) {
                continue;
            }

            int len = lang[i].size();
            bool exist = false;
            for (int j = 0; j < len; j++) {
                if (check[lang[i][j]] == true) {
                    exist = true;
                }
            }
            if (exist == true) {
                for (int j = 0; j < len; j++) {
                    if (check[lang[i][j]] == false) {
                        cout << i << " " << j << endl;
                        cout << lang[i][j] << endl;
                        check[lang[i][j]] = true;
                        change = true;
                    }
                }
            } 
        }
        if (change == false) {
            break;
        }
    }
    bool ans = true;
    for (int i = 0; i < n; i++) {
        if (check[i] == false) {
            ans = false;
            break;
        }
    }
    if (ans == true) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }


    return 0;
}

Submission Info

Judge Result