Submission #5374072
Source Code Expand
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/
#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))
//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountll((a))
//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
//constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};
//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
struct Accelerate_Cin {
Accelerate_Cin() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} Accelerate_Cin;
int N, M;
vector<int> G[202020];
const int x = 101010;
bool vis[202020];
void dfs(int n) {
vis[n] = true;
for (auto t : G[n]) {
if (vis[t] != true) {
dfs(t);
}
}
return;
}
signed main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int l;
cin >> l;
l--;
G[l + x].push_back(i);
G[i].push_back(l + x);
}
}
dfs(0);
for (int i = 0; i < N; i++) {
if (vis[i] == false) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
null_null |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
2909 Byte |
Status |
AC |
Exec Time |
32 ms |
Memory |
9344 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, sample-01.txt, sample-02.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
3 ms |
4992 KB |
01-02.txt |
AC |
3 ms |
4992 KB |
01-03.txt |
AC |
3 ms |
5120 KB |
01-04.txt |
AC |
3 ms |
4992 KB |
01-05.txt |
AC |
3 ms |
4992 KB |
01-06.txt |
AC |
3 ms |
4992 KB |
01-07.txt |
AC |
3 ms |
4992 KB |
01-08.txt |
AC |
3 ms |
4992 KB |
01-09.txt |
AC |
3 ms |
4992 KB |
01-10.txt |
AC |
3 ms |
4992 KB |
02-01.txt |
AC |
27 ms |
8704 KB |
02-02.txt |
AC |
24 ms |
9216 KB |
02-03.txt |
AC |
25 ms |
8576 KB |
02-04.txt |
AC |
32 ms |
8704 KB |
02-05.txt |
AC |
29 ms |
9344 KB |
02-06.txt |
AC |
32 ms |
8704 KB |
02-07.txt |
AC |
29 ms |
9216 KB |
02-08.txt |
AC |
20 ms |
9072 KB |
02-09.txt |
AC |
23 ms |
9076 KB |
02-10.txt |
AC |
20 ms |
9076 KB |
02-11.txt |
AC |
20 ms |
9076 KB |
02-12.txt |
AC |
22 ms |
8960 KB |
02-13.txt |
AC |
21 ms |
8960 KB |
sample-01.txt |
AC |
3 ms |
4992 KB |
sample-02.txt |
AC |
3 ms |
4992 KB |