裸题诶!左半图是1~m的题目,右半图是0~n-1的锦囊,求最大匹配。注意题目要求按m的顺序求,不能断。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1010
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,boy[N],ans=0;
bool f[N];
vector<int>a[N];
bool find(int x){
for(int i=0;i<2;++i){
int y=a[x][i];if(f[y]) continue;
f[y]=1;if(!boy[y]||find(boy[y])){boy[y]=x;return 1;}
}return 0;
}
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();
for(int i=1;i<=m;++i){
int x=read()+1,y=read()+1;
a[i].push_back(x);a[i].push_back(y);
}
for(int i=1;i<=m;++i){
memset(f,0,sizeof(f));
if(find(i)) ans++;
else break;
}printf("%d\n",ans);
return 0;
}