Submission #96234

#	Time	Username	Problem	Language	Result	Execution time	Memory
96234		ics0503	Cities (BOI16_cities)	C++17	100 / 100	2902 ms	49696 KiB

cities

#include<stdio.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
struct xy {
	long long x; int y;
	xy(long long x, int y) : x(x), y(y) {};
	bool operator<(const xy &p)const {
		return x > p.x;
	}
};
vector<xy>edge[121212];
long long D[1 << 5][121212];int L[6];
int  main() {
	int n, m, k; scanf("%d%d%d", &n, &k, &m);
	int i, j;
	for (i = 0; i < k; i++)scanf("%d", &L[i]);
	for (i = 0; i < m; i++) {
		long long s, e, w; scanf("%lld%lld%lld", &s, &e, &w);
		edge[s].push_back({ e,w });
		edge[e].push_back({ s,w });
	}
	long long inf = 1e18;
	for (i = 0; i < (1 << k); i++)for (j = 1; j <= n; j++)D[i][j] = inf;
	for (i = 0; i < k; i++)D[(1 << i)][L[i]] = 0;
	for (i = 1; i < (1 << k); i++) {
		for (j = 1; j <= n; j++) for (int p = 0; p < i; p++) if ((i | p) == i)D[i][j] = min(D[i][j], D[p][j]+D[i^p][j]);
		priority_queue<xy>H;
		for (j = 1; j <= n; j++) if (D[i][j]<inf)H.push({ D[i][j],j });
		while (!H.empty()) {
			xy now = H.top(); H.pop();
			for (j = 0; j < edge[now.y].size(); j++) {
				int nxt = edge[now.y][j].x, w = edge[now.y][j].y;
				if (D[i][nxt] > D[i][now.y] + w) {
					D[i][nxt] = D[i][now.y] + w;
					H.emplace(D[i][nxt], nxt);
				}
			}
		}
	}
	long long ans = inf;
	for (i = 1; i <= n; i++)ans = min(ans, D[(1 << k) - 1][i]);
	printf("%lld", ans);
	return 0;
}

Compilation message (stderr)

cities.cpp: In function 'int main()':
cities.cpp:21:28: warning: narrowing conversion of 'w' from 'long long int' to 'int' inside { } [-Wnarrowing]
   edge[s].push_back({ e,w });
                            ^
cities.cpp:22:28: warning: narrowing conversion of 'w' from 'long long int' to 'int' inside { } [-Wnarrowing]
   edge[e].push_back({ s,w });
                            ^
cities.cpp:33:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (j = 0; j < edge[now.y].size(); j++) {
                ~~^~~~~~~~~~~~~~~~~~~~
cities.cpp:16:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n, m, k; scanf("%d%d%d", &n, &k, &m);
               ~~~~~^~~~~~~~~~~~~~~~~~~~~~
cities.cpp:18:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i = 0; i < k; i++)scanf("%d", &L[i]);
                         ~~~~~^~~~~~~~~~~~~
cities.cpp:20:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   long long s, e, w; scanf("%lld%lld%lld", &s, &e, &w);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

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