Submission #3735507
Source Code Expand
/* ---------- STL Libraries ---------- */ // IO library #include <cstdio> #include <fstream> #include <iomanip> #include <ios> #include <iostream> // algorithm library #include <algorithm> #include <cmath> #include <numeric> #include <random> // container library #include <array> #include <bitset> #include <deque> #include <map> #include <unordered_map> #include <queue> #include <set> #include <string> #include <tuple> #include <vector> /* ---------- Namespace ---------- */ using namespace std; /* ---------- Type ---------- */ using ll = long long; #define int ll #define P pair<ll, ll> /* ---------- Constants */ const ll MOD = 1e9 + 7; const int INF = 1LL << 55; // const double PI = acos(-1); // const double EPS = 1e-10; // mt19937 mert(LL(time(0))); /* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */ class UnionFind { public: vector<int> par, rank; int cnt; UnionFind(int n) : cnt(n) { par = vector<int>(n); iota(par.begin(), par.end(), 0); rank = vector<int>(n, 0); } int root(int x) { if (par[x] == x) { return x; } else { return par[x] = root(par[x]); } } void unite(int x, int y) { x = root(x); y = root(y); if (x == y) return; if (rank[x] < rank[y]) { par[x] = y; } else { par[y] = x; if (rank[x] == rank[y]) rank[x]++; } cnt--; } bool same(int x, int y) { return root(x) == root(y); } }; signed main() { int N, M; cin >> N >> M; int a[N]; for (int i = 0; i < N; i++) cin >> a[i]; UnionFind uf = UnionFind(N); for (int i = 0; i < M; i++) { int a, b; cin >> a >> b; a--; b--; uf.unite(a, b); } int ret = 0; for (int i = 0; i < N; i++) { if (uf.same(i, a[i] - 1)) ret++; } cout << ret << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Equals |
User | sykwer |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 2046 Byte |
Status | AC |
Exec Time | 88 ms |
Memory | 2560 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
0_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 42 ms | 256 KB |
1_005.txt | AC | 83 ms | 2560 KB |
1_006.txt | AC | 88 ms | 2560 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | AC | 1 ms | 256 KB |
1_009.txt | AC | 1 ms | 256 KB |
1_010.txt | AC | 1 ms | 256 KB |
1_011.txt | AC | 1 ms | 256 KB |
1_012.txt | AC | 1 ms | 256 KB |
1_013.txt | AC | 2 ms | 256 KB |
1_014.txt | AC | 3 ms | 256 KB |
1_015.txt | AC | 1 ms | 256 KB |
1_016.txt | AC | 1 ms | 256 KB |
1_017.txt | AC | 2 ms | 256 KB |
1_018.txt | AC | 39 ms | 256 KB |
1_019.txt | AC | 30 ms | 2560 KB |
1_020.txt | AC | 30 ms | 2560 KB |
1_021.txt | AC | 30 ms | 2560 KB |
1_022.txt | AC | 88 ms | 2560 KB |