//\\__ hr1212 __//\\
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mi;
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b)
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define pi(a) printf(" %d",a)
#define nl printf("\n");
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define f(i,a,b) for(i=a;i<b;i++)
#define rf(i,a,b) for(i=a;i>=b;i--)
#define clr(x,a) memset(x,a,sizeof(x))
#define MAX 1000100
#define MOD 1000000007
int n,m,p[30][30],a[30][30],sz[30][30];
vector<char> w;
void solve(int x,int y){
if(x!=y)
solve(x,p[x][y]);
w.pb((char)(y+'A'));
}
int main(){
int r,k,i,c=0,x=0,y=0,j,t,l,z,x1=0,y1=0;
ll ans=0;
char ch1[2],ch2[2];
sii(n,m);
f(i,0,n)
f(j,0,n){
p[i][j]=i;
sz[i][j]=1;
a[i][j]=1e9;
}
f(i,0,m){
scanf("%s",ch1);
scanf("%s",ch2);
si(x);
a[ch1[0]-'A'][ch2[0]-'A']=x;
a[ch2[0]-'A'][ch1[0]-'A']=x;
}
f(k,0,n){
f(i,0,n){
f(j,0,n){
if(a[i][j]>a[i][k]+a[k][j]){
a[i][j]=a[i][k]+a[k][j];
p[i][j]=p[k][j];
sz[i][j]=sz[k][j]+1;
}
else if(a[i][j]==a[i][k]+a[k][j]){
if(sz[i][j]>sz[k][j]+1){
sz[i][j]=sz[k][j]+1;
p[i][j]=p[k][j];
}
}
}
}
}
si(z);
while(z--){
w.clear();
scanf("%s",ch1);
scanf("%s",ch2);
x=ch1[0]-'A';y=ch2[0]-'A';
solve(x,y);
f(i,0,w.size())
if(i!=w.size()-1)
printf("%c ",w[i]);
else
printf("%c\n",w[i]);
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mi;
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b)
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define pi(a) printf(" %d",a)
#define nl printf("\n");
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define f(i,a,b) for(i=a;i<b;i++)
#define rf(i,a,b) for(i=a;i>=b;i--)
#define clr(x,a) memset(x,a,sizeof(x))
#define MAX 1000100
#define MOD 1000000007
int n,m,p[30][30],a[30][30],sz[30][30];
vector<char> w;
void solve(int x,int y){
if(x!=y)
solve(x,p[x][y]);
w.pb((char)(y+'A'));
}
int main(){
int r,k,i,c=0,x=0,y=0,j,t,l,z,x1=0,y1=0;
ll ans=0;
char ch1[2],ch2[2];
sii(n,m);
f(i,0,n)
f(j,0,n){
p[i][j]=i;
sz[i][j]=1;
a[i][j]=1e9;
}
f(i,0,m){
scanf("%s",ch1);
scanf("%s",ch2);
si(x);
a[ch1[0]-'A'][ch2[0]-'A']=x;
a[ch2[0]-'A'][ch1[0]-'A']=x;
}
f(k,0,n){
f(i,0,n){
f(j,0,n){
if(a[i][j]>a[i][k]+a[k][j]){
a[i][j]=a[i][k]+a[k][j];
p[i][j]=p[k][j];
sz[i][j]=sz[k][j]+1;
}
else if(a[i][j]==a[i][k]+a[k][j]){
if(sz[i][j]>sz[k][j]+1){
sz[i][j]=sz[k][j]+1;
p[i][j]=p[k][j];
}
}
}
}
}
si(z);
while(z--){
w.clear();
scanf("%s",ch1);
scanf("%s",ch2);
x=ch1[0]-'A';y=ch2[0]-'A';
solve(x,y);
f(i,0,w.size())
if(i!=w.size()-1)
printf("%c ",w[i]);
else
printf("%c\n",w[i]);
}
return 0;
}
No comments:
Post a Comment