結果

問題 No.2160 みたりのDominator
ユーザー 👑 tute7627tute7627
提出日時 2022-12-11 02:10:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 214 ms / 2,000 ms
コード長 16,401 bytes
コンパイル時間 3,288 ms
コンパイル使用メモリ 248,348 KB
実行使用メモリ 28,516 KB
最終ジャッジ日時 2024-10-15 01:54:53
合計ジャッジ時間 11,646 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 85 ms
26,272 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,816 KB
testcase_05 AC 2 ms
6,816 KB
testcase_06 AC 3 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 2 ms
6,820 KB
testcase_09 AC 2 ms
6,820 KB
testcase_10 AC 2 ms
6,820 KB
testcase_11 AC 2 ms
6,816 KB
testcase_12 AC 2 ms
6,820 KB
testcase_13 AC 2 ms
6,820 KB
testcase_14 AC 2 ms
6,820 KB
testcase_15 AC 2 ms
6,816 KB
testcase_16 AC 2 ms
6,820 KB
testcase_17 AC 3 ms
6,816 KB
testcase_18 AC 2 ms
6,816 KB
testcase_19 AC 2 ms
6,816 KB
testcase_20 AC 2 ms
6,816 KB
testcase_21 AC 3 ms
6,820 KB
testcase_22 AC 2 ms
6,820 KB
testcase_23 AC 3 ms
6,816 KB
testcase_24 AC 2 ms
6,816 KB
testcase_25 AC 2 ms
6,816 KB
testcase_26 AC 2 ms
6,816 KB
testcase_27 AC 2 ms
6,820 KB
testcase_28 AC 2 ms
6,816 KB
testcase_29 AC 2 ms
6,816 KB
testcase_30 AC 3 ms
6,816 KB
testcase_31 AC 2 ms
6,816 KB
testcase_32 AC 2 ms
6,816 KB
testcase_33 AC 2 ms
6,816 KB
testcase_34 AC 5 ms
6,820 KB
testcase_35 AC 2 ms
6,816 KB
testcase_36 AC 2 ms
6,820 KB
testcase_37 AC 2 ms
6,820 KB
testcase_38 AC 2 ms
6,816 KB
testcase_39 AC 2 ms
6,816 KB
testcase_40 AC 214 ms
28,516 KB
testcase_41 AC 194 ms
28,280 KB
testcase_42 AC 116 ms
17,648 KB
testcase_43 AC 154 ms
22,916 KB
testcase_44 AC 214 ms
27,976 KB
testcase_45 AC 155 ms
25,868 KB
testcase_46 AC 133 ms
24,556 KB
testcase_47 AC 70 ms
14,072 KB
testcase_48 AC 81 ms
15,376 KB
testcase_49 AC 80 ms
15,924 KB
testcase_50 AC 51 ms
12,240 KB
testcase_51 AC 129 ms
19,300 KB
testcase_52 AC 176 ms
26,080 KB
testcase_53 AC 197 ms
27,428 KB
testcase_54 AC 115 ms
17,192 KB
testcase_55 AC 85 ms
11,632 KB
testcase_56 AC 78 ms
11,732 KB
testcase_57 AC 88 ms
11,772 KB
testcase_58 AC 64 ms
11,904 KB
testcase_59 AC 88 ms
11,748 KB
testcase_60 AC 88 ms
12,700 KB
testcase_61 AC 84 ms
11,648 KB
testcase_62 AC 86 ms
12,160 KB
testcase_63 AC 84 ms
11,804 KB
testcase_64 AC 86 ms
11,876 KB
testcase_65 AC 28 ms
7,128 KB
testcase_66 AC 38 ms
7,580 KB
testcase_67 AC 34 ms
7,788 KB
testcase_68 AC 72 ms
11,648 KB
testcase_69 AC 56 ms
9,496 KB
testcase_70 AC 57 ms
11,904 KB
testcase_71 AC 24 ms
6,820 KB
testcase_72 AC 42 ms
9,344 KB
testcase_73 AC 70 ms
11,956 KB
testcase_74 AC 65 ms
11,456 KB
testcase_75 AC 4 ms
6,816 KB
testcase_76 AC 4 ms
6,816 KB
testcase_77 AC 24 ms
7,424 KB
testcase_78 AC 43 ms
8,592 KB
testcase_79 AC 5 ms
6,820 KB
testcase_80 AC 6 ms
6,820 KB
testcase_81 AC 15 ms
7,000 KB
testcase_82 AC 11 ms
6,820 KB
testcase_83 AC 14 ms
6,816 KB
61_evil_bias_nocross_01.txt AC 188 ms
30,848 KB
61_evil_bias_nocross_02.txt AC 190 ms
26,700 KB
61_evil_bias_nocross_03.txt AC 97 ms
19,060 KB
61_evil_bias_nocross_04.txt AC 106 ms
20,740 KB
61_evil_bias_nocross_05.txt AC 160 ms
30,232 KB
61_evil_bias_nocross_06.txt AC 189 ms
28,940 KB
61_evil_bias_nocross_07.txt AC 116 ms
20,704 KB
61_evil_bias_nocross_08.txt AC 175 ms
25,052 KB
61_evil_bias_nocross_09.txt AC 168 ms
30,212 KB
61_evil_bias_nocross_10.txt AC 75 ms
16,040 KB
61_evil_bias_nocross_11.txt AC 120 ms
22,572 KB
61_evil_bias_nocross_12.txt AC 163 ms
25,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";os<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});
  return ord;
}
template<typename T> vector<T> inv_perm(const vector<T>&ord){
  vector<T>inv(ord.size());
  for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
  return inv;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
  Graph<T>ret(g.size());
  for(int i=0;i<g.size();i++){
    for(auto e:g[i]){
      int to = e.to;
      e.to = i;
      ret[to].push_back(e);
    }
  }
  return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v;
    T w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}
