#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using namespace std;
const int N = 1e5 + 10;
const int mod = 998244353;
const int inf = 1e9;
vector<pair<int,int>>g[N];
bool mark[N];
long long dist[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin >> n >> m;
for(int i = 1; i <= n; i++) dist[i] = inf;
for(int i = 1; i <= m; i++) {
int u,v,w;
cin >> u >> v >> w;
g[u].pb({v,w});
g[v].pb({u,w});
}
int k;
cin >> k;
priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>>pq;
for(int i = 1; i <= k; i++) {
int x;
cin >> x;
mark[x] = true;
pq.push({0,x});
dist[x] = 0;
}
while(!pq.empty()) {
long long dst = pq.top().F;
int u = pq.top().S;
pq.pop();
for(auto X : g[u]) {
if(dist[X.F] > dst + X.S) {
dist[X.F] = dst + X.S;
pq.push({dist[X.F],X.F});
}
}
}
int q;
cin >> q;
while(q--) {
int u,v;
cin >> u >> v;
queue<int>q;
q.push(u);
vector<bool>was(n + 1,false);
vector<long long>mn(n + 1,0);
mn[u] = dist[u];
while(!q.empty()) {
int s = q.front();
was[s] = true;
q.pop();
for(auto X : g[s]) {
if(min(mn[s],dist[X.F]) > mn[X.F]) {
mn[X.F] = min(mn[s],dist[X.F]);
q.push(X.F);
}
}
}
cout << mn[v] << "\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
3416 KB |
Output is correct |
2 |
Correct |
6 ms |
3420 KB |
Output is correct |
3 |
Correct |
6 ms |
3420 KB |
Output is correct |
4 |
Correct |
1 ms |
3420 KB |
Output is correct |
5 |
Correct |
7 ms |
3420 KB |
Output is correct |
6 |
Correct |
2 ms |
3420 KB |
Output is correct |
7 |
Correct |
1 ms |
3420 KB |
Output is correct |
8 |
Correct |
1 ms |
3420 KB |
Output is correct |
9 |
Correct |
9 ms |
3420 KB |
Output is correct |
10 |
Correct |
2 ms |
3420 KB |
Output is correct |
11 |
Correct |
10 ms |
3420 KB |
Output is correct |
12 |
Correct |
6 ms |
3528 KB |
Output is correct |
13 |
Correct |
4 ms |
3420 KB |
Output is correct |
14 |
Correct |
8 ms |
3604 KB |
Output is correct |
15 |
Correct |
9 ms |
3420 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
3416 KB |
Output is correct |
2 |
Correct |
6 ms |
3420 KB |
Output is correct |
3 |
Correct |
6 ms |
3420 KB |
Output is correct |
4 |
Correct |
1 ms |
3420 KB |
Output is correct |
5 |
Correct |
7 ms |
3420 KB |
Output is correct |
6 |
Correct |
2 ms |
3420 KB |
Output is correct |
7 |
Correct |
1 ms |
3420 KB |
Output is correct |
8 |
Correct |
1 ms |
3420 KB |
Output is correct |
9 |
Correct |
9 ms |
3420 KB |
Output is correct |
10 |
Correct |
2 ms |
3420 KB |
Output is correct |
11 |
Correct |
10 ms |
3420 KB |
Output is correct |
12 |
Correct |
6 ms |
3528 KB |
Output is correct |
13 |
Correct |
4 ms |
3420 KB |
Output is correct |
14 |
Correct |
8 ms |
3604 KB |
Output is correct |
15 |
Correct |
9 ms |
3420 KB |
Output is correct |
16 |
Execution timed out |
4054 ms |
10068 KB |
Time limit exceeded |
17 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
3416 KB |
Output is correct |
2 |
Correct |
1 ms |
3420 KB |
Output is correct |
3 |
Correct |
1 ms |
3420 KB |
Output is correct |
4 |
Correct |
1 ms |
3420 KB |
Output is correct |
5 |
Correct |
2 ms |
3420 KB |
Output is correct |
6 |
Correct |
1 ms |
3420 KB |
Output is correct |
7 |
Correct |
1 ms |
3420 KB |
Output is correct |
8 |
Correct |
1 ms |
3420 KB |
Output is correct |
9 |
Correct |
1 ms |
3420 KB |
Output is correct |
10 |
Correct |
1 ms |
3420 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
99 ms |
15312 KB |
Output is correct |
2 |
Correct |
214 ms |
29120 KB |
Output is correct |
3 |
Correct |
193 ms |
29124 KB |
Output is correct |
4 |
Correct |
26 ms |
9044 KB |
Output is correct |
5 |
Correct |
172 ms |
28868 KB |
Output is correct |
6 |
Correct |
192 ms |
29128 KB |
Output is correct |
7 |
Correct |
205 ms |
29120 KB |
Output is correct |
8 |
Correct |
209 ms |
29128 KB |
Output is correct |
9 |
Correct |
206 ms |
29128 KB |
Output is correct |
10 |
Correct |
209 ms |
29048 KB |
Output is correct |
11 |
Correct |
191 ms |
29216 KB |
Output is correct |
12 |
Correct |
195 ms |
29196 KB |
Output is correct |
13 |
Correct |
208 ms |
29124 KB |
Output is correct |
14 |
Correct |
218 ms |
29144 KB |
Output is correct |
15 |
Correct |
214 ms |
31904 KB |
Output is correct |
16 |
Correct |
207 ms |
29196 KB |
Output is correct |
17 |
Correct |
208 ms |
29248 KB |
Output is correct |
18 |
Correct |
205 ms |
29128 KB |
Output is correct |
19 |
Correct |
32 ms |
9044 KB |
Output is correct |
20 |
Correct |
177 ms |
29036 KB |
Output is correct |
21 |
Correct |
143 ms |
28368 KB |
Output is correct |
22 |
Correct |
40 ms |
11972 KB |
Output is correct |
23 |
Correct |
36 ms |
9552 KB |
Output is correct |
24 |
Correct |
46 ms |
11848 KB |
Output is correct |
25 |
Correct |
37 ms |
11848 KB |
Output is correct |
26 |
Correct |
40 ms |
9984 KB |
Output is correct |
27 |
Correct |
27 ms |
9044 KB |
Output is correct |
28 |
Correct |
42 ms |
11848 KB |
Output is correct |
29 |
Correct |
25 ms |
9044 KB |
Output is correct |
30 |
Correct |
40 ms |
11848 KB |
Output is correct |
31 |
Correct |
26 ms |
9052 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
3416 KB |
Output is correct |
2 |
Correct |
6 ms |
3420 KB |
Output is correct |
3 |
Correct |
6 ms |
3420 KB |
Output is correct |
4 |
Correct |
1 ms |
3420 KB |
Output is correct |
5 |
Correct |
7 ms |
3420 KB |
Output is correct |
6 |
Correct |
2 ms |
3420 KB |
Output is correct |
7 |
Correct |
1 ms |
3420 KB |
Output is correct |
8 |
Correct |
1 ms |
3420 KB |
Output is correct |
9 |
Correct |
9 ms |
3420 KB |
Output is correct |
10 |
Correct |
2 ms |
3420 KB |
Output is correct |
11 |
Correct |
10 ms |
3420 KB |
Output is correct |
12 |
Correct |
6 ms |
3528 KB |
Output is correct |
13 |
Correct |
4 ms |
3420 KB |
Output is correct |
14 |
Correct |
8 ms |
3604 KB |
Output is correct |
15 |
Correct |
9 ms |
3420 KB |
Output is correct |
16 |
Execution timed out |
4054 ms |
10068 KB |
Time limit exceeded |
17 |
Halted |
0 ms |
0 KB |
- |