結果

問題 No.1549 [Cherry 2nd Tune] BANning Tuple
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2021-06-11 23:56:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 938 ms / 4,000 ms
コード長 8,001 bytes
コンパイル時間 4,257 ms
コンパイル使用メモリ 269,220 KB
実行使用メモリ 25,984 KB
最終ジャッジ日時 2024-05-08 20:38:05
合計ジャッジ時間 11,152 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
12,160 KB
testcase_01 AC 14 ms
12,928 KB
testcase_02 AC 342 ms
13,696 KB
testcase_03 AC 922 ms
19,072 KB
testcase_04 AC 895 ms
20,096 KB
testcase_05 AC 842 ms
18,560 KB
testcase_06 AC 938 ms
18,944 KB
testcase_07 AC 186 ms
25,984 KB
testcase_08 AC 175 ms
24,704 KB
testcase_09 AC 180 ms
25,088 KB
testcase_10 AC 167 ms
24,320 KB
testcase_11 AC 178 ms
25,088 KB
testcase_12 AC 175 ms
24,832 KB
testcase_13 AC 175 ms
24,960 KB
testcase_14 AC 180 ms
25,088 KB
testcase_15 AC 171 ms
24,576 KB
testcase_16 AC 174 ms
24,576 KB
testcase_17 AC 172 ms
24,576 KB
testcase_18 AC 178 ms
25,344 KB
testcase_19 AC 84 ms
12,544 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

#include <bits/stdc++.h>

// #include <atcoder/all>
#include <atcoder/convolution>

using namespace std;
using namespace atcoder;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                            \
    cerr << #v << endl;                         \
    for (int i = 0; i < v.size(); i++) {        \
        for (int j = 0; j < v[i].size(); j++) { \
            cerr << v[i][j] << " ";             \
        }                                       \
        cerr << endl;                           \
    }
typedef long long ll;
#define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

const int MAXN = 555555;

vl fact(MAXN);
vl rfact(MAXN);

ll mod_pow(ll x, ll p, ll M = MOD) {
    if (p < 0) {
        x = mod_pow(x, M - 2, M);
        p = -p;
    }
    ll a = 1;
    while (p) {
        if (p % 2)
            a = a * x % M;
        x = x * x % M;
        p /= 2;
    }
    return a;
}

ll mod_inverse(ll a, ll M = MOD) {
    return mod_pow(a, M - 2, M);
}

void set_fact(ll n, ll M = MOD) {
    fact[0] = 1;
    for (ll i = 1; i <= n; i++) {
        fact[i] = i * fact[i - 1] % M;
    }
    rfact[n] = mod_inverse(fact[n], M);
    for (ll i = n - 1; i >= 0; i--) {
        rfact[i] = (i + 1) * rfact[i + 1] % M;
    }
}
// Description: 区間をsetで管理するデータ構造(なお実装はmap)．各クエリO(log区間数)．

// #### attention! : [l, r] ( include r, not [l, r) )
class SegmentMap : public std::map<signed, signed> {
  private:
    bool flagToMergeAdjacentSegment;

  public:
    // if merge [l, c] and [c+1, r], set flagToMergeAdjacentSegment to true
    SegmentMap(bool flagToMergeAdjacentSegment = true) : flagToMergeAdjacentSegment(flagToMergeAdjacentSegment) {}
    // __exist -> iterator pair(l, r) (contain p)
    // noexist -> map.end()
    auto get(signed p) const {
        auto it = upper_bound(p);
        if (it == begin() || (--it)->second < p) return end();
        return it;
    }

    bool check(signed p) const {
        auto itr = get(p);
        return itr != end();
    }

    // insert segment [l, r]
    void insert(signed l, signed r) {
        auto itl = upper_bound(l), itr = upper_bound(r + flagToMergeAdjacentSegment);
        if (itl != begin()) {
            if ((--itl)->second < l - flagToMergeAdjacentSegment) ++itl;
        }
        if (itl != itr) {
            l = std::min(l, itl->first);
            r = std::max(r, std::prev(itr)->second);
            erase(itl, itr);
        }
        (*this)[l] = r;
    }
    // remove segment [l, r]
    void remove(signed l, signed r) {
        auto itl = upper_bound(l), itr = upper_bound(r);
        if (itl != begin()) {
            if ((--itl)->second < l) ++itl;
        }
        if (itl == itr) return;
        int tl = std::min(l, itl->first), tr = std::max(r, std::prev(itr)->second);
        erase(itl, itr);
        if (tl < l) (*this)[tl] = l - 1;
        if (r < tr) (*this)[r + 1] = tr;
    }
    // Is p and q in same segment?
    bool same(signed p, signed q) const {
        const auto &&it = get(p);
        return it != end() && it->first <= q && q <= it->second;
    }
};

map<pll, ll> ren;

ll f(ll n, ll r) {
    if (ren.count(pll(n, r))) return ren[pll(n, r)];
    if (r == 0) return 1;
    return ren[pll(n, r)] = f(n - 1, r - 1) * (n % MOD) % MOD;
}

//http://drken1215.hatenablog.com/entry/2018/06/08/210000
//n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ‚��ď����Ă���
ll nCr(ll n, ll r, ll M = MOD) {
    if (r > n) return 0;
    ll bo = rfact[r];
    ll si = f(n, r);
    return si * bo % MOD;
}

signed main() {
    ll n, q;
    cin >> n >> q;
    const int m = 3010;
    set_fact(m);

    vl dp(m);
    dp[0] = 1;
    vl pre(m);
    unordered_map<ll, SegmentMap> out;

    while (q--) {
        ll k, a, b, s, t;
        cin >> k >> a >> b >> s >> t;

        bool newk = false;
        if (out.count(k) == 0) {
            SegmentMap orig(true);
            out[k] = orig;
            newk = true;
        }
        out[k].insert(a, b);

        if (newk) {
            auto itr = out.find(k);
            fill(all(pre), 0);
            rep(x, m) {
                if (not itr->second.check(x)) {
                    pre[x] = 1;
                }
            }

            dp = convolution<MOD>(dp, pre);
            dp.resize(m);
        } else {
            fill(all(dp), 0);
            dp[0] = 1;

            for (auto itr = out.begin(); itr != out.end(); itr++) {
                fill(all(pre), 0);
                rep(x, m) {
                    if (not itr->second.check(x)) {
                        pre[x] = 1;
                    }
                }

                dp = convolution<MOD>(dp, pre);
                dp.resize(m);
            }
        }

        ll free = n - (int)out.size();

        ll ans = 0;
        for (int al = 0; al <= t; al++) {
            ll ma = t - al;
            ll mi = s - al;
            ll add = nCr(free + ma, ma);
            if (mi - 1 >= 0) {
                add -= nCr(free + mi - 1, mi - 1);
            }
            ans += dp[al] * add % MOD;
            ans %= MOD;
        }
        cout << (ans + MOD) % MOD << endl;
    }
}
0