제출 #862939

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862939		Vanilla	Cities (BOI16_cities)	C++17	37 / 100	6061 ms	41680 KiB

cities

#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {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);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return (a + b - 1) / b;}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 1e5 + 2;
vector <pii64> ad [maxn];
int64 dp[40][maxn];
int a [maxn];
int n,k,m;

void solve(int id){

  return;
}


int main(){
  ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10);
  cin >> n >> k >> m;
  for (int i = 0; i < k; i++){
    cin >> a[i];
  }
  for (int i = 0; i < m; i++){
    int a,b,c;
    cin >> a >> b >> c;
    ad[a].push_back({b, c});
    ad[b].push_back({a, c});
  }
  for (int i = 1; i < (1 << k); i++){
    for (int j = 1; j <= n; j++){
      dp[i][j] = 1e18;
    }
  }
  for (int i = 0; i < k; i++){
    dp[1 << i][a[i]] = 0;
  }
  for (int i = 1; i < (1 << k); i++){
    for (int j = 1; j <= n; j++){
      if (i & (1 << j)) {
        for (int u = 1; u <= n; u++){
          dp[i][u] = min(dp[i][u], dp[i ^ (1 << j)][u] + dp[1 << j][u]);
        }
      }
    }
    priority_queue<pii64> s;
    for (int j = 1; j <= n; j++){
      if (dp[i][j] < 1e18) s.push({-dp[i][j], j});
    }
    while (!s.empty()) {
      int u = s.top().second;
      s.pop();
      for (auto [v, dist]: ad[u]) {
        if (dist + dp[i][u] < dp[i][v]) {
          dp[i][v] = dp[i][u] + dist;
          s.push({dp[i][v], v});
        }
      }
    }
  }
  int64 rs = 1e18;
  for (int i = 1; i <= n; i++) rs = min(rs, dp[(1 << k) - 1][i]);
  cout << rs;
  return 0;
}

• Subtask 1: 22 / 22
• Subtask 2: 0 / 14
• Subtask 3: 15 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 26