oj.uz

Submission #45072

# Submission time Handle Problem Language Result Execution time Memory
45072 2018-04-11T06:47:29 Z nibnalin Cities (BOI16_cities) C++17
74 / 100
 4000 ms 50148 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
using namespace std;

typedef long long int lli;

const int maxn = lli(1e5)+5, maxk = 6;
const lli inf = lli(1e17)+5;

int n, A[maxk];
lli D[maxk][maxn], dp[(1<<maxk)][maxn];
vector<pair<int, lli>> graph[maxn];

void dijkstra(int type, int node)
{
	for(int i = 0;i < n;i++) D[type][i] = inf;
	D[type][node] = 0;

	set<pair<lli, int>> Q;
	Q.insert({D[type][node], node});

	while(!Q.empty())
	{
		pair<lli, int> top = *Q.begin();
		Q.erase(Q.begin());

		for(auto it: graph[top.second])
		{
			if(D[type][it.first] > D[type][top.second]+it.second)
			{
				if(D[type][it.first] != inf) Q.erase({D[type][it.first], it.first});
				D[type][it.first] = D[type][top.second]+it.second;
				Q.insert({D[type][it.first], it.first});
			}
		}
	}
}

int main(void)
{
	int k, m, u, v;
	lli w;
	scanf("%d%d%d", &n, &k, &m);
	for(int i = 0;i < k;i++)
	{
		scanf("%d", &A[i]);
		A[i]--;
	}

	for(int i = 0;i < m;i++)
	{
		scanf("%d%d%lld", &u, &v, &w);
		u--, v--;
		graph[u].push_back({v, w}), graph[v].push_back({u, w});
	}

	for(int i = 0;i < k;i++) dijkstra(i, A[i]);

	for(int mask = 1;mask < (1<<k);mask++)
	{
		set<pair<lli, int>> Q;
		for(int i = 0;i < n;i++)
		{
			dp[mask][i] = inf;
			for(int j = 0;j < k;j++)
			{
				if((mask&(1<<j))) dp[mask][i] = min(dp[mask][i], dp[(mask^(1<<j))][i]+D[j][i]);
			}
			Q.insert({dp[mask][i], i});
		}

		while(!Q.empty())
		{
			pair<lli, int> top = *Q.begin();
			Q.erase(Q.begin());

			for(auto it: graph[top.second])
			{
				if(dp[mask][it.first] > dp[mask][top.second]+it.second)
				{
					Q.erase({dp[mask][it.first], it.first});
					dp[mask][it.first] = dp[mask][top.second]+it.second;
					Q.insert({dp[mask][it.first], it.first});
				}
			}
		}
	}

	lli res = inf;
	for(int i = 0;i < n;i++) res = min(res, dp[(1<<k)-1][i]);
	printf("%lld\n", res);
}

Compilation message

cities.cpp: In function 'int main()':
cities.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &k, &m);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
cities.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &A[i]);
   ~~~~~^~~~~~~~~~~~~
cities.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%lld", &u, &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1894 ms 26980 KB Output is correct
2 Correct 1894 ms 26980 KB Output is correct
3 Correct 896 ms 26980 KB Output is correct
4 Correct 123 ms 26980 KB Output is correct
5 Correct 858 ms 26980 KB Output is correct
6 Correct 159 ms 26980 KB Output is correct
7 Correct 9 ms 26980 KB Output is correct
8 Correct 7 ms 26980 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 26980 KB Output is correct
2 Correct 14 ms 26980 KB Output is correct
3 Correct 10 ms 26980 KB Output is correct
4 Correct 11 ms 26980 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3785 ms 34224 KB Output is correct
2 Correct 3818 ms 34224 KB Output is correct
3 Correct 1945 ms 34224 KB Output is correct
4 Correct 1821 ms 34224 KB Output is correct
5 Correct 421 ms 34224 KB Output is correct
6 Correct 179 ms 34224 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4014 ms 50148 KB Time limit exceeded
2 Halted 0 ms 0 KB -