結果

問題 No.114 遠い未来
ユーザー heno239heno239
提出日時 2022-10-13 10:34:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,243 ms / 5,000 ms
コード長 8,222 bytes
コンパイル時間 2,983 ms
コンパイル使用メモリ 178,528 KB
実行使用メモリ 22,728 KB
最終ジャッジ日時 2024-06-26 11:54:54
合計ジャッジ時間 9,748 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
20,296 KB
testcase_01 AC 428 ms
22,724 KB
testcase_02 AC 316 ms
20,036 KB
testcase_03 AC 62 ms
19,912 KB
testcase_04 AC 14 ms
19,912 KB
testcase_05 AC 16 ms
20,040 KB
testcase_06 AC 629 ms
19,912 KB
testcase_07 AC 13 ms
19,912 KB
testcase_08 AC 13 ms
20,040 KB
testcase_09 AC 18 ms
20,164 KB
testcase_10 AC 67 ms
20,676 KB
testcase_11 AC 153 ms
21,324 KB
testcase_12 AC 421 ms
22,600 KB
testcase_13 AC 409 ms
22,728 KB
testcase_14 AC 634 ms
19,912 KB
testcase_15 AC 1,243 ms
20,040 KB
testcase_16 AC 289 ms
19,912 KB
testcase_17 AC 269 ms
20,040 KB
testcase_18 AC 291 ms
20,044 KB
testcase_19 AC 159 ms
19,908 KB
testcase_20 AC 52 ms
20,040 KB
testcase_21 AC 22 ms
20,168 KB
testcase_22 AC 22 ms
19,912 KB
testcase_23 AC 14 ms
20,044 KB
testcase_24 AC 14 ms
20,040 KB
testcase_25 AC 14 ms
19,908 KB
testcase_26 AC 14 ms
20,044 KB
testcase_27 AC 14 ms
20,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//constexpr ll mod = 998244353;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 21;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};

//O(N3^T+N^22^T)
template<typename T>
struct Steiner_Tree {
	int n;
	struct edge {
		int to; T cost;
	};
	vector<vector<edge>> G;
	T sup;
	Steiner_Tree(int _n,T _sup) {
		n = _n; sup = _sup;
		G.resize(n);
	}
	void add_edge(int a, int b, T c) {
		G[a].push_back({ b,c });
		G[b].push_back({ a,c });
	}
	T query(vector<int> ids) {
		if (ids.size() == 1)return 0;
		int las = ids.back(); ids.pop_back();
		int len = ids.size();
		vector<vector<T>> dp((1 << len), vector<T>(n,sup));
		using speP = pair<T, P>;
		priority_queue<speP, vector<speP>, greater<speP>> q;
		rep(i, len) {
			dp[(1 << i)][ids[i]] = 0;
		}
		rep(i, (1 << len)) {
			rep(j, n) {
				if (dp[i][j] == sup)continue;
				q.push({ dp[i][j],{i,j} });
			}
			while (!q.empty()) {
				speP p = q.top(); q.pop();
				int x = p.second.first, y = p.second.second;
				if (dp[x][y] < p.first)continue;
				//next vertice
				for (edge e : G[y]) {
					T nd = e.cost + p.first;
					int nx = x;
					int ny = e.to;
					if (nd < dp[nx][ny]) {
						dp[nx][ny] = nd;
						q.push({ nd,{nx,ny} });
					}
				}
				//merge region
				int ri = (1 << len) - 1 - i;
				for (int b = ri;; b = ri & (b - 1)) {
					if (b == 0)break;
					if (b < i) {
						chmin(dp[i | b][y], dp[i][y] + dp[b][y]);
					}
				}
			}
		}
		return dp[(1 << len) - 1][las];
	}
};
void solve() {
	int n, m, k; cin >> n >> m >> k;
	if (k <= 15) {
		Steiner_Tree<int> st(n,mod);
		rep(i, m) {
			int a, b, c; cin >> a >> b >> c; a--; b--;
			st.add_edge(a, b, c);
		}
		vector<int> v(k);
		rep(i, k) {
			cin >> v[i]; v[i]--;
		}
		int ans = st.query(v);
		cout << ans << "\n";
	}
	else {
		vector<pair<int, P>> vp;
		rep(i, m) {
			int a, b, c; cin >> a >> b >> c; a--; b--;
			vp.push_back({ c,{a,b} });
		}
		sort(all(vp));
		vector<int> v(k);
		rep(i, k) {
			cin >> v[i]; v[i]--;
		}
		vector<int> vr;
		rep(i, n) {
			bool exi = false;
			for (int id : v)if (id == i)exi = true;
			if (!exi) {
				vr.push_back(i);
			}
		}
		int ans = mod;
		vector<bool> exi(n);
		rep(i, (1 << vr.size())) {
			uf u(n);
			vector<int> ids = v;
			rep(j, vr.size())if (i & (1 << j))ids.push_back(vr[j]);
			for (int id : ids)exi[id] = true;
			int sum = 0;
			int cnt = 0;
			for (auto p : vp) {
				int a = p.second.first, b = p.second.second;
				if (exi[a]&&exi[b]&&!u.same(a, b)) {
					cnt++; sum += p.first;
					u.unite(a, b);
					if (cnt == ids.size() - 1)break;
				}
			}
			//cout << "?? " << ids.size() << " " << cnt << "\n";
			if (cnt == ids.size() - 1) {
				chmin(ans, sum);
			}
			for (int id : ids)exi[id] = false;
		}
		cout << ans << "\n";
	}
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0