結果

問題 No.2807 Have Another Go (Easy)
ユーザー 👑 AngrySadEight
提出日時 2024-07-13 00:53:49
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 23 ms / 3,000 ms
コード長 3,813 bytes
コンパイル時間 19,245 ms
コンパイル使用メモリ 259,500 KB
最終ジャッジ日時 2025-02-22 06:05:56
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>
using mint = modint998244353;
template <typename T>
void debug(T e) {
    cerr << e << endl;
}
template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}
template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}
template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}
template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}
template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}
template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}
int main() {
    ll N, M, k;
    cin >> N >> M >> k;
    vector<ll> C(k);
    for (ll i = 0; i < k; i++) {
        cin >> C[i];
    }
    vector<ll> dp(2 * N + 7, 0);
    dp[0] = 1;
    for (ll i = 0; i < 2 * N; i++) {
        for (ll j = 1; j <= 6; j++) {
            dp[i + j] += dp[i];
            dp[i + j] %= mod2;
        }
    }
    for (ll i = 0; i < k; i++) {
        ll v1 = dp[C[i]];
        ll v1_sub = 0;
        for (ll j = max(0LL, 2 * N - C[i] - 6); j < 2 * N - C[i]; j++) {
            v1_sub += dp[j] * (j - (2 * N - C[i] - 7));
            v1_sub %= mod2;
        }
        v1 = (v1 * v1_sub) % mod2;
        ll v2 = dp[C[i] + N];
        ll v2_sub = 0;
        for (ll j = max(0LL, 2 * N - C[i] - N - 6); j < 2 * N - C[i] - N; j++) {
            v2_sub += dp[j] * (j - (2 * N - C[i] - N - 7));
            v2_sub %= mod2;
        }
        v2 = (v2 * v2_sub) % mod2;
        ll v3 = (dp[C[i]] * dp[N]) % mod2;
        ll v3_sub = 0;
        for (ll j = max(0LL, 2 * N - C[i] - N - 6); j < 2 * N - C[i] - N; j++) {
            v3_sub += dp[j] * (j - (2 * N - C[i] - N - 7));
            v3_sub %= mod2;
        }
        v3 = (v3 * v3_sub) % mod2;
        cout << (v1 + v2 - v3 + mod2) % mod2 << endl;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0