#430431 (C++14) No.992 最長増加部分列の数え上げ

提出ソース

結果

問題	No.992 最長増加部分列の数え上げ
ユーザー	haruki_K
提出日時	2020-02-14 23:25:25
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	63 ms / 2,000 ms
コード長	7,318 bytes
コンパイル時間	1,790 ms
コンパイル使用メモリ	184,652 KB
実行使用メモリ	16,128 KB
最終ジャッジ日時	2024-10-06 13:23:29
合計ジャッジ時間	5,043 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	1 ms 5,248 KB
testcase_04	AC	24 ms 7,936 KB
testcase_05	AC	18 ms 6,784 KB
testcase_06	AC	30 ms 8,960 KB
testcase_07	AC	23 ms 7,552 KB
testcase_08	AC	12 ms 5,504 KB
testcase_09	AC	21 ms 7,680 KB
testcase_10	AC	28 ms 8,832 KB
testcase_11	AC	36 ms 10,496 KB
testcase_12	AC	9 ms 5,248 KB
testcase_13	AC	20 ms 7,296 KB
testcase_14	AC	21 ms 7,424 KB
testcase_15	AC	9 ms 5,248 KB
testcase_16	AC	56 ms 14,848 KB
testcase_17	AC	12 ms 5,632 KB
testcase_18	AC	20 ms 7,168 KB
testcase_19	AC	35 ms 10,376 KB
testcase_20	AC	61 ms 16,000 KB
testcase_21	AC	61 ms 15,872 KB
testcase_22	AC	62 ms 16,128 KB
testcase_23	AC	60 ms 16,060 KB
testcase_24	AC	60 ms 16,020 KB
testcase_25	AC	60 ms 15,884 KB
testcase_26	AC	60 ms 16,048 KB
testcase_27	AC	61 ms 15,984 KB
testcase_28	AC	63 ms 15,996 KB
testcase_29	AC	61 ms 15,948 KB
testcase_30	AC	46 ms 14,200 KB
testcase_31	AC	46 ms 14,408 KB
testcase_32	AC	44 ms 14,400 KB
testcase_33	AC	44 ms 14,264 KB
testcase_34	AC	45 ms 14,324 KB
testcase_35	AC	39 ms 15,732 KB
testcase_36	AC	39 ms 15,728 KB
testcase_37	AC	40 ms 15,600 KB
testcase_38	AC	39 ms 15,600 KB
testcase_39	AC	40 ms 15,532 KB
testcase_40	AC	49 ms 15,208 KB
testcase_41	AC	49 ms 15,228 KB
testcase_42	AC	49 ms 15,348 KB
testcase_43	AC	49 ms 15,220 KB
testcase_44	AC	52 ms 15,212 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
// <<<
// >>> modint
template <uint32_t MOD>
struct ModInt {
    using u32 = uint32_t;
    using u64 = uint64_t;
    using i64 = int64_t;
    using M = ModInt;

    static constexpr u32 mul_inv(u32 n, int e = 5, u32 x = 1) {
        return e == 0 ? x : mul_inv(n, e-1, x*(2-x*n));
    }
    static constexpr u32 mod = MOD;
    static constexpr u32 nn = mul_inv(MOD);
    static constexpr u32 r2 = -u64(MOD) % MOD;

    u32 x;
    constexpr ModInt(i64 x = 0) : x(reduce(((x%=MOD)<0 ? x+MOD : x)*r2)) {}
    static constexpr u32 reduce(u64 w) {
        return u32(w >> 32) + MOD - i64((u64(u32(w) * nn) * MOD) >> 32);
    }
    constexpr i64 val() const {
        i64 r = reduce(x);
        if (r >= MOD) r -= MOD;
        return r;
    }
    constexpr explicit operator i64() const { return val(); }
    constexpr bool operator==(M p) const { return val() == p.val(); }
    constexpr bool operator!=(M p) const { return val() != p.val(); }
    constexpr M operator+() const { return *this; }
    constexpr M operator-() const { M r; r.x = x ? i64(2*MOD)-x : 0; return r; }
    constexpr M &operator+=(M p) {
        i64 t = x; if (((t += p.x) -= 2*MOD) < 0) t += 2*MOD;
        x = t;
        return *this;
    }
    constexpr M &operator-=(M p) { return *this += -p; }
    constexpr M &operator*=(M p) { x = reduce(u64(x)*p.x); return *this; }
    constexpr M &operator/=(M p) { *this *= p.inv(); return *this; }

    constexpr M operator+(M p) const { return M(*this) += p; }
    constexpr M operator-(M p) const { return M(*this) -= p; }
    constexpr M operator*(M p) const { return M(*this) *= p; }
    constexpr M operator/(M p) const { return M(*this) /= p; }
    friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
    friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
    friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
    friend constexpr M operator/(i64 x, M y) { return M(x)/y; }

    constexpr M inv() const { return pow(MOD - 2); }
    constexpr M pow(i64 n) const {
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }

    friend ostream &operator<<(ostream &os, M p) {
        return os << p.val();
    }
    friend istream &operator>>(istream &is, M &a) {
        u32 t; is >> t; a = t; return is;
    }
#ifdef LOCAL
    friend string to_s(M const& p) { return to_s(p.val(), MOD); }
#endif
};
// <<<
//constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9+7;
using mint = ModInt<MOD>;

int32_t main() {
    int n; cin >> n;
    vector<int> a(n); cin >> a;

    vector<vector<pair<int,int>>> v(n);
    {
        vector<int> dp(n,INF);
        rep (i,n) {
            int lb = lbd(dp,a[i]);
            dp[lb] = a[i];
            v[lb].eb(a[i],i);
        }
        dump(dp);
        int m = lbd(dp,INF);
        v.resize(m);
    }
    dump(v);
    int m = v.size();
    assert(m > 0);

    auto dp = make_v<mint,2>(m,0);
    rep (i,m) dp[i].resize(v[i].size()+1);
    rep (j,dp[0].size()-1) dp[0][j] = 1;
    rep (i,m-1) {
        rep (j,dp[i].size()-1) {
            dump(i);
            auto comp_val = [](auto p, auto q) {
                return p.fst > q.fst;
            };
            auto comp_idx = [](auto p, auto q) {
                return p.snd < q.snd;
            };
            int ub = lower_bound(all(v[i+1]),v[i][j],comp_val)-v[i+1].begin();
            int lb = upper_bound(all(v[i+1]),v[i][j],comp_idx)-v[i+1].begin();
            if (!(lb < ub)) continue;
            dump(i,lb,ub,dp[i+1].size());
            dp[i+1][lb] += dp[i][j];
            dp[i+1][ub] -= dp[i][j];
        }
        rep (j,dp[i+1].size()-1) dp[i+1][j+1] += dp[i+1][j];
    }
    cout << sumof(all(dp.back())) << endl;





}

yukicoder

結果

テストケース

ソースコード