Submission #992655


Source Code Expand

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <vector>
#include <memory.h>
using namespace std;

const int maxn = 1e5 + 10;
vector<int> G[maxn];
bool vis[maxn];
void dfs(int u, int& cnt)
{
	cnt++;
	vis[u] = 1;
	for(int i=0; i<(int)G[u].size(); i++)
	{
		if(!vis[G[u][i]]) dfs(G[u][i], cnt);
	}
}

int main()
{
	int n, m, k;
	while(cin>>n>>m)
	{
		vector<vector<int> > l(m+1);
		for(int i=1; i<=n; i++) G[i].clear();
		memset(vis, 0, sizeof(vis));
		for(int i=1; i<=n; i++)
		{
			scanf("%d", &k);
			while(k--)
			{
				int x;
				scanf("%d", &x);
				l[x].push_back(i);
			}
		}
		for(int i=1; i<=m; i++)
		{
			for(int j=1; j<(int)l[i].size(); j++)
			{
				G[l[i][j]].push_back(l[i][j-1]);
				G[l[i][j-1]].push_back(l[i][j]);
			}
		}
		int cnt = 0;
		dfs(1, cnt);
		cout<<((cnt == n) ? "YES" : "NO")<<endl;
	}
}






Submission Info

Submission Time
Task C - Interpretation
User YangDaiyi
Language C++14 (GCC 5.4.1)
Score 400
Code Size 902 Byte
Status AC
Exec Time 41 ms
Memory 13176 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &k);
                   ^
./Main.cpp:35:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &x);
                    ^

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 200 / 200
Status
AC × 2
AC × 12
AC × 25
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 5 ms 2688 KB
01-02.txt AC 5 ms 2688 KB
01-03.txt AC 5 ms 2688 KB
01-04.txt AC 5 ms 2688 KB
01-05.txt AC 5 ms 2688 KB
01-06.txt AC 5 ms 2688 KB
01-07.txt AC 5 ms 2688 KB
01-08.txt AC 5 ms 2688 KB
01-09.txt AC 5 ms 2688 KB
01-10.txt AC 5 ms 2816 KB
02-01.txt AC 31 ms 7808 KB
02-02.txt AC 37 ms 7552 KB
02-03.txt AC 32 ms 6528 KB
02-04.txt AC 41 ms 8192 KB
02-05.txt AC 41 ms 7296 KB
02-06.txt AC 41 ms 8192 KB
02-07.txt AC 40 ms 6528 KB
02-08.txt AC 33 ms 8548 KB
02-09.txt AC 40 ms 13176 KB
02-10.txt AC 31 ms 9468 KB
02-11.txt AC 31 ms 9468 KB
02-12.txt AC 30 ms 7680 KB
02-13.txt AC 30 ms 7680 KB
sample-01.txt AC 5 ms 2688 KB
sample-02.txt AC 5 ms 2688 KB