제출 #1059605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059605		vjudge1	Cities (BOI16_cities)	C++17	74 / 100	6080 ms	242652 KiB

cities

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ii pair<int, int>
#define tp tuple<int, int, int>
#define fi first
#define se second
#define all(x) x.begin(), x.end()

const int N = 2e5 + 5,
          INF = 2e16,
          mod = 1e9 + 7;
// code

int n, k, m, a[6], dp[N][33];
vector<ii> ad[N];
priority_queue<tp, vector<tp>, greater<>> pq;

int id(int i){
  for(int j = 0;  j< k; j++) if(a[j] == i) return j;
  return -1;
}

bool check(int msk1, int msk2){
  for(int i = 0; i < (1 << k); i++) if((msk1 >> i & 1) && (msk2 >> i & 1)) return false;
  return true;
}

int32_t main(){
  cin.tie(0)->sync_with_stdio(0);
//  #define task "test"
//  if(fopen(task ".inp", "r")){
//    freopen(task ".inp", "r", stdin);
//    freopen(task ".out", "w", stdout);
//  }

  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});
  }

  sort(a, a + k);

  for(int i = 1; i <= n; i++)
    for(int j = 1; j < (1 << k); j++) dp[i][j] = INF;

  for(int i = 0; i < k; i++){
    dp[a[i]][1 << i] = 0;
    pq.push({0, 1 << i, a[i]});
  }

  while(pq.size()){
    auto [d, msk, u] = pq.top(); pq.pop();

    if(d != dp[u][msk]) continue;

//    cout << u << " " << d << " " << msk << endl;

    for(auto [v, c] : ad[u]){
      int bit = id(v);
      if(bit != -1 && !(msk >> bit & 1))
        if(d + c < dp[v][msk|(1 << bit)])
      pq.push({dp[v][msk|(1 << bit)] = d + c, msk|(1 << bit), v});

      for(int _msk = 0; _msk < (1 << k); _msk++)
        if(check(msk, _msk) && d + c + dp[v][_msk] < dp[v][msk|_msk])
          pq.push({dp[v][msk|_msk] = d + c + dp[v][_msk], msk|_msk, v});
    }
  }
  int res = INF;
  for(int i = 1; i <= n; i++){
    res = min(res, dp[i][(1 << k)-1]);
//    cerr << dp[i][(1 << k)-1] << endl;
  }
  cout << res << endl;

  return 0;
}

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