Submission #76484482

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long 

const int N=1e5+15,inf=LONG_LONG_MAX;

int n,m,s,t,head[N],dis[N],cnt=1,now[N];
struct edge{int next,to;long long w;}e[N<<2];

void add(int u,int v,int w) {
	e[++cnt].to=v;
	e[cnt].w=w;e[cnt].next=head[u];
	head[u]=cnt;
	e[++cnt].to=u;
	e[cnt].w=0;e[cnt].next=head[v];
	head[v]=cnt;
}

bool bfs() {
	for(int i=1;i<=2*n+2;i++) dis[i]=inf;
	queue<int> q;
	q.push(s);
	dis[s]=0;now[s]=head[s];
	while(!q.empty()) {
		int u=q.front();
		q.pop();
		for(int i=head[u];i;i=e[i].next) {
			if(e[i].w>0&&dis[e[i].to]==inf) {
				q.push(e[i].to);
				now[e[i].to]=head[e[i].to];
				dis[e[i].to]=dis[u]+1;
				if(e[i].to==t) return true;
			}
		}
	}
	return false;
}

int dfs(int u,long long val) {
	if(u==t) return val;
	long long k,res=0;
	for(int i=now[u];i&&val;i=e[i].next) {
		now[u]=i;
		int v=e[i].to;
		if(e[i].w>0&&(dis[v]==dis[u]+1)) {
			k=dfs(v,min(e[i].w,val));
			if(k==0) dis[v]=inf;
			e[i].w-=k;e[i^1].w+=k;
			res+=k;val-=k;
		}
	}
	return res;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	long long ans=0;
	cin>>n>>m;
	s=2*n+1,t=2*n+2;
	for(int i=1;i<=m;i++) {
		int u,v,w;
		cin>>u>>v;
		add(u,n+v,1);
		add(v,n+u,1);
	}
	for(int i=1;i<=n;i++) add(2*n+1,i,1);
	for(int i=1;i<=n;i++) add(n+i,2*n+2,1);
	while(bfs()) {
		ans+=dfs(s,inf);
	}
	cout<<1013*(2*n-ans)<<'\n';
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function 'int main()':
./Main.cpp:63:25: warning: unused variable 'w' [-Wunused-variable]
   63 |                 int u,v,w;
      |                         ^

Judge Result