#C. ABC202C - Made Up

Type: Default

1000ms

256MiB

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Score : $300$ points

Problem Statement

Given are three sequences of length $N$ each: $A = (A_{1}, A_{2}, \dots, A_{N})$ , $B = (B_{1}, B_{2}, \dots, B_{N})$ , and $C = (C_{1}, C_{2}, \dots, C_{N})$ , consisting of integers between $1$ and $N$ (inclusive).

How many pairs $(i, j)$ of integers between $1$ and $N$ (inclusive) satisfy $A_{i} = B_{C_{j}}$ ?

Constraints

$1 \leq N \leq 1 0^{5}$
$1 \leq A_{i}, B_{i}, C_{i} \leq N$
All values in input are integers.

Input

Input is given from Standard Input in the following format:

 $N$ 
 $A_{1}$   $A_{2}$   $\dots$   $A_{N}$ 
 $B_{1}$   $B_{2}$   $\dots$   $B_{N}$ 
 $C_{1}$   $C_{2}$   $\dots$   $C_{N}$

Output

Print the number of pairs $(i, j)$ such that $A_{i} = B_{C_{j}}$ .

Sample Input 1

Sample Output 1

Four pairs satisfy the condition: $(1, 1), (1, 3), (2, 2), (3, 2)$ .

Sample Input 2

Sample Output 2

All the pairs satisfy the condition.

Sample Input 3

Sample Output 3

No pair satisfies the condition.

ABC202

Not Attended

Status: Done
Rule: IOI
Problem: 7
Start at: 2023-6-28 14:15
End at: 2023-6-28 16:39
Duration: 2.4 hour(s)
Host: 梁泽贤 (liangzexian)
Partic.: 13

#C. ABC202C - Made Up

ABC202C - Made Up

Problem Statement

Constraints

Input

Output

Sample Input 1

Sample Output 1

Sample Input 2

Sample Output 2

Sample Input 3

Sample Output 3

ABC202

Status

Development

Support

#C. ABC202C - Made Up

ABC202C - Made Up

Problem Statement

Constraints

Input

Output

Sample Input 1

Sample Output 1

Sample Input 2

Sample Output 2

Sample Input 3

Sample Output 3

ABC202

Status

Development

Support

Don't have an account?

SIGN IN