1063. Set Similarity (25)

#define  _CRT_SECURE_NO_WARNINGS 
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream>
#include<set>
#include<algorithm>
#include<stdio.h>  
using namespace std;   
int main()
{
int N;
cin >> N;
vector<int> *num = new vector<int>[N];
for (int i = 0; i < N; i++)
{
int M;
scanf("%d",&M);
for (int j = 0; j < M; j++)
{
int tmp;
scanf("%d",&tmp);
num[i].push_back(tmp);
}
sort(num[i].begin(), num[i].end());
}
int M;
cin >> M;
for (int i = 0; i < M; i++)
{
int a, b;
scanf("%d %d",&a,&b);
int Nc = 0, Nt = 0;
int i_b = 0, i_a = 0;
int pre_a = -1, pre_b = -1; 
while (i_a < num[a - 1].size() && i_b< num[b - 1].size())
{ 
if (num[a - 1][i_a] > num[b - 1][i_b])
{
Nt++;
pre_b = num[b - 1][i_b];
i_b++;
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;
}
else if (num[a - 1][i_a] < num[b - 1][i_b])
{ 
Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;
}
else
{ 
Nc++; 
pre_b = num[b - 1][i_b];
i_b++; 
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;


Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;
}
}
while (i_a< num[a - 1].size())
{
Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;  
}
while (i_b< num[b- 1].size())
{  
Nt++;
pre_b = num[b - 1][i_b];
i_b++;
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;
}
printf("%.1f%%\n",(float)Nc/(float)Nt*100);
}
return 0;
}