結果

問題 No.801 エレベーター
ユーザー FF256grhy
提出日時 2019-03-17 21:58:59
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 197 ms / 2,000 ms
コード長 4,293 bytes
コンパイル時間 1,781 ms
コンパイル使用メモリ 169,976 KB
実行使用メモリ 73,984 KB
最終ジャッジ日時 2024-07-07 22:40:45
合計ジャッジ時間 5,384 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC(T, v) static_cast<T>(v)
#define SI(v) SC(int, v.size())
#define SL(v) SC( LL, v.size())
#define RF(e, v) for(auto & e: v)
#define ei else if
#define UR assert(false)
// ---- ----
template<LL M> class ModInt {
private:
    LL v = 0;
public:
    ModInt() { }
    ModInt(LL vv) { setval(vv); }
    ModInt & setval(LL vv) { v = vv % M; if(v < 0) { v += M; } return (*this); }
    LL getval() const { return v; }
    ModInt & operator+=(const ModInt & b)       { return setval(v + b.v); }
    ModInt & operator-=(const ModInt & b)       { return setval(v - b.v); }
    ModInt & operator*=(const ModInt & b)       { return setval(v * b.v); }
    ModInt & operator/=(const ModInt & b)       { return setval(v * b.inv()); }
    ModInt & operator^=(            LU b)       { return setval(ex(v, b)); }
    ModInt   operator+ (                ) const { return ModInt(+v); }
    ModInt   operator- (                ) const { return ModInt(-v); }
    ModInt   operator+ (const ModInt & b) const { return ModInt(v + b.v); }
    ModInt   operator- (const ModInt & b) const { return ModInt(v - b.v); }
    ModInt   operator* (const ModInt & b) const { return ModInt(v * b.v); }
    ModInt   operator/ (const ModInt & b) const { return ModInt(v * b.inv()); }
    ModInt   operator^ (            LU b) const { return ModInt(ex(v, b)); }
    LL inv() const {
        LL x = (ex_gcd(v, M).FI + M) % M;
        assert(v * x % M == 1);
        return x;
    }
    LL ex(LL a, LU b) const {
        LL D = 64, x[64], y = 1;
        inc(i, D) { if((b >> i) == 0) { D = i; break; } }
        inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % M; }
        inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= M; } }
        return y;
    }
    pair<LL, LL> ex_gcd(LL a, LL b) const {
        if(b == 0) { return MP(1, 0); }
        auto p = ex_gcd(b, a % b);
        return MP(p.SE, p.FI - (a / b) * p.SE);
    }
};
template<LL M> ModInt<M> operator+(LL a, const ModInt<M> & b) { return  b + a; }
template<LL M> ModInt<M> operator-(LL a, const ModInt<M> & b) { return -b + a; }
template<LL M> ModInt<M> operator*(LL a, const ModInt<M> & b) { return  b * a; }
template<LL M> ModInt<M> operator/(LL a, const ModInt<M> & b) { return  a * b.inv(); }
template<LL M> istream & operator>>(istream & is, ModInt<M> & b) { LL v; is >> v; b.setval(v); return is; }
template<LL M> ostream & operator<<(ostream & os, const ModInt<M> & b) { return (os << b.getval()); }
// ---- ----
typedef ModInt<1'000'000'007> MI;
int n, m, k, l[3000], r[3000];
MI dp[3001][3002];
int main() {
    cin >> n >> m >> k;
    inc(i, m) { cin >> l[i] >> r[i]; l[i]--; }
    
    dp[0][0] = 1;
    inc(t, k) {
        vector<MI> s(n + 1);
        inc(i, n) { s[i + 1] = s[i] + dp[t][i]; }
        
        inc(i, m) {
            MI x = s[r[i]] - s[l[i]];
            dp[t + 1][l[i]] += x;
            dp[t + 1][r[i]] -= x;
        }
        
        inc(i, n + 1) { dp[t + 1][i + 1] += dp[t + 1][i]; }
    }
    
    cout << dp[k][n - 1] << endl;
    
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0