(大概有n久没写博客了,懒癌又犯了。。。PS上个周的个人赛这个周周末才补,我要懒死了。。打了一个周的口袋妖怪白金,还被某康嘲讽了好久。。
开始打有难度的个人赛了。
第一场个人赛,XJBG暴过去一个题,网络流从来没做过,而且也建不出图来就放弃了,现在补出来了。其实只要建出图来就很好做了。
题意:给你一个起始城市,结束城市,结束时间,并要求必须从起始城市开始并在结束时间之前到达结束城市。给你一堆飞机,每个飞机有最多的载客量,起始时间,结束时间,并且如果在一个城市中转的话要耗费30分钟,求最大流。
思路:将每一个航班看成一个点,对第i个航班,连一条i * 2到i * 2 + 1的边,对于不同的航班i和j,判断i能否到j和j能否到i,如果能,相应连一条INF的边,再将起始和结束连上,跑一边最大流出结果。
代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
const int maxn = 5005 * 2;
const int INF = 0x7fffffff;
struct Edge
{
int from, to, cap, flow;
};
struct Node
{
char u[105], v[105];
int c, st, ed;
int id1, id2;
}e[maxn / 2];
struct Dinic
{
int n, m, s, t;
vector<Edge> edges;
vector<int> G[maxn];
bool vis[maxn];
int cur[maxn];
int d[maxn];
void init(int maxn)
{
edges.clear();
for(int i = 0; i < maxn; ++i)
G[i].clear();
}
void AddEdge(int from, int to, int cap)
{
edges.push_back({from, to, cap, 0});
edges.push_back({to, from, 0, 0});
m = edges.size();
G[from].push_back(m - 2);
G[to].push_back(m - 1);
}
bool BFS()
{
// memset(d, 0x3f3f3f3f, sizeof(d));
memset(vis, false, sizeof(vis));
queue<int> q;
q.push(s);
d[s] = 0;
vis[s] = true;
while(!q.empty())
{
int x = q.front();q.pop();
for(int i = 0; i < G[x].size(); ++i)
{
Edge &e = edges[G[x][i]];
if(!vis[e.to] && e.cap > e.flow)
{
vis[e.to] = true;
d[e.to] = d[x] + 1;
q.push(e.to);
}
}
}
return vis[t];
}
int DFS(int x, int a)
{
if(x == t || a == 0)
return a;
int flow = 0, f;
for(int &i = cur[x]; i < G[x].size(); ++i)
{
Edge &e = edges[G[x][i]];
if(d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap - e.flow))) > 0)
{
e.flow += f;
edges[G[x][i] ^ 1].flow -= f;
flow += f;
a -= f;
if(a == 0)
break;
}
}
return flow;
}
int Maxflow(int s, int t)
{
this->s = s;
this->t = t;
int flow = 0;
while(BFS())
{
// cout << "****" << endl;
memset(cur, 0, sizeof(cur));
flow += DFS(s, INF);
// cout << "flow == " << flow << endl;
}
return flow;
}
}dinic;
int main()
{
while(~scanf("%d", &dinic.n))
{
char s[105], t[105];
int h;
scanf("%s%s", s, t);
scanf("%d", &h);
int m;
scanf("%d", &m);
dinic.init(m * 2 + 5);
int n = 2;
for(int i = 0; i < m; ++i)
{
scanf("%s%s%d%d%d", e[i].u, e[i].v, &e[i].c, &e[i].st, &e[i].ed);
e[i].id1 = n++;
e[i].id2 = n++;
if(strcmp(e[i].u, s) == 0)
{
// cout << "***" << endl;
dinic.AddEdge(0, e[i].id1, INF);
}
if(strcmp(e[i].v, t) == 0)
{
int st = e[i].ed % 100 + e[i].ed / 100 * 60;
int ed = h % 100 + h / 100 * 60;
if(ed - st >= 0)
{
// cout << "****" << endl;
dinic.AddEdge(e[i].id2, 1, INF);
}
}
dinic.AddEdge(e[i].id1, e[i].id2, e[i].c);
}
for(int i = 0; i < m; ++i)
{
for(int j = i + 1; j < m; ++j)
{
if(strcmp(e[i].u, e[j].v) == 0)
{
int st = e[i].st;
int ed = e[j].ed;
int t1 = st % 100 + st / 100 * 60;
int t2 = ed % 100 + ed / 100 * 60;
if(t1 - t2 >= 30)
{
dinic.AddEdge(e[j].id2, e[i].id1, INF);
}
}
if(strcmp(e[i].v, e[j].u) == 0)
{
int st = e[j].st;
int ed = e[i].ed;
int t1 = st % 100 + st / 100 * 60;
int t2 = ed % 100 + ed / 100 * 60;
if(t1 - t2 >= 30)
{
dinic.AddEdge(e[i].id2, e[j].id1, INF);
}
}
}
}
int ans = dinic.Maxflow(0, 1);
printf("%d\n", ans);
}
}