I need to solve this following problem as a subproblem of another problem:
You are given n sets S, S, S, ..., 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.
1<= n,size of S[i],elements of S[i],q <=100000
1<= sum of sizes of all sets <=100000
Thanks for reading the problem. It will be great if you can give me a solution.