結果

問題 No.1549 [Cherry 2nd Tune] BANning Tuple
ユーザー 👑 hitonanodehitonanode
提出日時 2021-06-11 23:38:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,616 ms / 4,000 ms
コード長 8,241 bytes
コンパイル時間 1,991 ms
コンパイル使用メモリ 167,472 KB
実行使用メモリ 77,708 KB
最終ジャッジ日時 2023-08-21 14:44:57
合計ジャッジ時間 35,120 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 172 ms
74,120 KB
testcase_01 AC 171 ms
74,444 KB
testcase_02 AC 237 ms
74,540 KB
testcase_03 AC 1,053 ms
75,912 KB
testcase_04 AC 1,092 ms
76,032 KB
testcase_05 AC 873 ms
75,740 KB
testcase_06 AC 854 ms
75,728 KB
testcase_07 AC 2,616 ms
77,580 KB
testcase_08 AC 2,376 ms
77,296 KB
testcase_09 AC 2,292 ms
77,432 KB
testcase_10 AC 2,122 ms
77,708 KB
testcase_11 AC 2,353 ms
77,592 KB
testcase_12 AC 2,200 ms
77,560 KB
testcase_13 AC 2,200 ms
77,476 KB
testcase_14 AC 2,262 ms
77,580 KB
testcase_15 AC 2,181 ms
77,368 KB
testcase_16 AC 2,283 ms
77,640 KB
testcase_17 AC 2,244 ms
77,340 KB
testcase_18 AC 2,259 ms
77,584 KB
testcase_19 AC 174 ms
74,232 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif

#include <atcoder/modint>
using mint = atcoder::modint998244353;

template <typename modint> struct acl_fac {
    std::vector<modint> facs, facinvs;
    acl_fac(int N) {
        assert(-1 <= N and N < modint::mod());
        facs.resize(N + 1, 1);
        for (int i = 1; i <= N; i++) facs[i] = facs[i - 1] * i;
        facinvs.assign(N + 1, facs.back().inv());
        for (int i = N; i > 0; i--) facinvs[i - 1] = facinvs[i] * i;
    }
    modint ncr(int n, int r) const {
        if (n < 0 or r < 0 or n < r) return 0;
        return facs[n] * facinvs[r] * facinvs[n - r];
    }
    modint operator[](int i) const { return facs[i]; }
    modint finv(int i) const { return facinvs[i]; }
};
constexpr int bias = 3010;
acl_fac<mint> fac(bias + 10);

int main() {
    lint N;
    int Q;
    cin >> N >> Q;
    map<lint, set<pint>> mp;

    vector nplusiPj(bias * 2, vector<mint>(bias));
    REP(i, nplusiPj.size()) {
        nplusiPj[i][0] = mint(N - bias) + i;
        FOR(j, 1, nplusiPj[i].size()) nplusiPj[i][j] = nplusiPj[i][j - 1] * (mint(N - bias) + i - j);
    }
    for (auto &w : nplusiPj) REP(j, w.size()) w[j] *= fac.facinvs[j + 1];

    while (Q--) {
        lint K;
        int a, b, s, t;
        cin >> K >> a >> b >> s >> t;

        for (auto itr = mp[K].begin(); itr != mp[K].end(); itr++) {
            if (itr->second + 1 < a or itr->first - 1 > b) {

            } else {
                chmin(a, itr->first);
                chmax(b, itr->second);
            }
        }
        for (auto itr = mp[K].begin(); itr != mp[K].end(); itr++) {
            while (itr != mp[K].end() and itr->first >= a and itr->second <= b) {
                itr = mp[K].erase(itr);
            }
            if (itr == mp[K].end()) break;
        }
        mp[K].emplace(a, b);

        vector dp(1, vector<mint>(t + 1));
        dp[0][0] = 1;
        for (auto [lval, ranges] : mp) {
            vector nxt(dp.size() + 1, vector<mint>(dp[0].size()));
            for (auto [l, r] : ranges) {
                REP(i, dp.size()) REP(j, int(dp[i].size()) - l) if (dp[i][j].val()) {
                    nxt[i + 1][j + l] += dp[i][j];
                    if (j + r + 1 < int(nxt[i + 1].size())) nxt[i + 1][j + r + 1] -= dp[i][j];
                }
            }
            for (auto &vec : nxt) {
                FOR(i, 1, vec.size()) vec[i] += vec[i - 1];
            }
            REP(i, dp.size()) REP(j, dp[i].size()) nxt[i][j] += dp[i][j];
            dp = nxt;
        }
        mint ret = 0;
        auto distribute = [&](lint a, lint M) -> mint {
            if (a < 0 or M < 0) return 0;
            if (a == 0) return 1;
            lint x = M + a - (N - bias);
            return nplusiPj[x][a - 1];
            // *fac.facinvs[a];
        };
        REP(i, dp.size()) REP(sum, dp[i].size()) if (dp[i][sum].val()) {
            mint tmp = dp[i][sum] * (distribute(t - sum, N - i) - distribute(s - 1 - sum, N - i));
            if (i % 2) ret -= tmp;
            else ret += tmp;
        }
        cout << ret.val() << '\n';
    }
}
0