您的位置: 首页  >  文章  >  HDU/HDOJ 3718 成都赛区2010 Similarity

HDU/HDOJ 3718 成都赛区2010 Similarity

分类: 文章 • 2024-11-30 18:21:22

链接：http://acm.hdu.edu.cn/showproblem.php?pid=3718


When we were children, we were always asked to do the classification homework. For example, we were given words {Tiger, Panda, Potato, Dog, Tomato, Pea, Apple, Pear, Orange, Mango} and we were required to classify these words into three groups. As you know, the correct classification was {Tiger, Panda, Dog}, {Potato, Tomato, Pea} and {Apple, Pear, Orange, Mango}. We can represent this classification with a mapping sequence{A,A,B,A,B,B,C,C,C,C}, and it means Tiger, Panda, Dog belong to group A, Potato, Tomato, Pea are in the group B, and Apple, Pear, Orange, Mango are in the group C.
But the LABEL of group doesn't make sense and the LABEL is just used to indicate different groups. So the representations {P,P,O,P,O,O,Q,Q,Q,Q} and {E,E,F,E,F,F,W,W,W,W} are equivalent to the original mapping sequence. However, the representations {A,A,A,A,B,B,C,C,C,C} and
{D,D,D,D,D,D,G,G,G,G} are not equivalent.

HDU/HDOJ 3718 成都赛区2010 Similarity


The pupils in class submit their mapping sequences and the teacher should read and grade the homework. The teacher grades the homework by calculating the maximum similarity between pupils' mapping sequences and the answer sequence. The definition of similarity is as follow.

Similarity(S, T) = sum(Si == Ti) / L
L = Length(S) = Length(T), i = 1, 2,... L,
where sum(Si == Ti) indicates the total number of equal labels in corresponding positions. The maximum similarity means the maximum similarities between S and all equivalent sequences of T, where S is the answer and fixed. Now given all sequences submitted by pupils and the answer sequence, you should calculate the sequences' maximum similarity.

Input
The input contains multiple test cases. The first line is the total number of cases T (T < 15). The following are T blocks. Each block indicates a case. A case begins with three numbers n (0 < n < 10000), k (0 < k < 27), m (0 < m < 30), which are the total number of objects, groups, and students in the class. The next line consists of n labels and each label is in the range [A...Z]. You can assume that the number of different labels in the sequence is exactly k. This sequence represents the answer. The following are m lines, each line contains n labels and each label also is in the range [A...Z]. These m lines represent the m pupils' answer sequences. You can assume that the number of different labels in each sequence doesn't exceed k.

Output
For each test case, output m lines, each line is a floating number (Round to 4 digits after the decimal point). You should output the m answers in the order of the sequences appearance.

Sample Input


2
10 3 3
A A B A B B C C C C
F F E F E E D D D D
X X X Y Y Y Y Z Z Z
S T R S T R S T R S
3 2 2
A B A
C D C
F F E






Sample Output






1.0000
0.7000
0.5000
1.0000
0.6667






Author
 
LIN, Yue




Source
 
  The 2010 ACM-ICPC Asia Chengdu Regional Contest  
 


Recommend
 
zhouzeyong





题目很明显，就是利用KM算法。。这个很早就想到过了。


但是一直没有动手敲过这个题目。


今天鼓起勇气敲了下。。还是发现了不少问题。


首先是k和m输入反了，找了好久都不知道是哪儿WA了。。


然后就是建图，建图可以用26个顶点来建图。


其它的建图方式可能回超时。





我的代码：


#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<map>
#define inf 199999999
using namespace std;
int link[30],lx[30],ly[30];
bool x[30],y[30];
int net[30][30];
char s[10005];
bool dfs(int u)
{
int i;
x[u]=true;
for(i=0;i<26;i++)
{
if(lx[u]+ly[i]==net[u][i]&&!y[i])
{
y[i]=true;
if(link[i]==-1||dfs(link[i]))
{
link[i]=u;
return true;
}
}
}
return false;
}
int main()
{
int i,j,n,m,k,t,ii,jj;
char temp[2];
scanf("%d",&t);
while(t--)
{
memset(s,'\0',sizeof(s));
scanf("%d%d%d",&n,&k,&m);
for(i=1;i<=n;i++)
{
scanf("%s",temp);
s[i]=temp[0];
}
for(i=1;i<=m;i++)
{
memset(net,0,sizeof(net));
for(j=1;j<=n;j++)
{
scanf("%s",temp);
net[s[j]-'A'][temp[0]-'A']++;
}
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
memset(link,-1,sizeof(link));
memset(ly,0,sizeof(ly));
for(ii=0;ii<30;ii++)
lx[ii]=inf;
for(k=0;k<26;k++)
{
while(1)
{
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
if(dfs(k))
break;
int d=inf;
for(ii=0;ii<26;ii++)
{
if(x[ii])
{
for(jj=0;jj<26;jj++)
{
if(!y[jj]&&lx[ii]+ly[jj]-net[ii][jj]<d)
d=lx[ii]+ly[jj]-net[ii][jj];
}
}
}
for(ii=0;ii<26;ii++)
if(x[ii])
lx[ii]=lx[ii]-d;
for(ii=0;ii<26;ii++)
if(y[ii])
ly[ii]=ly[ii]+d;
}
}
int ans=0;
for(ii=0;ii<26;ii++)
ans=ans+net[link[ii]][ii];
printf("%.4lf\n",double(ans)/double(n));
}
}
return 0;
}


															

																					

								

									相关推荐