UVALIVE 3645 Objective: Berlin

最大流 。以航班为节点进行最大流。 容量限制进行拆点。 如果时间地点满足可以建一条边。 具体看代码。变量名被修改过了。一开始的变量名可能比较容易看懂

但CE了。可能与库里的变量重复了。

AC代码

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
#define MAXN 15050
const int INF = 0x3f3f3f3f ;
struct node
{
    int u,v,next;
    int cap,flow;
}edge[];
int cnt,N,M;
int head[MAXN];
int ans;
string stpos,edpos,sti,eti;
map<string,int>place;
struct flight
{
    int s,t;
    int statime,ndtime;
    int num;
}src[MAXN];
int cas,lasttime,a[MAXN];
queue<int>q;
void addedge(int u, int v, int cap)
{
    edge[cnt].u = u;
    edge[cnt].v = v;
    edge[cnt].cap = cap;
    edge[cnt].flow = ;
    edge[cnt].next = head[u];
    head[u] = cnt++;

    edge[cnt].u = v;
    edge[cnt].v = u;
    edge[cnt].cap = ;
    edge[cnt].flow = ;
    edge[cnt].next = head[v];
    head[v] = cnt++;
}
void read()
{
    place.clear();
    cas = ;
    cin >> stpos >> edpos;
    place[stpos] = cas++; place[edpos] = cas++;
    cin >> eti;
    lasttime = ((eti[] - '') *  + eti[] - '') *  + (eti[] - '') *  + eti[] - '';
    cin >> M;
    for (int i = ; i <= M; i++)
    {
        cin >> stpos >> edpos;
        if (!place[stpos]) place[stpos] = cas++;
        if (!place[edpos]) place[edpos] = cas++;
        cin >> src[i].num;
        cin >> sti >> eti;
        src[i].statime = ((sti[] - '') *  + sti[] - '') *  + (sti[] - '') *  + sti[] - '';
        src[i].ndtime = ((eti[] - '') *  + eti[] - '') *  + (eti[] -'') *  + eti[] - '';
        src[i].s = place[stpos];
        src[i].t = place[edpos];
    }
}
void build()
{
    memset(head,-,sizeof(head));
    cnt = ;
    for (int i = ; i <= M; i++)
    {
        if (src[i].s == ) addedge(,i,INF);
        if (src[i].t ==  && src[i].ndtime <= lasttime) addedge(i + M,M *  + ,INF);
        addedge(i, i + M, src[i].num);
        for (int j = ; j <= M; j++)
        {
            if (i == j)continue;
            if (src[i].t == src[j].s && src[i].ndtime +  <= src[j].statime) addedge(i + M, j,INF);
        }
    }
}
int Edmonds_karp(int source,int target)
{
    while (!q.empty()) q.pop();
    int p[MAXN];
    int F = ;
    while (true)
    {
       memset(p,-,sizeof(p));
       q.push(source);
       memset(a,,sizeof(a));
       a[source] = INF;
       while (!q.empty())
       {
           int u = q.front(); q.pop();
           for (int i = head[u]; i != -; i = edge[i].next)
           {
               int v = edge[i].v;
               if (!a[v] && edge[i].cap > edge[i].flow)
               {
                   a[v] = min(a[u],edge[i].cap - edge[i].flow);
                   p[v] = i;
                   q.push(v);
               }
           }
       }
       if (a[target] == ) break;
       for (int i = p[target]; i != -; i = p[edge[i].u])
       {
           edge[i].flow += a[target];
           edge[i ^ ].flow -= a[target];
       }
       F += a[target];
    }
    return F;
}
int main()
{
    //freopen("sample.txt","r",stdin);
    while (scanf("%d",&N) != EOF)
    {
        read();
        build();
        printf("%d\n",Edmonds_karp(,  * M + ));
    }
    return ;
}

CE代码也放在这里容易看懂一些

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
#define MAXN 15050
const int INF = 0x3f3f3f3f ;
struct node
{
    int u,v,next;
    int cap,flow;
}edge[];
int cnt,N,M;
int head[MAXN];
int ans;
string stpos,edpos,stime,etime;
map<string,int>place;
struct flight
{
    int s,t;
    int sttime,edtime;
    int num;
}src[MAXN];
int cas,lasttime,a[MAXN];
queue<int>q;
void addedge(int u, int v, int cap)
{
    edge[cnt].u = u;
    edge[cnt].v = v;
    edge[cnt].cap = cap;
    edge[cnt].flow = ;
    edge[cnt].next = head[u];
    head[u] = cnt++;

    edge[cnt].u = v;
    edge[cnt].v = u;
    edge[cnt].cap = ;
    edge[cnt].flow = ;
    edge[cnt].next = head[v];
    head[v] = cnt++;
}
void read()
{
    place.clear();
    cas = ;
    cin >> stpos >> edpos;
    place[stpos] = cas++; place[edpos] = cas++;
    cin >> etime;
    lasttime = ((etime[] - '') *  + etime[] - '') *  + (etime[] - '') *  + etime[] - '';
    cin >> M;
    for (int i = ; i <= M; i++)
    {
        cin >> stpos >> edpos;
        if (!place[stpos]) place[stpos] = cas++;
        if (!place[edpos]) place[edpos] = cas++;
        cin >> src[i].num;
        cin >> stime >> etime;
        src[i].sttime = ((stime[] - '') *  + stime[] - '') *  + (stime[] - '') *  + stime[] - '';
        src[i].edtime = ((etime[] - '') *  + etime[] - '') *  + (etime[] - '') *  + etime[] - '';
        src[i].s = place[stpos];
        src[i].t = place[edpos];
    }
}
void build()
{
    memset(head,-,sizeof(head));
    cnt = ;
    for (int i = ; i <= M; i++)
    {
        if (src[i].s == ) addedge(,i,INF);
        if (src[i].t ==  && src[i].edtime <= lasttime) addedge(i + M,M *  + ,INF);
        addedge(i, i + M, src[i].num);
        for (int j = ; j <= M; j++)
        {
            if (i == j)continue;
            if (src[i].t == src[j].s && src[i].edtime +  <= src[j].edtime) addedge(i + M, j,INF);
        }
    }
}
int Edmonds_karp(int source,int target)
{
    while (!q.empty()) q.pop();
    int p[MAXN];
    int F = ;
    while (true)
    {
       memset(p,-,sizeof(p));
       q.push(source);
       memset(a,,sizeof(a));
       a[source] = INF;
       while (!q.empty())
       {
           int u = q.front(); q.pop();
           for (int i = head[u]; i != -; i = edge[i].next)
           {
               int v = edge[i].v;
               if (!a[v] && edge[i].cap > edge[i].flow)
               {
                   a[v] = min(a[u],edge[i].cap - edge[i].flow);
                   p[v] = i;
                   q.push(v);
               }
           }
       }
       if (a[target] == ) break;
       for (int i = p[target]; i != -; i = p[edge[i].u])
       {
           edge[i].flow += a[target];
           edge[i ^ ].flow -= a[target];
       }
       F += a[target];
    }
    return F;
}
int main()
{
    //freopen("sample.txt","r",stdin);
    while (scanf("%d",&N) != EOF)
    {
        read();
        build();
        printf("%d\n",Edmonds_karp(,  * M + ));
    }
    return ;
}