# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
510605 | amukkalir | 다리 (APIO19_bridges) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
f#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const int INF = 1e9+1000;
const int nax = 1000;
int n, m;
int p[nax+5];
vector<pair<int,pii>> b;
int par(int a) {
return p[a] == a ? a : p[a] = par(p[a]);
}
void join(int a, int b) {
p[par(a)] = par(b);
}
signed main () {
scanf("%d %d", &n, &m);
b.pb(mp(0,mp(0,0)));
for(int i=1; i<=m; i++) {
int u, v, d;
scanf("%d %d %d", &u,&v,&d);
b.pb(mp(d,mp(u,v)));
}
int q; scanf("%d", &q);
while(q--) {
int tp; scanf("%d", &tp);
int x, w; scanf("%d%d", &x, &w);
if(tp==1) {
b[x].fi = w;
} else {
for(int i=1; i<=n; i++) p[i] = i;
for(auto br : b) {
int d = br.fi;
if(d < w) continue;
int u = br.se.fi; int v = br.se.se;
join(u, v);
}
int c = 0;
for(int i=1; i<=n; i++) {
if(par(i) == par(x)) c++;
}
printf("%d\n", c);
}
}
}