poj 1469 COURSES (匈牙利算法)

Posted by 111qqz on Thursday, May 26, 2016

TOC

poj 1469 题目链接

``````/* ***********************************************
Author :111qqz
Created Time :2016年05月26日 星期四 23时53分39秒
File Name :code/poj/1469.cpp
************************************************ */

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define fst first
#define sec second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ms(a,x) memset(a,x,sizeof(a))
typedef long long LL;
#define pi pair < int ,int >
#define MP make_pair

using namespace std;
const double eps = 1E-8;
const int dx4[4]={1,0,0,-1};
const int dy4[4]={0,-1,1,0};
const int inf = 0x3f3f3f3f;
const int N=30003;
int n,p;
int cnt ;
bool vis[405];
struct Edge
{
int v;
int nxt;
}edge[N];

{
edge[cnt].v = v;
cnt++;
}

bool dfs( int u)
{
//  cout<<"u:"<<u<<endl;
for ( int i = head[u] ; i!=-1 ; i = edge[i].nxt)
{
int v = edge[i].v;
if (vis[v]) continue;
vis[v] = true;

{
return true;
}
}
return false;
}
int hungary()
{
int res = 0 ;

for ( int i = 1 ; i <= p ; i++)
{
ms(vis,false);
if (dfs(i))  res++;
}

return res;

}
int main()
{
#ifndef  ONLINE_JUDGE
freopen("code/in.txt","r",stdin);
#endif
int T;
scanf("%d",&T);
while (T--)
{
scanf("%d%d",&p,&n);
cnt  = 0;
ms(edge,0);
for ( int i = 1 ; i <= p ; i++)
{
int x;
scanf("%d",&x);
while (x--)
{
int y;
scanf("%d",&y);
y+=p;
}
}
int ans = hungary();

if (ans==p) puts("YES");
else puts("NO");
}

#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0;
}
``````

「真诚赞赏，手留余香」