結果

問題 No.801 エレベーター
ユーザー pazzle1230
提出日時 2019-03-30 13:04:08
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 3,924 bytes
コンパイル時間 1,764 ms
コンパイル使用メモリ 171,064 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-08 19:40:40
合計ジャッジ時間 4,130 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std; 
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}
template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}
template<::std::uint_fast64_t mod>
class ModInt{
private:
    using value_type = ::std::uint_fast64_t;
    value_type n;
public:
    ModInt() : n(0) {}
    ModInt(value_type n_) : n(n_ % mod) {}
    ModInt(const ModInt& m) : n(m.n) {}
    template<typename T>
    explicit operator T() const { return static_cast<T>(n); }
    value_type get() const { return n; }
    friend ::std::ostream& operator<<(::std::ostream &os, const ModInt<mod> &a) {
        return os << a.n;
    }
    friend ::std::istream& operator>>(::std::istream &is, ModInt<mod> &a) {
        value_type x;
        is >> x;
        a = ModInt<mod>(x);
        return is;
    }
    bool operator==(const ModInt& m) const { return n == m.n; }
    bool operator!=(const ModInt& m) const { return n != m.n; }
    ModInt& operator*=(const ModInt& m){ n = n * m.n % mod; return *this; }
    ModInt pow(value_type b) const{
        ModInt ans = 1, m = ModInt(*this);
        while(b){
            if(b & 1) ans *= m;
            m *= m;
            b >>= 1;
        }
        return ans;
    }
    ModInt inv() const { return (*this).pow(mod-2); }
    ModInt& operator+=(const ModInt& m){ n += m.n; n = (n < mod ? n : n - mod); return *this; }
    ModInt& operator-=(const ModInt& m){ n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
    ModInt& operator/=(const ModInt& m){ *this *= m.inv(); return *this; }
    ModInt operator+(const ModInt& m) const { return ModInt(*this) += m; }
    ModInt operator-(const ModInt& m) const { return ModInt(*this) -= m; }
    ModInt operator*(const ModInt& m) const { return ModInt(*this) *= m; }
    ModInt operator/(const ModInt& m) const { return ModInt(*this) /= m; }
    ModInt& operator++(){ n += 1; return *this; }
    ModInt& operator--(){ n -= 1; return *this; }
    ModInt operator++(int){
        ModInt old(n);
        n += 1;
        return old;
    }
    ModInt operator--(int){
        ModInt old(n);
        n -= 1;
        return old;
    }
    ModInt operator-() const { return ModInt(mod-n); }
};
template<::std::size_t size, ::std::uint_fast64_t mod=1000000007>
class Factorial{
private:
    using value_type = ModInt<mod>;
    ::std::vector<value_type> fact, inv;
public:
    Factorial() : fact(size+1, 1), inv(size+1, 1){
        for(::std::size_t i = 1; i <= size; ++i){
            fact[i] = fact[i-1] * value_type(i);
            inv[i] = fact[i].inv();
        }
    }
    value_type comb(::std::int64_t a, ::std::int64_t b){
        assert(a >= b);
        assert(b >= 0);
        return fact[a]*inv[b]*inv[a-b];
    }
    value_type& operator[](::std::size_t k){ return fact[k]; }
};
const int64 mod = 1e9+7;
using Mint = ModInt<mod>;
int main(void) {
    int64 N, M, K;
    cin >> N >> M >> K;
    vector<int64> L(M), R(M);
    REP(i, M){
        cin >> L[i] >> R[i];
        L[i]--; R[i];
    }
    vector<Mint> dp(N, 0);
    dp[0] = 1;
    REP(_, K) {
        vector<Mint> sum(N+1, 0), dp2(N+1, 0);
        REP(i, N) sum[i+1] += sum[i] + dp[i];
        REP(i, M) {
            Mint s = sum[R[i]]-sum[L[i]];
            dp2[L[i]] += s;
            dp2[R[i]] -= s;
        }
        REP(i, N) dp2[i+1] += dp2[i];
        swap(dp, dp2);
    }
    cout << dp[N-1] << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0