test/yukicoder/2063.test.cpp

• View this file on GitHub
• Last update: 2020-10-27 18:08:33+09:00
• Problem: https://yukicoder.me/problems/2063

Depends on

• segtree/count/dynamic_offline.cpp

Code

#define PROBLEM "https://yukicoder.me/problems/2063"

#include<bits/stdc++.h>
using namespace std;

#define call_from_test
#include "../../segtree/count/dynamic_offline.cpp"
#undef call_from_test

#ifdef SANITIZE
#define IGNORE
#endif

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  const char newl = '\n';

  int n,m;
  cin>>n>>m;
  vector<int> as(n),bs(n);
  for(int i=0;i<n;i++) cin>>as[i]>>bs[i];

  RangeCount<int, int> seg(m);
  for(int i=0;i<n;i++){
    if(as[i]>bs[i]) swap(as[i],bs[i]);
    seg.preupdate(as[i],bs[i]);
  }
  seg.build();

  long long ans=0;
  for(int i=0;i<n;i++){
    ans+=seg.query(0,as[i],as[i],bs[i]);
    ans+=seg.query(as[i],bs[i],bs[i],m);
    seg.update(as[i],bs[i],1);
  }

  cout<<ans<<newl;
  return 0;
}

#line 1 "test/yukicoder/2063.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/2063"

#include<bits/stdc++.h>
using namespace std;

#define call_from_test
#line 1 "segtree/count/dynamic_offline.cpp"

#line 3 "segtree/count/dynamic_offline.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
template<typename Key,typename T>
struct RangeCount{
  struct BIT{
    vector<T> dat;
    BIT(int n){dat.assign(++n,0);}
    T sum(int k){
      T res=0;
      for(;k;k-=k&-k) res+=dat[k];
      return res;
    }
    void add(int k,T v){
      for(++k;k<(int)dat.size();k+=k&-k) dat[k]+=v;
    }
  };
  int n;
  vector< vector<Key> > val;
  vector<BIT> dat;
  RangeCount(int n):n(n){
    val.assign(n<<1,vector<Key>());
    dat.reserve(n<<1);
  }
  void preupdate(int a,Key x){
    a+=n;
    while(a){
      val[a].emplace_back(x);
      a>>=1;
    }
  }
  void build(){
    for(int i=0;i<n*2;i++){
      auto &vs=val[i];
      sort(vs.begin(),vs.end());
      vs.erase(unique(vs.begin(),vs.end()),vs.end());
      dat.emplace_back(vs.size());
    }
  }
  void update(int a,Key x,T z){
    a+=n;
    while(a){
      auto &vs=val[a];
      int k=lower_bound(vs.begin(),vs.end(),x)-vs.begin();
      dat[a].add(k,z);
      a>>=1;
    }
  }
  T calc(int k,Key x,Key y){
    auto &vs=val[k];
    int p=lower_bound(vs.begin(),vs.end(),x)-vs.begin();
    int q=lower_bound(vs.begin(),vs.end(),y)-vs.begin();
    return dat[k].sum(q)-dat[k].sum(p);
  }
  // [a, b) * [x, y)
  T query(int a,int b,Key x,Key y){
    T res=0;
    for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1){
      if(l&1) res+=calc(l++,x,y);
      if(r&1) res+=calc(--r,x,y);
    }
    return res;
  }
};
//END CUT HERE
#ifndef call_from_test
//INSERT ABOVE HERE
//END CUT HERE
signed main(){
  return 0;
}
#endif
#line 8 "test/yukicoder/2063.test.cpp"
#undef call_from_test

#ifdef SANITIZE
#define IGNORE
#endif

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  const char newl = '\n';

  int n,m;
  cin>>n>>m;
  vector<int> as(n),bs(n);
  for(int i=0;i<n;i++) cin>>as[i]>>bs[i];

  RangeCount<int, int> seg(m);
  for(int i=0;i<n;i++){
    if(as[i]>bs[i]) swap(as[i],bs[i]);
    seg.preupdate(as[i],bs[i]);
  }
  seg.build();

  long long ans=0;
  for(int i=0;i<n;i++){
    ans+=seg.query(0,as[i],as[i],bs[i]);
    ans+=seg.query(as[i],bs[i],bs[i],m);
    seg.update(as[i],bs[i],1);
  }

  cout<<ans<<newl;
  return 0;
}

Back to top page