結果
| 問題 | No.1812 Uribo Road |
| ユーザー |
 heno239
|
| 提出日時 | 2022-01-14 22:05:03 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 148 ms / 5,000 ms |
| コード長 | 5,699 bytes |
| コンパイル時間 | 2,894 ms |
| コンパイル使用メモリ | 179,392 KB |
| 最終ジャッジ日時 | 2025-01-27 11:30:59 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 30 |
ソースコード
#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 longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;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;}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; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += 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 << 20;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;}typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-8;const ld pi = acosl(-1.0);int dx[4] = { 1,0,-1,0 };int dy[4] = { 0,1,0,-1 };//-----------------------------------------/////////////////////////////////struct edge {int to, cost;};ll dp[1 << 12][12][2];void solve() {int n, m, k; cin >> n >> m >> k;assert(n <= 10000);assert(k <= 12);vector<int> r(k);rep(i, k) {cin >> r[i]; r[i]--;}vector<int> a(m), b(m), c(m);vector<vector<edge>> G(n);rep(i, m) {cin >> a[i] >> b[i] >> c[i]; a[i]--; b[i]--;G[a[i]].push_back({ b[i],c[i] });G[b[i]].push_back({ a[i],c[i] });}vector<int> vs;vs.push_back(0);vs.push_back(n - 1);rep(i, k) {int id = r[i];vs.push_back(a[id]);vs.push_back(b[id]);}sort(all(vs));vs.erase(unique(all(vs)), vs.end());rep(i, vs.size()) {assert(vs[i] >= 0 && vs[i] < n);}vector<vector<ll>> dist(vs.size(), vector<ll>(n));vector<vector<ll>> cost(vs.size(), vector<ll>(vs.size()));vector<vector<int>> loc(k, vector<int>(2));rep(i, k) {loc[i][0] = lower_bound(all(vs), a[r[i]]) - vs.begin();loc[i][1] = lower_bound(all(vs), b[r[i]]) - vs.begin();}rep(i, vs.size()) {fill(all(dist[i]), INF);priority_queue<LP, vector<LP>, greater<LP>> q;q.push({ 0,vs[i] });dist[i][vs[i]] = 0;while (!q.empty()) {LP p = q.top(); q.pop();if (p.first > dist[i][p.second])continue;for (edge e : G[p.second]) {ll nd = p.first + e.cost;if (nd < dist[i][e.to]) {dist[i][e.to] = nd;q.push({ nd,e.to });}}}rep(j, vs.size())cost[i][j] = dist[i][vs[j]];}rep(i, (1 << k))rep(j,k)rep(l, 2)dp[i][j][l] = INF;rep(i, k)rep(j,2) {dp[(1 << i)][i][j] = cost[0][loc[i][j^1]]+c[r[i]];}rep(i, (1 << k))rep(j, k)rep(l,2) {if (dp[i][j][l] == INF)continue;rep(to, k)rep(y,2) {if (i & (1 << to))continue;int ni = i ^ (1 << to);int nj = to;int ny = y;ll sum = dp[i][j][l] + cost[loc[j][l]][loc[to][y ^ 1]] + c[r[to]];chmin(dp[ni][nj][ny], sum);}}ll ans = INF;rep(j, k)rep(l,2) {ll sum = dp[(1 << k) - 1][j][l] + cost[loc[j][l]][vs.size()-1];chmin(ans, sum);}cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(10);//init_f();//init();//while(true)//useexpr();//int t; cin >> t; rep(i, t)solve();return 0;}