結果

問題 No.1996 <><
ユーザー stoqstoq
提出日時 2022-07-01 22:03:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 174 ms / 2,000 ms
コード長 6,477 bytes
コンパイル時間 4,479 ms
コンパイル使用メモリ 276,040 KB
実行使用メモリ 24,600 KB
最終ジャッジ日時 2024-11-26 05:07:14
合計ジャッジ時間 7,141 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
15,604 KB
testcase_01 AC 13 ms
15,684 KB
testcase_02 AC 14 ms
15,812 KB
testcase_03 AC 14 ms
15,748 KB
testcase_04 AC 13 ms
15,656 KB
testcase_05 AC 14 ms
15,724 KB
testcase_06 AC 12 ms
15,716 KB
testcase_07 AC 13 ms
15,656 KB
testcase_08 AC 14 ms
15,756 KB
testcase_09 AC 14 ms
15,764 KB
testcase_10 AC 14 ms
15,652 KB
testcase_11 AC 63 ms
20,164 KB
testcase_12 AC 174 ms
24,592 KB
testcase_13 AC 169 ms
24,600 KB
testcase_14 AC 154 ms
24,192 KB
testcase_15 AC 131 ms
23,164 KB
testcase_16 AC 97 ms
22,236 KB
testcase_17 AC 134 ms
23,248 KB
testcase_18 AC 58 ms
19,992 KB
testcase_19 AC 69 ms
20,824 KB
testcase_20 AC 66 ms
20,564 KB
testcase_21 AC 101 ms
22,136 KB
testcase_22 AC 131 ms
23,328 KB
testcase_23 AC 16 ms
15,964 KB
testcase_24 AC 59 ms
19,940 KB
testcase_25 AC 34 ms
17,872 KB
testcase_26 AC 49 ms
19,124 KB
testcase_27 AC 18 ms
16,408 KB
testcase_28 AC 12 ms
15,648 KB
testcase_29 AC 32 ms
17,608 KB
testcase_30 AC 14 ms
15,840 KB
testcase_31 AC 20 ms
16,448 KB
testcase_32 AC 14 ms
15,672 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 1

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
//#include <atcoder/lazysegtree>
//#include <atcoder/modint>
//#include <atcoder/segtree>

using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#pragma region Macros

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll floor(ll a, ll b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(300010);

#pragma endregion

// -------------------------------

template <typename T>
struct BIT {
  int n;
  vector<T> dat;

  BIT() {}
  BIT(int n) : n(n), dat(n + 1, 0) {}
  BIT(vector<T> &a) : n(a.size()), dat(a.size() + 1) {
    for (int i = 0; i < n; i++) dat[i + 1] = a[i];
    for (int i = 1; i <= n; i++) {
      if (i + (i & -i) <= n) dat[i + (i & -i)] += dat[i];
    }
  }

  // 0-indexed
  void add(int i, T x) {
    i++;
    while (i <= n) {
      dat[i] += x;
      i += i & -i;
    }
  }

  void update(int i, T x) { add(i, x - get(i)); }

  // [0, i)
  T sum(int i) {
    T res = 0;
    while (i > 0) {
      res += dat[i];
      i -= i & -i;
    }
    return res;
  }

  // 0-indexed
  T get(int i) { return sum(i + 1) - sum(i); }

  // [l, r)
  T query(int l, int r) { return sum(r) - sum(l); }

  void display() {
    for (int i = 0; i < n; i++) cerr << get(i) << " ";
    cerr << "\n";
  }
};

mint dp[1510][1510];

void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  cin >> a;
  compress(a);
  string s;
  cin >> s;

  vector<BIT<mint>> bit(k + 1);
  rep(i, k + 1) bit[i] = BIT<mint>(n + 1);

  rep(i, n) {
    rep(j, k + 1) {
      if (j == 0) {
        dp[i][j] = 1;
      } else if (s[j - 1] == '<') {
        dp[i][j] = bit[j - 1].query(0, a[i]);
      } else {
        dp[i][j] = bit[j - 1].query(a[i] + 1, n);
      }
    }
    rep(j, k + 1) { bit[j].add(a[i], dp[i][j]); }
  }
  mint sum = 0;
  rep(i, n) sum += dp[i][k];
  cout << sum << "\n";
}

int main() { solve(); }
0