https://binarysearch.com/problems/MaximizetheNumberofEquivalentPairsAfterSwaps
You are given a list of integers of the same length A
and B
. You are also given a twodimensional list of integers C
where each element is of the form [i, j]
which means that you can swap A[i]
and A[j]
as many times as you want.
Return the maximum number of pairs where A[i] = B[i]
after the swapping.
Constraints

n ≤ 100,000
wheren
is the length ofA
andB

m ≤ 100,000
wherem
is the length ofC
Example 1
Input
A = [1, 2, 3, 4]
B = [2, 1, 4, 3]
C = [ [0, 1], [2, 3] ]
Output
4
Explanation
We can swap A[0]
with A[1]
then A[2]
with A[3]
.
can someone help me with the approach?