結果

問題 No.2210 equence Squence Seuence
ユーザー stoqstoq
提出日時 2023-02-10 22:01:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 82 ms / 2,000 ms
コード長 6,765 bytes
コンパイル時間 4,413 ms
コンパイル使用メモリ 275,720 KB
実行使用メモリ 13,160 KB
最終ジャッジ日時 2024-07-07 16:16:45
合計ジャッジ時間 7,272 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
6,812 KB
testcase_01 AC 10 ms
6,812 KB
testcase_02 AC 9 ms
6,940 KB
testcase_03 AC 24 ms
8,320 KB
testcase_04 AC 25 ms
8,448 KB
testcase_05 AC 35 ms
9,472 KB
testcase_06 AC 30 ms
8,704 KB
testcase_07 AC 66 ms
12,548 KB
testcase_08 AC 10 ms
6,944 KB
testcase_09 AC 10 ms
6,940 KB
testcase_10 AC 10 ms
6,940 KB
testcase_11 AC 10 ms
6,944 KB
testcase_12 AC 10 ms
6,944 KB
testcase_13 AC 81 ms
13,032 KB
testcase_14 AC 77 ms
13,028 KB
testcase_15 AC 78 ms
13,028 KB
testcase_16 AC 82 ms
13,028 KB
testcase_17 AC 81 ms
13,160 KB
testcase_18 AC 10 ms
6,940 KB
testcase_19 AC 10 ms
6,944 KB
testcase_20 AC 10 ms
6,944 KB
testcase_21 AC 10 ms
6,944 KB
testcase_22 AC 10 ms
6,944 KB
testcase_23 AC 67 ms
12,568 KB
testcase_24 AC 51 ms
10,260 KB
testcase_25 AC 62 ms
12,132 KB
testcase_26 AC 81 ms
13,060 KB
testcase_27 AC 27 ms
8,448 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:262:14: warning: 'x' may be used uninitialized [-Wmaybe-uninitialized]
  262 |     if (i == x) {
      |              ^
main.cpp:254:7: note: 'x' was declared here
  254 |   int x, Min = INF;
      |       ^

ソースコード

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 = 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 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(300010);
#pragma endregion

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

// 0-indexed
template <typename T>
struct BIT {
  int n;
  vector<T> bit[2];
  BIT(int n) : n(n) {
    for (int p = 0; p < 2; p++) bit[p].assign(n, 0);
  }

  void add_sub(int p, int i, T x) {
    for (int idx = i; idx < n + 1; idx += (idx & -idx)) bit[p][idx - 1] += x;
  }
  // [l,r) に加算
  void add(int l, int r, T x) {
    ++l, ++r;
    add_sub(0, l, -x * (l - 1));
    add_sub(0, r, x * (r - 1));
    add_sub(1, l, x);
    add_sub(1, r, -x);
  }
  T sum_sub(int p, int i) {
    T s(0);
    for (int idx = i; idx > 0; idx -= (idx & -idx)) s += bit[p][idx - 1];
    return s;
  }
  T sum(int i) {
    ++i;
    return sum_sub(0, i) + sum_sub(1, i) * i;
  }
  // [l,r)
  T query(int l, int r) { return sum(r - 1) - sum(l - 1); }
  T get(int i) { return sum(i) - sum(i - 1); }
  void display() {
    rep(i, n) cerr << get(i) << " ";
    cerr << "\n";
  }
};

using S = int;
S op(S a, S b) {
  if (a != 0) return a;
  return b;
}
S e() { return 0; }

bool f(int x) { return x <= 0; }

void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  cin >> a;
  vector<int> b(n - 1);
  rep(i, n - 1) {
    if (a[i + 1] < a[i])
      b[i] = 1;
    else if (a[i + 1] > a[i])
      b[i] = -1;
    else
      b[i] = 0;
  }
  segtree<S, op, e> seg(b);

  // i 以下を数える
  BIT<int> bit(n);
  rep(i, n) {
    int r = seg.max_right<f>(i);
    bit.add(i, i + 1, r - i + 1);
    bit.add(r + 1, n, 1);
  }

  int x, Min = INF;
  rep(i, n) {
    int val = bit.get(i);
    if (val < k) continue;
    if (chmin(Min, val)) x = i;
  }
  vector<int> ans;
  rep(i, n) {
    if (i == x) {
      continue;
    }
    ans.push_back(a[i]);
  }
  cout << ans << "\n";
}

int main() { solve(); }
0