bzoj1191[HNOI2006]超级英雄Hero
2015-12-12 11:48
288 查看
裸的二分图匹配,毕竟是t1,但是主要是有一句题目一旦没办法匹配了就要break,没看到闯关制的我调了好久
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define LL long long
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
inline LL read()
{
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
#define N 1005
int a
,l
;
bool y
;
int n,m;
bool match(int x)
{
fo(i,0,n-1)
if (y[i]==0&&a[x][i])
{
y[i]=1;
if (l[i]==0||match(l[i]))
{
l[i]=x;
return 1;
}
}
return 0;
}
int main()
{
memset(l,0,sizeof(l));
n=read(),m=read();
fo(i,1,m)
{
int x=read(),y=read();
a[i][y]=1;
a[i][x]=1;
}
int ans=0;
fo(i,1,m)
{
memset(y,0,sizeof(y));
if (match(i)) ans++;
else break;
}
printf("%d\n",ans);
return 0;
}
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define LL long long
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
inline LL read()
{
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
#define N 1005
int a
,l
;
bool y
;
int n,m;
bool match(int x)
{
fo(i,0,n-1)
if (y[i]==0&&a[x][i])
{
y[i]=1;
if (l[i]==0||match(l[i]))
{
l[i]=x;
return 1;
}
}
return 0;
}
int main()
{
memset(l,0,sizeof(l));
n=read(),m=read();
fo(i,1,m)
{
int x=read(),y=read();
a[i][y]=1;
a[i][x]=1;
}
int ans=0;
fo(i,1,m)
{
memset(y,0,sizeof(y));
if (match(i)) ans++;
else break;
}
printf("%d\n",ans);
return 0;
}
相关文章推荐
- [wikioi2930]填报志愿(裸题)
- poj2239 Selecting Courses
- poj2195 Going Home
- KM算法 详解+模板
- KM算法
- poj1422 Air Raid
- 最小路径覆盖
- poj2060 Taxi Cab Scheme
- poj3216 Repairing Company
- poj3041 Asteroids
- 最大匹配的Hopcroft-Karp算法
- poj1548 Robots
- poj2594 Tre 4000 asure Exploration
- [BZOJ1059][ZJOI2007][二分图匹配]矩阵游戏
- [BZOJ1191][HNOI2006][二分图匹配][匈牙利算法]超级英雄hero
- [网络流24题 #1]飞行员配对方案问题
- [wikioi 1022]覆盖
- Codevs 1022 覆盖
- [BZOJ1059][ZJOI2007]矩阵游戏
- 杭电2063二分图匹配(匈牙利算法)