結果

問題 No.992 最長増加部分列の数え上げ
ユーザー hotman78hotman78
提出日時 2020-02-14 23:15:02
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 10,740 bytes
コンパイル時間 4,573 ms
コンパイル使用メモリ 379,320 KB
実行使用メモリ 18,944 KB
最終ジャッジ日時 2024-10-06 13:16:27
合計ジャッジ時間 9,541 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 1 ms
6,816 KB
testcase_04 AC 40 ms
9,472 KB
testcase_05 AC 26 ms
7,680 KB
testcase_06 AC 47 ms
10,880 KB
testcase_07 AC 33 ms
8,832 KB
testcase_08 AC 16 ms
6,816 KB
testcase_09 AC 34 ms
8,960 KB
testcase_10 AC 47 ms
10,880 KB
testcase_11 AC 59 ms
12,800 KB
testcase_12 AC 13 ms
6,820 KB
testcase_13 AC 32 ms
8,704 KB
testcase_14 AC 31 ms
8,576 KB
testcase_15 AC 13 ms
6,820 KB
testcase_16 AC 89 ms
17,536 KB
testcase_17 AC 17 ms
6,820 KB
testcase_18 AC 30 ms
8,448 KB
testcase_19 AC 57 ms
12,672 KB
testcase_20 AC 99 ms
18,944 KB
testcase_21 AC 98 ms
18,944 KB
testcase_22 AC 99 ms
18,944 KB
testcase_23 AC 100 ms
18,944 KB
testcase_24 AC 97 ms
18,944 KB
testcase_25 AC 98 ms
18,816 KB
testcase_26 AC 99 ms
18,944 KB
testcase_27 AC 97 ms
18,944 KB
testcase_28 AC 99 ms
18,944 KB
testcase_29 AC 99 ms
18,816 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC push_options
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define MOD 1000000007LL
//#define MOD 998244353LL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
//inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
//inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
//auto call=[&](auto f,auto... args){return f(f,args...);};

class mint {
  using u64 = std::uint_fast64_t;
    public:
    u64 a;
    constexpr mint(const u64 x = 0)noexcept:a(x % MOD){}
    constexpr u64 &value()noexcept{return a;}
    constexpr const u64 &value() const noexcept {return a;}
    constexpr mint operator+(const mint rhs)const noexcept{return mint(*this) += rhs;}
    constexpr mint operator-(const mint rhs)const noexcept{return mint(*this)-=rhs;}
    constexpr mint operator*(const mint rhs) const noexcept {return mint(*this) *= rhs;}
    constexpr mint operator/(const mint rhs) const noexcept {return mint(*this) /= rhs;}
    constexpr mint &operator+=(const mint rhs) noexcept {
        a += rhs.a;
        if (a >= MOD)a -= MOD;
        return *this;
    }
    constexpr mint &operator-=(const mint rhs) noexcept {
        if (a<rhs.a)a += MOD;
        a -= rhs.a;
        return *this;
    }
    constexpr mint &operator*=(const mint rhs) noexcept {
        a = a * rhs.a % MOD;
        return *this;
    }
    constexpr mint operator++(int n) noexcept {
        a += 1;
        if (a >= MOD)a -= MOD;
        return *this;
    }
    constexpr mint operator--(int n) noexcept {
        if (a<1)a += MOD;
        a -= 1;
        return *this;
    }
    constexpr mint &operator/=(mint rhs) noexcept {
        u64 exp=MOD-2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
    mint pow(long long n){
        long long x=a;
        mint ret = 1;
        while(n>0) {
            if(n&1)(ret*=x);
            (x*=x)%=MOD;
            n>>=1;
        }
        return ret;
    }
    mint inv()const{
        int _a=a,b=MOD,u=1,v=0,t;
        while(b>0) {
            t=_a/b;
            swap(_a-=t*b,b);
            swap(u-=t*v,v);
        }
        return mint(u);
    }
    mint comb(lint b){
        using lint=long long;
        static bool init=1;
        static lint fac[3000001],ifac[3000001];
        if(init){
            init=0;
            fac[0]=1;
            ifac[0]=1;
            auto mod_pow=[&](lint x,lint n){
                lint ans = 1;
                while(n != 0){
                    if(n&1)ans=ans*x%MOD;
                    x=x*x%MOD;
                    n=n>>1;
                }
                return ans;
            };
            for(int i=0;i<3000000;i++){
                fac[i+1]=fac[i]*(i+1)%MOD;
                ifac[i+1]=ifac[i]*mod_pow(i+1, MOD-2)%MOD;
            }
        }
        if(a==0&&b==0)return 1;
        if((lint)a<b||a<0)return 0;
        lint tmp=ifac[a-b]*ifac[b]%MOD;
        return tmp*fac[a]%MOD;
    }
    
    friend ostream& operator<<(ostream& lhs, const mint& rhs) noexcept {
        lhs << rhs.a;
        return lhs;
    }
    friend istream& operator>>(istream& lhs,mint& rhs) noexcept {
        lhs >> rhs.a;
        return lhs;
    }
};
inline mint fact(lint a){return a?fact(a-1)*a:1;}

template<typename T,typename E>
class AVL_map{
	struct node;
	using np=node*;
    struct node{
        T key;E val;E cal;
        int cnt=1;
        int dep=0;
        np ch[2]={nullptr,nullptr};
        node(T key,E val):key(key),val(val){}
    };
    bool is_multi=true;
    np root=nullptr;
    inline int count(np t){return t?t->cnt:0;}
    inline int depth(np t){return t?t->dep:0;}
    inline E calc(np t){return t?t->cal:e;}
    inline np update(np& t,bool f=1){
		if(!t)return t;
        t->cnt=count(t->ch[0])+1+count(t->ch[1]);
        t->dep=max(depth(t->ch[0]),depth(t->ch[1]))+1;
        //if(func){
            t->cal=e;
            if(t->ch[0])t->cal=func(t->cal,t->ch[0]->val);
            t->cal=func(t->cal,t->val);
            if(t->ch[1])t->cal=func(t->cal,t->ch[1]->val);
        //}
        if(f&&abs(depth(t->ch[0])-depth(t->ch[1]))==2){
			rebuild(t,depth(t->ch[0])<depth(t->ch[1]));
		}
        return t;
    }
    E e=0;
    E func(E s,E t){
        return s+t;
    }
    public:
	AVL_map(){}
    AVL_map(bool f){is_multi=f;}
    inline void insert(T key,E val){insert(key,val,root);}
    inline void erase(T key){erase(key,root);}
    inline int lower_bound(T key){return lower_bound(key,root);}
	inline int upper_bound(T key){return upper_bound(key,root);}
    inline int count(T key){return upper_bound(key,root)-lower_bound(key,root);}
	inline int size(){return count(root);}
	inline T find_by_order(int idx){assert(0<=idx&&idx<size());return find_by_order(idx,root);}
	inline T operator[](int idx){return find_by_order(idx);}
    inline void allow_multi(bool f){is_multi=f;}
    inline E get_sum_by_order(int l,int r){return get_sum_by_order(l,r,-1,root);}
    inline E get_sum(lint l,lint r){return get_sum(l,r,-1,root);}
    private:
    E get_sum(T l,T r,int p,np t){
        if(!t)return e;
        bool f=l<=t->key&&t->key<r;
        if(r<=t->key)return get_sum(l,r,-1,t->ch[0]);
        if(l>t->key)return get_sum(l,r,-1,t->ch[1]);
        E l_val=(f&&p==1)?calc(t->ch[0]):get_sum(l,r,0,t->ch[0]);
        E r_val=(f&&p==0)?calc(t->ch[1]):get_sum(l,r,1,t->ch[1]);
        return func(func(l_val,f?t->val:e),r_val);
    }
    E get_sum_by_order(int l,int r,int p,np t){
        if(!t)return e;
        int idx=count(t->ch[0]);
        bool f=l<=idx&&idx<r;
        if(r<=idx)return get_sum_by_order(l,r,-1,t->ch[0]);
        if(l>idx)return get_sum_by_order(l-idx-1,r-idx-1,-1,t->ch[1]);
        E l_val=(f&&p==1)?calc(t->ch[0]):get_sum_by_order(l,r,0,t->ch[0]);
        E r_val=(f&&p==0)?calc(t->ch[1]):get_sum_by_order(l-idx-1,r-idx-1,1,t->ch[1]);
        return func(func(l_val,f?t->val:e),r_val);
    }
    void insert(T key,E val,np& t){
        if(!t)t=new node(key,val);
        else if(key<=t->key)insert(key,val,t->ch[0]);
        else if(key>t->key)insert(key,val,t->ch[1]);
        update(t);
    }
    void erase(T key,np& t){
        if(!t)return;
        else if(key==t->key){
			if(!t->ch[0]||!t->ch[1])t=t->ch[0]?t->ch[0]:t->ch[1];
			else move_down(t->ch[0],t);
		}
        else if(key<t->key)erase(key,t->ch[0]);
        else if(key>t->key)erase(key,t->ch[1]);
		update(t);
    }
	void move_down(np& t,np& p){
		if(t->ch[1])move_down(t->ch[1],p);
		else p->key=t->key,t=t->ch[0];
		update(t);
	}
    int lower_bound(T key,np t){
        if(!t)return 0;
        if(key<=t->key)return lower_bound(key,t->ch[0]);
        else return count(t->ch[0])+1+lower_bound(key,t->ch[1]);
    }
	int upper_bound(T key,np t){
        if(!t)return 0;
        if(key<t->key)return upper_bound(key,t->ch[0]);
        else return count(t->ch[0])+1+upper_bound(key,t->ch[1]);
    }
	E find_by_order(int idx,np t){
		if(idx==count(t->ch[0]))return t->val;
		else if(idx<count(t->ch[0]))return find_by_order(idx,t->ch[0]);
		else return find_by_order(idx-count(t->ch[0])-1,t->ch[1]);
	}
	np rot(np t){
		int b=depth(t->ch[0])<depth(t->ch[1]);
		if(depth(t->ch[0])==depth(t->ch[1]))return t;
		np s=t->ch[b];
		t->ch[b]=s->ch[1-b];
		s->ch[1-b]=t;
		update(t,0);update(s,0);
		return s;
	}
    void rebuild(np& t,int b){
		if(t->ch[b]&&depth(t->ch[b]->ch[b])<depth(t->ch[b]->ch[1-b])){
			t->ch[b]=rot(t->ch[b]);
		}
		t=rot(update(t,0));
    }
};


int main(){
    lint n;
    cin>>n;
    vec a(n);
    rep(i,n)cin>>a[i];
    vec dp;
    vector<lint>dp2(n);
    rep(i,n){
        auto itr=lower_bound(all(dp),a[i]);
        if(itr==dp.end()){
            dp.push_back(a[i]);
            dp2[i]=dp.size()-1;
        }
        else {
            *itr=a[i];
            dp2[i]=itr-dp.begin();
        }
    }
    hash_map<lint,AVL_map<lint,mint>>m;
    rep(i,n){
        if(dp2[i]==0)m[0].insert(a[i],1);
        else{
            m[dp2[i]].insert(a[i],m[dp2[i]-1].get_sum(-INF,a[i]).a);
        }
    }
    cout<<m[dp.size()-1].get_sum(-INF,INF)<<endl;
}
0