結果

問題 No.2210 equence Squence Seuence
ユーザー stoqstoq
提出日時 2023-02-23 03:31:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,849 ms / 2,000 ms
コード長 7,860 bytes
コンパイル時間 5,266 ms
コンパイル使用メモリ 279,384 KB
実行使用メモリ 21,676 KB
最終ジャッジ日時 2024-07-23 02:28:11
合計ジャッジ時間 24,242 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
14,996 KB
testcase_01 AC 31 ms
14,980 KB
testcase_02 AC 32 ms
15,000 KB
testcase_03 AC 284 ms
16,620 KB
testcase_04 AC 347 ms
16,828 KB
testcase_05 AC 517 ms
17,660 KB
testcase_06 AC 444 ms
17,152 KB
testcase_07 AC 1,251 ms
20,608 KB
testcase_08 AC 31 ms
14,944 KB
testcase_09 AC 30 ms
14,948 KB
testcase_10 AC 31 ms
15,160 KB
testcase_11 AC 32 ms
14,976 KB
testcase_12 AC 31 ms
14,932 KB
testcase_13 AC 1,849 ms
21,652 KB
testcase_14 AC 1,637 ms
21,676 KB
testcase_15 AC 1,530 ms
21,548 KB
testcase_16 AC 1,558 ms
21,672 KB
testcase_17 AC 1,648 ms
21,672 KB
testcase_18 AC 32 ms
15,004 KB
testcase_19 AC 33 ms
15,152 KB
testcase_20 AC 33 ms
14,920 KB
testcase_21 AC 34 ms
15,092 KB
testcase_22 AC 34 ms
15,088 KB
testcase_23 AC 1,503 ms
20,632 KB
testcase_24 AC 997 ms
19,124 KB
testcase_25 AC 1,334 ms
20,244 KB
testcase_26 AC 1,792 ms
21,504 KB
testcase_27 AC 401 ms
16,796 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#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 = 1777777777;
#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 ld EPS = 1e-10;
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());
inline ll randInt(ll l, ll r) { return engine() % (r - l + 1) + l; }
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(1000010);
#pragma endregion

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

struct hash_t : pair<modint1000000007, modint998244353> {
  hash_t() {}
  hash_t(long long a) : pair<modint1000000007, modint998244353>(a, a) {}
  hash_t operator+=(hash_t q) noexcept {
    this->first += q.first, this->second += q.second;
    return *this;
  }
  hash_t operator-=(hash_t q) noexcept {
    this->first -= q.first, this->second -= q.second;
    return *this;
  }
  hash_t operator*=(hash_t q) noexcept {
    this->first *= q.first, this->second *= q.second;
    return *this;
  }
  hash_t operator+(hash_t q) noexcept {
    hash_t p = *this;
    return p += q;
  }
  hash_t operator-(hash_t q) noexcept {
    hash_t p = *this;
    return p -= q;
  }
  hash_t operator*(hash_t q) noexcept {
    hash_t p = *this;
    return p *= q;
  }
};
ostream &operator<<(ostream &os, hash_t h) noexcept {
  os << "(" << h.first.val() << ", " << h.second.val() << ")";
  return os;
}

template <typename T>
struct Hash {
  int n;
  T s;
  static long long B;
  vector<hash_t> sum;
  vector<hash_t> Bp;

  Hash() {}
  Hash(T &s) : s(s), n(s.size()), Bp(n + 1) {
    Bp[0] = 1;
    for (int i = 0; i < n; i++) Bp[i + 1] = Bp[i] * B;
    sum.assign(n + 1, 0);
    for (int i = n - 1; i >= 0; i--) sum[i] = sum[i + 1] * B + s[i];
  }
  inline hash_t query(int l, int r) { return sum[l] - sum[r] * Bp[r - l]; }
};
random_device B_seed;
mt19937 B_engine(B_seed());
template <typename T>
long long Hash<T>::B = (long long)(B_engine()) + 500010;

// X = S[l1, r1), Y = T[l2, r2)
// X < Y  -> -1
// X = Y  -> 0
// X > Y  -> 1
template <typename T>
int comp_hash(int l1, int r1, int l2, int r2, Hash<T> &h1, Hash<T> &h2) {
  int len = min(r1 - l1, r2 - l2);
  int lo = 0, hi = len + 1;
  while (hi - lo > 1) {
    int mi = (lo + hi) / 2;
    if (h1.query(l1, l1 + mi) == h2.query(l2, l2 + mi))
      lo = mi;
    else
      hi = mi;
  }
  if (lo == len) {
    if (r1 - l1 < r2 - l2)
      return -1;
    else if (r1 - l1 == r2 - l2)
      return 0;
    else
      return 1;
  }
  return (h1.s[l1 + lo] < h2.s[l2 + lo] ? -1 : 1);
}

int n, k;
vector<int> a;
Hash<vector<int>> hs;

int get(int x, int i) { return x < i ? a[x] : a[x + 1]; }

hash_t prefix(int x, int i) {
  if (x <= i) return hs.query(0, x);
  return hs.query(0, i) + hs.query(i + 1, x + 1) * hs.Bp[i];
}

bool comp(int i, int j) {
  int lo = 0, hi = n;
  while (hi - lo > 1) {
    int mi = (lo + hi) / 2;
    if (prefix(mi, i) == prefix(mi, j))
      lo = mi;
    else
      hi = mi;
  }
  return get(lo, i) < get(lo, j);
}

void solve() {
  cin >> n >> k;
  a.resize(n);
  cin >> a;
  hs = Hash<vector<int>>(a);
  vector<int> v(n);
  iota(all(v), 0);
  sort(all(v), comp);
  vector<int> ans;
  rep(i, n) {
    if (i == v[k - 1]) continue;
    ans.push_back(a[i]);
  }
  cout << ans << "\n";
}

int main() { solve(); }
0