Submission #1177732

#	Time	Username	Problem	Language	Result	Execution time	Memory
1177732		sasde	Bridges (APIO19_bridges)	C++20	27 / 100	3094 ms	6372 KiB

bridges

#include<bits/stdc++.h>
#define task "strdel"
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
using namespace std;
const int N=1e6+5,lg=20,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
struct pt{
  int u,ru,v,rv,i;
};
struct zz{
  int n;
vector<pt>res;
vector<int>r;
void build(int _n){
n=_n;
r=vector<int>(n+5,-1);
}
int acs(int u){
  return r[u]<0?u:acs(r[u]);
}
void join(int u,int v,int i){
  u=acs(u);
  v=acs(v);
  if(u!=v){
    if(r[u]>r[v])swap(u,v);
    res.pb({u,r[u],v,r[v],i});
    // cout <<u<<" "<<v<<'\n';
    r[u]+=r[v];
    r[v]=u;
  }
}
void rollback(int w){
  while(res.size()&&w<res.back().i){
    int u=res.back().u;
    int v=res.back().v;
    r[v]=res.back().rv;
    r[u]=res.back().ru;
    res.pop_back();

  }
}
}s;
int n,m,ans[N];
struct pt1{
  int u,v,w;
}b[N];
vector<int>query;
struct pt2{
  int t,u,w;
}c[N];

bool k[N];
int k1[N];
void solve(){
  cin >> n >> m;
  // cout <<n;
  for(int i=1;i<=m;++i)cin >> b[i].u >> b[i].v >> b[i].w;
  int q;
cin >> q;
int sq=450,st=1;
for(int test=1;test<=q;++test){
  cin >> c[test].t >> c[test].u >> c[test].w;
  vector<int>jo,nojo,res;
  if(test%sq==0||q==test)
  {
      // cout <<st<<" "<<test<<'\n';

    for(int i=st;i<=test;++i){
  if(c[i].t==1){
    k[c[i].u]=1;
  }
  else{
    query.emb(i);
    // cout <<i<<" ";
    res.emb(i);
  }
  }
  for(int i=1;i<=m;++i){
    if(!k[i]){
      nojo.emb(i);
    }
    else jo.emb(i);
  }
   sort(res.begin(),res.end(),[](const int &x,const int &y){
    return c[x].w >c[y].w;
   });
   sort(nojo.begin(),nojo.end(),[](const int &x,const int &y){
    return b[x].w >b[y].w;
   });
   int j=0;
   s.build(n);

   for(int x:res){
      // cout <<x;

    while(j<nojo.size()&&b[nojo[j]].w>=c[x].w){
      s.join(b[nojo[j]].u,b[nojo[j]].v,0);
      ++j;
    }
    // cout <<x<<" "<<j<<'\n';
    for(int z=st;z<x;++z){
      if(c[z].t==1){
        k1[c[z].u]=z;
      }
    }
    for(int y:jo){
      if(k1[y]){
        if(c[k1[y]].w>=c[x].w)s.join(b[y].u,b[y].v,1);
      }
      else{
        if(b[y].w>=c[x].w)s.join(b[y].u,b[y].v,1);
      }
    }
    ans[x]=-s.r[s.acs(c[x].u)];
    s.rollback(0);
  for(int z=st;z<x;++z){
      if(c[z].t==1){
        k1[c[z].u]=0;
      }
    }
   }
  for(int i=st;i<=test;++i){
      // cout <<st<<" "<<test<<'\n';
  if(c[i].t==1){
    k[c[i].u]=1;
    b[c[i].u].w=c[i].w;
  }
  }
  s.rollback(-1);
  st=test+1;
  }

}
for(int i:query)cout <<ans[i]<<'\n';
}
main()
{
  srand(time(0));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    if(fopen(task".inp","r")){
      freopen(task".inp","r",stdin);
      freopen(task".out","w",stdout);
    }
    int t=1;
 //   cin >> t;
while(t--){
    solve();
}

}

Compilation message (stderr)

bridges.cpp:153:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  153 | main()
      | ^~~~
bridges.cpp: In function 'int main()':
bridges.cpp:160:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  160 |       freopen(task".inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:161:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  161 |       freopen(task".out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 14 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27