poj 3281 dining（ 最大流 ）

这里很显然是拆点。但是在呢么拆呢

之前做的时候，是拆的牛，今天拆的食物和水，果断错了，按照我的建图方法，S连牛，牛连水，水连食物，食物连E，很显然，无法保证从牛出的到水，然后从水走出的边无法保证是之前那个牛喜欢的食物，因此错！

正常的建图，S连水，水连牛，牛拆点，牛连食物，食物连E！

细节见代码：

#include <cstdio>
#include <cstring>

int N, F, D, map[500][500];
const int inf = 9999999;

int Max_flow( int s, int e ) {
    int ret = inf, pre[500], que[450*450], ans = 0;
    bool isq[450];
    while(1) {
        bool flag = false;
        int head = 0, tail = 0, num = N+N+F+D+1;
        memset(isq, 0, sizeof(isq) );
        for( int i = 0; i <= num; ++i ) pre[i] = -1;
        que[tail++] = s;
        isq[s] = true;
        while( head < tail ) {
            int tt = que[head++];
            if( tt == e ) {
                flag = true;
                break;
            }
            for( int i = 0; i <= num; ++i ) {
               if( !isq[i] && map[tt][i] ) {
                  pre[i] = tt;
                  isq[i] = true;
                  que[tail++] = i;
               }
            }
        }
        if ( !flag ) break; 

        for ( int i = e; i != s; i = pre[i] ) if( map[pre[i]][i] < ret ) ret = map[pre[i]][i];
        for ( int i = e; i != s; i = pre[i] ) map[pre[i]][i] -= ret, map[i][pre[i]] += ret;

        ans += ret;
    }
    return ans;
}

int main()
{
    while ( scanf("%d%d%d", &N, &F, &D) != EOF ) {
       int Fi, Di, f, d;
       int s = 0, e = N + N + F + D + 1, sc = 1, ec = N + N, sf = ec + 1, ef = ec + F, sd = ef + 1, ed = ef + D;
       memset( map, 0, sizeof(map) );
       for ( int i = 1; i <= ec; i += 2 ) {
           map[i][i+1]++;
           scanf("%d%d", &Fi, &Di);
           for ( int j = 1; j <= Fi; ++j ) {
               scanf("%d", &f);
               ++map[sf+f-1][i];
           }
           for ( int j = 1; j <= Di; ++j ) {
               scanf("%d", &d);
               ++map[i+1][sd+d-1];
           }
       }
       for ( int i = sf; i <= ef; ++i ) map[s][i]++;
       for ( int i = sd; i <= ed; ++i ) map[i][e]++;
       //for( int i = 0; i <= N + N + F + D + 1; ++i , printf("\n")) 
         //  for ( int j = 0; j <= N+N+F+D+1; ++j ) printf(" %d", map[i][j]);
       printf("%d\n", Max_flow(s, e));
    }
}