結果
問題 | No.2215 Slide Subset Sum |
ユーザー |
|
提出日時 | 2023-02-10 22:58:44 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 286 ms / 3,000 ms |
コード長 | 3,515 bytes |
コンパイル時間 | 1,925 ms |
コンパイル使用メモリ | 203,236 KB |
最終ジャッジ日時 | 2025-02-10 13:29:03 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 45 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define all(x) begin(x),end(x)template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }#define debug(a) cerr << "(" << #a << ": " << a << ")\n";typedef long long ll;typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> pi;const int mxN = 1e5+1, oo = 1e9;const long long MD = 998244353;template<long long MOD=MD> struct mdint {int d=0;mdint () {d=0;}mdint (long long _d) : d(_d%MOD){if(d<0) d+=MOD;};friend mdint& operator+=(mdint& a, const mdint& o) {a.d+=o.d; if(a.d>=MOD) a.d-=MOD;return a;}friend mdint& operator-=(mdint& a, const mdint& o) {a.d-=o.d; if(a.d<0) a.d+=MOD;return a;}friend mdint& operator*=(mdint& a, const mdint& o) {return a = mdint((ll)a.d*o.d);}mdint operator*(const mdint& o) const {mdint res = *this;res*=o;return res;}mdint operator+(const mdint& o) const {mdint res = *this;res+=o;return res;}mdint operator-(const mdint& o) const {mdint res = *this;res-=o;return res;}mdint operator^(long long b) const {mdint tmp = 1;mdint power = *this;while(b) {if(b&1) {tmp = tmp*power;}power = power*power;b/=2;}return tmp;}friend mdint operator/=(mdint& a, const mdint& o) {a *= (o^(MOD-2));return a;}mdint operator/(const mdint& o) {mdint res = *this;res/=o;return res;}bool operator==(const mdint& o) { return d==o.d;}bool operator!=(const mdint& o) { return d!=o.d;}friend istream& operator>>(istream& c, mdint& a) {return c >> a.d;}friend ostream& operator<<(ostream& c, const mdint& a) {return c << a.d;}};using mint = mdint<MD>;typedef array<mint,100> ss;int k;ss add(ss& a, int v) {ss b = a;for(int j=0;j<k;++j) {b[(j+v)%k]+=a[j];}return b;}struct sta {stack<ss> st;stack<int> s;sta() {ss cur = {};cur[0]=1;st.push(cur);}void add(int i) {s.push(i);st.push(::add(st.top(),i));}int pop() {st.pop();int tmp = s.top();s.pop();return tmp;}bool empty() {return s.empty();}ss& myss() {return st.top();}};int main() {ios_base::sync_with_stdio(false);cin.tie(NULL);int n,m; cin >> n >> m >> k;sta s1 = {},s2 = {};auto remove = [&]() {if(s1.empty()) {while(!s2.empty()) {s1.add(s2.pop());}}if(!s1.empty()) s1.pop();};vi a(n); for(int& i: a) cin >> i;for(int i=0;i<m;++i) {s2.add(a[i]);}for(int i=0;i+m<=n;++i) {mint ans=0;for(int i=0;i<k;++i) {ans+=s1.myss()[i]*s2.myss()[(k-i)%k];}cout << ans-1 << '\n';if(i+m!=n) {s2.add(a[i+m]);remove();}}}