結果

問題 No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
コンテスト
ユーザー ir5
提出日時 2024-06-23 16:32:22
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 692 ms / 2,000 ms
コード長 4,573 bytes
コンパイル時間 4,359 ms
コンパイル使用メモリ 165,636 KB
実行使用メモリ 78,240 KB
最終ジャッジ日時 2024-06-23 16:32:40
合計ジャッジ時間 8,563 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

const ll mod = 998244353;
struct mint {
  ll x;
  mint(ll x_ = 0) : x((x_ % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint &a) { if ((x += a.x) >= mod) x -= mod; return *this; }
  mint &operator-=(const mint &a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; }
  mint &operator*=(const mint &a) { (x *= a.x) %= mod; return *this; }
  mint operator+(const mint &a) const { mint res(*this); return res += a; }
  mint operator-(const mint &a) const { mint res(*this); return res -= a; }
  mint operator*(const mint &a) const { mint res(*this); return res *= a; }
  mint pow(ll t) const { if (!t) return 1; mint a = pow(t >> 1); a *= a; if (t & 1) a *= *this; return a; }
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
  mint operator/(const mint &a) const { mint res(*this); return res /= a; }
  friend ostream &operator<<(ostream &os, const mint &m) { os << m.x; return os; }
  friend istream &operator>>(istream &is, mint &m) { is >> m.x; return is; }
};

namespace solver {

template<typename T1, typename T2> struct In2 {
  T1 a; T2 b;
  friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};

template<typename T1, typename T2, typename T3> struct In3 {
  T1 a; T2 b; T3 c;
  friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};

int n, q;
vector<int> as;
vector<In3<int, int, int>> queries;

void read() {
  cin >> n >> q;
  take(as, n);
  take(queries, q);
}

using RetType = void;

RetType run() {
  vector<pair<int, pair<int, int>>> events;
  for (auto a : as) events.push_back({a, {q, q}});  // multiply
  for (int i : range(q)) {
    auto query = queries[i];
    for (int color : range(query.a, query.b + 1)) events.push_back({color, {i, query.c}});  // answer
  }

  ranges::sort(events);

  dump(events);

  map<int, mint> mult;
  mint prod = 1;
  for (auto event : events) {
    auto [color, pp] = event;
    auto [q_idx, _] = pp;
    if (q_idx == q) prod *= color;
    else mult[color] = prod;
  }

  dump(mult);

  ranges::reverse(events);

  vector<mint> poly(n + 1);
  poly[0] = 1;
  vector<ll> ans(q);
  for (auto event : events) {
    auto [color, pp] = event;
    auto [q_idx, p] = pp;

    if (q_idx == q) {
      // multiply
      for (int i = n; i >= 0; --i) {
        poly[i] = poly[i] * (color - 1) + mint((i > 0) ? poly[i - 1] : 0);
      }
    } else {
      // answer
      if (q_idx == 0) dump(p << " " << (poly[p] * mult[color]))
      ans[q_idx] ^= (poly[p] * mult[color]).x;
    }
  }

  for (ll outp : ans) cout << outp % mod << endl; // why?
}

}  // namespace

template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }

int main(int argc, char** argv) {
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  run(solver::run);
}
0