Submission #495060

#	Time	Username	Problem	Language	Result	Execution time	Memory
495060		armashka	Evacuation plan (IZhO18_plan)	C++17	54 / 100	4026 ms	106020 KiB

plan

#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e9;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
                                                                    
int n, m, k, qq, d[N];
vector <pair<int, int>> g[N];
map <pair<int, int>, bool> way;
 
const void solve(/*Armashka*/) {
	cin >> n >> m;
	for (int i = 1; i <= m; ++ i) {
		int u, v, w;
		cin >> u >> v >> w;
		g[u].pb({v, w});
		g[v].pb({u, w});
		way[{u, v}] = way[{v, u}] = 1;
	}
	for (int i = 1; i <= n; ++ i) d[i] = inf;
	cin >> k;
	queue <int> q;
	for (int i = 1; i <= k; ++ i) {
		int x; cin >> x;
		d[x] = 0;
		q.push(x);
	}
	while (q.sz) {
		int v = q.front();
		q.pop();
		for (auto [to, w] : g[v]) {
			if (d[to] > d[v] + w) {
		    	d[to] = d[v] + w;
				q.push(to);
			}
		}
	}
	cin >> qq;
	while (qq --) {
		int a, b;
		cin >> a >> b;
		if (way[{a, b}]) {
			cout << min(d[a], d[b]) << "\n";
			continue;
		}
		vector <int> res(n + 5, 0);
		q.push(a);
		res[a] = d[a];
		while (q.sz) {
			int v = q.front();
			q.pop();
			for (auto [to, w] : g[v]) {
				if (res[to] < min(res[v], d[to])) {
					res[to] = min(res[v], d[to]);
					q.push(to);
				}
			}
		}
		cout << res[b] << "\n";
	}
}
 
signed main() {
    fast;
	//freopen("divide.in", "r", stdin);
	//freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
    	solve();
	}
}
 
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
 
*/

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