poj 3189 二分+枚举+最大流

Steady Cow Assignment

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4267		Accepted: 1503

Description

Farmer John's N (1 <= N <= 1000) cows each reside in one of B (1 <= B <= 20) barns which, of course, have limited capacity. Some cows really like their current barn, and some are not so happy.

FJ would like to rearrange the cows such that the cows are as equally happy as possible, even if that means all the cows hate their assigned barn.

Each cow gives FJ the order in which she prefers the barns. A cow's happiness with a particular assignment is her ranking of her barn. Your job is to find an assignment of cows to barns such that no barn's capacity is exceeded and the size of the range (i.e., one more than the positive difference between the the highest-ranked barn chosen and that lowest-ranked barn chosen) of barn rankings the cows give their assigned barns is as small as possible.

Input

Line 1: Two space-separated integers, N and B

Lines 2..N+1: Each line contains B space-separated integers which are exactly 1..B sorted into some order. The first integer on line i+1 is the number of the cow i's top-choice barn, the second integer on that line is the number of the i'th cow's second-choice barn, and so on.

Line N+2: B space-separated integers, respectively the capacity of the first barn, then the capacity of the second, and so on. The sum of these numbers is guaranteed to be at least N.

Output

Line 1: One integer, the size of the minumum range of barn rankings the cows give their assigned barns, including the endpoints.

Sample Input

6 4
1 2 3 4
2 3 1 4
4 2 3 1
3 1 2 4
1 3 4 2
1 4 2 3
2 1 3 2

Sample Output

2

Hint

Explanation of the sample:

Each cow can be assigned to her first or second choice: barn 1 gets cows 1 and 5, barn 2 gets cow 2, barn 3 gets cow 4, and barn 4 gets cows 3 and 6.

Source

//有n(<=1000)头牛, b(<=20)个牛棚, 每个牛棚有自己的容量, 每头牛按喜好程度为b个牛棚打上不同的分数,
//现在分配牛去牛棚, 设第i头牛对分配的牛棚的喜好值为rank[i],
//问在不挤爆牛棚的前提下, 怎样分配, 使得max{rank[i]}-min{rank[j]}最小
//用两个指针不后退的往前扫，不断求最大流即可
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define M 4100
const int inf=1<<30;
int gap[M],dis[M],pre[M],cur[M];
int NE,NV,sink,source;
int head[M],n,m,rank[M][M],cap[M];
struct Node
{
    int c,pos,next;
} E[999999];
#define FF(i,NV) for(int i=0;i<NV;i++)
int sap(int s,int t)
{
    memset(pre,-1,sizeof(pre));
    memset(dis,0,sizeof(int)*(NV+1));
    memset(gap,0,sizeof(int)*(NV+1));
    FF(i,NV) cur[i] = head[i];
    int u = pre[s] = s,maxflow = 0,aug =inf;
    gap[0] = NV;
    while(dis[s] < NV)
    {
loop:
        for(int &i = cur[u]; i != -1; i = E[i].next)
        {
            int v = E[i].pos;
            if(E[i].c >0&& dis[u] == dis[v] + 1)
            {
                aug=min(aug,E[i].c);
                pre[v] = u;
                u = v;
                if(v == t)
                {
                    maxflow += aug;
                    for(u = pre[u]; v != s; v = u,u = pre[u])
                    {
                        E[cur[u]].c -= aug;
                        E[cur[u]^1].c += aug;
                    }
                    aug = inf;
                }

                goto loop;
            }
        }
        int mindis = NV;
        for(int i = head[u]; i != -1 ; i = E[i].next)
        {
            int v = E[i].pos;
            if(E[i].c && mindis > dis[v])
            {
                cur[u] = i;
                mindis = dis[v];
            }
        }
        if( (--gap[dis[u]]) == 0)break;
        gap[ dis[u] = mindis+1 ] ++;
        u = pre[u];
    }
    return maxflow;
}
void addEdge(int u,int v,int c )
{
    E[NE].c = c;
    E[NE].pos = v;
    E[NE].next = head[u];
    head[u] = NE++;
    E[NE].c = 0;
    E[NE].pos = u;
    E[NE].next = head[v];
    head[v] = NE++;
}
void build_graph(int l,int r)
{

    memset(head,-1,sizeof(head));
    NE= 0;
    for(int i = 1; i <= n; i++)
    {
        for(int j = l; j <= r; j++)
        {
            addEdge(i,n+rank[i][j],inf);
        }
    }
    for(int i = 1; i <= n; i++)
    {
        addEdge(source,i,1);
    }
    for(int i = 1; i <= m; i++)
    {
        addEdge(i+n,sink,cap[i]);
    }
}
void search()
{

    int l = 1,r = 1;
    int mid;
    int ans = m;
    build_graph(l,r);
    while(l <= r && r <= m)
    {
        mid = sap(source,sink);
        if(mid == n)
        {
            if(r - l + 1 < ans) ans = r - l + 1;
            l++;
        }
        else
            r++;
        build_graph(l,r);
    }

    printf("%d\n",ans);
}

int main()
{

    while(scanf("%d%d",&n,&m) != EOF)
    {

        source = 0,sink = n + m + 1;
        NV = sink + 1;

        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
            {
                scanf("%d",&rank[i][j]);

            }

        for(int i = 1; i <= m; i++)
        {
            scanf("%d",&cap[i]);
        }
        search();
    }
//  system("pause");
    return 0;
}
/*
6 4
1 2 3 4
2 3 1 4
4 2 3 1
3 1 2 4
1 3 4 2
1 4 2 3
2 1 3 2
*/