Submission #993343
Source Code Expand
/*** Template Begin ***/
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto init_ = [] {
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed;
return 0;
}();
template <typename T>
inline T in() {
T x;
std::cin >> x;
return x;
}
template <typename T>
inline void in(T &x) {
std::cin >> x;
}
template <typename T, typename... Ts>
inline void in(T &t, Ts &... ts) {
std::cin >> t;
in(ts...);
}
template <typename T, typename U = std::vector<T>>
inline U vin(int n) {
U v(n);
for (int i = 0; i < n; ++i) {
std::cin >> v[i];
}
return v;
}
template <typename T, typename U = std::vector<T>, typename V = std::vector<U>>
inline V vin(int h, int w) {
V vv(h, U(w));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
std::cin >> vv[i][j];
}
}
return vv;
}
template <typename T>
inline void out(const T &x) {
std::cout << x << std::endl;
}
template <char delimiter = ' ', typename T, typename... Ts>
inline void out(const T &t, const Ts &... ts) {
std::cout << t << delimiter;
out(ts...);
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int n) {
for (int i = 0; i < n; ++i) {
if (i) std::cout << delimiter;
std::cout << v[i];
}
std::cout << std::endl;
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int h, int w) {
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (j) std::cout << delimiter;
std::cout << v[i][j];
}
std::cout << std::endl;
}
}
template <typename T, size_t D>
struct multi_vector_type {
using type = std::vector<typename multi_vector_type<T, D - 1>::type>;
};
template <typename T>
struct multi_vector_type<T, 1> {
using type = std::vector<T>;
};
template <typename T>
struct multi_vector_type<T, 0> {
using type = T;
};
template <typename T, size_t D>
using multi_vector = typename multi_vector_type<T, D>::type;
template <typename T, size_t D, class = typename std::enable_if<D == 0>::type>
T make_vector(const T &val = T()) {
return val;
}
template <typename T, size_t D = 1, typename... Ts,
class = typename std::enable_if<D != 0>::type>
multi_vector<T, D> make_vector(size_t n, Ts &&... args) {
return multi_vector<T, D>(n, make_vector<T, D - 1>(args...));
}
using namespace std;
#define USING_BOOST
#ifdef USING_BOOST
#include <boost/range.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <boost/range/irange.hpp>
inline auto rep(int begin, int end) {
if (begin > end) {
return boost::irange(0, 0);
} else {
return boost::irange(begin, end);
}
}
inline auto rep(int begin, int end, int step) {
if ((step > 0 && begin > end) || (step < 0 && begin < end)) {
return boost::irange(0, 0, step);
} else {
return boost::irange(begin, end, step);
}
}
#endif
#define USING_NAMESPACE
#ifdef USING_NAMESPACE
using namespace std;
#ifdef USING_BOOST
using namespace boost;
using namespace boost::adaptors;
#endif
#endif
/*** Template End ***/
vector<int> visited;
vector<vector<int>> graph;
vector<int> ks;
vector<vector<int>> ls;
vector<vector<int>> ms;
void dfs(int id) {
if (visited[id]) {
return;
}
visited[id] = true;
for (int l : ls[id]) {
for (int to : ms[l - 1]) {
dfs(to);
}
}
}
int main() {
int n, m;
in(n, m);
visited.resize(n);
graph.resize(n);
ks.resize(n);
ls.resize(n);
ms.resize(m);
for (int i : rep(0, n)) {
in(ks[i]);
for (int j : rep(0, ks[i])) {
int l = in<int>();
ls[i].push_back(l);
ms[l - 1].push_back(i);
}
sort(ls[i].begin(), ls[i].end());
}
dfs(0);
if (all_of(visited.begin(), visited.end(), [](auto f) { return f; })) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
mino |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
4681 Byte |
Status |
TLE |
Exec Time |
2103 ms |
Memory |
13304 KB |
Judge Result
Set Name |
sample |
dataset1 |
dataset2 |
Score / Max Score |
0 / 0 |
200 / 200 |
0 / 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 |
2 ms |
256 KB |
01-02.txt |
AC |
3 ms |
256 KB |
01-03.txt |
AC |
3 ms |
384 KB |
01-04.txt |
AC |
4 ms |
384 KB |
01-05.txt |
AC |
3 ms |
384 KB |
01-06.txt |
AC |
3 ms |
384 KB |
01-07.txt |
AC |
3 ms |
384 KB |
01-08.txt |
AC |
3 ms |
384 KB |
01-09.txt |
AC |
3 ms |
384 KB |
01-10.txt |
AC |
6 ms |
384 KB |
02-01.txt |
AC |
32 ms |
5760 KB |
02-02.txt |
AC |
70 ms |
11776 KB |
02-03.txt |
AC |
31 ms |
4480 KB |
02-04.txt |
AC |
41 ms |
8832 KB |
02-05.txt |
AC |
43 ms |
9984 KB |
02-06.txt |
AC |
41 ms |
8832 KB |
02-07.txt |
AC |
41 ms |
8960 KB |
02-08.txt |
TLE |
2103 ms |
10872 KB |
02-09.txt |
TLE |
2103 ms |
13304 KB |
02-10.txt |
TLE |
2103 ms |
9336 KB |
02-11.txt |
TLE |
2103 ms |
9336 KB |
02-12.txt |
AC |
843 ms |
8576 KB |
02-13.txt |
AC |
842 ms |
8448 KB |
sample-01.txt |
AC |
2 ms |
256 KB |
sample-02.txt |
AC |
2 ms |
256 KB |