oj.uz

Submission #163285

# Submission time Handle Problem Language Result Execution time Memory
163285 2019-11-12T11:09:52 Z MvC Cities (BOI16_cities) C++11
100 / 100
 2711 ms 72352 KB 
#include <iostream>
#include <climits>
#include <queue>

using namespace std;
typedef long long int Z;

int n, k, m;
vector<int> imp;
vector<vector<pair<int, Z>>> G;
Z d[32][202020];
Z huge = LLONG_MAX / 3;
bool seen[202020];

int main() {
	cin.sync_with_stdio(false);
	
	cin >> n >> k >> m;
	imp.resize(k);
	for(int i = 0; i < k; ++i) {
		cin >> imp[i];
		--imp[i];
	}
	
	G.resize(n);
	for(int i = 0; i < m; ++i) {
		int a, b;
		Z c;
		cin >> a >> b >> c;
		--a;
		--b;
		G[a].emplace_back(b, c);
		G[b].emplace_back(a, c);
	}
	
	fill((Z*)d, (Z*)d + 32 * 202020, huge);
	
	for(int i = 0; i < k; ++i) {
		d[1 << i][imp[i]] = 0;
	}
	
	priority_queue<pair<Z, int>> Q;
	for(int c = 1; c < (1 << k); ++c) {
		for(int a = 0; a < c; ++a) {
			if((a | c) != c) continue;
			int b = c ^ a;
			if(b > a) continue;
			for(int v = 0; v < n; ++v) {
				d[c][v] = min(d[c][v], d[a][v] + d[b][v]);
			}
		}
		fill(seen, seen + n, false);
		for(int v = 0; v < n; ++v) {
			if(d[c][v] == huge) continue;
			Q.emplace(-d[c][v], v);
		}
		//if(c==(1<<k)-1)return cout<<-Q.top().first<<'\n',0;
		while(!Q.empty()) {
			Z cost = -Q.top().first;
			int v = Q.top().second;
			Q.pop();
			if(seen[v]) continue;
			seen[v] = true;
			for(auto edge : G[v]) {
				Z ec = cost + edge.second;
				if(ec < d[c][edge.first]) {
					d[c][edge.first] = ec;
					Q.emplace(-ec, edge.first);
				}
			}
		}
	}
	
	Z res = huge;
	for(int v = 0; v < n; ++v) {
		res = min(res, d[(1 << k) - 1][v]);
	}
	cout << res << '\n';
	
	return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 50936 KB Output is correct
2 Correct 45 ms 50940 KB Output is correct
3 Correct 44 ms 50908 KB Output is correct
4 Correct 44 ms 50936 KB Output is correct
5 Correct 44 ms 50908 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 745 ms 72248 KB Output is correct
2 Correct 708 ms 71264 KB Output is correct
3 Correct 470 ms 63084 KB Output is correct
4 Correct 152 ms 63436 KB Output is correct
5 Correct 436 ms 72352 KB Output is correct
6 Correct 144 ms 63352 KB Output is correct
7 Correct 51 ms 51192 KB Output is correct
8 Correct 51 ms 51192 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 51192 KB Output is correct
2 Correct 53 ms 51204 KB Output is correct
3 Correct 51 ms 51132 KB Output is correct
4 Correct 48 ms 51192 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1411 ms 72172 KB Output is correct
2 Correct 1398 ms 71384 KB Output is correct
3 Correct 1143 ms 63000 KB Output is correct
4 Correct 918 ms 68972 KB Output is correct
5 Correct 292 ms 64484 KB Output is correct
6 Correct 153 ms 65628 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2711 ms 71148 KB Output is correct
2 Correct 2702 ms 71144 KB Output is correct
3 Correct 2645 ms 70368 KB Output is correct
4 Correct 1982 ms 62964 KB Output is correct
5 Correct 1556 ms 68076 KB Output is correct
6 Correct 468 ms 64096 KB Output is correct
7 Correct 167 ms 64888 KB Output is correct