Submission #1732721

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,m,a,b,c,li[310][310],dist[310];

int main(){
	cin >> n >> m;
	REP(i,0,m){
		cin >> a >> b >> c;
		li[a-1][b-1]=li[b-1][a-1]=c;
	}
	
	int s=INF;
	REP(i,1,n){
		if(li[0][i]){
			int tmp=li[0][i];
			li[0][i]=li[i][0]=0;
			fill(dist,dist+310,INF);
			
			dist[i]=0;
			pq<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> que;
			pair<int,int> cur=make_pair(0,i);
			que.push(cur);
			while(!que.empty()){
				cur=que.top();
				que.pop();
				
				int from=cur.second;
				REP(i,0,n){
					if(li[from][i]){
						if(dist[i]>dist[from]+li[from][i]){
							dist[i]=dist[from]+li[from][i];
							que.push(make_pair(dist[i],i));
						}
					}
				}
			}
			
			if(dist[0]!=INF) s=min(s,dist[0]+tmp);
			li[0][i]=li[i][0]=tmp;
		}
	}
		
	
	cout << (s==INF?-1:s) << endl;
	return 0;
}

Submission Info

Judge Result