Submission #1176908


Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
 
using namespace std;
 
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
 
typedef vector<int> vi;
typedef pair<int,int> pii;
 
#define MAX_N 100000
 
int parent[MAX_N];
int ran[MAX_N];
 
void init(int n)
{
  int i;
  rep(i,n){
    parent[i]=i;
    ran[i]=0;
  }
}
int find(int x)
{
  if(parent[x]==x)
    return x;
  else
    return parent[x]=find(parent[x]);
}
 
void unite(int x,int y)
{
  x=find(x);
  y=find(y);
  if(x==y)return;
 
  if(ran[x]<ran[y])
    parent[x]=y;
  else{
    parent[y]=x;
    if(ran[x]==ran[y])ran[x]++;
  }
}
 
vi lan[100005];
 
int main()
{
  int i,j;
  int n,m;
  cin>>n>>m;
  //  vi lan(m);                                   
  rep(i,n){
    int k,l;
    cin>>k;
    rep(j,k){
      cin>>l;
      l--;//0indexed                               
      lan[l].push_back(i);//0indexed               
    }
  }
 
  init(n);
  rep(i,m){
    rep(j,lan[i].size())
      unite(lan[i][0],lan[i][j]);
  }
  bool ans=true;
  rep(i,n){
    if(find(parent[0])!=find(parent[i]))
      ans=false;
  }
  if(ans)cout<<"YES"<<endl;
  else cout<<"NO"<<endl;
}

Submission Info

Submission Time
Task C - Interpretation
User rika0384
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1629 Byte
Status AC
Exec Time 59 ms
Memory 4736 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 2 ms 2560 KB
01-02.txt AC 3 ms 2560 KB
01-03.txt AC 3 ms 2560 KB
01-04.txt AC 3 ms 2560 KB
01-05.txt AC 3 ms 2560 KB
01-06.txt AC 3 ms 2560 KB
01-07.txt AC 3 ms 2560 KB
01-08.txt AC 3 ms 2560 KB
01-09.txt AC 3 ms 2560 KB
01-10.txt AC 3 ms 2560 KB
02-01.txt AC 47 ms 4608 KB
02-02.txt AC 49 ms 3968 KB
02-03.txt AC 48 ms 4096 KB
02-04.txt AC 59 ms 4352 KB
02-05.txt AC 54 ms 3968 KB
02-06.txt AC 59 ms 4352 KB
02-07.txt AC 55 ms 4096 KB
02-08.txt AC 39 ms 3940 KB
02-09.txt AC 58 ms 3832 KB
02-10.txt AC 50 ms 4732 KB
02-11.txt AC 50 ms 4732 KB
02-12.txt AC 49 ms 4736 KB
02-13.txt AC 51 ms 4608 KB
sample-01.txt AC 2 ms 2560 KB
sample-02.txt AC 2 ms 2560 KB