This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
ll k, n, m, o, dp[50050];
vvii adj;
void getToll(ll u, ll v) {
//cerr << "// getToll(" << u << ", " << v << ")\n";
if (dp[u] != -1) return;
if (u == v) { dp[u] = 0; return; }
if (u/5 >= v/5) { dp[u] = 1e9; return; }
ll minToll = 1e9;
for (ii edge : adj[u]) {
getToll(edge.fi, v);
if (dp[edge.fi] >= 1e9) continue;
ll currToll = dp[edge.fi] + edge.se;
if (currToll < minToll) minToll = currToll;
}
dp[u] = minToll;
//cerr << "// " << dp[u] << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k >> n >> m >> o;
adj.assign(n + 20, vii());
for (ll i = 0; i < m; i++) {
ll a, b, t;
cin >> a >> b >> t;
adj[a].push_back({b, t});
}
for (ll i = 0; i < o; i++) {
memset(dp, -1, sizeof dp);
ll a, b;
cin >> a >> b;
getToll(a, b);
cout << (dp[a] >= 1e9 ? -1 : dp[a]) << '\n';
}
}
# | 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... |