Pagini recente » Cod sursa (job #1844139) | Cod sursa (job #501566) | Cod sursa (job #2386073) | Cod sursa (job #1581321) | Cod sursa (job #2726259)
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("felinare.in");
ofstream cout("felinare.out");
vector <int> v[8191*2+5];
int viz[8191*2+5],st[8191*2+5],dr[8191*2+5],n;
bool cup(int nod){
if(viz[nod]==1)
return 0;
viz[nod]=1;
for(auto u:v[nod]){
if(dr[u]==0){
st[nod]=u;
dr[u]=nod;
return 1;
}
}
for(auto u:v[nod]){
if(cup(dr[u])==1){
st[nod]=u;
dr[u]=nod;
return 1;
}
}
return 0;
}
void add(int a,int b){
v[a].push_back(b+n);
}
int main()
{
int m,a,b,cnt=0,prevcnt=0;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>a>>b;
add(a,b);
}
do{
prevcnt=cnt;
for(int i=1;i<=2*n;i++){
viz[i]=0;
}
for(int i=1;i<=n;i++){
if(st[i]==0){
cnt+=cup(i);
}
}
}while(cnt!=prevcnt);
cout<<2*n-cnt<<"\n";
return 0;
}