Submission #917785

#TimeUsernameProblemLanguageResultExecution timeMemory
917785VMaksimoski008Toll (BOI17_toll)C++14
10 / 100
41 ms6740 KiB
#include <bits/stdc++.h> #define pb push_back #define eb emplace_back #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define uniq(x) x.erase(unique(all(x)), x.end()) #define rall(x) x.rbegin(), x.rend() //#define int long long using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; const double eps = 1e-9; void setIO() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int k, m, n, o; vector<vector<pii> > graph; int32_t main() { setIO(); cin >> k >> n >> m >> o; graph.resize(n); for(int i=0; i<m; i++) { int a, b, w; cin >> a >> b >> w; graph[a].push_back({ b, w }); } vector<ll> dist(n, 1e18); vector<bool> vis(n, 0); priority_queue<pll, vector<pll>, greater<pll> > pq; pq.push({ 0, 0 }); dist[0] = 0; while(!pq.empty()) { int u = pq.top().second; pq.pop(); if(vis[u]) continue; vis[u] = 1; for(auto &[v, w] : graph[u]) { if(dist[v] > dist[u] + w) { dist[v] = dist[u] + w; pq.push({ dist[v], v }); } } } while(o--) { int a, b; cin >> a >> b; cout << (vis[b] ? dist[b] : -1) << '\n'; } return 0; }

Compilation message (stderr)

toll.cpp: In function 'int32_t main()':
toll.cpp:58:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |         for(auto &[v, w] : graph[u]) {
      |                   ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...