PAT 1063 Set Similarity (25)

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<algorithm>
 4 using namespace std;
 5 const int N=1e4+11;
 6 int a[51][N],cnt[51];
 7 int main()
 8 {
 9     int n,k,u,v,i,j;
10     scanf("%d",&n);
11     for(i=1;i<=n;i++)
12     {
13         scanf("%d",&cnt[i]);
14         for(j=1;j<=cnt[i];j++)
15         {
16             scanf("%d",&a[i][j]);
17         }
18         sort(a[i]+1,a[i]+cnt[i]+1);
19     }
20     scanf("%d",&k);
21     while(k--)
22     {
23         scanf("%d%d",&u,&v);
24         i=1,j=1;int sum=0,ans=0;
25         while(i<=cnt[u]&&j<=cnt[v])
26         {
27             if(a[u][i]==a[v][j])
28             {
29                 ans++;
30                 while(a[u][i+1]==a[u][i]&&i<=cnt[u]){
31                     i++;
32                 }
33                 while(a[v][j+1]==a[v][j]&&j<=cnt[v]){
34                     j++;
35                 }
36                 i++;j++;
37             }
38             else if(a[u][i]<a[v][j])
39             {
40                 while(a[u][i+1]==a[u][i]&&i<=cnt[u]){
41                     i++;
42                 }
43                 i++;
44             }
45             else if(a[u][i]>a[v][j]){
46                 while(a[v][j+1]==a[v][j]&&j<=cnt[v]){
47                     j++;
48                 }
49                 j++;
50             }
51             sum++;
52         }
53         if(cnt[u]>=i)    sum+=cnt[u]-i+1;
54         if(cnt[v]>=j)    sum+=cnt[v]-j+1;
55         printf("%.1f%%\n",100.0*ans/sum);
56     }
57     return 0;
58 }