結果
問題 | No.992 最長増加部分列の数え上げ |
ユーザー | rniya |
提出日時 | 2020-10-06 10:25:41 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 99 ms / 2,000 ms |
コード長 | 8,423 bytes |
コンパイル時間 | 2,296 ms |
コンパイル使用メモリ | 217,888 KB |
実行使用メモリ | 16,500 KB |
最終ジャッジ日時 | 2024-07-20 00:41:50 |
合計ジャッジ時間 | 8,442 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 37 ms
8,448 KB |
testcase_05 | AC | 27 ms
7,040 KB |
testcase_06 | AC | 47 ms
9,472 KB |
testcase_07 | AC | 34 ms
8,064 KB |
testcase_08 | AC | 17 ms
5,888 KB |
testcase_09 | AC | 36 ms
8,192 KB |
testcase_10 | AC | 45 ms
9,344 KB |
testcase_11 | AC | 57 ms
10,624 KB |
testcase_12 | AC | 13 ms
5,376 KB |
testcase_13 | AC | 32 ms
7,808 KB |
testcase_14 | AC | 32 ms
7,936 KB |
testcase_15 | AC | 12 ms
5,376 KB |
testcase_16 | AC | 87 ms
15,420 KB |
testcase_17 | AC | 17 ms
5,888 KB |
testcase_18 | AC | 30 ms
7,936 KB |
testcase_19 | AC | 54 ms
10,748 KB |
testcase_20 | AC | 93 ms
16,412 KB |
testcase_21 | AC | 92 ms
16,384 KB |
testcase_22 | AC | 91 ms
16,384 KB |
testcase_23 | AC | 94 ms
16,384 KB |
testcase_24 | AC | 93 ms
16,384 KB |
testcase_25 | AC | 94 ms
16,500 KB |
testcase_26 | AC | 93 ms
16,416 KB |
testcase_27 | AC | 95 ms
16,340 KB |
testcase_28 | AC | 99 ms
16,444 KB |
testcase_29 | AC | 92 ms
16,384 KB |
testcase_30 | AC | 71 ms
15,604 KB |
testcase_31 | AC | 74 ms
15,696 KB |
testcase_32 | AC | 72 ms
15,696 KB |
testcase_33 | AC | 73 ms
15,708 KB |
testcase_34 | AC | 74 ms
15,616 KB |
testcase_35 | AC | 73 ms
15,624 KB |
testcase_36 | AC | 70 ms
15,624 KB |
testcase_37 | AC | 70 ms
15,500 KB |
testcase_38 | AC | 69 ms
15,624 KB |
testcase_39 | AC | 70 ms
15,628 KB |
testcase_40 | AC | 78 ms
15,880 KB |
testcase_41 | AC | 79 ms
15,616 KB |
testcase_42 | AC | 74 ms
15,616 KB |
testcase_43 | AC | 77 ms
15,808 KB |
testcase_44 | AC | 78 ms
15,628 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define LOCAL #pragma region Macros typedef long long ll; #define ALL(x) (x).begin(),(x).end() const long long MOD=1000000007; // const long long MOD=998244353; const int INF=1e9+10; const long long IINF=1e18; const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1}; const char dir[4]={'D','R','U','L'}; template<typename T> istream &operator>>(istream &is,vector<T> &v){ for (T &x:v) is >> x; return is; } template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const pair<T,U> &p){ os << '(' << p.first << ',' << p.second << ')'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();++itr){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; --itr; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();++itr){ os << *itr; if (++itr!=s.end()) os << ','; --itr; } os << '}'; return os; } void debug_out(){cerr << '\n';} template<class Head,class... Tail> void debug_out(Head&& head,Tail&&... tail){ cerr << head; if (sizeof...(Tail)>0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) cerr << " ";\ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\ cerr << " ";\ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;} template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;} template<class T1,class T2> inline bool chmin(T1 &a,T2 b){ if (a>b){a=b; return true;} return false; } template<class T1,class T2> inline bool chmax(T1 &a,T2 b){ if (a<b){a=b; return true;} return false; } #pragma endregion template<uint32_t mod> class modint{ using i64=int64_t; using u32=uint32_t; using u64=uint64_t; public: u32 v; constexpr modint(const i64 x=0) noexcept :v(x<0?mod-1-(-(x+1)%mod):x%mod){} constexpr u32 &value() noexcept {return v;} constexpr const u32 &value() const noexcept {return v;} constexpr modint operator+(const modint &rhs) const noexcept {return modint(*this)+=rhs;} constexpr modint operator-(const modint &rhs) const noexcept {return modint(*this)-=rhs;} constexpr modint operator*(const modint &rhs) const noexcept {return modint(*this)*=rhs;} constexpr modint operator/(const modint &rhs) const noexcept {return modint(*this)/=rhs;} constexpr modint &operator+=(const modint &rhs) noexcept { v+=rhs.v; if (v>=mod) v-=mod; return *this; } constexpr modint &operator-=(const modint &rhs) noexcept { if (v<rhs.v) v+=mod; v-=rhs.v; return *this; } constexpr modint &operator*=(const modint &rhs) noexcept { v=(u64)v*rhs.v%mod; return *this; } constexpr modint &operator/=(const modint &rhs) noexcept { return *this*=rhs.pow(mod-2); } constexpr modint pow(u64 exp) const noexcept { modint self(*this),res(1); while (exp>0){ if (exp&1) res*=self; self*=self; exp>>=1; } return res; } constexpr modint &operator++() noexcept {if (++v==mod) v=0; return *this;} constexpr modint &operator--() noexcept {if (v==0) v=mod; return --v,*this;} constexpr modint operator++(int) noexcept {modint t=*this; return ++*this,t;} constexpr modint operator--(int) noexcept {modint t=*this; return --*this,t;} template<class T> friend constexpr modint operator+(T x,modint y) noexcept {return modint(x)+y;} template<class T> friend constexpr modint operator-(T x,modint y) noexcept {return modint(x)-y;} template<class T> friend constexpr modint operator*(T x,modint y) noexcept {return modint(x)*y;} template<class T> friend constexpr modint operator/(T x,modint y) noexcept {return modint(x)/y;} constexpr bool operator==(const modint &rhs) const noexcept {return v==rhs.v;} constexpr bool operator!=(const modint &rhs) const noexcept {return v!=rhs.v;} constexpr bool operator!() const noexcept {return !v;} friend istream &operator>>(istream &s,modint &rhs) noexcept { i64 v; rhs=modint{(s>>v,v)}; return s; } friend ostream &operator<<(ostream &s,const modint &rhs) noexcept { return s<<rhs.v; } }; template<typename Monoid> struct SegmentTree{ typedef function<Monoid(Monoid,Monoid)> F; int n; F f; Monoid id; vector<Monoid> dat; SegmentTree(int n_,F f,Monoid id):f(f),id(id){init(n_);} void init(int n_){ n=1; while(n<n_) n<<=1; dat.assign(n<<1,id); } void build(const vector<Monoid> &v){ for (int i=0;i<v.size();++i) dat[i+n]=v[i]; for (int i=n-1;i;--i) dat[i]=f(dat[i<<1|0],dat[i<<1|1]); } void update(int k,Monoid x){ dat[k+=n]=x; while(k>>=1) dat[k]=f(dat[k<<1|0],dat[k<<1|1]); } Monoid query(int a,int b){ if (a>=b) return id; Monoid vl=id,vr=id; for (int l=a+n,r=b+n;l<r;l>>=1,r>>=1){ if (l&1) vl=f(vl,dat[l++]); if (r&1) vr=f(dat[--r],vr); } return f(vl,vr); } template<typename C> int find_subtree(int k,const C &check,Monoid &M,bool type){ while(k<n){ Monoid nxt=type?f(dat[k<<1|type],M):f(M,dat[k<<1|type]); if (check(nxt)) k=k<<1|type; else M=nxt,k=k<<1|(type^1); } return k-n; } // min i s.t. f(seg[a],seg[a+1],...,seg[i]) satisfy "check" template<typename C> int find_first(int a,const C &check){ Monoid L=id; if (a<=0){ if (check(f(L,dat[1]))) return find_subtree(1,check,L,false); return -1; } int b=n; for (int l=a+n,r=b+n;l<r;l>>=1,r>>=1){ if (l&1){ Monoid nxt=f(L,dat[l]); if (check(nxt)) return find_subtree(l,check,L,false); L=nxt; ++l; } } return -1; } // max i s.t. f(seg[i],...,seg[b-2],seg[b-1]) satisfy "check" template<typename C> int find_last(int b,const C &check){ Monoid R=id; if (b>=n){ if (check(f(dat[1],R))) return find_subtree(1,check,R,true); return -1; } int a=n; for (int l=a,r=b+n;l<r;l>>=1,r>>=1){ if (r&1){ Monoid nxt=f(dat[--r],R); if (check(nxt)) return find_subtree(r,check,R,true); R=nxt; } } return -1; } Monoid operator[](int i){return dat[i+n];} }; using mint=modint<MOD>; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector<int> A(N); for (int i=0;i<N;++i) cin >> A[i]; vector<int> dp(N,INF),lis(N),pos(N); vector<vector<pair<int,int>>> group(N+1); for (int i=0;i<N;++i){ auto itr=lower_bound(dp.begin(),dp.end(),A[i]); lis[i]=itr-dp.begin()+1; *itr=A[i]; group[lis[i]].emplace_back(A[i],i); } group[0].emplace_back(-INF,-1); for (int i=1;i<=N;++i) sort(group[i].begin(),group[i].end()); vector<int> sz(N+1); for (int i=0;i<=N;++i){ sz[i]+=group[i].size(); if (i<N) sz[i+1]+=sz[i]; if (i) for (int j=0;j<group[i].size();++j){ pos[group[i][j].second]=sz[i-1]+j; } } SegmentTree<mint> seg(N+1,[](mint a,mint b){return a+b;},0); seg.update(0,1); for (int i=0;i<N;++i){ int lb=-1,ub=group[lis[i]-1].size(); while(ub-lb>1){ int mid=(ub+lb)>>1; (group[lis[i]-1][mid].first<A[i]?lb:ub)=mid; } int l=sz[lis[i]-1]-group[lis[i]-1].size(); // debug(lis[i],sz[lis[i]-1],ub,l,l+ub); seg.update(pos[i],seg.query(l,l+ub)); // for (int j=0;j<=N;++j) cerr << seg[j] << (j==N?'\n':' '); } mint ans=0; for (int i=N;i>0;--i){ if (!group[i].empty()){ ans=seg.query(sz[i-1],sz[i]); cout << ans << '\n'; return 0; } } }