Rt，我用的是堆优化版本的dijkstra，但是WAWA了。

到底哪里错了捏？求dalao debug

(感觉有点shi山代码)

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<climits>
using namespace std;
typedef pair<int,int> pii;
const int N=1e3+5,inf=INT_MAX;
int n,m;
vector<pii>g1[N],g2[N];//{index,distance}
int dis1[N<<2],dis2[N<<2];
bool vis1[N<<2],vis2[N<<2];

void dijkstra(int s,int *dis,bool *vis,vector<pii>g[N]){
	priority_queue<pii,vector<pii>,greater<pii> >pq;
	for(int i=1;i<=n<<1;i++)dis[i]=INT_MAX;
	for(int i=1;i<=n<<1;i++)vis[i]=false;
	dis[s]=0;
	pq.push({s,0});
	while(!pq.empty()){
		pii tp=pq.top();
		pq.pop();
		int u=tp.first;
		if(vis[u])continue;//If it's been found before, skip it.
		vis[u]=true;
		for(auto i:g[u]){
			int t=i.first,dist=i.second;
		//	cout<<dist<<endl;
			if(!vis[t]&&dis[t]>dis[u]+dist){
				dis[t]=dis[u]+dist;
				pq.push({t,dis[t]});
			}
		}
	}
}
int res;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		g1[u].push_back({v,w});
		g2[v+n].push_back({u+n,w});
	}
	dijkstra(1,dis1,vis1,g1);
	dijkstra(1+n,dis2,vis2,g2);
	for(int i=2;i<=n;i++){
		res+=dis1[i]+dis2[i+n];
	}
	cout<<res<<endl;
	return 0;
}