This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// 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];
for(int i = 0; i < m; i ++) {
int u, v;
cin >> u >> v;
int w;
cin >> 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 {
queue <int> q;
vector <int> dist2(n, -1);
dist2[a] = 0;
q.push(a);
while(!q.empty()) {
int v = q.front();
q.pop();
for(auto [u, w] : g[v]) {
if(dist2[u] == -1) {
dist2[u] = dist2[v] + w;
q.push(u);
}
}
}
if(dist2[b] == 1e9) cout << -1 << "\n";
else cout << dist2[b] << "\n";
}
}
return 0;
}
Compilation message (stderr)
toll.cpp: In function 'int main()':
toll.cpp:30:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
30 | for(auto [u, w] : g[v]) {
| ^
toll.cpp:53:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
53 | for(auto [u, w] : g[v]) {
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |