Solve this following problem as a subproblem of another problem:

1

Statement:

Given n sets S[1], S[2], …, S[n] each having some distinct elements (Note that 2 different sets have common elements but each set have distinct elements).

Given q queries of type (i,j) you need to find if there is any common element in set S[i] and S[j]. Output YES/NO.

Constraints:

1<= n,size of S[i],elements of S[i],q <=100000

1<= sum of sizes of all sets <=100000

Thanks :slight_smile: It will be great if you can give me a solution.