oj.uz

Submission #969391

# Submission time Handle Problem Language Result Execution time Memory
969391 2024-04-25T05:39:02 Z Spade1 Cities (BOI16_cities) C++14
100 / 100
 2530 ms 42928 KB 
#pragma once
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pld> vpld;
typedef vector<vi> vvi;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;

template<typename T> using pq = priority_queue<T>;
template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
#define ins insert

template<typename T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MOD = 1e9 + 7;
const int INF = 0x3fffffff;
const ll LINF = 0x1fffffffffffffff;
const char nl = '\n';
const int MX = 1e5 + 3;

vpii adj[MX];
ll dp[MX][32], imp[MX];

void solve() {
  int n, k, m; cin >> n >> k >> m;
  for (int i = 0; i < k; ++i) cin >> imp[i];
  for (int i = 1; i <= m; ++i) {
    int u, v, w; cin >> u >> v >> w;
    adj[u].emplace_back(v, w); adj[v].emplace_back(u, w);
  }
  
  for (int i = 1; i <= n; ++i) for (int mask = 0; mask < 32; ++mask) dp[i][mask] = LINF;
  //base cases
  for (int i = 0; i < k; ++i) dp[imp[i]][(1<<i)] = 0;
  for (int bitmask = 0; bitmask < (1<<k); ++bitmask) {
      for (int j = 1; j < bitmask; j<<=1) {
        if (bitmask & j) {
          for (int i = 1; i <= n; ++i) ckmin(dp[i][bitmask], dp[i][bitmask^j] + dp[i][j]);
      }
    }

    pqg<pll> pq;
    for (int i = 1; i <= n; ++i) if (dp[i][bitmask] != LINF) pq.emplace(dp[i][bitmask], i);
    while (!pq.empty()) {
      auto [W, a] = pq.top(); pq.pop();
      if (dp[a][bitmask] < W) continue;
      for (auto [b, w] : adj[a]) {
        if (ckmin(dp[b][bitmask], dp[a][bitmask] + w)) pq.emplace(dp[b][bitmask], b);
      }
    }
  }

  ll ans = LINF;
  for (int i = 1; i <= n; ++i) ckmin(ans, dp[i][(1<<k)-1]);
  cout << ans << nl;
}

int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0); cin.tie(NULL);
  int t = 1;
  // cin >> t;
  while (t--) { solve(); }
  return 0;
}

Compilation message

cities.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
cities.cpp: In function 'void solve()':
cities.cpp:69:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   69 |       auto [W, a] = pq.top(); pq.pop();
      |            ^
cities.cpp:71:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   71 |       for (auto [b, w] : adj[a]) {
      |                 ^

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 1 ms 5724 KB Output is correct
3 Correct 1 ms 5720 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 1 ms 5724 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 41768 KB Output is correct
2 Correct 551 ms 42008 KB Output is correct
3 Correct 292 ms 35156 KB Output is correct
4 Correct 45 ms 10504 KB Output is correct
5 Correct 241 ms 40492 KB Output is correct
6 Correct 43 ms 10576 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 3 ms 5980 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5980 KB Output is correct
2 Correct 6 ms 5928 KB Output is correct
3 Correct 4 ms 5720 KB Output is correct
4 Correct 4 ms 5980 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1219 ms 42928 KB Output is correct
2 Correct 1169 ms 42484 KB Output is correct
3 Correct 703 ms 35740 KB Output is correct
4 Correct 556 ms 27460 KB Output is correct
5 Correct 120 ms 13524 KB Output is correct
6 Correct 50 ms 12368 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2515 ms 42620 KB Output is correct
2 Correct 2530 ms 42628 KB Output is correct
3 Correct 2372 ms 42300 KB Output is correct
4 Correct 1643 ms 35232 KB Output is correct
5 Correct 1156 ms 27364 KB Output is correct
6 Correct 188 ms 13564 KB Output is correct
7 Correct 60 ms 12120 KB Output is correct