Submission #864518

#	Time	Username	Problem	Language	Result	Execution time	Memory
864518		maks007	Toll (BOI17_toll)	C++14	10 / 100	525 ms	7764 KiB

toll

// Bismi ALlah
#include "bits/stdc++.h"

using namespace std;

signed main () {
	int n, m, k, query;
	cin >> k >> n >> m >> query;
	vector<pair <int,int>> g[n], revG[n];
	for(int i = 0; i < m; i ++) {
		int u, v;
		cin >> u >> v;
		int w;
		cin >> w;
		revG[v].push_back({u, w});
		g[u].push_back({v, w});
	}
	for(auto i : g) {
		sort(i.begin(), i.end(), [](pair <int,int> a, pair <int,int> b) {
			return a.second < b.second;
		});
	}
	priority_queue <pair <int,int>> q;
	vector <int> dist(n, 1e9);
	dist[0] = 0;
	q.push({0, 0});
	while(!q.empty()) {
		int v = q.top().second, cur_d = q.top().first;
		q.pop();
		if(cur_d > dist[v]) continue;
		for(auto [u, w] : g[v]) {
			if(dist[u] > dist[v] + w) {
				dist[u] = dist[v] + w;
				q.push({-dist[u], u});
			}
		}
	}
	while(query --) {
		int a, b;
		cin >> a >> b;
		
		if(a == 0) {
			if(dist[b] == 1e9) cout << -1 << "\n";
			else
			cout << dist[b] << "\n"; 
		}else {
			int dp[n];
			for(int i = 0; i < n; i ++) dp[i] = 1e9;
			dp[b] = 0;
			for(int i = 0; i < n; i ++) {
				if(dp[i] != 1e9) {
					for(auto [u, w] : revG[i]) {
						dp[u] = min(dp[u], dp[i] + w);
					}
				}
			}
			if(dp[a] == 1e9) cout << -1 << "\n";
			else cout << dp[a] << "\n";
		}
	}
	return 0;
}

Compilation message (stderr)

toll.cpp: In function 'int main()':
toll.cpp:31:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |   for(auto [u, w] : g[v]) {
      |            ^
toll.cpp:52:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   52 |      for(auto [u, w] : revG[i]) {
      |               ^

• Subtask 1: 0 / 7
• Subtask 2: 10 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 31
• Subtask 5: 0 / 44