oj.uz

Submission #147323

# Submission time Handle Problem Language Result Execution time Memory
147323 2019-08-28T20:21:07 Z cerberus Cities (BOI16_cities) C++17
74 / 100
 6000 ms 169008 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) {
			for (int smask = mask + 1; smask < tot; ++smask) {
				if ((smask & mask) == mask) {
					supermasks[mask].pb(smask);
				}
			}
		} else {
			for (int i = 0; i < k; ++i) {
				if (!(mask & (1 << i))) {
					supermasks[mask].pb(mask | (1 << i));
				}
			}
		}
	}
	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 &e : g[u]) {
			int v = e.first, w = e.second;
			ll cand = dp[mask][u] + w;
			if (cand < dp[mask][v]) {
				dp[mask][v] = cand;
				q.push({mask, v, cand});
			}
		}
		for (auto &nmask : supermasks[mask]) {
			int extra = nmask ^ mask;
			ll cand = dp[mask][u] + dp[extra][u];
			if (cand < dp[nmask][u]) {
				dp[nmask][u] = cand;
				q.push({nmask, u, cand});
			}
		}
	}
	ll ans = inf;
	for (int u = 1; u <= n; ++u) {
		ans = min(ans, dp[all][u]);
	}
	cout << ans << '\n';
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2812 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 795 ms 30988 KB Output is correct
2 Correct 710 ms 22528 KB Output is correct
3 Correct 472 ms 15572 KB Output is correct
4 Correct 89 ms 7780 KB Output is correct
5 Correct 317 ms 15472 KB Output is correct
6 Correct 84 ms 7544 KB Output is correct
7 Correct 7 ms 3064 KB Output is correct
8 Correct 6 ms 2916 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3700 KB Output is correct
2 Correct 11 ms 3292 KB Output is correct
3 Correct 8 ms 3192 KB Output is correct
4 Correct 9 ms 3320 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2139 ms 53648 KB Output is correct
2 Correct 2000 ms 53300 KB Output is correct
3 Correct 1402 ms 34256 KB Output is correct
4 Correct 1065 ms 30960 KB Output is correct
5 Correct 254 ms 16988 KB Output is correct
6 Correct 99 ms 9588 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5622 ms 99096 KB Output is correct
2 Execution timed out 6063 ms 169008 KB Time limit exceeded
3 Halted 0 ms 0 KB -