#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define ff first
#define ss second
#define MP make_pair
const int mxn = 4e5 + 10;
int par[mxn], ans[mxn], n, m;
vector<pair<int, pii>> edges;
int parent(int u) {
if(par[u] < 0) return u;
return par[u] = parent(par[u]);
}
bool unite(int u, int v) {
u = parent(u);
v = parent(v);
if(u == v) return 0;
if(par[u] > par[v]) swap(u, v);
par[u] += par[v];
par[v] = u;
return 0;
}
int main() {
cin >> n >> m;
for(int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
edges.push_back(MP(w, MP(u, v)));
}
int q;
cin >> q;
for(int i = 1; i <= q; i++) {
int s, w;
cin >> s >> w;
edges.push_back(MP(w, MP(-i, s)));
}
sort(edges.begin(), edges.end(), [&](const pair<int, pii> &L, const pair<int, pii> &R) { return L > R; });
memset(par, -1, sizeof par);
for(auto p : edges) {
if(p.ss.ff > 0) {
int w = p.ff;
int u = p.ss.ff;
int v = p.ss.ss;
// cout << "unite: " << u << ' ' << v << endl;
unite(u, v);
}
else {
int w = p.ff;
int i = -p.ss.ff;
int s = p.ss.ss;
int u = parent(s);
assert(0 < i && i < mxn);
assert(0 < u && u < mxn);
ans[i] = -par[u];
// cout << " start: " << s << ' ' << w << " = " << ans[i] << endl;
}
}
for(int i = 1; i <= q; i++)
cout << ans[i] << endl;
return 0;
}
Compilation message
bridges.cpp: In function 'int main()':
bridges.cpp:50:8: warning: unused variable 'w' [-Wunused-variable]
50 | int w = p.ff;
| ^
bridges.cpp:57:8: warning: unused variable 'w' [-Wunused-variable]
57 | int w = p.ff;
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
3160 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
103 ms |
12480 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
84 ms |
12332 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
140 ms |
11700 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
103 ms |
12480 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
3160 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |