結果
問題 |
No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
|
ユーザー |
|
提出日時 | 2020-05-29 22:31:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 406 ms / 2,000 ms |
コード長 | 2,929 bytes |
コンパイル時間 | 1,696 ms |
コンパイル使用メモリ | 112,848 KB |
最終ジャッジ日時 | 2025-01-10 17:46:14 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 25 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:61:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 61 | scanf("%d", &v[i]); | ~~~~~^~~~~~~~~~~~~ main.cpp:72:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 72 | scanf("%d %d %d", &l, &r, &ps[i]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> #include <cmath> static const int MOD = 998244353; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; template<u32 M = 1000000007> struct modint{ u32 val; modint(): val(0){} template<typename T> modint(T t){t %= (T)M; if(t < 0) t += (T)M; val = t;} modint pow(ll k) const { modint res(1), x(val); while(k){ if(k&1) res *= x; x *= x; k >>= 1; } return res; } template<typename T> modint& operator=(T t){t %= (T)M; if(t < 0) t += (T)M; val = t; return *this;} modint inv() const {return pow(M-2);} modint& operator+=(modint a){val += a.val; if(val >= M) val -= M; return *this;} modint& operator-=(modint a){if(val < a.val) val += M-a.val; else val -= a.val; return *this;} modint& operator*=(modint a){val = (u64)val*a.val%M; return *this;} modint& operator/=(modint a){return (*this) *= a.inv();} modint operator+(modint a) const {return modint(val) +=a;} modint operator-(modint a) const {return modint(val) -=a;} modint operator*(modint a) const {return modint(val) *=a;} modint operator/(modint a) const {return modint(val) /=a;} modint operator-(){return modint(M-val);} bool operator==(const modint a) const {return val == a.val;} bool operator!=(const modint a) const {return val != a.val;} bool operator<(const modint a) const {return val < a.val;} }; using mint = modint<MOD>; int main() { int n, q; cin >> n >> q; vector<mint> dp(n+1); // reversed!!! dp[0] = 1; int cnt = 0; vector<int> v(n); for (int i = 0; i < n; ++i) { scanf("%d", &v[i]); for (int j = n-1; j >= 0; --j) { dp[j+1] += dp[j]*mint(v[i]-1); } cnt++; } sort(v.begin(),v.end()); vector<pair<int, int>> event; vector<int> ps(q); for (int i = 0; i < q; ++i) { int l, r; scanf("%d %d %d", &l, &r, &ps[i]); for (int j = l; j <= r; ++j) { event.emplace_back(j, i); } } set<int> s; sort(event.begin(),event.end()); int cur = 0; vector<int> ans(q); for (int i = 0; i < event.size(); ++i) { while(cur < v.size() && event[i].first > v[cur]){ for (int j = 0; j < n; ++j) { dp[j+1] -= dp[j]*(v[cur]-1); } for (int j = 0; j <= n; ++j) { dp[j] *= mint(v[cur]); } cnt--; cur++; } if(cnt >= ps[event[i].second]) ans[event[i].second] ^= dp[cnt-ps[event[i].second]].val; } for (int i = 0; i < q; ++i) { printf("%d\n", ans[i]); } return 0; }