#779097 (C++17) No.1996 <><

提出ソース

結果

問題	No.1996 <><
ユーザー	cutmdo
提出日時	2022-07-16 02:17:50
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,390 ms / 2,000 ms
コード長	6,609 bytes
コンパイル時間	4,521 ms
コンパイル使用メモリ	277,424 KB
実行使用メモリ	51,432 KB
最終ジャッジ日時	2023-09-10 09:05:56
合計ジャッジ時間	21,819 ms
ジャッジサーバーID （参考情報）	judge14 / judge15

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,376 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	2 ms 4,384 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	2 ms 4,376 KB
testcase_05	AC	2 ms 4,376 KB
testcase_06	AC	1 ms 4,376 KB
testcase_07	AC	2 ms 4,384 KB
testcase_08	AC	3 ms 4,380 KB
testcase_09	AC	2 ms 4,380 KB
testcase_10	AC	2 ms 4,380 KB
testcase_11	AC	599 ms 27,372 KB
testcase_12	AC	1,206 ms 51,432 KB
testcase_13	AC	1,390 ms 51,340 KB
testcase_14	AC	1,343 ms 49,840 KB
testcase_15	AC	1,163 ms 45,144 KB
testcase_16	AC	966 ms 39,864 KB
testcase_17	AC	1,205 ms 45,832 KB
testcase_18	AC	647 ms 30,300 KB
testcase_19	AC	788 ms 32,412 KB
testcase_20	AC	761 ms 30,136 KB
testcase_21	AC	1,033 ms 41,392 KB
testcase_22	AC	1,202 ms 44,908 KB
testcase_23	AC	29 ms 5,144 KB
testcase_24	AC	659 ms 32,868 KB
testcase_25	AC	302 ms 13,996 KB
testcase_26	AC	540 ms 25,812 KB
testcase_27	AC	80 ms 8,096 KB
testcase_28	AC	2 ms 4,380 KB
testcase_29	AC	260 ms 11,800 KB
testcase_30	AC	10 ms 4,376 KB
testcase_31	AC	92 ms 9,192 KB
testcase_32	AC	3 ms 4,376 KB

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

ソースコード

raw source code

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/debug.hpp"
#include "./CompetitiveProgrammingCpp/Timer.hpp"
#include "./CompetitiveProgrammingCpp/sample.hpp"
#else
#define dump(...)
template<class T>constexpr inline auto d_val(T a, T b) { return a; }
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VVVVL = std::vector<VVVL>;
using VVVVVL = std::vector<VVVVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::deque;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
auto pow(signed, signed) { assert(false); }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;

//=============================================================================================


template<class T>
class isMonoid {
    template <class U>
    static auto check(U x) -> decltype(x.binaryOperation(x), std::true_type{});
    static std::false_type check(...);
public:
    static bool const value = decltype(check(std::declval<T>()))::value;
};

template<class Monoid, std::enable_if_t<isMonoid<Monoid>::value, std::nullptr_t> = nullptr >
class SegmentTree {
private:
    const int m_size;
    vector<Monoid> m_node;

    int calcSize(int n) const { int size = 1; while(size < n) { size <<= 1; }return size; }

    auto _query(int a, int b) const {
        return _query(a, b + 1, 0, 0, m_size);
    }
    auto _query(int a, int b, int k, int l, int r)const {
        if(r <= a || b <= l) { return Monoid(); }
        if(a <= l && r <= b) { return m_node[k]; }
        return _query(a, b, 2 * k + 1, l, (l + r) / 2).binaryOperation(
            _query(a, b, 2 * k + 2, (l + r) / 2, r)
        );
    }
public:
    SegmentTree(int n) : m_size(calcSize(n)), m_node(m_size * 2 - 1) {}

    auto add(int itr, Monoid&& val) {
        int i = itr + m_size - 1;
        m_node[i] = std::forward<decltype(val)>(val);
        while(i > 0) {
            i = (i - 1) / 2;
            m_node[i] = m_node[i * 2 + 1].binaryOperation(m_node[i * 2 + 2]);
        }
    }
    auto query(int a, int b, int k, int l, int r)const { return _query(a, b, k, l, r).m_val; }
    auto query(int a, int b)const { return query(a, b + 1, 0, 0, m_size); }
};


template<
    class S,   // 要素の型
    S element, // 元
    class T // lambdaはC++20じゃないと渡せなかった．．．
    // S T(S, S)  // 2項演算子
>
struct Monoid {
    S m_val;
    Monoid() :m_val(element) {}
    Monoid(S val) :m_val(val) {}
    Monoid binaryOperation(const Monoid& m2)const { return T()(m_val, m2.m_val); }
};

signed main() {

    ll n, k;
    cin >> n >> k;
    VL a(n);
    string s;
    cin >> a >> s;


    struct Functor {
        auto operator()(ll a, ll b)const {
            return (a + b) % MOD;
        }
    };
    using M = Monoid<ll, 0, Functor>;
    auto tree = SegmentTree<M>(n);

    auto itox = a;
    sort(itox);
    unique(itox);
    ll sz = itox.size();
    map<ll, ll> xtoi;
    REP(i, sz) { xtoi.emplace(itox[i], i); }

    V<SegmentTree<M>> dp(k + 1, SegmentTree<M>(sz));
    REP(i, n) {
        FOR(j, 1, k + 1) {
            if(s[j - 1] == '<') {
                ll x = a[i];
                ll it = xtoi[x];
                ll ad = dp[j - 1].query(0, it - 1);
                ll now = dp[j].query(it, it);
                dp[j].add(it, now + ad);
            } else {
                ll x = a[i];
                ll it = xtoi[x];
                ll ad = dp[j - 1].query(it + 1, sz - 1);
                ll now = dp[j].query(it, it);
                dp[j].add(it, now + ad);
            }
        }
        ll x = a[i];
        auto it = xtoi[x];
        ll now = dp[0].query(it, it);
        dp[0].add(it, now + 1);
    }
    
    ll ans = dp[k].query(0, sz - 1);
    cout << ans << endl;

}

yukicoder

結果

テストケース

ソースコード