CF Elementary Math【网络流】

题意：有n对数字，中间可以填+ - *，问有没有可能n个算式的结果都不一样。

思路：最大流，每对数字的3种结果都算出来，连过去，容量为1。起点连n对数，汇点连它们的结果，容量都为1。

最大流 < n，impossible；否则遍历n对数连到了哪个结果，输出

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<stdlib.h>
#include<math.h>
#include<vector>
#include<list>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#include<numeric>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1e5+5;
ll x[maxn],y[maxn],node[maxn];
map<ll,int> ma;
struct edge {int to,cf,rev;};
vector<edge> G[maxn];
int lev[maxn],iter[maxn];

void init(int x)
{
	for(int i = 0; i <= x; i++)
		G[i].clear();
}

void add(int from, int to, int cap)
{
	G[from].push_back((edge){to,cap,G[to].size()});
	G[to].push_back((edge){from,0,G[from].size()-1});
}

void bfs(int s)
{
	memset(lev,-1,sizeof lev);
	queue<int> q;
	lev[s] = 0;
	q.push(s);
	while(!q.empty())
	{
		int v = q.front();q.pop();
		for(int i = 0; i < G[v].size(); i++)
		{
			edge &e = G[v][i];
			if(e.cf > 0 && lev[e.to] < 0)
			{
				lev[e.to] = lev[v] + 1;
				q.push(e.to);
			}
		}
	}
}

int dfs(int v,int t, int f)
{
	if(v == t) return f;
	for(int &i = iter[v]; i < G[v].size(); i++)
	{
		edge &e = G[v][i];
		if(e.cf > 0 && lev[v] < lev[e.to])
		{
			int d = dfs(e.to, t, min(f,e.cf));
			if(d > 0)
			{
				e.cf -= d;
				G[e.to][e.rev].cf += d;
				return d;
			}
		}
	}
	return 0;
}

int maxflow(int s,int t)
{
	int flow = 0;
	while(1)
	{
		bfs(s);
		if(lev[t] < 0) return flow;
		memset(iter,0,sizeof iter);
		int f;
		while((f = dfs(s,t,0x3f3f3f3f)) > 0)
			flow += f;
	}
}

int main(void)
{
	int n,cnt;
	while(scanf("%d",&n)!=EOF)
	{
		init(4*n+10);
		ma.clear();
		cnt = n+1;
		for(int i = 1; i <= n; i++)
		{
			ll a,b;
			scanf("%lld%lld",&a,&b);
			x[i] = a;y[i] = b;
			if(ma.find(a+b) == ma.end())
			{
				ma[a+b] = cnt;
				add(i,cnt,1);
				node[cnt++] = a+b;
			}
			else
				add(i,ma[a+b],1);
			if(ma.find(a-b) == ma.end())
			{
				ma[a-b] = cnt;
				add(i,cnt,1);
				node[cnt++] = a-b;
			}
			else
				add(i,ma[a-b],1);
			if(ma.find(a*b) == ma.end())
			{
				ma[a*b] = cnt;
				add(i,cnt,1);
				node[cnt++] = a*b;
			}
			else
				add(i,ma[a*b],1);
		}
		for(int i = 1; i <= n; i++)
			add(0,i,1);
		for(int i = n+1; i < cnt; i++)
			add(i,cnt,1);
		int ans = maxflow(0,cnt);
		if(ans < n)
			printf("impossible\n");
		else
		{
			for(int i = 1; i <= n; i++)
			{
				for(int j = 0; j < G[i].size(); j++)
				{
					if(!G[i][j].cf && G[i][j].to != 0)
					{
						int m = G[i][j].to;
						char op;
						if(x[i]+y[i] == node[m])
							op = '+';
						if(x[i]-y[i] == node[m])
							op = '-';
						if(x[i]*y[i] == node[m])
							op = '*';
						printf("%lld %c %lld = %lld\n",x[i],op,y[i],node[m]);
						break;
					}
				}
			}
		}
	}
	return 0;
}