結果

問題 No.1812 Uribo Road
ユーザー stoqstoq
提出日時 2022-01-14 22:45:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 5,800 bytes
コンパイル時間 4,151 ms
コンパイル使用メモリ 276,232 KB
実行使用メモリ 446,588 KB
最終ジャッジ日時 2024-11-20 13:10:01
合計ジャッジ時間 58,224 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
353,200 KB
testcase_01 AC 70 ms
182,176 KB
testcase_02 AC 69 ms
369,168 KB
testcase_03 AC 77 ms
367,700 KB
testcase_04 AC 68 ms
369,172 KB
testcase_05 AC 67 ms
182,196 KB
testcase_06 AC 69 ms
367,736 KB
testcase_07 AC 69 ms
367,684 KB
testcase_08 AC 86 ms
175,388 KB
testcase_09 AC 104 ms
175,664 KB
testcase_10 AC 80 ms
175,340 KB
testcase_11 AC 77 ms
175,464 KB
testcase_12 TLE -
testcase_13 AC 81 ms
175,700 KB
testcase_14 AC 95 ms
175,624 KB
testcase_15 AC 330 ms
177,924 KB
testcase_16 AC 1,292 ms
176,008 KB
testcase_17 TLE -
testcase_18 AC 958 ms
176,824 KB
testcase_19 TLE -
testcase_20 TLE -
testcase_21 TLE -
testcase_22 TLE -
testcase_23 AC 139 ms
175,664 KB
testcase_24 AC 70 ms
175,256 KB
testcase_25 AC 78 ms
175,656 KB
testcase_26 AC 73 ms
175,360 KB
testcase_27 AC 553 ms
176,048 KB
testcase_28 AC 87 ms
176,024 KB
testcase_29 AC 73 ms
175,316 KB
testcase_30 AC 93 ms
175,476 KB
testcase_31 TLE -
testcase_32 AC 79 ms
175,308 KB
testcase_33 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 1

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
//#include <atcoder/modint>
//#include <atcoder/lazysegtree>
//#include <atcoder/segtree>

using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#pragma region Macros

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(1000010);

#pragma endregion

// -------------------------------

int d[10000 * (1 << 12)];
vector<pair<short, short>> E[10000];
int r[20000];
int c[20000];

void solve() {
  Fill(d, INF);
  int n, m, k;
  cin >> n >> m >> k;
  Fill(r, -1);
  rep(i, k) {
    int t;
    cin >> t, t--;
    r[t] = i;
  }

  rep(i, m) {
    short a, b;
    cin >> a >> b >> c[i];
    a--, b--;
    E[a].push_back({b, i});
    E[b].push_back({a, i});
  }
  smaller_queue<pii> que;
  que.push({0, 0});
  d[0] = 0;
  int i, msk, msk2, num2;
  while (!que.empty()) {
    auto [di, num] = que.top();
    que.pop();
    if (d[num] < di) continue;
    msk = num / n;
    i = num % n;

    for (auto [j, ei] : E[i]) {
      msk2 = msk;
      if (r[ei] != -1) msk2 |= (1 << r[ei]);
      num2 = msk2 * n + j;
      if (chmin(d[num2], d[num] + c[ei])) {
        que.push({d[num2], num2});
      }
    }
  }
  cout << d[n * (1 << k) - 1] << "\n";
}

int main() { solve(); }
0