template<typename T>
struct Compress{
	vector<T>v;
	Compress(){
	}
	Compress(const vector<T>&input){
		add(input);
    build();
	}
  template<typename... Args>
  Compress(const vector<T> &head,const Args& ...input){
    add(head, input...);
    build();
  }
  template<typename... Args>
  Compress(const T &head,const Args& ...input){
    add(head, input...);
    build();
  }
  void build(){
		sort(v.begin(), v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
  }
	void add(const vector<T>&add){
		v.insert(v.end(),add.begin(), add.end());
	}
  template<typename Head, typename ...Tail>
  void add(const Head& head,const Tail& ...tail){
    add(head);
    add(tail...);
  }
  void add(T val){
    v.push_back(val);
  }
  int next(T val){
    return lower_bound(v.begin(), v.end(), val) - v.begin();
  }
  int prev(T val){
    return upper_bound(v.begin(), v.end(), val) - v.begin() - 1;
  }
  bool exist(T val){
    return binary_search(v.begin(), v.end(), val);
  }
  T val(int x){
    return v[x];
  }
  vector<int>compress(const vector<T>&input){
    vector<int>ret(input.size());
    for(int i=0;i<input.size();i++)ret[i]=next(input[i]);
    return ret;
  }
  int operator[](T val){
    return next(val);
  }
  int size(){
    return v.size();
  }
};
template< typename Monoid, typename OperatorMonoid,typename F, typename G, typename H>
struct LazySegmentTree {
  ll sz, height, n;
  vector< Monoid > data;
  vector< OperatorMonoid > lazy;
  const F f;
  const G g;
  const H h;
  Monoid M1;
  OperatorMonoid OM0;
  LazySegmentTree(ll n, const F &f,const G &g, const H &h, Monoid M1, OperatorMonoid OM0):n(n),f(f),g(g),h(h),M1(M1),OM0(OM0){
    sz = 1;
    height = 0;
    while(sz < n) sz <<= 1, height++;
    data.assign(2 * sz, M1);
    lazy.assign(2 * sz, OM0);
  }

  void set(ll k, const Monoid &x) {
    data[k + sz] = x;
  }

  void build() {
    for(ll k = sz - 1; k > 0; k--) {
      data[k] = f(data[2 * k + 0], data[2 * k + 1]);
    }
  }

  inline void propagate(ll k) {
    if(lazy[k] != OM0) {
      lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
      lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
      data[k] = reflect(k);
      lazy[k] = OM0;
    }
  }

  inline Monoid reflect(ll k) {
    return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
  }

