zoj1134 Strategic Game(DP/图论)

#include <stdio.h>
#include <stdlib.h>

typedef struct node
{
int     Point;
node*    Next;
}node;
node  Node[ 3001 ];
node *Head[ 1501 ];
bool  Used[ 1501 ];
int   Result[ 1501 ];

bool find( int a, int n )
{
for ( node *P = Head[ a ] ; P ; P = P->Next )
if ( !Used[ P->Point ] ) {
Used[ P->Point ] = true;
if ( Result[ P->Point ] == -1 || find( Result[ P->Point ] , n ) ) {
Result[ P->Point ] = a;
return true;
}
}
return false;
}

int argument( int n )
{
for ( int i = 0 ; i < n ; ++ i )
Result[ i ] = -1;
int Count = 0;
for ( int i = 0 ; i < n ; ++ i ) {
for ( int j = 0 ; j < n ; ++ j )
Used[ j ] = false;
if ( find( i, n ) )
++ Count;
}
return Count;
}

int main()
{
int n,a,m,b;
while ( scanf("%d",&n) != EOF ) {
for ( int i = 0 ; i < n ; ++ i )
Head[ i ] = NULL;
int Count = 0;
for ( int i = 0 ; i < n ; ++ i ) {
scanf("%d:(%d)",&a,&m);
for ( int j = 0 ; j < m ; ++ j ) {
scanf("%d",&b);
Node[ Count ].Next  = Head[ a ];
Node[ Count ].Point = b;
Head[ a ] = &Node[ Count ++ ];
Node[ Count ].Next  = Head[ b ];
Node[ Count ].Point = a;
Head[ b ] = &Node[ Count ++ ];
}
}
printf("%d\n",argument( n )/2);
}
return 0;
}