E. Paired Payment(多维最短路dijkstra)

https://codeforces.com/contest/1486/problem/E

题意:

给一张无向图，一次只能同时走两步，权值为两条边的边权和的平方。求1到其他每个点的最短距离。达不到就输出-1

思路：

拆点跑分层图也可以做。这里学习的是最短路的形式。原来的dijkstra最短路只更新最短距离,即dis[i]

这道题需要在原来的基础上多加状态,

观察到这个边权很小，适合做dis的一维状态。

即dis[i][j][num]:从起点到x，上一条边的权值为j,且已经经过了num条边，这个num^1，不断交替，0代表偶数，1代表奇数。

 

 

 if(dis[v][w][now.num^1]>dis[now.id][now.w][now.num]+cost){

                dis[v][w][now.num^1]=dis[now.id][now.w][now.num]+cost;

                que.push({v,w,dis[v][w][now.num^1],now.num^1});
            }

 

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
struct Node{
    LL id,w,val,num;///当前点id,前一条边的权值,到当前的点的最短dis,经过的边数
    friend bool operator <(struct Node A,struct Node B){
        return A.val>B.val;
    }
};
struct Edge{
    LL to,val;
};
LL dis[maxn][55][3];
bool vis[maxn][55][3];
vector<Edge>g[maxn];
LL n,m;
void dij(){
    memset(dis,0x3f,sizeof(dis));
    priority_queue<Node>que;
    dis[1][0][0]=0;
    que.push({1,0,0,0});
    while(!que.empty()){
        Node now=que.top();que.pop();
        if(vis[now.id][now.w][now.num]) continue;
        vis[now.id][now.w][now.num]=1;

        LL x=now.id;
        for(auto i:g[x]){
            LL v=i.to;LL w=i.val;
            LL cost=0;
            if(now.num==1){
                cost=(now.w+w)*(now.w+w);
            }
            
            if(dis[v][w][now.num^1]>dis[now.id][now.w][now.num]+cost){

                dis[v][w][now.num^1]=dis[now.id][now.w][now.num]+cost;

                que.push({v,w,dis[v][w][now.num^1],now.num^1});
            }
        }
    }
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  cin>>n>>m;
  for(LL i=1;i<=m;i++){
    LL u,v,val;cin>>u>>v>>val;
    g[u].push_back({v,val});
    g[v].push_back({u,val});
  }
  dij();
  for(LL i=1;i<=n;i++){
     LL maxv=1e18;
     for(LL j=0;j<=50;j++){
        maxv=min(maxv,dis[i][j][0]);
     }
     if(maxv==1e18){
        cout<<"-1"<<" ";
     }
     else cout<<maxv<<" ";
  }
  cout<<"\n";
return 0;
}