Submission #992293
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
#define INF INT_MAX/3
#define MAX_N 1000
int n,m;
vector<int> g[222222];
int cnt=0;
bool vis[222222];
void dfs(int v){
if(v<n)cnt++;
vis[v]=true;
rep(i,g[v].size()){
if(!vis[g[v][i]])dfs(g[v][i]);
}
}
int main(){
cin.sync_with_stdio(false);
cin>>n>>m;
rep(i,n){
int k;
cin>>k;
rep(j,k){
int a;
cin>>a;
a--;
g[i].pb(a+n); g[a+n].pb(i);
}
}
memset(vis,0,sizeof(vis));
dfs(0);
if(cnt==n)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
yamad |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1219 Byte |
Status |
AC |
Exec Time |
41 ms |
Memory |
9472 KB |
Judge Result
Set Name |
sample |
dataset1 |
dataset2 |
Score / Max Score |
0 / 0 |
200 / 200 |
200 / 200 |
Status |
|
|
|
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 |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
8 ms |
5632 KB |
01-02.txt |
AC |
8 ms |
5760 KB |
01-03.txt |
AC |
8 ms |
5760 KB |
01-04.txt |
AC |
8 ms |
5760 KB |
01-05.txt |
AC |
8 ms |
5760 KB |
01-06.txt |
AC |
8 ms |
5760 KB |
01-07.txt |
AC |
8 ms |
5760 KB |
01-08.txt |
AC |
8 ms |
5760 KB |
01-09.txt |
AC |
8 ms |
5760 KB |
01-10.txt |
AC |
8 ms |
5760 KB |
02-01.txt |
AC |
32 ms |
8704 KB |
02-02.txt |
AC |
33 ms |
9344 KB |
02-03.txt |
AC |
33 ms |
8576 KB |
02-04.txt |
AC |
41 ms |
8960 KB |
02-05.txt |
AC |
38 ms |
9472 KB |
02-06.txt |
AC |
40 ms |
8832 KB |
02-07.txt |
AC |
37 ms |
9216 KB |
02-08.txt |
AC |
28 ms |
9208 KB |
02-09.txt |
AC |
32 ms |
9208 KB |
02-10.txt |
AC |
28 ms |
9208 KB |
02-11.txt |
AC |
28 ms |
9208 KB |
02-12.txt |
AC |
29 ms |
9088 KB |
02-13.txt |
AC |
30 ms |
9088 KB |
sample-01.txt |
AC |
8 ms |
5632 KB |
sample-02.txt |
AC |
8 ms |
5632 KB |