-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFCAR
113 lines (83 loc) Β· 2.04 KB
/
FCAR
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<bits/stdc++.h>
using namespace std;
// #define ld long double
// #define ll long long int
#define int long long
#define ll int
#define Dd cout<<1;
#define EE endl
#define RR return
#define pb push_back
const int inf= 1e18;
void solve()
{
int n,m;
cin>>n>>m;
int height[n];
for(int i=0;i<n;i++) cin>>height[i];
int cost[n];
for(int i=0;i<n;i++) cin>>cost[i];
vector<int> adj[n];
for(int i=0;i<m;i++)
{
int x,y; cin>>x>>y;
adj[--x].pb(--y);
adj[y].pb(x);
}
vector<vector<int>> dist(n,vector<int>(2,inf));
// for(int i=0;i<n;i++) dist[i]=1e9;
priority_queue< pair<int,pair<int,int>>,
vector<pair<int,pair<int,int>>>,greater<pair<int,pair<int,int>>> > q;
dist[0][0]=dist[0][1]=cost[0];
q.push({dist[0][0],{0,0}});
q.push({dist[0][1],{0,1}});
while(!q.empty())
{
int d = q.top().first;
int node = q.top().second.first;
int mode = q.top().second.second;
q.pop();
for(auto ch : adj[node])
{
if(height[ch]>=height[node])
{
int sum = dist[node][mode];
if(mode!=0)
sum+= cost[node];
if(dist[ch][0]>sum)
{
dist[ch][0]=sum;
q.push({dist[ch][0],{ch,0}});
}
}
if(height[ch]<=height[node])
{
int sum=dist[node][mode];
if(mode!=1) sum+= cost[node];
if(dist[ch][1]>sum)
{
dist[ch][1]=sum;
q.push({dist[ch][1],{ch,1}});
}
}
}
}
int ans = min(dist[n-1][0],dist[n-1][1]);
if(ans>=inf) ans=-1;
cout<<ans<<EE;
}
signed main()
// int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
for(int tt=1;tt<=t;tt++)
{
solve();
}
// cout<<"mic_check";
return 0;
}