Uva-1161-Objective: Berlin

这个题被分到网络流时序模型中，以航班进行为点进行建图，不过在这里需要拆点。拆点后对应连边，流量为其容量。若存在航班可以换乘，则反向连容量为无穷大的边

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<string>
#include<map>
#include<queue>
using namespace std;
const int inf=1<<29;
const int maxn=5100;
const int maxm=1e7+100;
struct Flight
{
    int st_n;
    int des_n;
    int cap;
    int st_t;
    int des_t;
}F[maxn];
int n,m,t;
int st,des,e,head[maxn*2],pnt[maxm],flow[maxm],nxt[maxm],level[maxn*2];
queue<int> q;
map<string,int> s;
void AddEdge(int u,int v,int f)
{
    pnt[e]=v;nxt[e]=head[u];flow[e]=f;head[u]=e++;
    pnt[e]=u;nxt[e]=head[v];flow[e]=0;head[v]=e++;
}
void Build()
{
    memset(head,-1,sizeof(head));
    st=e=0;des=m*2+1;
    for(int i=1;i<=m;i++)
        if(F[i].st_n==1)
            AddEdge(st,i,inf);
    for(int i=1;i<=m;i++)
    {
        AddEdge(i,m+i,F[i].cap);
        for(int j=1;j<=m;j++)
            if(F[i].des_n==F[j].st_n&&F[i].des_t+30<=F[j].st_t)
                AddEdge(i+m,j,inf);
    }
    for(int i=1;i<=m;i++)
        if(F[i].des_n==2&&F[i].des_t<=t)
            AddEdge(m+i,des,inf);
}
bool BFS()
{
    memset(level,0,sizeof(level));
    level[st]=1;
    q.push(st);
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(int i=head[u];i!=-1;i=nxt[i])
            if(flow[i]&&!level[pnt[i]])
            {
                level[pnt[i]]=level[u]+1;
                q.push(pnt[i]);
            }
    }
    return level[des];
}
int DFS(int u,int maxf)
{
    if(u==des||!maxf)
        return maxf;
    for(int i=head[u],t;i!=-1;i=nxt[i])
        if(level[pnt[i]]==level[u]+1&&(t=DFS(pnt[i],min(flow[i],maxf))))
        {
            flow[i]-=t;
            flow[i^1]+=t;
            return t;
        }
    return level[u]=0;
}
void solve()
{
    Build();
    int ans=0;
    while(BFS())
        while(1)
        {
            int val=DFS(st,inf);
            if(!val)
                break;
            ans+=val;
        }
    printf("%d\n",ans);
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        int cnt=0;
        s.clear();
        string city;
        cin>>city;
        s[city]=++cnt;
        cin>>city;
        s[city]=++cnt;
        int val;
        scanf("%d",&val);  
        t=val/100*60+val%100;
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        {
            string city;
            cin>>city;
            if(!s[city])
                s[city]=++cnt;
            F[i].st_n=s[city];
            cin>>city;
            if(!s[city])
                s[city]=++cnt;
            F[i].des_n=s[city];
            scanf("%d%d%d",&F[i].cap,&F[i].st_t,&F[i].des_t);
            F[i].st_t=F[i].st_t/100*60+F[i].st_t%100;
            F[i].des_t=F[i].des_t/100*60+F[i].des_t%100;
        }
        solve();
    } 
    return 0;
}