Submission #488250

#	Time	Username	Problem	Language	Result	Execution time	Memory
488250		levsog2004	Evacuation plan (IZhO18_plan)	C++14	35 / 100	4059 ms	71868 KiB

plan

#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef  int  ll;
#define all(x) x.begin(),x.end()
#define al(a,n)  (a,a+n)
#define se second
#define fr first
#define m_p make_pair
const ll N = 100005;
const ll mod = 1000 * 1000 * 1000 + 7;
const ll inf = 1000000009;
ll n, m, k, z, t, x, y, ans, pat, a[N],c[N],dist[N],color[N];
vector<pair<ll, ll>> g[N];
map <ll, ll> mp[N];
pair<ll, ll> p;
int main()
{
	cin >> n >> m;
	for (int i = 0; i < m; ++i)
	{
		cin >> x >> y >> z;
		mp[x][y] = 1;
		mp[y][x] = 1;
		g[x].push_back({ y,z });
		g[y].push_back({ x,z });

	}
	cin >> k;
	priority_queue<pair<ll, ll>> q;
	for (int i = 0; i <= n; ++i)
		dist[i] = inf;
	for (int i = 0; i < k; ++i)
	{
		cin >> a[i];
		q.push({ 0,a[i] });
		dist[a[i]] = 0;
		c[a[i]] = 1;
	}
	while (q.size() > 0)
	{
		p = q.top();
		q.pop();
		x = p.first*-1;
		y = p.second;
		for (int i = 0; i < g[y].size(); ++i)
		{
			if (dist[g[y][i].first] > x + g[y][i].second)
			{
				q.push({-1*(x+g[y][i].second),g[y][i].first});
				dist[g[y][i].first] = x + g[y][i].second;
			}
		}
	}
	cin >> ans;
	for (int i = 0; i < ans; ++i)
	{
		cin >> x >> y;
		if (mp[x][y]!=1)
		{
			pat = -1;
			for (int j = 0; j <= n; ++j)
			{
				color[j] = -1;
			}
			color[x] = 1;
			q.push({ -1*dist[x], x });
			while (q.size() > 0)
			{
				p = q.top();
				q.pop();
				int pow=-1*p.first, v=p.second;
				if (v == y)
				{
					pat = max(pat, pow);
					continue;
				}	

				for (int i = 0; i < g[v].size(); ++i)
				{
					if (color[g[v][i].first] < pow && pow>pat)
					{
						q.push({ min(pow, dist[g[v][i].first]) * -1,g[v][i].first });
						color[g[v][i].first] = min(pow, dist[g[v][i].first]);
					}
				}
			}
			cout << pat << endl;
		}
		else
			cout << min(dist[x], dist[y]) << endl;

	}
	return 0;
}

Compilation message (stderr)

plan.cpp: In function 'int main()':
plan.cpp:58:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for (int i = 0; i < g[y].size(); ++i)
      |                   ~~^~~~~~~~~~~~~
plan.cpp:91:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for (int i = 0; i < g[v].size(); ++i)
      |                     ~~^~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 12 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 46