結果
問題 | No.992 最長増加部分列の数え上げ |
ユーザー | tatyam |
提出日時 | 2020-02-14 21:51:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 15,272 bytes |
コンパイル時間 | 2,802 ms |
コンパイル使用メモリ | 220,068 KB |
実行使用メモリ | 14,848 KB |
最終ジャッジ日時 | 2024-10-06 11:22:48 |
合計ジャッジ時間 | 8,405 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 47 ms
8,704 KB |
testcase_05 | AC | 35 ms
6,144 KB |
testcase_06 | AC | 59 ms
8,960 KB |
testcase_07 | AC | 43 ms
8,576 KB |
testcase_08 | AC | 23 ms
6,016 KB |
testcase_09 | AC | 48 ms
8,448 KB |
testcase_10 | AC | 59 ms
8,960 KB |
testcase_11 | AC | 76 ms
9,344 KB |
testcase_12 | AC | 15 ms
5,248 KB |
testcase_13 | AC | 42 ms
8,448 KB |
testcase_14 | AC | 43 ms
8,448 KB |
testcase_15 | AC | 15 ms
5,248 KB |
testcase_16 | AC | 123 ms
14,208 KB |
testcase_17 | AC | 24 ms
6,016 KB |
testcase_18 | AC | 42 ms
8,448 KB |
testcase_19 | AC | 73 ms
9,344 KB |
testcase_20 | AC | 134 ms
14,592 KB |
testcase_21 | AC | 136 ms
14,848 KB |
testcase_22 | AC | 133 ms
14,592 KB |
testcase_23 | AC | 135 ms
14,720 KB |
testcase_24 | AC | 132 ms
14,592 KB |
testcase_25 | AC | 136 ms
14,848 KB |
testcase_26 | AC | 130 ms
14,720 KB |
testcase_27 | AC | 131 ms
14,720 KB |
testcase_28 | AC | 129 ms
14,720 KB |
testcase_29 | AC | 132 ms
14,720 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 | - |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; using uint = unsigned int; using pcc = pair<char, char>; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using tuplis = array<ll, 3>; template<class T> using pq = priority_queue<T, vector<T>, greater<T>>; const ll LINF=0x1fffffffffffffff; const ll MINF=0x7fffffffffff; const int INF=0x3fffffff; const int MOD=1000000007; const int MODD=998244353; const ld DINF=numeric_limits<ld>::infinity(); const ld EPS=1e-9; const ld PI=3.1415926535897932; const ll four[] = {0, 1, 0, -1, 0}; const ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0}; #define overload4(_1,_2,_3,_4,name,...) name #define overload3(_1,_2,_3,name,...) name #define rep1(n) for(ll i=0;i<n;++i) #define rep2(i,n) for(ll i=0;i<n;++i) #define rep3(i,a,b) for(ll i=a;i<b;++i) #define rep4(i,a,b,c) for(ll i=a;i<b;i+=c) #define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__) #define rrep1(n) for(ll i=(n)-1;i>=0;i--) #define rrep2(i,n) for(ll i=(n)-1;i>=0;i--) #define rrep3(i,a,b) for(ll i=(b)-1;i>=(a);i--) #define rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c) #define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__) #define each(i,...) for(auto&& i:__VA_ARGS__) #define all1(i) begin(i),end(i) #define all2(i,a) begin(i),begin(i)+a #define all3(i,a,b) begin(i)+a,begin(i)+b #define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__) #define rall1(i) (i).rbegin(),(i).rend() #define rall2(i,k) (i).rbegin(),(i).rbegin()+k #define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b #define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__) #define sum(...) accumulate(all(__VA_ARGS__),0LL) #define dsum(...) accumulate(all(__VA_ARGS__),0.0L) #define elif else if #define unless(a) if(!(a)) #define mp make_pair #define mt make_tuple #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__) #define SORT(a) sort(all(a)) #define REVERSE(a) reverse(all(a)) #define UNIQUE(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define vec(type,name,...) vector<type> name(__VA_ARGS__) #define VEC(type,name,size) vector<type> name(size);in(name) #define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) #define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name) #define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__))) template<class T> auto max(const T& a){ return *max_element(all(a)); } template<class T> auto min(const T& a){ return *min_element(all(a)); } ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; } ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); } ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } template<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; } template<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; } vector<pll> factor(ull x){ vector<pll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; } vector<ll> divisor(ull x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; } template<class T> unordered_map<T, ll> press(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); unordered_map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; } template<class T> map<T, ll> press_map(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; } int scan(){ return getchar(); } void scan(int& a){ scanf("%d", &a); } void scan(unsigned& a){ scanf("%u", &a); } void scan(long& a){ scanf("%ld", &a); } void scan(long long& a){ scanf("%lld", &a); } void scan(unsigned long long& a){ scanf("%llu", &a); } void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); } void scan(float& a){ scanf("%f", &a); } void scan(double& a){ scanf("%lf", &a); } void scan(long double& a){ scanf("%Lf", &a); } void scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } } void scan(char a[]){ scanf("%s", a); } void scan(string& a){ cin >> a; } template<class T> void scan(vector<T>&); template<class T, size_t size> void scan(array<T, size>&); template<class T, class L> void scan(pair<T, L>&); template<class T, size_t size> void scan(T(&)[size]); template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); } template<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); } template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); } template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); } template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); } template<class T> void scan(T& a){ cin >> a; } void in(){} template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); } void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } void print(int a){ printf("%d", a); } void print(unsigned a){ printf("%u", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(unsigned long long a){ printf("%llu", a); } void print(char a){ printf("%c", a); } void print(char a[]){ printf("%s", a); } void print(const char a[]){ printf("%s", a); } void print(float a){ printf("%.15f", a); } void print(double a){ printf("%.15f", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } template<class T> void print(const vector<T>&); template<class T, size_t size> void print(const array<T, size>&); template<class T, class L> void print(const pair<T, L>& p); template<class T, size_t size> void print(const T (&)[size]); template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); } template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } } template<class T> void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; } template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } #ifdef DEBUG void err(){ putchar('\n'); } template<class T> void err(const T& t){ print(t); putchar('\n'); } template<class Head, class... Tail> void err(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); } #else template<class... T> void err(const T&...){} #endif int first(bool i = true){ return out(i?"first":"second"); } int yes(bool i = true){ return out(i?"yes":"no"); } int Yes(bool i = true){ return out(i?"Yes":"No"); } int No(){ return out("No"); } int YES(bool i = true){ return out(i?"YES":"NO"); } int NO(){ return out("NO"); } int Yay(bool i = true){ return out(i?"Yay!":":("); } int possible(bool i = true){ return out(i?"possible":"impossible"); } int Possible(bool i = true){ return out(i?"Possible":"Impossible"); } int POSSIBLE(bool i = true){ return out(i?"POSSIBLE":"IMPOSSIBLE"); } void Case(ll i){ printf("Case #%lld: ", i); } constexpr uint mod = MOD; struct Modint{ uint num = 0; constexpr Modint(){} constexpr Modint(const Modint &x) : num(x.num){} inline constexpr operator ll() const { return num; } inline constexpr Modint& operator+=(Modint x){ num += x.num; if(num >= mod) num -= mod; return *this; } inline constexpr Modint& operator++(){ if(num == mod - 1) num = 0; else num++; return *this; } inline constexpr Modint operator++(int){ Modint ans(*this); operator++(); return ans; } inline constexpr Modint operator- () const { return Modint(0) -= *this; } inline constexpr Modint operator- (Modint x) const { return Modint(*this) -= x; } inline constexpr Modint& operator-=(Modint x){ if(num < x.num) num += mod; num -= x.num; return *this; } inline constexpr Modint& operator--(){ if(num == 0) num = mod - 1; else num--; return *this; } inline constexpr Modint operator--(int){ Modint ans(*this); operator--(); return ans; } inline constexpr Modint& operator*=(Modint x){ num = ull(num) * x.num % mod; return *this; } inline constexpr Modint& operator/=(Modint x){ return operator*=(x.inv()); } template<class T> constexpr Modint(T x){ x %= T(mod); if(x < 0) x += mod; num = uint(x); } template<class T> inline constexpr Modint operator+(T x) const { return Modint(*this) += x; } template<class T> inline constexpr Modint& operator+=(T x){ x %= mod; if(x < 0) x += mod; num += x; if(num >= mod) num -= mod; return *this; } template<class T> inline constexpr Modint operator- (T x) const { return Modint(*this) -= x; } template<class T> inline constexpr Modint& operator-=(T x){ return operator-=(Modint(x)); } template<class T> inline constexpr Modint operator* (T x) const { return Modint(*this) *= x; } template<class T> inline constexpr Modint& operator*=(T x){ return operator*=(Modint(x)); } template<class T> inline constexpr Modint operator/ (T x) const { return Modint(*this) /= x; } template<class T> inline constexpr Modint& operator/=(T x){ return operator/=(Modint(x)); } inline constexpr Modint inv() const { ll x = 0, y = 0; extgcd(num, mod, x, y); return x; } inline constexpr ll extgcd(ll a, ll b, ll &x, ll &y) const { ll g = a; x = 1; y = 0; if(b){ g = extgcd(b, a % b, y, x); y -= a / b * x; } return g; } inline constexpr Modint pow(ull x) const { Modint ans = 1, cnt = *this; while(x){ if(x & 1) ans *= cnt; cnt *= cnt; x /= 2; } return ans; } }; std::istream& operator>>(std::istream& is, Modint& x) { ll a; in(a); x = a; return is; } inline constexpr Modint operator""_M(ull x) { return Modint(x); } std::vector<Modint> fac(1, 1), inv(1, 1); inline void reserve(ll a){ if(fac.size() >= a) return; if(a < fac.size() * 2) a = fac.size() * 2; if(a >= mod) a = mod; while(fac.size() < a) fac.push_back(fac.back() * Modint(fac.size())); inv.resize(fac.size()); inv.back() = fac.back().inv(); for(ll i = inv.size() - 1; !inv[i - 1]; i--) inv[i - 1] = inv[i] * i; } inline Modint fact(ll n){ if(n < 0) return 0; reserve(n + 1); return fac[n]; } inline Modint perm(ll n, ll r){ if(r < 0 || n < r) return 0; reserve(n + 1); return fac[n] * inv[n - r]; } inline Modint comb(ll n, ll r){ if(r < 0 || n < r) return 0; reserve(n + 1); return fac[n] * inv[r] * inv[n - r]; } inline Modint Mcomb(ll n, ll r){ return comb(n + r - 1, n - 1); } // r個をn部屋に分ける inline Modint catalan(ll n){ reserve(n * 2 + 1); return fac[n * 2] * inv[n] * inv[n + 1]; } using T = pair<ll, Modint>; struct SegmentTree{ T f(const T& a, const T& b) const { if(a.first > b.first) return a; elif(a.first < b.first) return b; else return {a.first, a.second + b.second}; } ll size = 1, rank = 0, expected_size; vector<T> data; const T def_value; SegmentTree(ll n, const T& def_value = T()): def_value(def_value), expected_size(n){ while(size < expected_size){ size *= 2; rank++; } data.assign(size * 2, def_value); } SegmentTree(const vector<T>& v, const T& def_value): def_value(def_value), expected_size(v.size()){ while(size < expected_size){ size *= 2; rank++; } data.assign(size * 2, def_value); for(ll i = 0; i < v.size(); i++) data[size + i] = v[i]; // for(ll i = Base::size; --i;) Base::data[i] = f(Base::data[i * 2], Base::data[i * 2 + 1]); } T operator[](ll at) const { return data[size + at]; } void update(ll at){ while(at /= 2) data[at] = f(data[at * 2], data[at * 2 + 1]); } void set(ll at, const T& val){ at += size; data[at] = val; update(at); } T get(ll l, ll r) const { T L = def_value, R = def_value; l += size; r += size; for(; l < r; l /= 2, r /= 2){ if(l & 1) L = f(L, data[l++]); if(r & 1) R = f(data[--r], R); } return f(L, R); } template<class F> ll find_last(const F& check, ll l = 0) const { // max x s.t. check(get(l, x)) == true if(l == expected_size) return expected_size; ll height = 0, at = l + size; T val = def_value; for(; height <= rank; height++) if(at >> height & 1){ T val2 = f(val, data[at >> height]); if(check(val2)){ at += 1 << height; if(at == size * 2) return expected_size; val = val2; } else break; } for(; height--; ){ T val2 = f(val, data[at >> height]); if(check(val2)){ at += 1 << height; val = val2; } } return min(at - size, expected_size); } template<class F> ll find_first(const F& check, ll r) const { // min x s.t. check(get(x, r)) == true if(!r) return 0; ll height = 0, at = r + size; T val = def_value; for(; height <= rank; height++) if(at >> height & 1){ T val2 = f(val, data[at >> height ^ 1]); if(check(val2)){ at -= 1 << height; if(!at) return 0; val = val2; } else break; } for(; height--; ){ T val2 = f(val, data[(at >> height) - 1]); if(check(val2)){ at -= 1 << height; val = val2; } } return at - size; } void clear(){ for(auto& i : data) i = def_value; } }; signed main(){ LL(n); VEC(ll,a,n); vec(ll,b,n); rep(n)b[i]=n-1-i; sort(all(b),[&](ll x,ll y){return a[x]<a[y];}); SegmentTree seg(n+1); seg.set(0,{0,1}); each(i,b){ i++; T x=seg.get(0,i); x.first++; seg.set(i,x); } out(seg.data[1].second); }