Submission #1111450

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111450		jmuzhen	Drivers (BOI24_drivers)	C++17	0 / 100	1 ms	336 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#define int long long

using ii = pair<int, int>;
vector<vector<ii>> adj;

int n, m, u;

/* observation: abs(dist(a, x) - dist(b, x)) <= dist(a, b) <= dist(a, x) + dist(b, x)
 * in fact, only the left half is useful.
 * The answer is YES, iff we can find some abs(dist(a, x) - dist(b, x)) <= p (the query value).
 */
 
 
auto dijkstra(int src) {
	vector<int> dist(n+1, 1e15);
	priority_queue<ii, vector<ii>, greater<ii>> pq;
	
	dist[src] = 0; pq.push({0, src});
	while (!pq.empty()) {
		auto [d, u] = pq.top(); pq.pop();
		if (d > dist[u]) continue;
		for (auto [v, w] : adj[u]) {
			if (dist[u] + w < dist[v]) {
				dist[v] = dist[u] + w;
				pq.push({dist[v], v});
			}
		}	
	}
	return dist;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);
	
	cin >> n >> m >> u;
	// all nodes are 1-indexed.
	adj = vector<vector<ii>>(n+1, vector<ii>());
	
	for (int i = 0; i < m; i++) {
		int a, b, t; cin >> a >> b >> t;
		adj[a].push_back({b, t});
		adj[b].push_back({a, t});
	}
	
	
	// dijkstra
	vector<vector<int>> all_dist(n+1, vector<int>());
	for (int i = 1; i <= n; i++) {
		auto dist = dijkstra(i);
		all_dist[i] = dist;
		//for (int& x : all_dist[i]) cout << x << " ";
		//cout << endl;
	}
	
	// queries
	while (u--) {
		int a, b, p ; cin >> a >> b >> p;
		//assert(all_dist[a][b] == all_dist[b][a]);
		if (all_dist[a][b] <= p) {
			cout << "TAIP\n";
		}
		else {
			cout << "NE\n";
		}
	}

}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 23
• Subtask 5: 0 / 45