  inline void recalc(ll k) {
    while(k >>= 1) data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));
  }

  inline void thrust(ll k) {
    for(ll i = height; i > 0; i--) propagate(k >> i);
  }

  void update(ll a, ll b, const OperatorMonoid &x) {
	if(a>=b)return;
    thrust(a += sz);
    thrust(b += sz - 1);
    for(ll l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if(l & 1) lazy[l] = h(lazy[l], x), ++l;
      if(r & 1) --r, lazy[r] = h(lazy[r], x);
    }
    recalc(a);
    recalc(b);
  }
  
  void update(ll a,const Monoid &x){
    thrust(a += sz);
    data[a] = x;
    lazy[a] = OM0;
    recalc(a);
  }

  Monoid query(ll a, ll b) {
	if(a>=b)return M1;
    thrust(a += sz);
    thrust(b += sz - 1);
    Monoid L = M1, R = M1;
    for(ll l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if(l & 1) L = f(L, reflect(l++));
      if(r & 1) R = f(reflect(--r), R);
    }
    return f(L, R);
  }

  Monoid operator[](const ll &k) {
    return query(k, k + 1);
  }

  template< typename C >
  ll find_subtree(ll a, const C &check, Monoid &M, bool type) {
    while(a < sz) {
      propagate(a);
      Monoid nxt = type ? f(reflect(2 * a + type), M) : f(M, reflect(2 * a + type));
      if(check(nxt)) a = 2 * a + type;
      else M = nxt, a = 2 * a + 1 - type;
    }
    return a - sz;
  }

  template< typename C >
  ll find_first(ll a, const C &check) {
    Monoid L = M1;
    if(a <= 0) {
      if(check(f(L, reflect(1)))) return find_subtree(1, check, L, false);
      return -1;
    }
    thrust(a + sz);
    ll b = sz;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) {
        Monoid nxt = f(L, reflect(a));
        if(check(nxt)) return find_subtree(a, check, L, false);
        L = nxt;
        ++a;
      }
    }
    return -1;
  }


  template< typename C >
  ll find_last(ll b, const C &check) {
    Monoid R = M1;
    if(b >= sz) {
      if(check(f(reflect(1), R))) return find_subtree(1, check, R, true);
      return -1;
    }
    thrust(b + sz - 1);
    ll a = sz;
    for(b += sz; a < b; a >>= 1, b >>= 1) {
      if(b & 1) {
        Monoid nxt = f(reflect(--b), R);
        if(check(nxt)) return find_subtree(b, check, R, true);
        R = nxt;
      }
    }
    return -1;
  }
  void print(){
    for(ll i=0;i<n;i++)if((*this)[i]==M1)cout<<"x|";else cout<<(*this)[i]<<"|";
    cout<<endl;
  }
};
template<typename C, typename V>
vector<V>static_rectangle_add_rectangle_sum(const vector<tuple<C,C,C,C,V>>&add,const vector<tuple<C,C,C,C>>&query){
  vector<C>xc,yc;
  xc.reserve(add.size()*2+query.size()*2);
  yc.reserve(add.size()*2+query.size()*2);
  for(int i=0;i<add.size();i++){
    auto [xl,xr,yl,yr,v]=add[i];
    xc.push_back(xl);xc.push_back(xr);
    yc.push_back(yl);yc.push_back(yr);
  }
  for(int i=0;i<query.size();i++){
    auto [xl,xr,yl,yr]=query[i];
    xc.push_back(xl);xc.push_back(xr);
    yc.push_back(yl);yc.push_back(yr);
  }
  Compress<C>mpx(xc),mpy(yc);
  struct M{
    V a,b,len;
  };
  using OM=pair<V,V>;
  auto f=[&](M x,M y)->M{
    return {x.a+y.a,x.b+y.b,x.len+y.len};
  };
  auto g=[&](M x,OM y)->M{
    return {x.a+y.first*x.len,x.b+y.second*x.len,x.len};
  };
  auto h=[&](OM x,OM y)->OM{
    return make_pair(x.first+y.first,x.second+y.second);
  };
  LazySegmentTree seg(mpy.size(),f,g,h,M{0,0,0},OM(0,0));
  for(int i=0;i<mpy.size()-1;i++){
    seg.set(i,{0,0,mpy.val(i+1)-mpy.val(i)});
  }
  seg.build();
  vector<vector<int>>ga(mpx.size()),gq(mpx.size());
  for(int i=0;i<add.size();i++){
    auto [xl,xr,yl,yr,v]=add[i];
    if(xl<xr){
      ga[mpx[xl]].push_back(i);
      ga[mpx[xr]].push_back(i);
    }
  }
  for(int i=0;i<query.size();i++){
    auto [xl,xr,yl,yr]=query[i];
    if(xl<xr){
      gq[mpx[xl]].push_back(i);
      gq[mpx[xr]].push_back(i);
    }
  }
  vector<V>ret(query.size());
  for(int i=0;i<mpx.size();i++){
    for(auto j:gq[i]){
      auto [xl,xr,yl,yr]=query[j];
      auto p=seg.query(mpy[yl],mpy[yr]);
      V sum=p.a*mpx.val(i)+p.b;
      if(mpx[xl]==i)ret[j]-=sum;
      else ret[j]+=sum;
    }
    for(auto j:ga[i]){
      auto [xl,xr,yl,yr,v]=add[j];
      OM upd(v,-xl*v);
      if(mpx[xr]==i){
        upd.first=-upd.first,upd.second=xr*v;
      }
      seg.update(mpy[yl],mpy[yr],upd);
    }
  }
  return ret;
}
int main(){
  {}
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  vector<int>n(3);
  rep(i,0,3)cin>>n[i];
  int m;cin>>m;
  vector<int>u(m),v(m);
  rep(i,0,m)cin>>u[i]>>v[i],u[i]--,v[i]--;
  int sn=acc(n);
  vector<pair<int,int>>nu(m,MP(-1,-1)),nv(m,MP(-1,-1));
  {
    int pn=0;
    vector<int>mp(sn);
    rep(i,0,3){
      vector<int>imos(n[i]+2);
      auto get=[&](int x){
        //cout<<"get" spa x spa sn<<endl;
        if(x==sn)return 0;
        if(x==sn+1)return n[i]+1;
        if(pn<=x&&x<pn+n[i]){
          //cout<<x<<endl;
          return x-pn+1;
        }
        return -1;
      };
      rep(j,0,m){
        int l=u[j],r=v[j];
        
        l=get(l),r=get(r);
        if(l>r)swap(l,r);
        //cout<<i spa j spa l spa r<<endl;
        if(l==-1)continue;
        imos[l]++;
        imos[r]--;
      }
      rep(j,0,n[i]+1)imos[j+1]+=imos[j];
      vector<int>idx(n[i]+2);
      rep(j,0,n[i]+1)idx[j+1]=idx[j]+(imos[j]==0);
      //debug(idx);
      if(idx[0]==idx.back()){
        cout<<0<<endl;
        return 0;
      }
      rep(j,0,m){
        //cout<<j spa get(u[j]) spa get(v[j])<<endl;
        if((get(u[j])==-1)^(get(v[j])==-1)){
          if(get(u[j])!=-1)nu[j]=MP(i,idx[get(u[j])]);
          if(get(v[j])!=-1)nv[j]=MP(i,idx[get(v[j])]);
        }
      }
      pn+=n[i];
      n[i]=idx.back();
    }
  }
  vector<vector<int>>premx(3);
  vector<vector<int>>sufmi(3);
  rep(i,0,3){
    premx[i].assign(n[0],0);
    sufmi[i].assign(n[0],n[i]-1);
  }
  rep(i,0,m){
    if(nu[i].fi==-1)continue;
    if(nv[i].fi==0)swap(nu[i],nv[i]);
    if(nu[i].fi!=0)continue;
    if(nv[i].fi==0)continue;
    //cout<<nu[i] spa "-" spa nv[i]<<endl;
    if(nu[i].se!=n[0])chmax(premx[nv[i].fi][nu[i].se],nv[i].se);
    if(nu[i].se!=0)chmin(sufmi[nv[i].fi][nu[i].se-1],nv[i].se-1);
  }
  rep(i,0,n[0]-1)rep(j,0,3)chmax(premx[j][i+1],premx[j][i]);
  rrep(i,0,n[0]-1)rep(j,0,3)chmin(sufmi[j][i],sufmi[j][i+1]);
  vector<tuple<int,int,int,int,ll>>add;
  vector<tuple<int,int,int,int>>query;
  //debug(premx);cout<<endl;debug(sufmi);
  rep(i,0,n[0]){
    if(premx[1][i]<=sufmi[1][i]&&premx[2][i]<=sufmi[2][i]){
      query.EB(premx[1][i],sufmi[1][i]+1,premx[2][i],sufmi[2][i]+1);
    }
  }
  vector<int>lcmi(n[1],n[2]),rcmx(n[1],0);
  //debug(lcmi);
  rep(i,0,m){
    if(nu[i].fi>nv[i].fi)swap(nu[i],nv[i]);
    if(nu[i].fi==1&&nv[i].fi==2){
      //cout<<nu[i].se spa nv[i].se<<endl;
      if(nu[i].se>0)chmin(lcmi[nu[i].se-1],nv[i].se);
      if(nu[i].se<n[1])chmax(rcmx[nu[i].se],nv[i].se);
    }
  }
  rrep(i,0,n[1]-1)chmin(lcmi[i],lcmi[i+1]);
  rep(i,0,n[1]-1)chmax(rcmx[i+1],rcmx[i]);
  //debug(lcmi);
  //debug(rcmx);
  rep(i,0,n[1]){
    if(rcmx[i]<lcmi[i]){
      add.emplace_back(i,i+1,rcmx[i],lcmi[i],1);
    }
  }
  auto all=static_rectangle_add_rectangle_sum(add,query);
  ll ret=0;
  for(auto z:all)ret+=z;
  cout<<ret<<endl;
  return 0;
}
0