| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 864528 | maks007 | Toll (BOI17_toll) | C++14 | 3074 ms | 194208 KiB |
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;
#define int long long
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});
}
map <pair <int,int>,int> dp;
for(int i = 0; i < n; i ++) {
dp[{i,i}] = 0;
for(int j = 0; j < n; j ++) {
if(dp.count({i, j})) {
for(auto [u, w] : g[j]) {
if(dp.count({i, u}) == 0) dp[{i, u}] = dp[{i, j}] + w;
else dp[{i, u}] = min(dp[{i, u}], dp[{i, j}] + w);
}
}
}
}
while(query --) {
int a, b;
cin >> a >> b;
if(dp.count({a, b})) cout << dp[{a, b}] << "\n";
else cout << -1 << "\n";
}
return 0;
}Compilation message (stderr)
| # | 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... | ||||
