[Solution] Good Pairs CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Good Pairs CodeChef Solution | CodeChef Problem Solution 2022

You are given arrays A$A$ and B$B$ of length N$N$ each. Determine the number of good pairs.

A pair (i,j)$(i,j)$ (1≤i,j≤N)$(1\le i,j\le N)$ is said to be good if all of the following conditions are satisfied:

• i<j;$i<j;$
• Ai=Bj;$A_i=B_j;$
• Aj=Bi;$A_j=B_i;$

Input Format

• First line will contain T$T$, the number of test cases. Then the test cases follow.

Solution Click Below:-  CLICK HERE

Description of each test case:

• First line contains an integer N$N$ - denoting the length of the arrays.
• Second line contains N$N$ space-separated integers A1,A2,…AN$A_1,A_2,\dots A_N$ - denoting the array A$A$.
• Third line contains N$N$ space-separated integers B1,B2,…BN$B_1,B_2,\dots B_N$ - denoting the array B$B$.

Get Subscription CodeChef Solution

Chef gives Party CodeChef Solution

Dominant Army CodeChef Solution

Circular Track CodeChef Solution

Good Pairs CodeChef Solution

Anti-knapsack CodeChef Solution

A Bit Easy CodeChef Solution

Average Gift CodeChef Solution

Output Format

For each test case, output the number of good pairs.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 2≤N≤105$2\le N\le {10}^5$
• 1≤Ai,Bi≤109$1\le A_i,B_i\le {10}^9$
• Sum of N$N$ over all test cases does not exceed 2⋅105$2\cdot {10}^5$.

Join Now for Solution:-