結果

問題 No.1812 Uribo Road
コンテスト
ユーザー HIR180
提出日時 2022-01-14 21:45:54
言語 C++17
(gcc 13.3.0 + boost 1.89.0)
結果
AC  
実行時間 112 ms / 5,000 ms
コード長 10,179 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 3,490 ms
コンパイル使用メモリ 211,976 KB
最終ジャッジ日時 2025-01-27 11:13:03
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
//#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#define pcnt(x) __builtin_popcountll(x)

#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	//don't make x negative!
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 1
ll F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;
	R[_sz-1] = modpow(F[_sz-1], mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;
}
ll C(int a,int b){
	if(b < 0 || a < b) return 0;
	return F[a]*R[b]%mod*R[a-b]%mod;
}
template<class T> using mat = vc<vc<T>>;
template<class T>
mat<T> make_e(int n, int m, T v){
	mat<T>ret(n, vc<T>(m));
	rep(i, min(n, m)) ret[i][i] = v;
	return ret;
}
template<class T>
mat<T> operator+(mat<T> a, mat<T> b){
	assert(a.size() == b.size());
	if(a.size()) assert(a[0].size() == b[0].size());
	
	rep(i, a.size()) rep(j, a[0].size()){
		a[i][j] += b[i][j];
		if(a[i][j] >= mod) a[i][j] -= mod;
	}
	
	return a;
}
template<class T>
mat<T> operator-(mat<T> a, mat<T> b){
	assert(a.size() == b.size());
	if(a.size()) assert(a[0].size() == b[0].size());
	
	rep(i, a.size()) rep(j, a[0].size()){
		a[i][j] += mod - b[i][j];
		if(a[i][j] >= mod) a[i][j] -= mod;
	}
	
	return a;
}
template<class T>
mat<T> operator*(mat<T> a, mat<T> b){
	if(a.empty() || b.empty()) return mat<T>();
	int n = a.size();
	int m = b[0].size();
	int len = a[0].size();
	assert(len == b.size());
	mat<T>ret(n);
	rep(i, n) ret[i] = vc<T>(m);
	
	rep(i, n) rep(j, len) rep(k, m){
		ll add = (ll)(a[i][j]) * b[j][k];
		add %= mod;
		ret[i][k] += add;
		if(ret[i][k] >= mod) ret[i][k] -= mod;
	}
	return ret;
}
template<class T>
ll det(mat<T>m){
	int n = m.size();
	assert(n > 0 && m[0].size() == n);
	
	ll ret = 1;
	for(int j=0;j<n;j++){
		int pivot=-1;
		for(int i=j;i<n;i++){
			if(m[i][j]){
				pivot = i; break;
			}
		}
		if(pivot == -1) return 0;
     	if(j != pivot){
			rep(k,n) swap(m[j][k],m[pivot][k]);
        	ret = -ret;
        }
        ret = ret * m[j][j] % mod;
		ll rev = modpow(m[j][j],mod-2);
		for(int i=j+1;i<n;i++){
			if(m[i][j]){
				ll gg = (ll)m[i][j]*rev%mod;
				for(int g=j;g<n;g++){
					m[i][g] -= (ll)m[j][g]*gg%mod;
					if(m[i][g]<0) m[i][g]+=mod;
				}
			}
		}
	}
	return (mod+ret)%mod;
}
//vc<vc<int>>bs;
template<class T>
vc<T>AxB(mat<T>A, vc<T>b){
	int r = A.size(), c = A[0].size();
	assert(b.size() == r);
	
	int nxt = 0, free = 0;
	vc<T>ret(c, 0);
	
	rep(j, c){
		int pivot = -1;
		for(int i=nxt;i<r;i++){
			if(A[i][j]){
				pivot = i; break;
			}
		}
		if(pivot == -1){
			free ++;
			continue;
		}
     	if(nxt != pivot){
			rep(k, c) swap(A[nxt][k],A[pivot][k]);
        	swap(b[nxt], b[pivot]);
        }
		ll rev = modpow(A[nxt][j],mod-2);
		for(int g=j;g<c;g++){
			A[nxt][g] = A[nxt][g]*rev%mod;
		}
		b[nxt] = b[nxt]*rev%mod;
		rep(i, r){
			if(i != nxt and A[i][j]){
				T gg = A[i][j];
				for(int g=j;g<c;g++){
					A[i][g] -= A[nxt][g]*gg%mod;
					if(A[i][g]<0) A[i][g]+=mod;
				}
				b[i] -= b[nxt]*gg%mod;
				if(b[i]<0) b[i]+=mod;
			}
		}
		nxt ++;
	}
	vc<int>fix(c, 0);
	vc<int>top(nxt);
	rep(i, nxt){
		rep(j, c){
			if(A[i][j] != 0){
				top[i] = j;
				fix[j] = 1;
				ret[j] = b[i];
				break;
			}
		}
	}
	//error
	for(int i=nxt;i<r;i++) if(b[i] != 0) return vc<T>();
	//get basis
	/*vc<vc<T>>basis(free);
	int id = 0;
	rep(j, c){
		if(fix[j] == 1) continue;
		vc<T>tmp(c, 0);
		tmp[j] = 1;
		for(int i=0;i<nxt;i++){
			tmp[top[i]] = (mod-A[i][j])%mod;
		}
		basis[id++] = tmp;
	}
	bs = basis;*/
	return ret;
}
//A...n*n matrix or n*2n matrix, left = A and right = E
template<class T>
mat<T>inv(mat<T>A){
	int r = A.size(), c = A[0].size();
	if(c == r){
		rep(i, r){
			A[i].resize(r+r, 0);
			rep(j, r) A[i][r+j] = (i == j);
		}
		c += r;
	}
	assert(c == r+r);
	rep(j, r){
		int pivot = -1;
		for(int i=j;i<r;i++){
			if(A[i][j]){
				pivot = i; break;
			}
		}
		if(pivot == -1){
			return mat<T>();
		}
     	if(j != pivot){
			rep(k, c) swap(A[j][k],A[pivot][k]);
        }
		ll rev = modpow(A[j][j],mod-2);
		for(int g=j;g<c;g++){
			A[j][g] = A[j][g]*rev%mod;
		}
		rep(i, r){
			if(i != j and A[i][j]){
				T gg = A[i][j];
				for(int g=j;g<c;g++){
					A[i][g] -= A[j][g]*gg%mod;
					if(A[i][g]<0) A[i][g]+=mod;
				}
			}
		}
	}
	mat<int>ret = make_e(r, r, 0LL);
	rep(i, r) rep(j, r){
		assert(A[i][j] == (i==j));
		ret[i][j] = A[i][r+j];
	}
	return ret;
}
//#define sz_dd 1005
//int dd[sz_dd][sz_dd];
int D[30][10005], zant;
struct dijk{
	vc<vc<pair<int, ll>>>e;
	vc<int>id;
	vc<ll>dist;
	//頂点の上限
	int n;
	
