Submission #8402116
Source Code Expand
#include <iostream> #include <map> #include <set> #include <vector> #include <algorithm> #include <math.h> #include <cmath> #include <deque> using namespace std; typedef long long ll; int p[100005]; int q[100005]; struct UnionFind{ vector<int> par; vector<int> rank; vector<int> sizes; UnionFind(int n): par(n), rank(n), sizes(n){ for(int i = 0; i < n; i++){ par[i] = i; rank[i] = 0; sizes[i] = 1; } } int root(int x){ if(par[x] == x) return x; else return par[x] = root(par[x]); } bool same(int x, int y){ return root(x) == root(y); } void unite(int x, int y){ x = root(x); y = root(y); if(x == y) return; else { if(rank[x] < rank[y]){ par[x] = y; sizes[y] += sizes[x]; } else { par[y] = x; sizes[x] += sizes[y]; if(rank[x] == rank[y]) rank[x]++; } } } int size(int x){ return sizes[root(x)]; } }; int main(){ int N, M; cin >> N >>M; for(int i = 1; i <= N; i++){ cin >> p[i]; q[p[i]] = i; } UnionFind uni(N+1); for(int i = 1; i <= M; i++){ int x, y; cin >> x >> y; uni.unite(x, y); } int ans = 0; for(int i = 1; i <= N; i++){ if(uni.root(i) == uni.root(q[i])) ans++; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Equals |
User | Tabeta |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1572 Byte |
Status | AC |
Exec Time | 90 ms |
Memory | 2176 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 | 85 ms | 2176 KB |
1_006.txt | AC | 90 ms | 2176 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 | 2176 KB |
1_020.txt | AC | 30 ms | 2176 KB |
1_021.txt | AC | 31 ms | 2176 KB |
1_022.txt | AC | 89 ms | 2176 KB |