s向1的点建边,容量为1,0的点向T建边,容量为1,对于所有朋友关系:如果原来意见相同,就建双向边,容量为1,否则建边由1指向0,容量为1。最小割就是答案。最后s集合都是1,T集合都是0.
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 310
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,col[N],h[N],num=1,T=301,lev[N],ans=0,cur[N];
struct edge{
int to,next,val;
}data[91000];
inline void add(int x,int y,int val,int op){
data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].val=val;
data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].val=val*op;
}
inline bool bfs(){
queue<int>q;memset(lev,0,sizeof(lev));
lev[0]=1;q.push(0);
while(!q.empty()){
int x=q.front();q.pop();
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(lev[y]||!data[i].val) continue;
lev[y]=lev[x]+1;q.push(y);
}
}return lev[T];
}
inline int dinic(int x,int low){
if(x==T) return low;int tmp=low;
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(lev[y]!=lev[x]+1||!data[i].val) continue;
int res=dinic(y,min(data[i].val,tmp));
if(!res) lev[y]=0;else tmp-=res,data[i].val-=res,data[i^1].val+=res;
if(!tmp) return low;
}return low-tmp;
}
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();
for(int i=1;i<=n;++i){
col[i]=read();col[i]?add(0,i,1,0):add(i,T,1,0);
}while(m--){
int x=read(),y=read();if(col[x]<col[y]) swap(x,y);
if(col[x]==col[y]) add(x,y,1,1);
else add(x,y,1,0);
}while(bfs()){memcpy(cur,h,sizeof(cur));ans+=dinic(0,inf);}
printf("%d\n",ans);
return 0;
}