Exactly One Side

Difficulty: 1000 3500 ms 128 MB

implementation

Treating A and B as sets (duplicates ignored), count the values present in exactly one of them.

Input: the first line has N; the second line has A; the third line has B.

Output: the symmetric difference size.

Constraints:

• 1 ≤ N ≤ 10⁵
• |values| ≤ 10⁹

Sample Tests

3
1 2 3
2 3 4

2

2
1 1
1 1

0

Read the Editorial