oj.uz

Submission #147319

# Submission time Handle Problem Language Result Execution time Memory
147319 2019-08-28T19:59:48 Z cerberus Cities (BOI16_cities) C++17
14 / 100
 5981 ms 168784 KB 
/* cerberus97 - Hanit Banga */

#include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>

using namespace std;

#define pb push_back
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL)

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 1e5 + 10, K = 5, S = (1 << K) + 10;
const ll inf = 1e15 + 42;

struct state_t {
	int mask, u;
	ll val;
	bool operator<(const state_t &o) const {
		return val > o.val;
	}
};

int imp[K];
vector<pii> g[N];
vector<int> supermasks[S];
ll dp[S][N];

int main() {
	fast_cin();
	int n, k, m;
	cin >> n >> k >> m;
	for (int i = 0; i < k; ++i) {
		cin >> imp[i];
	}
	for (int i = 0; i < m; ++i) {
		int u, v, w;
		cin >> u >> v >> w;
		g[u].pb({v, w});
		g[v].pb({u, w});
	}
	int tot = (1 << k), all = tot - 1;
	for (int mask = 1; mask < tot; ++mask) {
		for (int u = 1; u <= n; ++u) {
			dp[mask][u] = inf;
		}
	}
	for (int mask = 0; mask < tot; ++mask) {
		if (__builtin_popcount(mask) > 1) {
			supermasks[mask].pb(mask);
			continue;
		}
		for (int smask = mask; smask < tot; ++smask) {
			if ((smask & mask) == mask) {
				supermasks[mask].pb(smask);
			}
		}
	}
	priority_queue<state_t> q;
	for (int i = 0; i < k; ++i) {
		dp[1 << i][imp[i]] = 0;
		q.push({1 << i, imp[i], 0});
	}
	while (!q.empty()) {
		auto cur = q.top();
		q.pop();
		int mask = cur.mask, u = cur.u;
		if (dp[mask][u] != cur.val) {
			continue;
		}
		for (auto &nmask : supermasks[mask]) {
			int extra = nmask ^ mask;
			for (auto &e : g[u]) {
				int v = e.first, w = e.second;
				ll cand = dp[mask][u] + w + dp[extra][v];
				if (cand < dp[nmask][v]) {
					dp[nmask][v] = cand;
					q.push({nmask, v, cand});
				}
			}
		}
	}
	ll ans = inf;
	for (int u = 1; u <= n; ++u) {
		ans = min(ans, dp[all][u]);
	}
	cout << ans << '\n';
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2676 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Incorrect 4 ms 2808 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 877 ms 35112 KB Output is correct
2 Correct 854 ms 34768 KB Output is correct
3 Correct 451 ms 17628 KB Output is correct
4 Correct 107 ms 11748 KB Output is correct
5 Correct 367 ms 19672 KB Output is correct
6 Correct 87 ms 11260 KB Output is correct
7 Correct 8 ms 3064 KB Output is correct
8 Correct 6 ms 2876 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 3700 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2310 ms 57820 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 5981 ms 168784 KB Output isn't correct
2 Halted 0 ms 0 KB -