Submission #1835285


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int N, M;
int K[100010];
vector<int> L[100010];
int lang[100010];
int par[100010];
int sz[100010];

int find(int x) {
  if (par[x] == x) return x;
  return par[x] = find(par[x]);
}

void unite(int x, int y) {
  x = find(x), y = find(y);
  if (x == y) return;
  par[y] = x;
  sz[x] += sz[y];
}

int main(void) {
  cin >> N >> M;
  for (int i = 0; i < N; i++) {
    cin >> K[i];
    for (int j = 0; j < K[i]; j++) {
      int l;
      cin >> l;
      L[i].push_back(l);
    }
  }

  for (int i = 0; i < N; i++) {
    par[i] = i;
    sz[i] = 1;
  }

  fill(lang, lang + 100010, -1);
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < K[i]; j++) {
      if (lang[L[i][j]] < 0) {
        lang[L[i][j]] = i;
      } else {
        unite(lang[L[i][j]], i);
      }
    }
  }
  cout << (sz[find(0)] == N ? "YES" : "NO") << endl;

  return 0;
}

Submission Info

Submission Time
Task C - Interpretation
User legosuke
Language C++14 (GCC 5.4.1)
Score 400
Code Size 940 Byte
Status AC
Exec Time 64 ms
Memory 7296 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 200 / 200
Status
AC × 2
AC × 12
AC × 27
Set Name Test Cases
sample sample-01.txt, sample-02.txt
dataset1 sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt
dataset2 sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 3 ms 2944 KB
01-02.txt AC 3 ms 2944 KB
01-03.txt AC 3 ms 3072 KB
01-04.txt AC 3 ms 3072 KB
01-05.txt AC 3 ms 3072 KB
01-06.txt AC 3 ms 3072 KB
01-07.txt AC 3 ms 3072 KB
01-08.txt AC 3 ms 3072 KB
01-09.txt AC 3 ms 3072 KB
01-10.txt AC 3 ms 3072 KB
02-01.txt AC 41 ms 3712 KB
02-02.txt AC 54 ms 7168 KB
02-03.txt AC 44 ms 3840 KB
02-04.txt AC 56 ms 5376 KB
02-05.txt AC 58 ms 6400 KB
02-06.txt AC 56 ms 5376 KB
02-07.txt AC 58 ms 6912 KB
02-08.txt AC 45 ms 7296 KB
02-09.txt AC 64 ms 7296 KB
02-10.txt AC 51 ms 5376 KB
02-11.txt AC 51 ms 5372 KB
02-12.txt AC 48 ms 5376 KB
02-13.txt AC 49 ms 5376 KB
sample-01.txt AC 3 ms 2944 KB
sample-02.txt AC 3 ms 2944 KB