c++邮递员投递经过特定点_luoguP1629 邮递员送信

建一个正向图和反向图，(都存到一个地方，反向图的节点加 n 就好了)，跑两边 Dijskra

#include

using namespace std;

const int N = 1e3 + 10,M = 1e5 + 10,INF = 0x3f3f3f3f;

typedef pair PII;

typedef long long LL;

int e[M*2],ne[M*2],w[M*2],h[N*2],idx,n,m;

LL dist[N*2];

bool st[N*2];

void add(int a,int b,int c) {

e[idx] = b,w[idx] = c,ne[idx] = h[a],h[a] = idx ++;

}

void dij(int s) {

for(int i = 1;i <= n * 2; ++i) dist[i] = INF;

dist[s] = 0;

priority_queue,greater > q;

q.push(make_pair(0,s));

while(q.size()) {

auto ver = q.top().second;

q.pop();

if(st[ver]) continue;

st[ver] = 1;

for(int i = h[ver]; ~i;i = ne[i]) {

int j = e[i];

if(dist[