HDU6805 Deliver the Cake

Solution

建图：
对每一个点建立两个点，每两个点连四条双向边。
dijkstra跑的时候加一个点是否是’L’和‘R’的判断。

Code

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#pragma GCC optimize(2)

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const double eps = 1e-8;
const int NINF = 0xc0c0c0c0;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const ll mod  = 1e9 + 7;
const ll N = 4e5 + 5;

int n,m,s,t,x;
ll d[N];
char a[N];
int vis[N];

struct edge{
	int to;
	ll cost;
};

struct node{
    ll first;
    int second;
    bool operator < (const node& T) const{
        return fi>T.fi;
    }
};

vector<edge> G[N];

inline void add(int x,int y,int z){
	G[x].push_back({y,z});
	G[y].push_back({x,z});
}

void dijkstra(int s){
    priority_queue<node> q;
	for(int i=0;i<=2*n+1;i++) d[i]=1e18;
    memset(vis,0,sizeof(vis));
	d[s]=0;
	q.push({0,s});
	while(!q.empty()){
		node t=q.top();q.pop();
		int v=t.se;
		if(vis[v]) continue;
        vis[v]=true;
		for(int i=0;i<G[v].size();i++){
			edge e=G[v][i];
            ll tmp=0;
            if(a[v]=='R'&&a[e.to]=='L') tmp=x;
            if(a[v]=='L'&&a[e.to]=='R') tmp=x;
			if(!vis[e.to] && d[e.to]>d[v]+e.cost+tmp){
				d[e.to]=d[v]+e.cost+tmp;
				q.push({d[e.to],e.to});
			}
		}
	}
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;cin>>T;
    while(T--){
    	cin>>n>>m>>s>>t>>x>>a+1;
    	for(int i=0;i<=2*n+1;i++) G[i].clear();
    	for(int i=1;i<=n;i++){
    		if(a[i]!='M') a[n+i]=a[i];
    		else a[i]='L',a[n+i]='R';
    	}
    	for(int i=0;i<m;i++){
    		int u,v,w;
    		cin>>u>>v>>w;
    		add(u,v,w);
    		add(u,v+n,w);
    		add(u+n,v,w);
    		add(u+n,v+n,w);
    	}
        a[2*n+1]=' ';
    	add(0,s,0);
    	add(0,s+n,0);
    	add(2*n+1,t,0);
    	add(2*n+1,t+n,0);
    	dijkstra(0);
        cout<<d[2*n+1]<<'\n';
    }
    return 0;
}