#1168393 (C++14) No.3565 Take from Excluded

• 問題: No.3565 Take from Excluded
• ユーザー: hos.lyric
• 提出日時: 2026-06-05 23:54:05
• 言語: C++14 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 6,258 bytes
• コンパイル時間: 1,083 ms
• コンパイル使用メモリ: 148,436 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-06-05 23:54:27
• 合計ジャッジ時間: 5,579 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge1_1

ファイルパターン	結果
sample	AC * 2
other	AC * 11 WA * 2 RE * 1 TLE * 1 -- * 3

ソースコード

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T> ostream &operator<<(ostream &os, const vector<T> &as);
template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int N, Q;
vector<Int> A;
vector<Int> K, X, M;

vector<Mint> slow() {
  Mint off = A[0];
  vector<Int> fs, gs;
  for (int i = 0, j = 0; i < N; i = j) {
    for (; j < N && A[i] - i == A[j] - j; ++j) {}
    fs.push_back(j - i);
    if (i) gs.push_back(A[i] - A[i - 1] - 1);
  }
// cerr<<__LINE__<<": "<<fs<<" "<<gs<<endl;
  vector<Mint> ans(Q);
  for (int q = 0; q < Q; ++q) {
    auto once = [&]() -> void {
      assert(fs.size() == gs.size() + 1);
      {
        Int sum = 0;
        for (const Int g : gs) sum += g;
        for (; sum > M[q]; ) {
          sum -= gs.back();
          gs.pop_back();
        }
        gs.push_back(M[q] - sum);
      }
      off += fs[0];
      fs.swap(gs);
      const int len = fs.size();
      gs.resize(len);
      gs.erase(gs.begin());
    };
    
    Int k = K[q];
    once();
    --k;
// cerr<<__LINE__<<": "<<fs<<" "<<gs<<endl;
    if (k) {
      once();
      --k;
// cerr<<__LINE__<<": "<<fs<<" "<<gs<<endl;
    }
    {
      {
        Int sum = 0;
        for (const Int g : gs) sum += g;
        assert(sum < M[q]);
        gs.push_back(M[q] - sum);
      }
      assert(fs.size() == gs.size());
      const int len = fs.size();
      const Int quo = k/2 / len;
      const Int rem = k/2 % len;
      for (int i = 0; i < len; ++i) off += Mint(quo + (i < rem)) * (Mint(fs[i]) + Mint(gs[i]));
      rotate(fs.begin(), fs.begin() + rem, fs.end());
      rotate(gs.begin(), gs.begin() + rem, gs.end());
      gs.pop_back();
      k %= 2;
// cerr<<__LINE__<<": "<<fs<<" "<<gs<<endl;
    }
    if (k) {
      once();
      --k;
// cerr<<__LINE__<<": "<<fs<<" "<<gs<<endl;
    }
    assert(!k);
    
    ans[q] = off;
    Int x = X[q];
    for (int i = 0; ; ++i) {
      assert(i < (int)fs.size());
      if (x <= fs[i]) {
        ans[q] += (x - 1);
        break;
      }
      x -= fs[i];
      ans[q] += fs[i];
      assert(i < (int)gs.size());
      ans[q] += gs[i];
    }
  }
  return ans;
}

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) scanf("%lld", &A[i]);
    K.resize(Q);
    X.resize(Q);
    M.resize(Q);
    for (int q = 0; q < Q; ++q) scanf("%lld%lld%lld", &K[q], &X[q], &M[q]);
    
    sort(A.begin(), A.end());
    A.erase(unique(A.begin(), A.end()), A.end());
    N = A.size();
    
    const auto ans = slow();
    for (int q = 0; q < Q; ++q) printf("%u\n", ans[q].x);
  }
  
  return 0;
}