#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
const int maxn=4040,maxl=500500,S=5;
const ll inf=1e18;
int n,m,q,L,a[maxl],X[maxn],Y[maxn],cost[maxn],mark[maxn];
ll dist[maxn][maxn],seg[maxl][S][S];
vector<pair<int,int> > g[maxn];
pair<int,int> adj[maxn/2][maxn/2][S],b[maxl][S];
void Get_Ans(){
ll ans=inf;
f(i,0,S){
f(j,0,S){
minm(ans,seg[1][i][j]);
}
}
cout<<(ans==inf ? -1 : ans)<<endl;
}
void dijikastra(int id){
fill(mark, mark + maxn, 0);
fill(dist[id], dist[id] + maxn, inf);
dist[id][id] = cost[id];
set<pair<int,int> > s;
f(i,0,2*m) s.insert({dist[id][i],i});
while(s.size()){
int x = (*s.begin()).S, u = Y[x], last = X[x];
s.erase(*s.begin());
if(mark[u] == 2) continue ;
mark[u]++;
for(auto v : g[u]){
if(v.F == last) continue ;
if(dist[id][x] + cost[v.S] < dist[id][v.S]){
s.erase({dist[id][v.S],v.S});
dist[id][v.S] = dist[id][x] + cost[v.S];
s.insert({dist[id][v.S],v.S});
}
}
}
}
void Make(){
f(i,0,2*m+1) dist[i][2*m]=dist[2*m][i]=inf;
dist[2 * m][2 * m]=inf;
f(i,0,2*m) dijikastra(i);
f(u,1,n+1){
f(v,1,n+1){
if(u == v) continue ;
int x = 2 * m, y = 2 * m, e = 0, p = 0;
for(auto adju : g[u]){
for(auto adjv : g[v]){
adjv.S ^= 1;
if(dist[adju.S][adjv.S] < dist[x][y]){
x = adju.S, y = adjv.S;
}
}
}
adj[u][v][0] = {x, y};
e = 2 * m, p = 2 * m;
for(auto adju : g[u]){
for(auto adjv : g[v]){
adjv.S ^= 1;
if(adju.S != x && dist[adju.S][adjv.S] < dist[e][p]){
e = adju.S, p = adjv.S;
}
}
}
adj[u][v][1] = {e, p};
e = 2 * m, p = 2 * m;
for(auto adju : g[u]){
for(auto adjv : g[v]){
adjv.S ^= 1;
if(adju.S != x && adjv.S != adj[u][v][1].S && dist[adju.S][adjv.S] < dist[e][p]){
e = adju.S, p = adjv.S;
}
}
}
adj[u][v][2] = {e, p};
e = 2 * m, p = 2 * m;
for(auto adju : g[u]){
for(auto adjv : g[v]){
adjv.S ^= 1;
if(adjv.S != y && dist[adju.S][adjv.S] < dist[e][p]){
e = adju.S, p = adjv.S;
}
}
}
adj[u][v][3] = {e, p};
e = 2 * m, p = 2 * m;
for(auto adju : g[u]){
for(auto adjv : g[v]){
adjv.S ^= 1;
if(adju.S != adj[u][v][3].F && adjv.S != y && dist[adju.S][adjv.S] < dist[e][p]){
e = adju.S, p = adjv.S;
}
}
}
adj[u][v][4] = {e, p};
}
}
}
void merge(int id,int id0,int id1,int l,int mid,int r){
f(i,0,S) f(j,0,S) seg[id][i][j]=inf;
f(i,0,S){
f(j,0,S){
f(k,0,S){
f(p,0,S){
if(b[mid-1][j].S/2!=b[mid][k].F/2){
minm(seg[id][i][p],seg[id0][i][j]+seg[id1][k][p]);
}
}
}
}
}
}
void build(int id=1, int l = 0, int r = L - 1){
if(l + 1 == r){
f(i,0,S){
f(j,0,S){
seg[id][i][j]=dist[b[l][i].F][b[l][j].S];
}
}
return ;
}
int mid = (l + r) >> 1;
build(id * 2 + 0, l, mid);
build(id * 2 + 1, mid, r);
merge(id, id * 2 + 0, id * 2 + 1, l, mid, r);
}
void change(int id,int l,int r,int x){
if(r<x || x<l) return ;
if(l+1==r){
f(i,0,S){
f(j,0,S){
seg[id][i][j]=(i==j ? dist[b[l][i].F][b[l][i].S] : inf);
}
}
return ;
}
int mid=(l+r)>>1;
change(id*2+0,l,mid,x);
change(id*2+1,mid,r,x);
merge(id, id * 2 + 0, id * 2 + 1, l, mid, r);
}
main(){
cin>>n>>m>>q>>L;
f(i,0,2*m){
if((i&1) == 0){
cin >> X[i] >> Y[i] >> cost[i];
X[i+1] = Y[i], Y[i+1] = X[i];
cost[i+1] = cost[i];
}
g[X[i]].pb({Y[i], i});
}
Make();
f(i,0,L){
cin >> a[i];
if(i > 0){
f(j,0,S){
b[i-1][j] = adj[a[i-1]][a[i]][j];
}
}
}
build();
f(i,0,q){
int x,val;
cin>>x>>val; x--;
a[x]=val;
if(x>0){
f(j,0,S){
b[x-1][j]=adj[a[x-1]][a[x]][j];
}
}
if(x<L-1){
f(j,0,S){
b[x][j]=adj[a[x]][a[x+1]][j];
}
}
change(1,0,L-1,x);
Get_Ans();
}
}
Compilation message
wild_boar.cpp:171:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
171 | main(){
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
716 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
1100 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
716 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
1100 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
716 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
1100 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
716 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
1100 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
