Submission #992161
Source Code Expand
#include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <vector> #include <cstring> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <algorithm> using namespace std; #define REP(i,n) for(int i=0; i<n; ++i) #define FOR(i,a,b) for(int i=a; i<=b; ++i) #define FORR(i,a,b) for (int i=a; i>=b; --i) #define pi M_PI typedef long long ll; typedef vector<int> VI; typedef vector<ll> VL; typedef vector<VI> VVI; typedef pair<int,int> P; typedef pair<ll,ll> PL; const int N = 100000; VI e[2*N]; int f[2*N]; void dfs(int now){ f[now] = 1; REP(i,e[now].size()){ int next = e[now][i]; if (f[next]) continue; dfs(next); } } int main() { int n, m; cin >> n >> m; REP(i,n){ int k; cin >> k; while(k--){ int l; scanf("%d", &l); e[i].push_back(l+N); e[l+N].push_back(i); } } dfs(0); bool ok = 1; REP(i,n){ if (!f[i]) ok = 0; } cout << (ok ? "YES" : "NO") << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | TangentDay |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1164 Byte |
Status | AC |
Exec Time | 53 ms |
Memory | 8960 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:48:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &l); ^
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 | 4992 KB |
01-02.txt | AC | 8 ms | 4992 KB |
01-03.txt | AC | 9 ms | 4992 KB |
01-04.txt | AC | 9 ms | 4992 KB |
01-05.txt | AC | 9 ms | 4992 KB |
01-06.txt | AC | 8 ms | 4992 KB |
01-07.txt | AC | 8 ms | 4992 KB |
01-08.txt | AC | 8 ms | 4992 KB |
01-09.txt | AC | 9 ms | 4992 KB |
01-10.txt | AC | 9 ms | 4992 KB |
02-01.txt | AC | 35 ms | 8192 KB |
02-02.txt | AC | 50 ms | 8960 KB |
02-03.txt | AC | 37 ms | 7808 KB |
02-04.txt | AC | 52 ms | 8704 KB |
02-05.txt | AC | 52 ms | 8960 KB |
02-06.txt | AC | 52 ms | 8704 KB |
02-07.txt | AC | 53 ms | 8832 KB |
02-08.txt | AC | 47 ms | 8824 KB |
02-09.txt | AC | 50 ms | 8824 KB |
02-10.txt | AC | 40 ms | 8824 KB |
02-11.txt | AC | 39 ms | 8824 KB |
02-12.txt | AC | 39 ms | 8704 KB |
02-13.txt | AC | 39 ms | 8832 KB |
sample-01.txt | AC | 8 ms | 4992 KB |
sample-02.txt | AC | 8 ms | 4992 KB |