結果
問題 | No.728 ギブ and テイク |
ユーザー |
![]() |
提出日時 | 2018-08-24 22:07:40 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 893 ms / 3,000 ms |
コード長 | 4,853 bytes |
コンパイル時間 | 1,517 ms |
コンパイル使用メモリ | 175,140 KB |
実行使用メモリ | 31,444 KB |
最終ジャッジ日時 | 2024-06-23 07:33:54 |
合計ジャッジ時間 | 9,090 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#include<bits/stdc++.h>using namespace std;using Int = long long;struct FullyIndexableDictionary{Int len,blk;vector<Int> bit,sum;FullyIndexableDictionary(){}FullyIndexableDictionary(Int len):len(len),blk((len+31)>>5),bit(blk,0),sum(blk,0){}void set(Int k){bit[k>>5]|=1<<(k&31);}void build(){sum[0]=0;for(Int i=1;i<blk;i++)sum[i]=sum[i-1]+__builtin_popcount(bit[i-1]);}bool operator[](Int k) const{return bool((bit[k>>5]>>(k&31))&1);}Int rank(Int k){return sum[k>>5]+__builtin_popcount(bit[k>>5]&((1<<(k&31))-1));}Int rank(bool v,Int k){return (v?rank(k):k-rank(k));}Int select(bool v,Int k){if(k<0||rank(v,len)<=k) return -1;Int low=0,high=len;while(low+1<high){Int mid=(low+high)>>1;if(rank(v,mid)>=k+1) high=mid;else low=mid;}return high-1;}Int select(bool v,Int i,Int l){return select(v,i+rank(v,l));}};template<class T,Int MAXLOG>struct WaveletMatrix{Int len;FullyIndexableDictionary mat[MAXLOG];Int zs[MAXLOG],buff1[MAXLOG],buff2[MAXLOG];static const T npos=-1;Int freq_dfs(Int d,Int l,Int r,T val,T a,T b){if(l==r) return 0;if(d==MAXLOG) return (a<=val&&val<b)?r-l:0;T nv=1ULL<<(MAXLOG-d-1)|val;T nnv=((1ULL<<(MAXLOG-d-1))-1)|nv;if(nnv<a||b<=val) return 0;if(a<=val&&nnv<b) return r-l;Int lc=mat[d].rank(1,l),rc=mat[d].rank(1,r);return freq_dfs(d+1,l-lc,r-rc,val,a,b)+freq_dfs(d+1,lc+zs[d],rc+zs[d],nv,a,b);}WaveletMatrix(vector<T> data){len=data.size();vector<T> l(len),r(len);for(Int dep=0;dep<MAXLOG;dep++){mat[dep]=FullyIndexableDictionary(len+1);Int p=0,q=0;for(Int i=0;i<len;i++){bool k=(data[i]>>(MAXLOG-(dep+1)))&1;if(k) r[q++]=data[i],mat[dep].set(i);else l[p++]=data[i];}zs[dep]=p;mat[dep].build();swap(l,data);for(Int i=0;i<q;i++) data[p+i]=r[i];}}T access(Int k){T res=0;bool bit;for(Int dep=0;dep<MAXLOG;dep++){bit=mat[dep][k];res=(res<<1)|bit;k=mat[dep].rank(bit,k)+zs[dep]*dep;}return res;}// return the number of v in [0,k)Int rank(T v,Int k){Int l=0,r=k;for(Int dep=0;dep<MAXLOG;dep++){buff1[dep]=l;buff2[dep]=r;bool bit=(v>>(MAXLOG-(dep+1)))&1;l=mat[dep].rank(bit,l)+zs[dep]*bit;r=mat[dep].rank(bit,r)+zs[dep]*bit;}return r-l;}// return the position of k-th vInt select(T v,Int k){rank(v,len);for(Int dep=MAXLOG-1;dep>=0;dep--){bool bit=(v>>(MAXLOG-(dep+1)))&1;k=mat[dep].select(bit,k,buff1[dep]);if(k>=buff2[dep]||k<0) return -1;k-=buff1[dep];}return k;}Int select(T v,Int k,Int l){return select(v,k+rank(v,l));}// return k-th largest value in [l,r)T quantile(Int l,Int r,Int k){if(r-l<=k||k<0) return -1;T res=0;for(Int dep=0;dep<MAXLOG;dep++){Int p=mat[dep].rank(1,l);Int q=mat[dep].rank(1,r);if(q-p>k){l=p+zs[dep];r=q+zs[dep];res|=(1<<(MAXLOG-(dep+1)));}else{k-=(q-p);l-=p;r-=q;}}return res;}T rquantile(Int l,Int r,Int k){return quantile(l,r,r-l-k-1);}// return number of points in [left, right) * [lower, upper)Int rangefreq(Int left,Int right,T lower,T upper){return freq_dfs(0,left,right,0,lower,upper);}pair<Int, Int> ll(Int l,Int r,T v){Int res=0;for(Int dep=0;dep<MAXLOG;dep++){buff1[dep]=l;buff2[dep]=r;bool bit=(v>>(MAXLOG-(dep+1)))&1;if(bit) res+=r-l+mat[dep].rank(bit,l)-mat[dep].rank(bit,r);l=mat[dep].rank(bit,l)+zs[dep]*bit;r=mat[dep].rank(bit,r)+zs[dep]*bit;}return make_pair(res,r-l);}Int lt(Int l,Int r,T v){auto p=ll(l,r,v);return p.first;}Int le(Int l,Int r,T v){auto p=ll(l,r,v);return p.first+p.second;}T succ(Int l,Int r,T v){Int k=le(l,r,v);return k==r-l?npos:rquantile(l,r,k);}T pred(Int l,Int r,T v){Int k=lt(l,r,v);return k?rquantile(l,r,k-1):npos;}};//INSERT ABOVE HEREsigned main(){Int n;cin>>n;const Int OFS = 2e9;vector<Int> a(n),l(n),r(n);for(Int i=0;i<n;i++) cin>>a[i],a[i]+=OFS;for(Int i=0;i<n;i++) cin>>l[i]>>r[i];vector<Int> b(n);for(Int i=0;i<n;i++) b[i]=a[i]-l[i];WaveletMatrix<Int, 40> wm1(b);for(Int i=0;i<n;i++) b[i]=a[i]+r[i];WaveletMatrix<Int, 40> wm2(b);Int ans=0;for(Int i=0;i<n;i++){Int x=lower_bound(a.begin(),a.end(),a[i]-l[i])-a.begin();Int y=upper_bound(a.begin(),a.end(),a[i]+r[i])-a.begin();//cout<<x<<":"<<i<<":"<<y<<endl;ans+=wm2.rangefreq(x,i,a[i],OFS*2);ans+=wm1.rangefreq(i+1,y,0,a[i]+1);}cout<<ans/2<<endl;return 0;}