結果
問題 | No.992 最長増加部分列の数え上げ |
ユーザー | kcvlex |
提出日時 | 2020-02-14 22:55:50 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 223 ms / 2,000 ms |
コード長 | 4,178 bytes |
コンパイル時間 | 2,106 ms |
コンパイル使用メモリ | 182,076 KB |
実行使用メモリ | 17,732 KB |
最終ジャッジ日時 | 2024-10-06 13:09:35 |
合計ジャッジ時間 | 10,078 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 79 ms
9,728 KB |
testcase_05 | AC | 55 ms
7,040 KB |
testcase_06 | AC | 98 ms
10,240 KB |
testcase_07 | AC | 71 ms
9,348 KB |
testcase_08 | AC | 36 ms
6,400 KB |
testcase_09 | AC | 73 ms
9,592 KB |
testcase_10 | AC | 98 ms
10,240 KB |
testcase_11 | AC | 121 ms
11,084 KB |
testcase_12 | AC | 23 ms
5,248 KB |
testcase_13 | AC | 67 ms
9,472 KB |
testcase_14 | AC | 64 ms
9,348 KB |
testcase_15 | AC | 24 ms
5,248 KB |
testcase_16 | AC | 184 ms
17,112 KB |
testcase_17 | AC | 36 ms
6,400 KB |
testcase_18 | AC | 67 ms
9,332 KB |
testcase_19 | AC | 120 ms
10,940 KB |
testcase_20 | AC | 218 ms
17,664 KB |
testcase_21 | AC | 220 ms
17,648 KB |
testcase_22 | AC | 220 ms
17,664 KB |
testcase_23 | AC | 220 ms
17,712 KB |
testcase_24 | AC | 220 ms
17,724 KB |
testcase_25 | AC | 219 ms
17,632 KB |
testcase_26 | AC | 219 ms
17,572 KB |
testcase_27 | AC | 222 ms
17,696 KB |
testcase_28 | AC | 223 ms
17,612 KB |
testcase_29 | AC | 218 ms
17,708 KB |
testcase_30 | AC | 195 ms
17,500 KB |
testcase_31 | AC | 194 ms
17,616 KB |
testcase_32 | AC | 195 ms
17,632 KB |
testcase_33 | AC | 197 ms
17,512 KB |
testcase_34 | AC | 195 ms
17,544 KB |
testcase_35 | AC | 181 ms
17,620 KB |
testcase_36 | AC | 180 ms
17,556 KB |
testcase_37 | AC | 179 ms
17,644 KB |
testcase_38 | AC | 180 ms
17,620 KB |
testcase_39 | AC | 179 ms
17,732 KB |
testcase_40 | AC | 195 ms
17,652 KB |
testcase_41 | AC | 194 ms
17,516 KB |
testcase_42 | AC | 195 ms
17,620 KB |
testcase_43 | AC | 195 ms
17,504 KB |
testcase_44 | AC | 193 ms
17,548 KB |
ソースコード
// #define DEBUGGING #include <bits/stdc++.h> #define endl '\n' #define ALL(V) begin(V), end(V) #define ALLR(V) rbegin(V), rend(V) using ll = std::int64_t; using ull = std::uint64_t; using PLL = std::pair<ll, ll>; using TLL = std::tuple<ll, ll, ll>; template <typename T> using V = std::vector<T>; template <typename T> using VV = V<V<T>>; template <typename T> const T& var_min(const T &t) { return t; } template <typename T> const T& var_max(const T &t) { return t; } template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); } template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); } template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); } template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); } namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; } #define mv_rec make_v(init, tail...) template <typename T> T make_v(T init) { return init; } template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); } #undef mv_rec using namespace std; #ifdef DEBUGGING #include "../../debug/debug.cpp" #else #define DEBUG(...) 0 #define DEBUG_SEPARATOR_LINE 0 #endif template <typename T> class SegmentTree { public: ll size; vector<T> node; function<T(T, T)> comp; T identity_ele; //comp(x, identity_ele) == x SegmentTree(const vector<T> &v, function<T(T, T)> comp, T identity_ele) : comp(comp), identity_ele(identity_ele) { ll tmp = 1; while (tmp < v.size()) tmp = (tmp << 1); this->size = tmp; this->identity_ele = identity_ele; this->comp = comp; node = V<T>(2 * size - 1, identity_ele); for (ll i = 0; i < v.size(); i++) { node[i + size - 1] = v[i]; } for (ll i = size - 2; 0 <= i; i--) { node[i] = comp(node[i * 2 + 1], node[i * 2 + 2]); } } void update(ll pos, T value) { pos += size - 1; node[pos] = value; while (pos > 0) { pos = (pos - 1) / 2; node[pos] = comp(node[2 * pos + 1], node[2 * pos + 2]); } } T query(ll a, ll b) { return sub_query(a, b, 0, 0, size); } T sub_query(ll a, ll b, ll k, ll l, ll r) { if (r <= a || b <= l) { return identity_ele; } else if (a <= l && r <= b) { return node[k]; } else { T left = sub_query(a, b, k * 2 + 1, l, (l + r) / 2); T right = sub_query(a, b, k * 2 + 2, (l + r) / 2, r); return comp(left, right); } } }; const ll mod = 1e9 + 7; int main() { ll N; cin >> N; V<ll> A(N); for (ll &e : A) cin >> e; V<ll> ord(N); iota(ALL(ord), 0ll); sort(ALL(ord), [&](ll i, ll j) { if (A[i] != A[j]) return A[i] > A[j]; else return i < j; }); // len, perm SegmentTree<PLL> seg(V<PLL>(N + 10, PLL(0, 0)), [&](PLL p, PLL q) { ll a, b, c, d; tie(a, b) = p; tie(c, d) = q; if (a == c) return PLL(a, (b + d) % mod); else if (a < c) return q; else return p; }, PLL(0, 0)); for (ll idx : ord) { auto q = seg.query(idx, N + 10); if (q.first == 0) { PLL arg(1, 1); seg.update(idx, arg); } else { q.first++; seg.update(idx, q); } } cout << seg.query(0, N + 10).second << endl; return 0; }