#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define umap unordered_map
#define uset unordered_set
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;
const int INF = 1000000007;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
vii graph[50001];
int n, memo[50001], k, m, o;
cin >> k >> n >> m >> o;
rep(i, 0, m) {
int u, v, w;
cin >> u >> v >> w;
graph[u].emplace_back(v, w);
}
while (o--) {
memset(memo, 63, sizeof(memo));
int a, b, stop;
cin >> a >> b;
stop = (b / 5) * 5;
memo[a] = 0;
rep(i, a, stop) {
if (INF < memo[i]) continue;
trav(j, graph[i]) {
int v,w;
tie(v,w)=j;
memo[v] = min(memo[v], memo[i] + w);
}
}
cout<<(memo[b]<INF?memo[b]:-1)<<"\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3069 ms |
4296 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3067 ms |
4964 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
1612 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
1612 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3069 ms |
4296 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |