結果
問題 | No.1435 Mmm...... |
ユーザー | kiyoshi0205 |
提出日時 | 2021-03-19 22:24:57 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 41 ms / 2,000 ms |
コード長 | 6,282 bytes |
コンパイル時間 | 2,709 ms |
コンパイル使用メモリ | 190,432 KB |
実行使用メモリ | 20,224 KB |
最終ジャッジ日時 | 2024-11-18 23:11:32 |
合計ジャッジ時間 | 4,430 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 24 |
ソースコード
#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>// #include<ext/pb_ds/assoc_container.hpp>// #include<ext/pb_ds/tree_policy.hpp>// #include<ext/pb_ds/tag_and_trait.hpp>// using namespace __gnu_pbds;// #include<boost/multiprecision/cpp_int.hpp>// namespace multiprecisioninteger = boost::multiprecision;// using cint=multiprecisioninteger::cpp_int;using namespace std;using ll=long long;using datas=pair<ll,ll>;using ddatas=pair<long double,long double>;using tdata=pair<ll,datas>;using vec=vector<ll>;using mat=vector<vec>;using pvec=vector<datas>;using pmat=vector<pvec>;// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;#define For(i,a,b) for(i=a;i<(ll)b;++i)#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)#define rep(i,N) For(i,0,N)#define rep1(i,N) For(i,1,N)#define brep(i,N) bFor(i,N,0)#define brep1(i,N) bFor(i,N,1)#define all(v) (v).begin(),(v).end()#define allr(v) (v).rbegin(),(v).rend()#define vsort(v) sort(all(v))#define vrsort(v) sort(allr(v))#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())#define endl "\n"#define popcount __builtin_popcountll#define eb emplace_back#define print(x) cout<<x<<endl#define printyes print("Yes")#define printno print("No")#define printYES print("YES")#define printNO print("NO")#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)constexpr ll mod=1000000007;// constexpr ll mod=998244353;constexpr ll inf=1LL<<60;constexpr long double eps=1e-9;const long double PI=acosl(-1);template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}template<class T> ostream& operator<<(ostream& os,const vector<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> ostream& operator<<(ostream& os,const set<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}#ifdef DEBUGvoid debugg(){cout<<endl;}template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)#else#define debug(...) (void(0))#endifvoid startupcpp(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}ll modinv(ll a,ll m=mod) {ll b=m,u=1,v=0,t;while(b){t=a/b;a-=t*b; swap(a,b);u-=t*v; swap(u,v);}return (u+m)%m;}ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}vec modncrlistp,modncrlistm;ll modncr(ll n,ll r){if(n<r)return 0;ll i,size=modncrlistp.size();if(size<=n){modncrlistp.resize(n+1);modncrlistm.resize(n+1);if(!size){modncrlistp[0]=modncrlistm[0]=1;size++;}For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod;modncrlistm[n]=modinv(modncrlistp[n]);for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod;}return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;}ll modpow(ll a,ll n,ll m=mod){if(n<0)return 0;ll res=1;while(n>0){if(n&1)res=res*a%m;a=a*a%m;n>>=1;}return res;}ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}ll lcm(ll a,ll b){return a/gcd(a,b)*b;}template<class S,S(*op)(S,S),S(*e)()>struct segtree{public:segtree():segtree(0){}segtree(int n):segtree(vector<S>(n,e())){}segtree(const vector<S>& v):_n(int(v.size())){log=0;while((1U<<log)<(unsigned int)(_n))++log;size=1<<log;d=vector<S>(size<<1,e());for(int i=0;i<_n;++i)d[size+i]=v[i];for(int i=size-1;i>=1;--i)update(i);}void set(int p,S x){assert(0<=p&&p<_n);p+=size;d[p]=x;for(int i=1;i<=log;++i)update(p>>i);}S get(int p){assert(0<=p&&p<_n);return d[p+size];}S prod(int l,int r){assert(0<=l&&l<=r&&r<=_n);S sml=e(),smr=e();l+=size;r+=size;while(l<r){if(l&1)sml=op(sml,d[l++]);if(r&1)smr=op(d[--r],smr);l>>=1;r>>=1;}return op(sml,smr);}S all_prod(){return d[1];}template<bool(*f)(S)>int max_right(int l){return max_right(l,[](S x){return f(x);});}template<class F>int max_right(int l,F f){assert(0<=l&&l<=_n);assert(f(e()));if(l==_n)return _n;l+=size;S sm=e();do{while(~l&1)l>>=1;if(!f(op(sm,d[l]))){while(l<size){l<<=1;if(f(op(sm,d[l]))){sm=op(sm,d[l++]);}}return l-size;}sm=op(sm,d[l++]);}while((l&-l)!=l);return _n;}template<bool(*f)(S)>int min_left(int r){return min_left(r,[](S x){return f(x);});}template<class F>int min_left(int r,F f){assert(0<=r&&r<=_n);assert(f(e()));if(r==0)return 0;r+=size;S sm=e();do{--r;while(r>1&&(r&1))r>>=1;if(!f(op(d[r],sm))){while(r<size){r=r<<1|1;if(f(op(d[r],sm))){sm=op(d[r--],sm);}}return r+1-size;}sm=op(d[r],sm);}while((r&-r)!=r);return 0;}private:int _n,size,log;vector<S> d;void update(int k){d[k]=op(d[k<<1],d[k<<1|1]);}};struct S{ll mi,mi2,ma;};S op(S l,S r){if(l.mi>r.mi)swap(l,r);return S({l.mi,min(r.mi,l.mi2),max(l.ma,r.ma)});}constexpr S e(){return S({mod*2,mod*2,0});}constexpr bool g(S t){return t.ma<=t.mi+t.mi2;}ll N,M,K,H,W,A,B,C,D;string s,t;ll ans;int main(){startupcpp();// int codeforces;cin>>codeforces;while(codeforces--){ll i,j;cin>>N;vector<S> v(N);rep(i,N){cin>>j;v[i]=S({j,mod*2,j});}segtree<S,op,e> seg(v);rep(i,N){ans+=seg.max_right(i,g)-i-1;}print(ans);// }}