#include<bits/stdc++.h>
#define el '\n'
using namespace std ;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
const int MN = 1e5 + 5;
const int inf = 1e9;
struct DSU{
vector<int> par , sz;
int n;
void init(int n){
this -> n = n;
par.resize(n + 5);
sz.resize(n + 5 , 1);
for ( int i = 1 ; i <= n ; i++ ) par[i] = i;
}
int find_set(int v){
return v == par[v] ? v : par[v] = find_set(par[v]);
}
void unite(int r , int s){
r = find_set(r) , s = find_set(s);
if (r != s){
if (sz[r] < sz[s]) swap(r , s);
par[s] = r;
sz[r] += sz[s];
}
}
bool same_set(int u , int v){
return find_set(u) == find_set(v);
}
};
int32_t main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n , m;
cin >> n >> m;
vector<pair<int , pair<int , int>>> edge(m);
vector<vector<pair<int , int>>> adj(n + 2);
for ( int i = 0 ; i < m ; i++ ){
int u , v , w;
cin >> u >> v >> w;
adj[u].push_back(make_pair(v , w));
adj[v].push_back(make_pair(u , w));
edge[i].second = make_pair(u , v);
}
priority_queue<pair<int , int> , vector<pair<int , int>> , greater<pair<int , int>>> pq;
vector<int> dis(n + 5 , inf);
int k;
cin >> k;
for ( int i = 1 ; i <= k ; i++ ){
int x;
cin >> x;
dis[x] = 0;
pq.push(make_pair(0 , x));
}
while (!pq.empty()){
auto [d , u] = pq.top();
pq.pop();
if (d != dis[u]) continue;
for ( auto [v , w] : adj[u] ){
if (dis[v] > dis[u] + w){
dis[v] = dis[u] + w;
pq.push(make_pair(dis[v] , v));
}
}
}
int mn = *min_element(dis.begin() + 1 , dis.begin() + n + 1);
int mx = *max_element(dis.begin() + 1 , dis.begin() + n + 1);
for ( int i = 0 ; i < m ; i++ ) edge[i].first = min(dis[edge[i].second.first] , dis[edge[i].second.second]);
int q;
cin >> q;
vector<pair<int , int>> queries(q);
for ( int i = 0 ; i < q ; i++ ){
cin >> queries[i].first >> queries[i].second;
}
sort(edge.begin() , edge.end());
vector<int> l(q + 5 , mn) , r(q + 5 , mx);
vector<vector<int>> candidates(mx + 5);
DSU dsu;
while (1){
bool any = false;
for ( int i = 0 ; i < q ; i++ ){
if (l[i] <= r[i]){
int mid = (l[i] + r[i]) / 2;
candidates[mid].push_back(i);
any = true;
}
}
if (!any) break;
dsu.init(n);
int j = edge.size() - 1;
for ( int mid = mx ; mid >= mn ; mid-- ){
while (j >= 0 && edge[j].first >= mid){
dsu.unite(edge[j].second.first , edge[j].second.second);
j--;
}
for ( auto x : candidates[mid] ){
if (dsu.same_set(queries[x].first , queries[x].second)){
l[x] = mid + 1;
}
else r[x] = mid - 1;
}
candidates[mid].clear();
}
}
for ( int i = 0 ; i < q ; i++ ) cout << r[i] << el;
}
Compilation message
plan.cpp: In function 'int32_t main()':
plan.cpp:64:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
64 | auto [d , u] = pq.top();
| ^
plan.cpp:67:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
67 | for ( auto [v , w] : adj[u] ){
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
604 KB |
Output is correct |
3 |
Correct |
1 ms |
604 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
612 KB |
Output is correct |
6 |
Correct |
1 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
2 ms |
860 KB |
Output is correct |
10 |
Correct |
1 ms |
604 KB |
Output is correct |
11 |
Correct |
2 ms |
604 KB |
Output is correct |
12 |
Correct |
1 ms |
604 KB |
Output is correct |
13 |
Correct |
2 ms |
604 KB |
Output is correct |
14 |
Correct |
2 ms |
860 KB |
Output is correct |
15 |
Correct |
2 ms |
604 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
604 KB |
Output is correct |
3 |
Correct |
1 ms |
604 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
612 KB |
Output is correct |
6 |
Correct |
1 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
2 ms |
860 KB |
Output is correct |
10 |
Correct |
1 ms |
604 KB |
Output is correct |
11 |
Correct |
2 ms |
604 KB |
Output is correct |
12 |
Correct |
1 ms |
604 KB |
Output is correct |
13 |
Correct |
2 ms |
604 KB |
Output is correct |
14 |
Correct |
2 ms |
860 KB |
Output is correct |
15 |
Correct |
2 ms |
604 KB |
Output is correct |
16 |
Correct |
124 ms |
16712 KB |
Output is correct |
17 |
Correct |
329 ms |
32536 KB |
Output is correct |
18 |
Correct |
26 ms |
3420 KB |
Output is correct |
19 |
Correct |
77 ms |
16140 KB |
Output is correct |
20 |
Correct |
326 ms |
32160 KB |
Output is correct |
21 |
Correct |
166 ms |
20060 KB |
Output is correct |
22 |
Runtime error |
183 ms |
524288 KB |
Execution killed with signal 9 |
23 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
129 ms |
13268 KB |
Output is correct |
2 |
Correct |
279 ms |
24904 KB |
Output is correct |
3 |
Correct |
274 ms |
24792 KB |
Output is correct |
4 |
Runtime error |
178 ms |
524288 KB |
Execution killed with signal 9 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
604 KB |
Output is correct |
3 |
Correct |
1 ms |
604 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
612 KB |
Output is correct |
6 |
Correct |
1 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
2 ms |
860 KB |
Output is correct |
10 |
Correct |
1 ms |
604 KB |
Output is correct |
11 |
Correct |
2 ms |
604 KB |
Output is correct |
12 |
Correct |
1 ms |
604 KB |
Output is correct |
13 |
Correct |
2 ms |
604 KB |
Output is correct |
14 |
Correct |
2 ms |
860 KB |
Output is correct |
15 |
Correct |
2 ms |
604 KB |
Output is correct |
16 |
Correct |
124 ms |
16712 KB |
Output is correct |
17 |
Correct |
329 ms |
32536 KB |
Output is correct |
18 |
Correct |
26 ms |
3420 KB |
Output is correct |
19 |
Correct |
77 ms |
16140 KB |
Output is correct |
20 |
Correct |
326 ms |
32160 KB |
Output is correct |
21 |
Correct |
166 ms |
20060 KB |
Output is correct |
22 |
Runtime error |
183 ms |
524288 KB |
Execution killed with signal 9 |
23 |
Halted |
0 ms |
0 KB |
- |