結果

問題 No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
ユーザー fine
提出日時 2020-05-29 22:14:53
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 4,505 bytes
コンパイル時間 1,879 ms
コンパイル使用メモリ 182,420 KB
実行使用メモリ 362,788 KB
最終ジャッジ日時 2024-11-06 05:13:46
合計ジャッジ時間 5,595 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 10 TLE * 1 -- * 14
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr char newl = '\n';
// https://noshi91.hatenablog.com/entry/2019/03/31/174006
template <std::uint_fast64_t Modulus>
struct ModInt {
    using u64 = std::uint_fast64_t;
    static constexpr u64 MOD = Modulus;
    u64 val;
    constexpr ModInt(const u64 x = 0) noexcept : val(x % MOD) {}
    constexpr ModInt operator+() const noexcept { return ModInt(*this); }
    constexpr ModInt operator-() const noexcept {
        ModInt res(*this);
        if (res.val != 0) res.val = MOD - res.val;
        return res;
    }
    constexpr bool operator==(const ModInt& rhs) const noexcept { return val == rhs.val; }
    constexpr bool operator!=(const ModInt& rhs) const noexcept { return val != rhs.val; }
    // prefix increment/decrement
    constexpr ModInt& operator++() noexcept { return *this += ModInt(1); }
    constexpr ModInt& operator--() noexcept { return *this -= ModInt(1); }
    // postfix increment/decrement
    constexpr ModInt& operator++(int) noexcept {
        ModInt tmp(*this);
        ++*this;
        return tmp;
    }
    constexpr ModInt& operator--(int) noexcept {
        ModInt tmp(*this);
        --*this;
        return tmp;
    }
    constexpr ModInt operator+(const ModInt& rhs) const noexcept {
        return ModInt(*this) += rhs;
    }
    constexpr ModInt operator-(const ModInt& rhs) const noexcept {
        return ModInt(*this) -= rhs;
    }
    constexpr ModInt operator*(const ModInt& rhs) const noexcept {
        return ModInt(*this) *= rhs;
    }
    constexpr ModInt operator/(const ModInt& rhs) const noexcept {
        return ModInt(*this) /= rhs;
    }
    constexpr ModInt& operator+=(const ModInt& rhs) noexcept {
        val += rhs.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr ModInt& operator-=(const ModInt& rhs) noexcept {
        if (val < rhs.val) val += MOD;
        val -= rhs.val;
        return *this;
    }
    constexpr ModInt& operator*=(const ModInt& rhs) noexcept {
        val = val * rhs.val % MOD;
        return *this;
    }
    // prime Modulus only
    constexpr ModInt& operator/=(const ModInt& rhs) noexcept {
        return *this *= rhs.inv();
    }
    // prime Modulus only
    constexpr ModInt inv() const noexcept {
        return pow(*this, MOD - 2);
    }
};
template<std::uint_fast64_t Modulus>
constexpr ModInt<Modulus> pow(ModInt<Modulus> x, std::uint_fast64_t n) {
    ModInt<Modulus> res(1);
    while (n) {
        if (n & 1) res *= x;
        x *= x;
        n >>= 1;
    }
    return res;
}
template<std::uint_fast64_t Modulus>
istream& operator>>(istream& is, ModInt<Modulus>& x) {
    std::uint_fast64_t val;
    is >> val;
    x = ModInt<Modulus>(val);
    return is;
}
template<std::uint_fast64_t Modulus>
ostream& operator<<(ostream& os, const ModInt<Modulus>& x) {
    return os << x.val;
}
using mint = ModInt<998244353>;
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end(), greater<int>());
    vector<mint> memo(n + 1, 0);
    memo[n] = 1;
    for (int i = n - 1; i >= 0; i--) {
        memo[i] = memo[i + 1] * a[i];
    }
    // 1: 24
    // 2: 24
    // 3: 24
    // 4: 36
    // 5: 48
    vector< vector<mint> > dp(n + 1, vector<mint>(n + 1, 0));
    dp[0][0] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = n; j >= 0; j--) {
            if (j < n) dp[i + 1][j + 1] += dp[i][j];
            dp[i + 1][j] += dp[i][j] * (a[i] - 1);
        }
    }
    vector< vector<ll> > sums(n + 1, vector<ll>(n + 1, 0));
    for (int i = n, k = 0; i > 0; i--) {
        while (k < n) {
            if (a[k] < i) break;
            ++k;
        }
        for (int j = 0; j <= n; j++) {
            cerr << i << " " << j << " " << dp[k][j] * memo[k] << newl;
            sums[j][i] ^= (dp[k][j] * memo[k]).val;
        }
    }
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j < n; j++) {
            sums[i][j + 1] ^= sums[i][j];
        }
    }
    for (int i = 0; i < q; i++) {
        int l, r, p;
        cin >> l >> r >> p;
        ll sum = 0;
        for (int j = r, k = 0; j >= l; j--) {
            while (k < n) {
                if (a[k] < j) break;
                ++k;
            }
            sum ^= (dp[k][p] * memo[k]).val;
        }
        cout << sum << newl;
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0