結果

問題 No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
ユーザー ningenMeningenMe
提出日時 2020-05-29 22:58:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,035 ms / 2,000 ms
コード長 6,755 bytes
コンパイル時間 2,892 ms
コンパイル使用メモリ 217,948 KB
最終ジャッジ日時 2025-01-10 18:10:03
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x
    .second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj
    .begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr !
    = obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "")
    << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj
    .end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
/*
* @title ModInt
*/
template<long long mod> class ModInt {
public:
long long x;
constexpr ModInt():x(0) {
// do nothing
}
constexpr ModInt(long long y) : x(y>=0?(y%mod): (mod - (-y)%mod)%mod) {
// do nothing
}
ModInt &operator+=(const ModInt &p) {
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator+=(const long long y) {
ModInt p(y);
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator+=(const int y) {
ModInt p(y);
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const long long y) {
ModInt p(y);
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const int y) {
ModInt p(y);
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (x * p.x % mod);
return *this;
}
ModInt &operator*=(const long long y) {
ModInt p(y);
x = (x * p.x % mod);
return *this;
}
ModInt &operator*=(const int y) {
ModInt p(y);
x = (x * p.x % mod);
return *this;
}
ModInt &operator^=(const ModInt &p) {
x = (x ^ p.x) % mod;
return *this;
}
ModInt &operator^=(const long long y) {
ModInt p(y);
x = (x ^ p.x) % mod;
return *this;
}
ModInt &operator^=(const int y) {
ModInt p(y);
x = (x ^ p.x) % mod;
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inv();
return *this;
}
ModInt &operator/=(const long long y) {
ModInt p(y);
*this *= p.inv();
return *this;
}
ModInt &operator/=(const int y) {
ModInt p(y);
*this *= p.inv();
return *this;
}
ModInt operator=(const int y) {
ModInt p(y);
*this = p;
return *this;
}
ModInt operator=(const long long y) {
ModInt p(y);
*this = p;
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator++() {
x++;
if(x>=mod) x-=mod;
return *this;
}
ModInt operator--() {
x--;
if(x<0) x+=mod;
return *this;
}
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
ModInt operator^(const ModInt &p) const { return ModInt(*this) ^= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inv() const {
int a = x, b = mod, u = 1, v = 0, t;
while(b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(long long n) const {
ModInt ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt &a) {
long long t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
};
using modint = ModInt<MOD2>;
int main() {
ll N,Q; cin >> N >> Q;
vector<ll> A(N+1,LOWINF);
for(int i = 1; i <= N; ++i) cin >> A[i];
sort(ALL(A),greater<>());
A.push_back(0);
vector<ll> L(Q),R(Q),P(Q);
for(int i = 0; i < Q; ++i) cin >> L[i] >> R[i] >> P[i];
priority_queue<pair<ll,int>> pq;
for(int i = 0; i < Q; ++i) {
for(int j = L[i]; j <= R[i]; ++j) {
pq.push({j,P[i]});
}
}
auto dp = multivector(2,N+2,modint(0));
dp[0][0]=1;
modint cnt = 1;
for(int i = 1; i <= N; ++i) cnt *= A[i];
map<pair<ll,int>,modint> mp;
for(int i = 1; i <= N+1; ++i) {
while(pq.size() && pq.top().first>A[i]) {
auto p = pq.top();
pq.pop();
mp[p]=dp[(i-1)%2][p.second]*cnt;
}
for(int j = 0; j <= N; ++j) {
dp[i%2][j] = 0;
}
for(int j = 0; j <= i-1; ++j) {
dp[i%2][j+1] += dp[(i-1)%2][j];
dp[i%2][j] += dp[(i-1)%2][j]*(A[i]-1);
}
cnt /= A[i];
}
for(int i = 0; i < Q; ++i) {
modint ans = 0;
for(int j = L[i]; j <= R[i]; ++j) {
ans ^= mp[{j,P[i]}];
}
cout << ans << endl;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0