結果
| 問題 | No.1696 Nonnil |
| ユーザー |
 packer_jp
|
| 提出日時 | 2021-10-01 23:31:10 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 329 ms / 3,500 ms |
| コード長 | 10,217 bytes |
| コンパイル時間 | 2,323 ms |
| コンパイル使用メモリ | 208,168 KB |
| 最終ジャッジ日時 | 2025-01-24 19:29:10 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 39 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define all(a) begin(a), end(a)#define rall(a) rbegin(a), rend(a)#define uniq(a) (a).erase(unique(all(a)), (a).end())#define SZ(x) ((int)(x).size())#define pb(x) push_back(x)#define eb(x) emplace_back(x)#define vsum(x) reduce(all(x))#define vmax(a) *max_element(all(a))#define vmin(a) *min_element(all(a))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define mp make_pair#define endl '\n'using ll = long long;using ull = unsigned long long;using ld = long double;using Pi = pair<int, int>;using Pl = pair<ll, ll>;using Vi = vector<int>;using Vl = vector<ll>;using Vc = vector<char>;using VVi = vector<vector<int>>;using VVl = vector<vector<ll>>;using VVc = vector<vector<char>>;template <typename T, typename U> using P = pair<T, U>;template <typename T> using V = vector<T>;template <typename T> using VV = V<V<T>>;constexpr ll inf = 1000000000ll;constexpr ll INF = 4000000004000000000LL;constexpr ld eps = 1e-15;constexpr ld PI = 3.141592653589793;constexpr int popcnt(ull x) { return __builtin_popcountll(x); }template <typename T> using mat = vector<vector<T>>;constexpr ll dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};constexpr ll dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};constexpr ll sign(ll a) { return (a > 0) - (a < 0); }constexpr ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }constexpr ll cdiv(ll a, ll b) { return -fdiv(-a, b); }constexpr ull bit(int n) { return 1ull << n; }template <typename T> constexpr T mypow(T x, ll n) {T ret = 1;while (n) {if (n & 1) ret *= x;x *= x;n >>= 1;}return ret;}constexpr ll modpow(ll x, ll n, ll mod) {ll ret = 1;while (n) {if (n & 1) ret *= x;x *= x;n >>= 1;x %= mod;ret %= mod;}return ret;}template <typename T> T xor64(T lb, T ub) {static ull x = 88172645463325252ull;x ^= x << 7;return lb + (x ^= x >> 9) % (ub - lb);}constexpr ll safemod(ll x, ll mod) { return (x % mod + mod) % mod; }template <typename T> constexpr T sq(const T &a) { return a * a; }template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;template <typename T, typename U> bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }template <typename T, typename U> bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }template <typename T> T make_vector(T &&a) { return a; }template <typename... Ts> auto make_vector(int h, Ts &&... ts) { return vector(h, make_vector(ts...)); }template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {os << "(" << a.first << ", " << a.second << ")";return os;}template <typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")";return os;}template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {os << "(";for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");os << ")";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &a) {os << "(";for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");os << ")";return os;}template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {os << "(";for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");os << ")";return os;}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {os << "(";for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");os << ")";return os;}template <typename T> void print(const T &a) { cout << a << endl; }template <typename T> void print(const vector<T> &v) {for (auto &e : v) cout << e << " ";cout << endl;}template <typename T> void scan(vector<T> &a) {for (auto &i : a) cin >> i;}struct timer {clock_t start_time;void start() { start_time = clock(); }int lap() {// return x ms.return (clock() - start_time) * 1000 / CLOCKS_PER_SEC;}};template <typename T = int> struct Edge {int from, to;T cost;int idx;Edge() = default;Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}operator int() const { return to; }};template <typename T = int> struct Graph {vector<vector<Edge<T>>> g;int es;Graph() = default;explicit Graph(int n) : g(n), es(0) {}size_t size() const { return g.size(); }void add_directed_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es++); }void add_edge(int from, int to, T cost = 1) {g[from].emplace_back(from, to, cost, es);g[to].emplace_back(to, from, cost, es++);}void read(int M, int padding = -1, bool weighted = false, bool directed = false) {for (int i = 0; i < M; i++) {int a, b;cin >> a >> b;a += padding;b += padding;T c = T(1);if (weighted) cin >> c;if (directed)add_directed_edge(a, b, c);elseadd_edge(a, b, c);}}};#ifdef ONLINE_JUDGE#define dump(...) (void(0))#elsevoid debug() { cerr << endl; }template <typename Head, typename... Tail> void debug(Head &&head, Tail &&... tail) {cerr << head;if (sizeof...(Tail)) cerr << ", ";debug(tail...);}#define dump(...) cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ", debug(__VA_ARGS__)#endifstruct rep {struct itr {ll v;itr(ll v) : v(v) {}void operator++() { ++v; }ll operator*() const { return v; }bool operator!=(itr i) const { return v < *i; }};ll l, r;rep(ll l, ll r) : l(l), r(r) {}rep(ll r) : rep(0, r) {}itr begin() const { return l; };itr end() const { return r; };};struct per {struct itr {ll v;itr(ll v) : v(v) {}void operator++() { --v; }ll operator*() const { return v; }bool operator!=(itr i) const { return v > *i; }};ll l, r;per(ll l, ll r) : l(l), r(r) {}per(ll r) : per(0, r) {}itr begin() const { return r - 1; };itr end() const { return l - 1; };};struct io_setup {static constexpr int PREC = 20;io_setup() {cout << fixed << setprecision(PREC);cerr << fixed << setprecision(PREC);};} iOS;template <ll MOD = 1000000007> struct modint {ll val;modint(ll val = 0) : val(val >= 0 ? val % MOD : (MOD - (-val) % MOD) % MOD) {}static ll mod() { return MOD; }modint inv() const {ll a = val, b = MOD, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return modint(u);}modint pow(ll k) const {modint ret = 1, mul = val;while (k) {if (k & 1) ret *= mul;mul *= mul;k >>= 1;}return ret;}modint &operator+=(const modint &a) {if ((val += a.val) >= MOD) val -= MOD;return *this;}modint &operator-=(const modint &a) {if ((val += MOD - a.val) >= MOD) val -= MOD;return *this;}modint &operator*=(const modint &a) {(val *= a.val) %= MOD;return *this;}modint &operator/=(const modint &a) { return *this *= a.inv(); }modint operator+() const { return *this; }modint operator-() const { return modint(-val); }friend bool operator==(const modint &a, const modint &b) { return a.val == b.val; }friend bool operator!=(const modint &a, const modint &b) { return rel_ops::operator!=(a, b); }friend modint operator+(const modint &a, const modint &b) { return modint(a) += b; }friend modint operator-(const modint &a, const modint &b) { return modint(a) -= b; }friend modint operator*(const modint &a, const modint &b) { return modint(a) *= b; }friend modint operator/(const modint &a, const modint &b) { return modint(a) /= b; }friend istream &operator>>(istream &is, modint &a) {ll val;is >> val;a = modint(val);return is;}friend ostream &operator<<(ostream &os, const modint &a) { return os << a.val; }};template <typename mint> struct combination {vector<mint> fact, finv, inv;combination(int n) : fact(n + 1), finv(n + 1), inv(n + 1) {fact[0] = fact[1] = finv[0] = finv[1] = inv[1] = 1;for (int i : rep(2, n + 1)) {fact[i] = fact[i - 1] * i;inv[i] = -inv[mint::mod() % i] * (mint::mod() / i);finv[i] = finv[i - 1] * inv[i];}}mint P(int n, int r) { return r < 0 || n < r ? 0 : (fact[n] * finv[n - r]); }mint C(int n, int r) { return P(n, r) * finv[r]; }mint H(int n, int r) { return C(n + r - 1, r); }mint catalan(int n) { return C(2 * n, n) / (n + 1); }};int main() {ll n, k, m;cin >> n >> k >> m;Vl l(m), r(m);Vl prev(k + 1);for (ll i : rep(m)) cin >> l[i] >> r[i], chmax(prev[r[i]], l[i]);using mint = modint<998244353>;V<mint> sum(k + 1);sum[0] = 1;deque<P<ll, V<mint>>> dp;dp.emplace_back(0, sum);for (ll i : rep(1, k + 1)) {V<mint> cur(k + 1);for (ll j : rep(k)) cur[j + 1] += sum[j];for (ll j : rep(k + 1)) sum[j] += cur[j];dp.emplace_back(i, cur);while (dp[0].first < prev[i]) {for (ll j : rep(k + 1)) sum[j] -= dp[0].second[j];dp.pop_front();}}combination<mint> comb(k);mint ans = 0;for (ll i : rep(k + 1)) {for (ll j : rep(i + 1)) { ans += sum[i] * (mint(-1).pow(i - j)) * comb.C(i, j) * mint(j).pow(n); }}cout << ans << endl;}