# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
864524 | 2023-10-23T07:13:57 Z | maks007 | Toll (BOI17_toll) | C++14 | 81 ms | 3384 KB |
// 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}); } int dp[n]; for(int i = 0; i < n; i ++) dp[i] = 1e9; for(int i = 0; i < k; i ++) dp[i] = 0; for(int i = 0; i < n; i ++) { if(dp[i] == 1e9) continue; for(auto [u, w] : g[i]) { dp[u] = min(dp[u], dp[i] + w); } } while(query --) { int a, b; cin >> a >> b; if(dp[b] == 1e9) cout << -1 << "\n"; else cout << dp[b] - dp[a] << "\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 58 ms | 3384 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 81 ms | 3224 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 58 ms | 3384 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |