#1166207 (C++23) No.3553 Good Quartet

• 問題: No.3553 Good Quartet
• ユーザー: risujiroh
• 提出日時: 2026-05-22 23:31:31
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 402 ms / 2,000 ms
• コード長: 3,759 bytes
• コンパイル時間: 3,124 ms
• コンパイル使用メモリ: 348,068 KB
• 実行使用メモリ: 13,824 KB
• 最終ジャッジ日時: 2026-05-22 23:31:46
• 合計ジャッジ時間: 10,586 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_1

ファイルパターン	結果
sample	AC * 1
other	AC * 15

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

vector<array<int64_t, 4>> patterns;

void Init() {
  patterns.push_back({1, 5, 7, 11});
  patterns.push_back({1, 11, 19, 29});
}

void Solve() {
  int n, q;
  IN(n, q);
  set<int> se;
  while (n--) {
    int a;
    IN(a);
    se.insert(a);
  }

  int P = Len(patterns);

  vector<set<int>> good(P);
  for (int pi : Rep(0, P)) {
    for (int e : se) {
      auto [a, b, c, d] = patterns[pi];
      assert(a == 1);
      if (se.contains(e * b) && se.contains(e * c) && se.contains(e * d))
        good[pi].insert(e);
    }
  }

  while (q--) {
    int t, x;
    IN(t, x);
    if (t == 1) {
      se.insert(x);

      for (int pi : Rep(0, P)) {
        for (int t : patterns[pi]) {
          if (x % t)
            continue;
          int e = x / t;
          auto [a, b, c, d] = patterns[pi];
          if (se.contains(e * a) && se.contains(e * b) && se.contains(e * c) && se.contains(e * d))
            good[pi].insert(e);
        }
      }

    } else {
      for (int pi : Rep(0, P)) {
        for (int t : patterns[pi]) {
          if (x % t)
            continue;
          good[pi].erase(x / t);
        }
      }

      se.erase(x);
    }

    int ans = 0;
    for (const auto& e : good)
      ans += Len(e);
    OUT(ans);
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  Init();

  Solve();
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T>
concept MyRange =
    std::ranges::range<T> &&
    !std::convertible_to<T, std::string_view> &&
    !std::convertible_to<T, std::filesystem::path>;

template <class T>
concept MyTuple = std::__is_tuple_like<T>::value && !MyRange<T>;

namespace std {

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

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

ostream& operator<<(ostream& os, MyRange auto&& r) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << forward<decltype(e)>(e);
  }
  return os;
}

ostream& operator<<(ostream& os, MyTuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

template <class T>
class OneBased {
 public:
  explicit OneBased(T&& x) : ref_(std::forward<T>(x)) {}

  template <class... Ts>
  requires(sizeof...(Ts) > 1)
      OneBased(Ts&&... xs) : ref_(std::forward_as_tuple(std::forward<Ts>(xs)...)) {}

  friend std::istream& operator>>(std::istream& is, OneBased x) {
    if constexpr (MyRange<T>) {
      for (auto&& e : x.ref_) {
        is >> ::OneBased(e);
      }
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { (is >> ... >> ::OneBased(xs)); }, x.ref_);
    } else {
      is >> x.ref_;
      --x.ref_;
    }
    return is;
  }

  friend std::ostream& operator<<(std::ostream& os, OneBased x) {
    if constexpr (MyRange<T>) {
      auto f = [](auto&& e) { return ::OneBased(std::forward<decltype(e)>(e)); };
      os << (x.ref_ | std::views::transform(f));
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { os << std::tuple(::OneBased(xs)...); }, x.ref_);
    } else {
      os << ++x.ref_;
      --x.ref_;
    }
    return os;
  }

 private:
  T ref_;
};

template <class T>
OneBased(T&&) -> OneBased<T>;

template <class... Ts>
OneBased(Ts&&...) -> OneBased<std::tuple<Ts...>>;

using namespace std;

#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Len(r) int(size(r))
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1