题目大意
给定一张
n
个点,
给定一个起点
s
和一个终点
Data Constraint
n≤2000,m≤10000
题解
先把未确定的边单独抽出来,重新编号。
然后二分一个位置
mid
,将编号为
[1,mid]
的边权全部设为1,
[mid,Cnt]
的边权设为
+∞
,跑一次最短路。找到一个最大的
mid
使得最短路恰好大于给定值。
然后再二分
mid
这条边的边权即可。
SRC
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std ;
#define N 1000 + 10
#define M 10000 + 10
typedef long long ll ;
const ll inf = 2e14 ;
struct Edge {
int u , v , h ;
ll w ;
} E[M] ;
bool vis[N] , flag = 1 ;
ll W[2*M] , Dist[N] ;
int Node[2*M] , Next[2*M] , Head[N] , tot = 1 ;
int Un[M] , D[20*M] ;
int n , m , L , s , t ;
int Cnt ;
void link( int u , int v , ll w ) {
Node[++tot] = v ;
Next[tot] = Head[u] ;
W[tot] = w ;
Head[u] = tot ;
}
void SPFA() {
int i = 0 , j = 1 ;
memset( Dist , 63 , sizeof(Dist) ) ;
Dist[s] = 0 ;
D[1] = s ;
vis[s] = 1 ;
while ( i < j ) {
i ++ ;
int now = D[i] ;
for (int p = Head[now] ; p ; p = Next[p] ) {
if ( Dist[Node[p]] > Dist[now] + W[p] ) {
Dist[Node[p]] = Dist[now] + W[p] ;
if ( !vis[Node[p]] ) {
vis[Node[p]] = 1 ;
D[++j] = Node[p] ;
if ( Dist[D[j]] < Dist[D[i+1]] ) swap( D[i+1] , D[j] ) ;
}
}
}
vis[now] = 0 ;
}
}
bool Check1( int k ) {
for (int i = 1 ; i <= k ; i ++ ) {
int x = Un[i] ;
E[x].w = 1 ;
W[E[x].h] = W[E[x].h^1] = E[x].w ;
}
for (int i = k + 1 ; i <= Cnt ; i ++ ) {
int x = Un[i] ;
E[x].w = inf ;
W[E[x].h] = W[E[x].h^1] = E[x].w ;
}
SPFA() ;
return Dist[t] <= L ;
}
bool Check2( int x , ll len ) {
E[x].w = len ;
W[E[x].h] = W[E[x].h^1] = E[x].w ;
SPFA() ;
return Dist[t] <= L ;
}
void Search( int x ) {
ll l = 0 , r = L , ans = inf ;
while ( l <= r ) {
ll mid = (l + r) / 2 ;
if ( Check2(x,mid) ) l = mid + 1 , ans = mid ;
else r = mid - 1 ;
}
E[x].w = ans ;
W[E[x].h] = W[E[x].h^1] = E[x].w ;
SPFA() ;
if ( Dist[t] != L ) flag = 0 ;
}
int main() {
scanf( "%d%d%d%d%d" , &n , &m , &L , &s , &t ) ;
for (int i = 1 ; i <= m ; i ++ ) {
scanf( "%d%d%I64d" , &E[i].u , &E[i].v , &E[i].w ) ;
E[i].h = tot + 1 ;
link( E[i].u , E[i].v , E[i].w ) ;
link( E[i].v , E[i].u , E[i].w ) ;
if ( E[i].w == 0 ) Un[++Cnt] = i ;
}
int l = 0 , r = Cnt , num = -1 ;
while ( l <= r ) {
int mid = (l + r) / 2 ;
if ( Check1(mid) ) r = mid - 1 , num = mid ;
else l = mid + 1 ;
}
if ( num == -1 ) { printf( "NO\n" ) ; return 0 ; }
Search( Un[num] ) ;
if ( !flag ) { printf( "NO\n" ) ; return 0 ; }
printf( "YES\n" ) ;
for (int i = 1 ; i <= m ; i ++ ) printf( "%d %d %I64d\n" , E[i].u , E[i].v , E[i].w ) ;
return 0 ;
}
以上.