UVALive 5027 二分图 EK

C - Card Game

Crawling in process...Crawling failedTime Limit:3000MS    Memory Limit:0KB    64bit IO Format:%lld & %llu

SubmitStatusPracticeUVALive 5027

Description

 

 

Jimmy invents an interesting card game. There are N cards, each of which contains a string S_i. Jimmy wants to stick them into several circles, and each card belongs to one circle exactly. When sticking two cards, Jimmy will get a score. The score of sticking two cards is the longest common prefix of the second card and the reverse of the first card. For example, if Jimmy sticks the card S₁ containing ``abcd" in front of the card S<sub>2</sub> containing ``dcab", the score is 2. And if Jimmy sticks S₂ in front of S₁, the score is 0. The card can also stick to itself to form a self-circle, whose score is 0.

For example, there are 3 cards, whose strings are S₁=``ab", S<sub>2</sub>=``bcc", S₃=``ccb". There are 6 possible sticking:

1. S₁S₂,     S₂S₃,     S₃S₁, the score is 1+3+0 = 4
2. S₁S₂,     S₂S₁,     S₃S₃, the score is 1+0+0 = 1
3. S₁S₃,     S₃S₁,     S₂S₂, the score is 0+0+0 = 0
4. S₁S₃,     S₃S₂,     S₂S₁, the score is 0+3+0 = 3
5. S₁S₁,     S₂S₂,     S₃S₃, the score is 0+0+0 = 0
6. S₁S₁,     S₂S₃,     S₃S₂, the score is 0+3+3 = 6

So the best score is 6.

Given the information of all the cards, please help Jimmy find the best possible score.

Input

There are several test cases. The first line of each test case contains an integer N(1N200). Each of the next N lines contains a string S_i. You can assume the strings contain alphabets ('a'-'z', 'A'-'Z') only, and the length of every string is no more than 1000.

Output

Output one line for each test case, indicating the corresponding answer.

Sample Input

3 
ab 
bcc 
ccb 
1 
abcd

Sample Output

6 
0

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
char str[300][1500];
int lx[300],ly[90000];
int sx[300],sy[90000];
const int inf=999999999;
int w[300][90000];
int LINK[90000];
int ans;
int n;

int dmin;
bool Find(int u)
{
    sx[u] =1;
    for(int v = 1;v <= n;v ++)
    {
        if(!sy[v])
        {
            int t = lx[u] + ly[v] - w[u][v];
            if(t)
            {
                if(dmin > t)
                    dmin = t;
            }
            else
            {
                sy[v] = true;
                if(LINK[v] == -1 || Find(LINK[v]))
                {
                    LINK[v] = u;
                    return true;
                }
            }
        }
    }
    return false;
}


int KM(){
    for(int i = 1;i <= n;i ++)
    {
        for(int j = 1;j <= n;j ++)
            if(lx[i] < w[i][j])
                lx[i] = w[i][j];
    }

    memset(LINK,-1,sizeof(LINK));


    for(int i = 1;i <= n;i ++)
    {
        while(true)
        {

            memset(sx,0,sizeof(sx));
            memset(sy,0,sizeof(sy));
            dmin = inf;
             if(Find(i))
                break;
            for(int j = 1;j <= n;j ++)
            {
                if(sx[j])
                    lx[j] -= dmin;
                if(sy[j])
                    ly[j] += dmin;
            }
        }
    }
    for(int i = 1;i <= n;i ++)
        ans += w[LINK[i]][i];
   return ans;
}



int main(){

   while(scanf("%d",&n)!=EOF){
      getchar();
      memset(str,0,sizeof(str));
      memset(lx,0,sizeof(lx));
      memset(ly,0,sizeof(ly));
      memset(w,0,sizeof(w));
      for(int i=1;i<=n;i++){
        scanf("%s",str[i]);
        getchar();
      }

      for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){

                int num=0;
            if(i==j){
            w[i][j]=0;
            continue;
            }
            int len1=strlen(str[i]);
            int len2=strlen(str[j]);
            int temp1=len1-1,temp2=0;
            while(temp1>=0&&temp2<=len2-1&&str[i][temp1]==str[j][temp2]){

                    num++;
                    temp1--;
                    temp2++;

            }
            w[i][j]=num;

        }
      }
     ans=0;
       ans=KM();
       printf("%d
",ans);
   }
   return 0;
}