結果

問題 No.801 エレベーター
ユーザー 👑 hitonanodehitonanode
提出日時 2019-03-17 21:53:29
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 155 ms / 2,000 ms
コード長 3,841 bytes
コンパイル時間 1,753 ms
コンパイル使用メモリ 173,368 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-09-22 05:35:34
合計ジャッジ時間 4,778 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 3 ms
4,380 KB
testcase_04 AC 3 ms
4,376 KB
testcase_05 AC 3 ms
4,376 KB
testcase_06 AC 3 ms
4,380 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 3 ms
4,376 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 3 ms
4,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 3 ms
4,376 KB
testcase_13 AC 129 ms
4,376 KB
testcase_14 AC 129 ms
4,376 KB
testcase_15 AC 129 ms
4,376 KB
testcase_16 AC 128 ms
4,376 KB
testcase_17 AC 128 ms
4,376 KB
testcase_18 AC 128 ms
4,376 KB
testcase_19 AC 128 ms
4,376 KB
testcase_20 AC 129 ms
4,376 KB
testcase_21 AC 128 ms
4,376 KB
testcase_22 AC 129 ms
4,376 KB
testcase_23 AC 126 ms
4,376 KB
testcase_24 AC 126 ms
4,376 KB
testcase_25 AC 126 ms
4,380 KB
testcase_26 AC 126 ms
4,376 KB
testcase_27 AC 126 ms
4,380 KB
testcase_28 AC 155 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#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> 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> 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> ostream &operator<<(ostream &os, const unordered_set<T> &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> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
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); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

constexpr lint MOD = 1000000007;
int N, M, K;
vector<plint> LR;

vector<lint> nxt_step(const vector<lint> &st)
{
    vector<lint> ac(N + 1);
    REP(i, N) ac[i + 1] = (ac[i] + st[i]) % MOD;

    vector<lint> cou(M);
    REP(i, M) cou[i] = (ac[LR[i].SE + 1] - ac[LR[i].FI] + MOD) % MOD;
    vector<lint> res(N + 1);
    REP(i, M)
    {
        res[LR[i].FI] += cou[i];
        (res[LR[i].SE + 1] += MOD - cou[i]) %= MOD;
    }
    REP(i, N) res[i + 1] = (res[i + 1] + res[i]) % MOD;
    res.pop_back();
    return res;
}
int main()
{
    cin >> N >> M >> K;

    LR.resize(M);
    REP(i, M)
    {
        cin >> LR[i].FI >> LR[i].SE;
        LR[i].FI--;
        LR[i].SE--;
    }

    vector<lint> st(N, 0);
    st[0] = 1;
    REP(_, K)
    {
        st = nxt_step(st);
    }
    cout << st.back() << endl;
}
0