Submission #1503412
Source Code Expand
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
//#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <deque>
#include<valarray>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cmath>
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define int ll
using ll = long long;
using ull = unsigned long long;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
//Union-Find
class UnionFind {
private:
std::vector<int> parent;
std::vector<int> height;
std::vector<int> m_size;
public:
UnionFind(int size_) : parent(size_), height(size_, 0), m_size(size_, 1) {
REP(i, size_) {
parent[i] = i;
}
}
void init(int size_) {
parent.resize(size_);
height.resize(size_, 0);
m_size.resize(size_, 0);
REP(i, size_) {
parent[i] = i;
}
}
int find(int x) {
if (parent[x] == x) {
return x;
}
return parent[x] = find(parent[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
int t = size(x) + size(y);
m_size[x] = m_size[y] = t;
if (height[x] < height[y]) parent[x] = y;
else parent[y] = x;
if (height[x] == height[y]) ++height[x];
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
if (parent[x] == x) {
return m_size[x];
}
return size(parent[x] = find(parent[x]));
}
};
signed main() {
INIT;
VAR(int, n, k);
UnionFind uf(n);
REP(i, k) {
VAR(int, m);
VEC(int, b, m);
FOR(i, 1, m) {
uf.unite(b[0] - 1, b[i] - 1);
}
}
VAR(int, r);
std::set<int> set;
REP(i, r) {
VAR(int, p, q);
if (uf.same(--p, --q)) {
set.insert(p);
set.insert(q);
}
}
OUT(set.size())BR;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - ソーシャル |
User |
satanic0258 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
5903 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00_sample_01, 00_sample_02, 00_sample_03, 10_random_0, 10_random_1, 10_random_10, 10_random_11, 10_random_12, 10_random_13, 10_random_14, 10_random_15, 10_random_16, 10_random_17, 10_random_18, 10_random_19, 10_random_2, 10_random_20, 10_random_21, 10_random_22, 10_random_23, 10_random_24, 10_random_25, 10_random_26, 10_random_27, 10_random_28, 10_random_3, 10_random_4, 10_random_5, 10_random_6, 10_random_7, 10_random_8, 10_random_9, 20_twopartition_0, 20_twopartition_1, 20_twopartition_2, 20_twopartition_3, 20_twopartition_4, 20_twopartition_5, 20_twopartition_6 |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01 |
AC |
1 ms |
256 KB |
00_sample_02 |
AC |
1 ms |
256 KB |
00_sample_03 |
AC |
1 ms |
256 KB |
10_random_0 |
AC |
1 ms |
256 KB |
10_random_1 |
AC |
1 ms |
256 KB |
10_random_10 |
AC |
1 ms |
256 KB |
10_random_11 |
AC |
1 ms |
256 KB |
10_random_12 |
AC |
1 ms |
256 KB |
10_random_13 |
AC |
1 ms |
256 KB |
10_random_14 |
AC |
1 ms |
256 KB |
10_random_15 |
AC |
1 ms |
256 KB |
10_random_16 |
AC |
1 ms |
256 KB |
10_random_17 |
AC |
1 ms |
256 KB |
10_random_18 |
AC |
1 ms |
256 KB |
10_random_19 |
AC |
1 ms |
256 KB |
10_random_2 |
AC |
1 ms |
256 KB |
10_random_20 |
AC |
1 ms |
256 KB |
10_random_21 |
AC |
1 ms |
256 KB |
10_random_22 |
AC |
1 ms |
256 KB |
10_random_23 |
AC |
1 ms |
256 KB |
10_random_24 |
AC |
1 ms |
256 KB |
10_random_25 |
AC |
1 ms |
256 KB |
10_random_26 |
AC |
1 ms |
256 KB |
10_random_27 |
AC |
1 ms |
256 KB |
10_random_28 |
AC |
1 ms |
256 KB |
10_random_3 |
AC |
1 ms |
256 KB |
10_random_4 |
AC |
1 ms |
256 KB |
10_random_5 |
AC |
1 ms |
256 KB |
10_random_6 |
AC |
1 ms |
256 KB |
10_random_7 |
AC |
1 ms |
256 KB |
10_random_8 |
AC |
1 ms |
256 KB |
10_random_9 |
AC |
1 ms |
256 KB |
20_twopartition_0 |
AC |
1 ms |
256 KB |
20_twopartition_1 |
AC |
1 ms |
256 KB |
20_twopartition_2 |
AC |
1 ms |
256 KB |
20_twopartition_3 |
AC |
1 ms |
256 KB |
20_twopartition_4 |
AC |
1 ms |
256 KB |
20_twopartition_5 |
AC |
1 ms |
256 KB |
20_twopartition_6 |
AC |
1 ms |
256 KB |