Help with Problem from Tehran ICPC site

Revision en1, by Tameshk, 2019-12-21 21:08:13

Given two arrays A and B, find the number of different numbers can reach by adding exactly one element in A and exactly one form B. Constraints: 1) |A|,|B| <= 2*10^5 2) 0 <= A_i,B_i <= 2*10^5 3) No two elements in A and nor from B is same, However may be same numbers in A and B;
For example: A = [1,3,5] B = [1,3,7] ans = 6, [2,4,6,8,10,12]

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Tameshk 2019-12-21 21:10:04 19
en1 English Tameshk 2019-12-21 21:08:13 390 Initial revision (published)