/
0596.test.cpp
51 lines (42 loc) · 988 Bytes
/
0596.test.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0596
#include<bits/stdc++.h>
using namespace std;
#define call_from_test
#include "../../graph/bfs.cpp"
#include "../../tools/chminmax.cpp"
#undef call_from_test
signed main(){
int n,k;
cin>>n>>k;
vector<int> cs(n),rs(n);
for(int i=0;i<n;i++) cin>>cs[i]>>rs[i];
vector<vector<int> > G(n);
for(int i=0;i<k;i++){
int x,y;
cin>>x>>y;
x--;y--;
G[x].emplace_back(y);
G[y].emplace_back(x);
}
vector< vector<int> > di(n);
for(int i=0;i<n;i++) di[i]=bfs(i,G);
const int INF = 1e9;
vector<int> dp(n,INF);
vector<int> used(n,0);
dp[0]=0;
for(int i=0;i<n;i++){
int u=-1;
for(int j=0;j<n;j++){
if(used[j]||dp[j]==INF) continue;
if(u<0||dp[u]>dp[j]) u=j;
}
if(u<0) break;
used[u]=1;
for(int j=0;j<n;j++){
if(di[u][j]>rs[u]) continue;
chmin(dp[j],dp[u]+cs[u]);
}
}
cout<<dp[n-1]<<endl;
return 0;
}