添加链接描述
64MB可以开1e7左右数组大小
边的长度为权 边的变换就是乘车换乘次数
主要四位车站编号
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+9,M=1e4+9;
int h[M],e[N],ne[N],w[N],len[N],idx;
void add(int a,int b,int c,int id){
w[idx]=c,len[idx]=id;
e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}
typedef pair<int,int> pii;
int dist[M],vis[M],cnt[M],pre[M];
string out[M];
string get(int x){
string p=to_string(x);
while(p.size()<4){
p='0'+p;
}
return p;
}
void dijkstra(int st,int ed){
priority_queue<pii,vector<pii>,greater<pii>>q;
q.push({0,st});
memset(dist,0x3f,sizeof dist);
memset(vis,0,sizeof vis);
memset(cnt,0,sizeof cnt);
dist[st]=0;
while(q.size()){
auto p=q.top();
q.pop();
int d=p.first,x=p.second;
if(vis[x])continue;
vis[x]=1;
if(x==ed)break;
for(int i=h[x];~i;i=ne[i]){
int j=e[i];
if(dist[j]>d+w[i]){
dist[j]=d+w[i];
pre[j]=x;
cnt[j]=cnt[x]+1;
q.push({dist[j],j});
out[j]="Take Line#"+to_string(len[i])+" from "+get(x)+" to "+get(j)+".";
}
else if(dist[j]==d+w[i]){
if(cnt[j]>cnt[x]+1){
cnt[j]=cnt[x]+1;
pre[j]=x;
out[j]="Take Line#"+to_string(len[i])+" from "+get(x)+" to "+get(j);
}
}
}
}
cout<<dist[ed]<<endl;
vector<string>ans;
for(int i=ed;i!=st;i=pre[i]){
// cout<<"--"<<endl;
ans.push_back(out[i]);
}
for(int i=ans.size()-1;i>=0;i--){
cout<<ans[i]<<endl;
}
}
int main(){
memset(h,-1,sizeof h);
std::ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++){
int m;
cin>>m;
vector<int> v(m);
for(int j=0;j<m;j++){
cin>>v[j];
}
for(int j=0;j<m;j++){
for(int k=0;k<j;k++){
int len=j-k;
if(v[0]==v[m-1])len=min(len,m-len-1);//!!
add(v[j],v[k],len,i);
add(v[k],v[j],len,i);
}
}
}
int q;
cin>>q;
while(q--){
int st,ed;
cin>>st>>ed;
dijkstra(st,ed);
}
return 0;
}