| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 255794 | mehrdad_sohrabi | Bridges (APIO19_bridges) | C++14 | 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.
#include <bits/stdc++.h>
typedef unsigned int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define endl '\n'
#define int unsigned in
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
const int N=5e4+2,sq=700;
vector <pair <int,pii > > yy,yal;
bool vis[N*2];
bool vis2[N*2];
ll par[N],sz[N];
ll getpar(ll v){
if (par[v]==v) return v;
return par[v]=getpar(par[v]);
}
inline void mrg(ll v,ll u){
ll u1=getpar(u),v1=getpar(v);
if (u1==v1) return ;
if (sz[u1]>sz[v1])swap(u1,v1);
par[u1]=v1;
sz[v1]+=sz[u1];
}
ll pp[N],zz[N];
ll gg(ll v){
if (pp[v]==v) return v;
return pp[v]=gg(pp[v]);
}
inline void merg(ll v,ll u){
ll v1=gg(v),u1=gg(u);
if (v1==u1) return ;
if (zz[u1]>zz[v1]) swap(v1,u1);
pp[u1]=v1;
zz[v1]+=zz[u1];
}
ll ans[N*2];
vector <pair <int,pii> > q;
int32_t main(){
sync;
ll n,m;
scanf("%d %d",&n,&m);
for (int i=1;i<=m;i++){
ll u,v,w;
scanf("%d %d %d",&u,&v,&w);
// com.pb(w);
yy.pb({w,{u,v}});
}
ll q1;
scanf("%d",&q1);
while(q1--){
ll u,v,w;
scanf("%d %d %d",&u,&v,&w);
// com.pb(w);
q.pb({u,{v,w}});
}
for (int i=0;i<q.size();i+=sq){
vector <pii> g;
for (int j=i;j<min(i+sq,(int)q.size());j++){
if (q[j].F==1) vis[q[j].S.F-1]=1;
else{
g.pb({q[j].S.S,j});
}
}
memset(par,0,sizeof par);
memset(sz,0,sizeof sz);
for (int j=1;j<=n;j++){
sz[j]=1;
par[j]=j;
}
yal.clear();
for (int j=0;j<yy.size();j++){
if (vis[j]) continue;
yal.pb(yy[j]);
}
sort(yal.begin(),yal.end());
sort(g.begin(),g.end());
reverse(g.begin(),g.end());
ll cnt=0;
for (int j=yal.size()-1;j>-1;j--){
while(cnt<g.size() && g[cnt].F>yal[j].F){
for (int k=i;k<min(i+sq,(ll)q.size());k++){
if (q[k].F==1){
vis2[q[k].S.F-1]=0;
ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
pp[v]=getpar(v);
pp[u]=getpar(u);
zz[pp[v]]=sz[pp[v]];
zz[pp[u]]=sz[pp[u]];
pp[pp[v]]=pp[v];
pp[pp[u]]=pp[u];
}
else{
ll v=q[k].S.F;
pp[v]=getpar(v);
zz[pp[v]]=sz[pp[v]];
pp[pp[v]]=pp[v];
}
}
ll id=g[cnt].S;
for (int k=id;k>=i;k--){
if (q[k].F==2) continue;
ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
if (vis2[q[k].S.F-1]) continue;
vis2[q[k].S.F-1]=1;
if (q[k].S.S>=g[cnt].F){
merg(u,v);
}
}
for (int k=id+1;k<min(i+sq,(ll)q.size());k++){
if (q[k].F==2) continue;
ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
if (vis2[q[k].S.F-1]) continue;
vis2[q[k].S.F-1]=1;
if (yy[q[k].S.F-1].F>=g[cnt].F){
merg(u,v);
}
}
ans[id]=zz[gg(q[id].S.F)];
cnt++;
}
// for (int jj=0;jj<yal[j].size();jj++){
mrg(yal[j].S.F,yal[j].S.S);
//}
}
while(cnt<g.size()){
for (int k=i;k<min(i+sq,(ll)q.size());k++){
if (q[k].F==1){
vis2[q[k].S.F-1]=0;
ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
pp[v]=getpar(v);
pp[u]=getpar(u);
zz[pp[v]]=sz[pp[v]];
zz[pp[u]]=sz[pp[u]];
pp[pp[u]]=pp[u];
pp[pp[v]]=pp[v];
}
else{
ll v=q[k].S.F;
pp[v]=getpar(v);
zz[pp[v]]=sz[pp[v]];
pp[pp[v]]=pp[v];
}
}
ll id=g[cnt].S;
for (int k=id;k>=i;k--){
if (q[k].F==2) continue;
ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
if (vis2[q[k].S.F-1]) continue;
vis2[q[k].S.F-1]=1;
if (q[k].S.S>=g[cnt].F){
merg(u,v);
}
}
for (int k=id+1;k<min(i+sq,(ll)q.size());k++){
if (q[k].F==2) continue;
ll v=yy[q[k].S.F-1].S.F,u=yy[q[k].S.F-1].S.S;
if (vis2[q[k].S.F-1]) continue;
vis2[q[k].S.F-1]=1;
if (yy[q[k].S.F-1].F>=g[cnt].F){
merg(u,v);
}
}
ans[id]=zz[gg(q[id].S.F)];
cnt++;
}
for (int j=i;j<(min(i+sq,(ll)q.size()));j++){
if (q[j].F==1){
yy[q[j].S.F-1].F=q[j].S.S;
vis[q[j].S.F-1]=0;
}
}
}
for (int i=0;i<q.size();i++){
if (q[i].F==2)
printf("%d \n",ans[i]);
}
}