E - Elementary Math 2015-2016 Northwestern European Regional Contest (NWERC 2015)

题意：

给出+-*三种运算以及a   xxx   b两个数字。要求对于每个a.b执行任意一种预算，且结果均不等

思路：

构造二分图，寻找最大匹配。并且记录匹配的方式。对于每个a-b  a*b a+b都构造一个点，连边

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include <vector>
#include<algorithm>
#include <map>
#include <iostream>
using namespace std;

const int maxn=25005;
int n,m;
int pre[maxn];//保存各点的匹配点
int vis[maxn];
int voc[maxn];
vector<int> vec[maxn];
typedef long long ll;
map<ll ,ll > mp;
map<ll ,ll>mp2;
struct nod
{
    ll a,b;
} x[maxn];
int find(int u)//判断是否存在增广路，存在返回1
{
    int i,v;
    for(i=0; i<vec[u].size(); i++)
    {
        v=vec[u][i];
        if(vis[v])continue;
        vis[v]=1;
        if(pre[v]==-1||find(pre[v]))//-1找到未盖点，find是增广路。
        {
            pre[v]=u;//匹配边和非匹配边交换

            voc[u]=v;
            voc[v]=u;
            return 1;
        }
    }
    return 0;
}int cnt;
void solve(int u,ll x,ll y)
{
    ll tmp=x+y;
    if(!mp.count(tmp))
    {
        mp[tmp]=++cnt;
        mp2[cnt]=tmp;
    }
    int v=mp[tmp];
    vec[u].push_back(v);
    vec[v].push_back(u);

    ll tmp2=x*y;
    if(!mp.count(tmp2))
    {
        mp[tmp2]=++cnt;
        mp2[cnt]=tmp2;
    }
    v=mp[tmp2];
    vec[u].push_back(v);
    vec[v].push_back(u);

    ll tmp3=x-y;
    if(!mp.count(tmp3))
    {
        mp[tmp3]=++cnt;
        mp2[cnt]=tmp3;
    }
    v=mp[tmp3];
    vec[u].push_back(v);
    vec[v].push_back(u);

}
void op(int i)
{
    ll number=mp2[ voc[i] ];
    if(number==x[i].a*x[i].b)
    {

        printf("%lld ",x[i].a);
        printf("* %lld = %lld\n",x[i].b,x[i].a*x[i].b);
    }else if(number== x[i].a-x[i].b)
    {

        printf("%lld ",x[i].a);
        printf("- %lld = %lld\n",x[i].b,x[i].a-x[i].b);
    }
    else{

        printf("%lld ",x[i].a);
        printf("+ %lld = %lld\n",x[i].b,x[i].a+x[i].b);
    }
}
int main()
{
    scanf("%d",&n);
    int u,v;
    memset(pre,-1,sizeof(pre));
    cnt=n+1;
    for(int i=1; i<=n; i++)
    {
        scanf("%lld%lld",&x[i].a,&x[i].b);
        solve(i,x[i].a,x[i].b);
    }
    memset(voc,-1,sizeof(voc));
    int ans=0;
    for(int i=1; i<=n; i++)
    {
        memset(vis,0,sizeof(vis));
        ans+=find(i);
    }
    if(ans!=n)
    {   
        printf("impossible\n");
        return 0;
    }
    for(int i=1; i<=n; i++)
    {
        op(i);
    }

    return 0;
}