#994580 (C++23) No.2804 Fixer And Ratism

• 問題: No.2804 Fixer And Ratism
• ユーザー: risujiroh
• 提出日時: 2024-07-12 23:12:47
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 45 ms / 2,000 ms
• コード長: 3,612 bytes
• コンパイル時間: 3,681 ms
• コンパイル使用メモリ: 286,244 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-12 23:12:54
• 合計ジャッジ時間: 5,994 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	10 ms; 5,376 KB
testcase_04	AC	7 ms; 5,376 KB
testcase_05	AC	3 ms; 5,376 KB
testcase_06	AC	17 ms; 5,376 KB
testcase_07	AC	7 ms; 5,376 KB
testcase_08	AC	6 ms; 5,376 KB
testcase_09	AC	3 ms; 5,376 KB
testcase_10	AC	5 ms; 5,376 KB
testcase_11	AC	18 ms; 5,376 KB
testcase_12	AC	13 ms; 5,376 KB
testcase_13	AC	5 ms; 5,376 KB
testcase_14	AC	13 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	15 ms; 5,376 KB
testcase_17	AC	8 ms; 5,376 KB
testcase_18	AC	20 ms; 6,940 KB
testcase_19	AC	2 ms; 6,940 KB
testcase_20	AC	3 ms; 6,944 KB
testcase_21	AC	21 ms; 6,940 KB
testcase_22	AC	2 ms; 6,944 KB
testcase_23	AC	43 ms; 6,944 KB
testcase_24	AC	22 ms; 6,944 KB
testcase_25	AC	45 ms; 6,944 KB
testcase_26	AC	28 ms; 6,940 KB
testcase_27	AC	21 ms; 6,940 KB
testcase_28	AC	44 ms; 6,940 KB
testcase_29	AC	27 ms; 6,944 KB
testcase_30	AC	30 ms; 6,940 KB
testcase_31	AC	21 ms; 6,944 KB
testcase_32	AC	37 ms; 6,944 KB
testcase_33	AC	2 ms; 6,944 KB

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

struct S {
  std::string s;
  Int r;
  bool f;
};

void Solve() {
  Int n, q;
  Scan(n, q);
  std::vector<S> v;
  while (q--) {
    Int t;
    Scan(t);
    if (t == 1) {
      std::string s;
      Int r;
      Scan(s, r);
      v.push_back({s, r, false});
    } else if (t == 2) {
      Int x;
      Scan(x);
      n -= x;
    } else {
      std::string s;
      Int x;
      Scan(s, x);
      n += x;
      for (auto& e : v) {
        if (e.s == s) {
          e.f = true;
        }
      }
    }
    if (n < Sz(v)) {
      ranges::sort(v, std::greater{}, $(std::pair(Int{$1.f}, $1.r)));
      ranges::sort(v | views::drop(n), {}, $($1.r));
      for (const auto& e : v | views::drop(n)) {
        Print(e.s);
      }
      v.resize(n);
    }
  }
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(std::numeric_limits<Float>::max_digits10);

  Solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

#define $(...) \
  [&]<class T1 = int, class T2 = int>(T1&& $1 = 0, T2&& $2 = 0)->decltype(auto) { return __VA_ARGS__; }

using Int = int64_t;
using Float = double;

namespace ranges = std::ranges;
namespace views = std::views;

inline constexpr auto Rev = views::reverse;
inline constexpr auto Map = views::transform;
inline constexpr auto Filter = views::filter;

constexpr auto Rep(Int l, Int r) { return views::iota(std::min(l, r), r); }
constexpr auto Rep(Int n) { return Rep(0, n); }
constexpr auto Rep1(Int l, Int r) { return Rep(l, r + 1); }
constexpr auto Rep1(Int n) { return Rep(1, n + 1); }

constexpr Int Sz(auto&& r) { return static_cast<Int>(ranges::size(r)); }

template <class T, class U = T> bool Chmin(T& x, U&& y) { return y < x && (x = std::forward<U>(y), true); }
template <class T, class U = T> bool Chmax(T& x, U&& y) { return x < y && (x = std::forward<U>(y), true); }

inline constexpr Int INF = [] { std::array<char, sizeof(Int)> a; a.fill(0x3f); return std::bit_cast<Int>(a); }();

template <class T> concept Range = ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept TupleLike = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, TupleLike auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, TupleLike auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(TupleLike auto&& t) { \
    std::apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

void Scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void Print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

template <class F>
class Fix {
 public:
  explicit Fix(F f) : f_(std::move(f)) {}
  decltype(auto) operator()(auto&&... xs) const { return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...); }

 private:
  F f_;
};

#endif  // __INCLUDE_LEVEL__