http://codeforces.com/contest/567/problem/E 就是先判断每条边是不是最短路的桥,如果是,输出YES,否则,看看能否通过修改长度,变成桥。 #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i,n) for(int i=0; i a.d; } }; int n,m,S,T; int fst[100005],nxt[100005],u[100005],v[100005],l[100005],tol; ll dis[100005],rdis[100005]; int rfst[100005],rnxt[100005],ru[100005],rv[100005],rl[100005],rtol; int vis[100005]; ll cnt[100005],rcnt[100005]; void edge(int a,int b,int c) { u[tol] = a; v[tol] = b; l[tol] = c; nxt[tol] = fst[a]; fst[a] = tol++; } void redge(int a,int b,int c) { ru[rtol] = a; rv[rtol] = b; rl[rtol] = c; rnxt[rtol] = rfst[a]; rfst[a] = rtol++; } priority_queue Q; void Dijs(int S,int* fst,int* nxt,int* v,ll* dis,ll* cnt) { for(int i=1; i<=n; i++) dis[i] = INF; dis[S] = 0; mst(vis,0); mst(cnt,0); cnt[S] = 1; Q.push(Point(S,dis[S])); while(!Q.empty()) { Point q = Q.top();Q.pop(); if(vis[q.u]) continue; vis[q.u] = 1; for(int e=fst[q.u]; ~e; e=nxt[e]) if(!vis[v[e]]) { if(dis[v[e]] == dis[q.u] + l[e]) { cnt[v[e]] += cnt[q.u]; cnt[v[e]] %= MOD; } else if(dis[v[e]] > dis[q.u] + l[e]) { dis[v[e]] = dis[q.u] + l[e]; cnt[v[e]] = cnt[q.u]; Q.push(Point(v[e],dis[v[e]])); } } } } int main() { int a,b,c; scanf("%d%d%d%d",&n,&m,&S,&T); tol = rtol = 0; mst(fst,-1);mst(rfst,-1); for(int i=0; i