제출 #168941

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
168941		tourist	Evacuation plan (IZhO18_plan)	C++17	23 / 100	1119 ms	21980 KiB

plan

#include <iostream>
#include <queue>
#include <vector>

using namespace std;

#define ll long long
#define sz(x) (int)x.size()
#define pii pair < int, int >
#define endl "\n"
#define METH ios::sync_with_stdio(0); cin.tie(0);
#define BEGIN cout << "BEGIN" << endl;
#define END cout << "END" << endl;

const int N = 1e5;
const int mod = 1e9 + 7;										/// ANOTHER HASH MOD: 228228227
const int prime = 29;											/// ANOTHER HASH PRIME: 997
const int INF = ((long long) 0xCAFEBABE - 1e9 - 4e8);

int n, m, k, q;

vector < int > bad, dist(N + 1, INF);
vector < pii > g[N + 1], querry;

inline void purify() {
}

inline void precalc() {
}

inline void read() {
	int a, b, c;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> a >> b >> c;
		g[a].push_back({b, c});
		g[b].push_back({a, c});
	}

	cin >> k;
	for (int i = 1; i <= k; i++) {
		cin >> a;
		bad.push_back(a);
	}

	cin >> q;
	querry.push_back({0, 0});
	for (int i = 1; i <= q; i++) {
		cin >> a >> b;
		querry.push_back({a, b});
	}
}

void dij() {
	priority_queue < pii > pq;
	for (int i : bad) {
		pq.push({0, i});
		dist[i] = 0;
	}

	while (pq.size()) {
		int cur = pq.top().second;
		int d = -pq.top().first;
		pq.pop();

		if (d > dist[cur]) {
			continue;
		}

		for (pii i : g[cur]) {
			int u = i.first;
			int len = i.second;
			if (dist[cur] + len < dist[u]) {
				dist[u] = dist[cur] + len;
				pq.push({-dist[u], u});
			}
		}
	}
}

inline void solve() {
	dij();

	for (int i = 1; i <= q; i++) {
		pii j = querry[i];
		int ans = dist[j.second];
		if (dist[j.first] < dist[j.second]) {
			ans = dist[j.first];
		}
		cout << ans << endl;
	}
}

int main() {
	int t;
	//scanf("%d", &t);
	t = 1;

	//precalc();
	while (t--) {
		//purify();
		read();
		solve();
	}
}

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