	dijk(){}
	//有向辺のリストを与える
	dijk(vc<pair<ll,P>>v){
		for(auto a:v){
			id.pb(a.b.a);
			id.pb(a.b.b);
		}
		//非連結の場合、ちゃんとここで指定する必要あり
		n = 10005;
		for(int i=0;i<id.size();i++) {
			chmax(n, id[i]+1);
		}
		e.resize(n);
		for(auto a:v){
			int x = a.b.a;
			int y = a.b.b;
			e[x].eb(y, a.a);
		}
	}
	//if t is not reachable, return -1
	ll calc(int s, int t){
		dist.assign(n, 8e18);
		priority_queue<pair<ll, int>, vc<pair<ll, int>>, greater<pair<ll, int>>>que;
		dist[s] = 0;
		que.push(mp(0, s));
		
		while(!que.empty()){
			auto q = que.top(); que.pop();
			if(dist[q.b] != q.a) continue;
			
			for(auto ed:e[q.b]){
				if(dist[ed.a] > q.a + ed.b){
					dist[ed.a] = q.a + ed.b;
					que.push(mp(dist[ed.a], ed.a));
				}
			}
		}
		for(int i=0;i<n;i++) D[zant][i] = dist[i];
		if(dist[t] > 7e18) return -1;
		return dist[t];
	}
	//if t is not reachable, return {}
	vector<int>pat(int s, int t){
		dist.assign(n, 8e18);
		priority_queue<pair<ll, int>, vc<pair<ll, int>>, greater<pair<ll, int>>>que;
		dist[s] = 0;
		que.push(mp(0, s));
		vector<int>pre(n, -1);
		
		while(!que.empty()){
			auto q = que.top(); que.pop();
			if(dist[q.b] != q.a) continue;
			
			for(auto ed:e[q.b]){
				if(dist[ed.a] > q.a + ed.b){
					dist[ed.a] = q.a + ed.b;
					pre[ed.a] = q.b;
					que.push(mp(dist[ed.a], ed.a));
				}
			}
		}
		if(dist[t] > 7e18) return vector<int>();
		vector<int>ret;
		while(1){
			ret.pb(t);
			if(s == t) break;
			t = pre[t];
		}
		reverse(ret.begin(), ret.end());
		return ret;
	}
};
int n, m, k;
vc<int>imp;

int dp[30][4096];
void solve(){
	vc<pair<ll,P>>vv;
	cin>>n>>m>>k;
	imp.pb(1);imp.pb(n);
	vc<int>rd;
	rep(i,k){
		int r;cin>>r; rd.pb(r);
	}
	vc<P1>info(k);
	repn(i,m){
		int a,b,c;cin>>a>>b>>c;
		vv.eb(c, mp(a, b));
		vv.eb(c, mp(b, a));
		rep(x, rd.size()){
			if(rd[x] == i){
				imp.eb(a);
				imp.eb(b);
				info[x] = mp(c, mp(a, b));
			}
		}
	}
	dijk d(vv);
	SORT(imp); ERASE(imp);
	rep(i, imp.size()){
		zant = i;
		auto f = d.calc(imp[i], 1);
	}
	rep(i,30)rep(j,4096)dp[i][j]=1e18;
	dp[0][0] = 0;
	rep(j, (1<<k)){
		rep(zan, imp.size()){
			if(dp[zan][j] > 5e17) continue;
			rep(nxt, k){
				if(((j>>nxt)&1)) continue;
				int u = info[nxt].b.a, v = info[nxt].b.b;
				int cs = info[nxt].a;
				chmin(dp[POSL(imp, v)][j+(1<<nxt)], dp[zan][j]+D[zan][u]+cs);
				chmin(dp[POSL(imp, u)][j+(1<<nxt)], dp[zan][j]+D[zan][v]+cs);
			}
		}
	}
	int ans = 1e18;
	rep(zan, imp.size()) chmin(ans, dp[zan][(1<<k)-1] + D[zan][n]);
	o(ans);
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; t = 1; //cin >> t;
	while(t--) solve();
}
0