Submission #463693

#	Time	Username	Problem	Language	Result	Execution time	Memory
463693		_Avocado_	Toll (BOI17_toll)	C++14	8 / 100	3083 ms	8644 KiB

toll

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

vector<vector<pair<int, int>>>graph;

int dijkstra(int s, int e, int n){
	priority_queue<pair<int, int>>pq;
	vector<int>dist(n, -1);
	pq.push({0, s});
	
	while(!pq.empty()){
		int d = -pq.top().first;
		int u = pq.top().second;
		pq.pop();
		
		if(dist[u] != -1) continue;
		
		dist[u] = d;
		
		for(auto [v, w]: graph[u]){
			pq.push({-(w+dist[u]), v});
		}
	}
	return dist[e];
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int k, n, m, q; cin>>k>>n>>m>>q;
	
	graph.assign(n, vector<pair<int, int>>());
	
	for(int i = 0; i<m; ++i){
		int a, b, c; cin>>a>>b>>c;
		graph[a].push_back({b, c});
	}
	
	for(int i = 0; i<q; ++i){
		int a, b; cin>>a>>b;
		
		cout<<dijkstra(a, b, n)<<'\n';
	}
	
	//cout<<'\n';
}

Compilation message (stderr)

toll.cpp: In function 'int64_t dijkstra(int64_t, int64_t, int64_t)':
toll.cpp:21:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 |   for(auto [v, w]: graph[u]){
      |            ^

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