結果
| 問題 | No.2374 ASKT Subsequences |
| ユーザー |
 eQe
|
| 提出日時 | 2024-12-28 02:53:24 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 89 ms / 2,000 ms |
| コード長 | 5,702 bytes |
| コンパイル時間 | 8,678 ms |
| コンパイル使用メモリ | 328,236 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-12-28 02:53:35 |
| 合計ジャッジ時間 | 8,666 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 28 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;namespace my{#define eb emplace_back#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)#define VL(n,...) vec<ll>__VA_ARGS__;setsize({n},__VA_ARGS__);lin(__VA_ARGS__)#define FO(n) for(ll ij=n;ij-->0;)#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))#define of(i,...) for(auto[i,i##stop,i##step]=range(1,__VA_ARGS__);i>=i##stop;i-=i##step)#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}using ll=long long;constexpr auto range(bool s,auto...a){array<ll,3>r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;return r;}constexpr char newline=10;constexpr char space=32;constexpr ll width2(auto x){x|=1;ll r=0;while(x>0)x>>=1,++r;return r;}constexpr ll log2_floor(auto x){return width2(x)-1;}auto max(const auto&...a){return max(initializer_list<common_type_t<decltype(a)...>>{a...});}template<class A,class B>struct pair{A a;B b;pair()=default;pair(A a,B b):a(a),b(b){}pair(const std::pair<A,B>&p):a(p.first),b(p.second){}auto operator<=>(const pair&)const=default;pair operator+(const pair&p)const{return{a+p.a,b+p.b};}friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<space<<p.b;}};template<class T,class U>ostream&operator<<(ostream&o,const std::pair<T,U>&p){return o<<p.first<<space<<p.second;}template<class T,size_t n>ostream&operator<<(ostream&o,const array<T,n>&a){fo(i,n)o<<a[i]<<string(i!=n-1,space);return o;}template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;template<class T>struct vec_attr{using core_type=T;static constexpr int d=0;};template<vectorial V>struct vec_attr<V>{using core_type=typename vec_attr<typename V::value_type>::core_type;static constexpr int d=vec_attr<typenameV::value_type>::d+1;};template<class T>using core_t=vec_attr<T>::core_type;template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?newline:space);return o;}template<class V>struct vec:vector<V>{using vector<V>::vector;vec(const vector<V>&v){vector<V>::operator=(v);}vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}vec operator^(const vec&u)const{return vec{*this}^=u;}vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;}vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;}vec operator+(const vec&u)const{return vec{*this}+=u;}vec operator-(const vec&u)const{return vec{*this}-=u;}vec&operator++(){fe(*this,e)++e;return*this;}vec&operator--(){fe(*this,e)--e;return*this;}vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}auto scan(const auto&f)const{pair<core_t<V>,bool>r{};fe(*this,e)if constexpr(!vectorial<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;}auto max()const{return scan([](auto&a,const auto&b){a<b?a=b:0;}).a;}vec zeta()const{vec v=*this;if constexpr(vectorial<V>)fe(v,e)e=e.zeta();fo(i,v.size()-1)v[i+1]+=v[i];return v;}};template<class T=ll,size_t n,size_t i=0>auto make_vec(const ll(&s)[n],T x={}){if constexpr(n==i+1)return vec<T>(s[i],x);else{auto X=make_vec<T,n,i+1>(s,x);return vec<decltype(X)>(s[i],X);}}template<ll n,class...A>void setsize(const ll(&l)[n],A&...a){((a=make_vec(l,core_t<A>())),...);}void lin(auto&...a){(cin>>...>>a);}template<char c=space>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<newline;}struct bit_vector:vec<uint8_t>{bit_vector(){}bit_vector(ll n){this->resize(n);fo(i,2){cnt[i].resize(n);se[i].reserve(n);}}void build(){fo(i,this->size())cnt[(*this)[i]][i]++,se[(*this)[i]].eb(i);fo(f,2)cnt[f]=cnt[f].zeta();}inline ll count(ll l,ll r,bool f)const{return count(r,f)-count(l,f);}inline ll count(ll r,bool f)const{return r<=0?0:cnt[f][r-1];}private:array<vec<int>,2>cnt,se;};struct wavelet_matrix{ll n,A,log;vec<bit_vector>bv;vec<ll>left;wavelet_matrix(vec<ll>a){n=a.size(),log=log2_floor(a.max())+1,A=(1LL<<log);vec<ll>cu=a;of(h,log){bit_vector b(n);fo(i,n)b[i]=(cu[i]>>h&1);b.build(),bv.eb(b);vec<ll>pre,suf;fo(i,n)!b[i]?pre.eb(cu[i]):suf.eb(cu[i]);cu=pre^suf;}left.resize(A,n);of(i,n)left[cu[i]]=i;}inline ll operator[](ll i)const{return get(i);}ll get(ll i)const{assert(0<=i&&i<n);ll x=0,cu=i;fo(h,log){bool f=bv[h][cu];x=(x<<1)+f;cu=bv[h].count(cu+1,f)-1;if(f)cu+=bv[h].count(n,0);}return x;}ll count(ll l,ll r,ll x)const{return count(r,x)-count(l,x);}ll count(ll r,ll x)const{assert(r<=n);if(r<=0)return 0;if(x>=A)return 0;if(left[x]==n)return 0;ll cu=r-1;fo(h,log){bool f=(x>>(log-1-h)&1);cu=bv[h].count(cu+1,f)-1;if(f)cu+=bv[h].count(n,0);}return cu-left[x]+1;}friend ostream&operator<<(ostream&o,const wavelet_matrix&wv){fo(i,wv.n)o<<wv[i]<<string(i<wv.n-1,space);return o;}};single_testcasevoid solve(){LL(N);VL(N,a);wavelet_matrix wm(a);ll ans=0;fo(i,1,N-1){fo(j,i+1,N){ll k=a[i]-a[j];if(k<=0)continue;if(a[j]-10>0)ans+=wm.count(0,i,a[j]-10)*wm.count(j,N,a[i]+1);}}pp(ans);}}