Submission #68941529

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ex exit(0)
#define ln cout<<'\n'
#define ll long long
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.12f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;

void Init() {}
void Main() {
  ll T;
  R T;
  map<ll,PP> ma;
  ma[0]=PP(0,P(-1,-1));
  ma[-1]=PP(-1,P(-1,-1));
  REP(i,1,T+1) {
    ll z,x,y;
    R z;
    if(z==1) {
      R x;
      PP p=ma[x];
      ma[i]=PP(i,P(-1,-1));
      ma[i].S.F=x;
      if(p.S.S!=-1) {
        PP q=ma[p.S.S];
        q.S.F=x;
        ma[p.S.S]=q;
        ma[i].S.S=p.S.S;
      }
      ma[x].S.S=i;
    } else {
      cin >> x >> y;
      PP p=ma[x],q=ma[y];
      vector<ll> a,b;
      ll f=0;
      while(1) {
        p=ma[p.S.S];
        q=ma[q.S.S];
        if(p.F==y) break;
        a.pb(p.F);
        if(q.F==x) {f=1;break;}
        b.pb(q.F);
      }
      ll ans=0;
      if(!f) {
        rep(j,a.size()) {
          ans+=a[j];
          ma.erase(a[j]);
        }
        ma[x].S.S=y;
        ma[y].S.F=x;
      } else {
        rep(j,b.size()) {
          ans+=b[j];
          ma.erase(b[j]);
        }
        ma[x].S.F=y;
        ma[y].S.S=x;
      }
      pr(ans);
    }
  }
  /*
  map<ll,PP> ma;
  map<long double,ll> m;
  ma[0]=PP(0,1LL<<60);
  m[0]=0;
  REP(i,1,T+1) {
    ll z,x,y;
    R z;
    if(z==1) {
      R x;
      PP p=ma[x];
      long double d=p.F+p.S;
      p.S/=2;
      ma[x]=p;
      ma[i]=P(d,p.S);
      m[d]=i;
    } else {
      cin >> x >> y;
      PP p=ma[x],q=ma[y];
      long double l=p.F,r=q.F;
      if(l>r) swap(l,r);
      iter(m) it=m.upper_bound(l);
      ll ans=0;
      vector<ll> v1;
      vector<long double> v2;
      while(it!=m.end()&&it->F!=r) {
        ans+=it->S;
        v1.pb(it->S);
        v2.pb(it->F);
        it++;
      }
      pr(ans);
      rep(i,v1.size()) ma.erase(v1[i]);
      rep(i,v2.size()) m.erase(v2[i]);
    }
  }
  */
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Init();ll T=1;if(0)R T;while(T--)Main();return 0;}

Submission Info

Judge Result