HDU - 6808 Go Running(图论)

一.题意:给出n(1e5)个点,问最少几个斜着的线可以覆盖所有的点

二.分析:用二分图最大匹配即最小点覆盖的性质做题,把每个点当作一条边,点所在的斜线当作点,然后这两条斜线所代表的点直接建一条有向边,然后跑二分图匹配就好了,亲测匈牙利算法会超时,dinic就可以卡着边过去.

三.代码: 

#include <bits/stdc++.h>
#define fi first
#define se second
#define mid (l+r>>1)
#define lo (o<<1)
#define ro (o<<1|1)
using namespace std;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int, int>pii;
struct tri {int x,y,z;};
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
const int N = 5e5 + 10;
const ll mod = 1e9 + 7;
const double PI = acos(0) * 2;

tri edg[N<<1];
int n,m,s,t;
int head[N],head2[N],dep[N],Q[N],edg_cnt;
void add(int a,int b,int c)
{
    edg[edg_cnt]={b,c,head[a]};
    head[a]=edg_cnt++;
    edg[edg_cnt]={a,0,head[b]};
    head[b]=edg_cnt++;
}
bool bfs()
{
    int front=0,tail=0;
    Q[tail++]=s;
    memset(dep,0,sizeof(dep[0])*(n+1));//记得改
    dep[s]=1;
    while(front<tail)
    {
        int u=Q[front++];
        for(int i=head[u];~i;i=edg[i].z)
        {
            int v=edg[i].x;
            if(edg[i].y&&!dep[v])
            {
                dep[v]=dep[u]+1;
                if(v==t)return 1;
                Q[tail++]=v;
            }
        }
    }
    return 0;
}
int dfs(int u,int low)
{
    if(u==t||!low)return low;
    int ret=0;

    for(int &i=head2[u];~i;i=edg[i].z)
    {
        int v=edg[i].x;
        if(dep[v]==dep[u]+1&&edg[i].y)
        {
            int flow=dfs(v,min(low,edg[i].y));
            if(!flow)continue;
            edg[i].y-=flow;
            edg[i^1].y+=flow;
            low-=flow;
            ret+=flow;
            if(!low)break;
        }
    }
    return ret;
}
int dinic()
{
    int ret=0;
    while(bfs())
    {
        //范围需要更改
        for(int i=1;i<=n;i++)head2[i]=head[i];
        ret+=dfs(s,inf);
    }
    return ret;
}
int solve()
{
    cin>>m;
    n=2,s=1,t=2;
    edg_cnt=0;
    memset(head,-1,sizeof(*head)*(m*2+10));
    unordered_map<int,int>c,r;
    while(m--)
    {
        int a,b;
        cin>>a>>b;
        int u=a+b,v=a-b;
        if(!r[u])
        {
            r[u]=++n;
            add(1,n,1);
        }
        if(!c[v])
        {
            c[v]=++n;
            add(n,2,1);
        }
        u=r[u];
        v=c[v];
        add(u,v,1);
    }
    return dinic();
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
//    freopen("in.txt","r",stdin);
    int _;cin>>_;
    while(_--)
    {
        cout<<solve()<<endl;
    }
    return 0;
}