Selecting Courses POJ - 2239（我是沙雕吧 按时间点建边 || 匹配水题）

呃呃呃呃呃

把每个课给了INF个容量。。。。我是沙雕把。。。。emm。。。。这题就是做着玩。。。呃呃呃别当真。。。。

#include <iostream>

#include <cstdio>

#include <sstream>

#include <cstring>

#include <map>

#include <cctype>

#include <set>

#include <vector>

#include <stack>

#include <queue>

#include <algorithm>

#include <cmath>

#include <bitset>

#define rap(i, a, n) for(int i=a; i<=n; i++)

#define rep(i, a, n) for(int i=a; i<n; i++)

#define lap(i, a, n) for(int i=n; i>=a; i--)

#define lep(i, a, n) for(int i=n; i>a; i--)

#define rd(a) scanf("%d", &a)

#define rlld(a) scanf("%lld", &a)

#define rc(a) scanf("%c", &a)

#define rs(a) scanf("%s", a)

#define rb(a) scanf("%lf", &a)

#define rf(a) scanf("%f", &a)

#define pd(a) printf("%d\n", a)

#define plld(a) printf("%lld\n", a)

#define pc(a) printf("%c\n", a)

#define ps(a) printf("%s\n", a)

#define MOD 2018

#define LL long long

#define ULL unsigned long long

#define Pair pair<int, int>

#define mem(a, b) memset(a, b, sizeof(a))

#define _  ios_base::sync_with_stdio(0),cin.tie(0)

//freopen("1.txt", "r", stdin);

using namespace std;

const int maxn = 1e5 + , INF = 0x7fffffff;

int head[maxn], cur[maxn], d[maxn], nex[maxn << ];

int n, m, s, t;

int cnt;

struct node

{

    int u, v, c;

}Node[maxn << ];

void add_(int u, int v, int c)

{

    Node[cnt].u = u;

    Node[cnt].v = v;

    Node[cnt].c = c;

    nex[cnt] = head[u];

    head[u] = cnt++;

}

void add(int u, int v, int c)

{

    add_(u, v, c);

    add_(v, u, );

}

bool bfs()

{

    queue<int> Q;

    mem(d, );

    Q.push(s);

    d[s] = ;

    while(!Q.empty())

    {

        int u = Q.front(); Q.pop();

        for(int i = head[u]; i != -; i = nex[i])

        {

            int v = Node[i].v;

            if(!d[v] && Node[i].c > )

            {

                d[v] = d[u] + ;

                Q.push(v);

                if(v == t) return ;

            }

        }

    }

    return d[t] != ;

}

int dfs(int u, int cap)

{

    int ret = ;

    if(u == t || cap == ) return cap;

    for(int &i = cur[u]; i != -; i = nex[i])

    {

        int v = Node[i].v;

        if(d[v] == d[u] +  && Node[i].c > )

        {

            int V = dfs(v, min(Node[i].c, cap));

            Node[i].c -= V;

            Node[i ^ ].c += V;

            ret += V;

            cap -= V;

            if(cap == ) break;

        }

    }

    if(cap > ) d[u] = -;

    return ret;

}

int Dinic()

{

    int ans = ;

    while(bfs())

    {

        memcpy(cur, head, sizeof head);

        ans += dfs(s, INF);

    }

   return ans;

}

int main()

{

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

    {

        mem(head, -);

        cnt = ;

        int u, v;

        s = , t = ;

        rap(i, , n)

        {

            rd(m);

            add(s,  + i, );

            rap(j, , m)

            {

                rd(u), rd(v);

                add( + i, (u - ) *  + v, );

            }

        }

        rap(i, , )

            add(i, t, );

        cout << Dinic() << endl;

    }

    return ;

}