Submission #991995
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#ifdef _WIN32
#define scanfll(x) scanf("%I64d", x)
#define printfll(x) printf("%I64d", x)
#else
#define scanfll(x) scanf("%lld", x)
#define printfll(x) printf("%lld", x)
#endif
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>;
using ld = long double; using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>;
vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using P = pair<ll, ll>;
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; cout << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
string bits_to_string(ll mask, ll n) { string s; rep(i, n) s += '0' + !!(mask & (1ll << i)); return s; }
#define ldout fixed << setprecision(40)
static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9+7;
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) { }
// x, yをマージ
bool unite(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
// x, yが同じ集合なら1
bool find(int x, int y) {
return root(x) == root(y);
}
// xの根を探す。同じ集合なら同じ根が帰る
int root(int x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
// xが含まれる集合の大きさを返す
int size(int x) {
return -data[root(x)];
}
// 分離されている集合の数を返す
int setNum(void) {
map<int, int> c;
rep(i, data.size()) {
c[root(i)]++;
}
return c.size();
}
// O(n)
// 集合ごとに全部の要素を出力
vector<vector<int>> getUnionList(void) {
map<int, vector<int>> c;
for (int i = 0; i < data.size(); i++)
c[root(i)].pb(i);
vector<vector<int>> v;
for (auto x : c)
v.push_back(x.second);
return v;
}
void print(void) {
auto c = getUnionList();
for (auto x : c) {
for (auto y : x)
cout << y << " ";
cout << endl;
}
}
};
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll n, m; cin >> n >> m;
vvll inv(m);
rep(i, n) {
ll k; cin >> k;
rep(j, k) {
ll lang; cin >> lang; lang--;
inv[lang].pb(i);
}
}
UnionFind uf(n);
rep(i, m) {
rep(j, inv[i].size()-1) {
uf.unite(inv[i][j], inv[i][j+1]);
}
}
if (uf.size(0) == n) {
cout << "YES" << endl; } else {cout << "NO" << endl;}
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Interpretation |
User |
hamko |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
4908 Byte |
Status |
AC |
Exec Time |
26 ms |
Memory |
4736 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 |
2 ms |
256 KB |
01-02.txt |
AC |
3 ms |
256 KB |
01-03.txt |
AC |
3 ms |
256 KB |
01-04.txt |
AC |
3 ms |
256 KB |
01-05.txt |
AC |
3 ms |
256 KB |
01-06.txt |
AC |
3 ms |
256 KB |
01-07.txt |
AC |
3 ms |
256 KB |
01-08.txt |
AC |
3 ms |
256 KB |
01-09.txt |
AC |
3 ms |
256 KB |
01-10.txt |
AC |
3 ms |
256 KB |
02-01.txt |
AC |
22 ms |
4736 KB |
02-02.txt |
AC |
17 ms |
1792 KB |
02-03.txt |
AC |
21 ms |
3200 KB |
02-04.txt |
AC |
26 ms |
4480 KB |
02-05.txt |
AC |
22 ms |
2304 KB |
02-06.txt |
AC |
26 ms |
4480 KB |
02-07.txt |
AC |
22 ms |
2304 KB |
02-08.txt |
AC |
15 ms |
1608 KB |
02-09.txt |
AC |
20 ms |
3828 KB |
02-10.txt |
AC |
18 ms |
3576 KB |
02-11.txt |
AC |
18 ms |
3576 KB |
02-12.txt |
AC |
19 ms |
3712 KB |
02-13.txt |
AC |
19 ms |
3584 KB |
sample-01.txt |
AC |
2 ms |
256 KB |
sample-02.txt |
AC |
2 ms |
256 KB |