把每个点拆成两个点，分别表示黑洞和白洞，然后按题意模拟加边跑最短路即可。
# include <cstdio> # include <cstring> # include <cstdlib> # include <iostream> # include <vector> # include <queue> # include <stack> # include <map> # include <set> # include <cmath> # include <algorithm> using namespace std; # define lowbit(x) ((x)&(-x)) # define pi 3.1415926535 # define eps 1e-9 # define MOD 1000000007 # define INF 1000000000 # define mem(a,b) memset(a,b,sizeof(a)) # define FOR(i,a,n) for(int i=a; i<=n; ++i) # define FO(i,a,n) for(int i=a; i<n; ++i) # define bug puts("H"); # define lch p<<1,l,mid # define rch p<<1|1,mid+1,r # define mp make_pair # define pb push_back typedef pair<int,int> PII; typedef vector<int> VI; # pragma comment(linker, "/STACK:1024000000,1024000000") typedef long long LL; int Scan() { int res=0, flag=0; char ch; if((ch=getchar())=='-') flag=1; else if(ch>='0'&&ch<='9') res=ch-'0'; while((ch=getchar())>='0'&&ch<='9') res=res*10+(ch-'0'); return flag?-res:res; } void Out(int a) { if(a<0) {putchar('-'); a=-a;} if(a>=10) Out(a/10); putchar(a%10+'0'); } const int N=5005; //Code begin... int w[N], mark[N], s[N], dist[N<<1]; struct qnode{ int v, c; qnode(int _v=0, int _c=0):v(_v),c(_c){} bool operator <(const qnode &r)const{return c>r.c;} }; struct Edge{ int v, cost; Edge(int _v=0, int _cost=0):v(_v),cost(_cost){} }; vector<Edge>E[N<<1]; bool vis[N<<1]; priority_queue<qnode>que; void Dijkstra(int n, int start){ mem(vis,0); FOR(i,1,n) dist[i]=INF; dist[start]=0; que.push(qnode(start,0)); qnode tmp; while (!que.empty()) { tmp=que.top(); que.pop(); int u=tmp.v; if (vis[u]) continue; vis[u]=true; FO(i,0,E[u].size()) { int v=E[u][i].v, cost=E[u][i].cost; if (!vis[v]&&dist[v]>dist[u]+cost) dist[v]=dist[u]+cost, que.push(qnode(v,dist[v])); } } } void addedge(int u, int v, int w){E[u].pb(Edge(v,w));} int main () { int n, m, u, v, cost; scanf("%d%d",&n,&m); FOR(i,1,n) scanf("%d",mark+i); FOR(i,1,n) scanf("%d",w+i); FOR(i,1,n) scanf("%d",s+i), addedge(i,n+i,0), addedge(n+i,i,s[i]); FOR(i,1,m) { scanf("%d%d%d",&u,&v,&cost); if (mark[u]==mark[v]) addedge(u,n+v,cost), addedge(n+u,v,cost); else { int delta=abs(w[u]-w[v]); addedge(u,v,max(0,cost-delta)); addedge(n+u,n+v,cost+delta); } } Dijkstra(n<<1,mark[1]?n+1:1); printf("%d ",min(dist[n],dist[n<<1])); return 0; }