【网络流】 LA 6395 SurelyYouCongest

先求一遍最短路，然后对每一个相同值的最短路，按所有最短路建边跑网络流，然后累加所有答案即可。。。

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 25005
#define maxm 150005
#define eps 1e-12
#define mod 998244353
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#pragma comment(linker, "/STACK:102400000,102400000")
#define pii pair<int, int> 
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

struct Edge
{
	int v, c, next;
	Edge() {}
	Edge(int v, int c, int next) : v(v), c(c), next(next) {}
}E[maxm];

struct node
{
	int u, dist;
	node() {}
	node(int u, int dist) : u(u), dist(dist) {}
	bool operator < (const node& b) const {
		return dist > b.dist;
	}
};

struct edge
{
	int v, w;
	edge *next;
}*h[maxn], EE[maxm], *edges;

priority_queue<node> q;
queue<int> Q;
vector<pii> v;
vector<int> vec;
int H[maxn], cntE;
int dist[maxn];
int dis[maxn];
int cur[maxn];
int cnt[maxn];
int pre[maxn];
int vis[maxn];
int n, m, m2, s, t, nv, flow;

void init()
{
	v.clear();
	edges = EE;
	cntE = 0;
	memset(h, 0, sizeof h);
	memset(H, -1, sizeof H);
	memset(dist, INF, sizeof dist);
	memset(vis, 0, sizeof vis);
}

void add_edges(int u, int v, int w)
{
	edges->v = v;
	edges->w = w;
	edges->next = h[u];
	h[u] = edges++;
}

void addedges(int u, int v, int c)
{
	E[cntE] = Edge(v, c, H[u]);
	H[u] = cntE++;
	E[cntE] = Edge(u, 0, H[v]);
	H[v] = cntE++;
}

void dijkstra()
{
	dist[1] = 0;
	q.push(node(1, dist[1]));
	while(!q.empty()) {
		int u = q.top().u;
		q.pop();
		if(vis[u]) continue;
		vis[u] = true;
		for(edge *e = h[u]; e; e = e->next) {
			int v = e->v, w = e->w;
			if(dist[v] > dist[u] + w) {
				dist[v] = dist[u] + w;
				q.push(node(v, dist[v]));
			}
		}
	}
}

void bfs()
{
	memset(cnt, 0, sizeof cnt);
	memset(dis, -1, sizeof dis);
	cnt[0] = 1, dis[t] = 0;
	Q.push(t);
	while(!Q.empty()) {
		int u = Q.front();
		Q.pop();
		for(int e = H[u]; ~e; e = E[e].next) {
			int v = E[e].v;
			if(dis[v] == -1) {
				dis[v] = dis[u] + 1;
				cnt[dis[v]]++;
				Q.push(v);
			}
		}
	}
}

int isap()
{
	memcpy(cur, H, sizeof H);
	flow = 0;
	bfs();
	int u = pre[s] = s, e, minv, pos, f;
	while(dis[s] <= nv) {
		if(u == t) {
			f = INF;
			for(int i = s; i != t; i = E[cur[i]].v) if(E[cur[i]].c < f) {
				f = E[cur[i]].c;
				pos = i;
			}
			for(int i = s; i != t; i = E[cur[i]].v) {
				E[cur[i]].c -= f;
				E[cur[i] ^ 1].c += f;
			}
			flow += f;
			u = pos;
		}
		for(e = H[u]; ~e; e = E[e].next) if(E[e].c && dis[E[e].v] + 1 == dis[u]) break;
		if(~e) {
			cur[u] = e;
			pre[E[e].v] = u;
			u = E[e].v;
		}
		else {
			if(--cnt[dis[u]] == 0) break;
			for(e = H[u], minv = nv; ~e; e = E[e].next) if(E[e].c && minv > dis[E[e].v]) {
				minv = dis[E[e].v];
				cur[u] = e;
			}
			dis[u] = minv + 1;
			cnt[dis[u]]++;
			u = pre[u];
		}
	}
	return flow;
}

int solve()
{
	cntE = 0;
	memset(H, -1, sizeof H);
	memset(vis, 0, sizeof vis);
	addedges(s, 1, INF);
	for(int i = 0; i < vec.size(); i++) Q.push(vec[i]), addedges(vec[i], t, 1);
	while(!Q.empty()) {
		int u = Q.front();
		Q.pop();
		if(vis[u]) continue;
		vis[u] = 1;
		for(edge *e = h[u]; e; e = e->next) {
			int v = e->v, w = e->w;
			if(dist[u] == dist[v] + w) {
				addedges(v, u, 1);
				Q.push(v);
			}
		}
	}
	return isap();
}

void work()
{
	s = 0, t = n + 1, nv = t + 1;
	for(int i = 1; i <= m; i++) {
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		add_edges(u, v, w);
		add_edges(v, u, w);
	}
	dijkstra();
	for(int i = 1; i <= m2; i++) {
		int id;
		scanf("%d", &id);
		v.push_back(mp(dist[id], id));
	}
	int ans = 0;
	sort(v.begin(), v.end());
	for(int i = 0; i < v.size(); i++) {
		vec.clear();
		vec.push_back(v[i].second);
		while(i + 1 < v.size() && v[i+1].first == v[i].first) vec.push_back(v[++i].second);
		if(vec.size() == 1) ans++;
		else ans += solve();
	}
	printf("%d\n", ans);
}

int main()
{
	while(scanf("%d%d%d", &n, &m, &m2)!=EOF) {
		init();
		work();
	}
	
	return 0;
}