#324769 (C++11) No.801 エレベーター

• 問題: No.801 エレベーター
• ユーザー: ningenMe
• 提出日時: 2019-03-17 21:48:20
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 149 ms / 2,000 ms
• コード長: 2,918 bytes
• コンパイル時間: 828 ms
• コンパイル使用メモリ: 95,952 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-07 21:41:17
• 合計ジャッジ時間: 3,784 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	3 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	3 ms; 5,376 KB
testcase_06	AC	3 ms; 5,376 KB
testcase_07	AC	3 ms; 5,376 KB
testcase_08	AC	3 ms; 5,376 KB
testcase_09	AC	3 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	3 ms; 5,376 KB
testcase_12	AC	3 ms; 5,376 KB
testcase_13	AC	148 ms; 5,376 KB
testcase_14	AC	147 ms; 5,376 KB
testcase_15	AC	147 ms; 5,376 KB
testcase_16	AC	147 ms; 5,376 KB
testcase_17	AC	149 ms; 5,376 KB
testcase_18	AC	147 ms; 5,376 KB
testcase_19	AC	146 ms; 5,376 KB
testcase_20	AC	147 ms; 5,376 KB
testcase_21	AC	148 ms; 5,376 KB
testcase_22	AC	146 ms; 5,376 KB
testcase_23	AC	141 ms; 5,376 KB
testcase_24	AC	141 ms; 5,376 KB
testcase_25	AC	141 ms; 5,376 KB
testcase_26	AC	143 ms; 5,376 KB
testcase_27	AC	146 ms; 5,376 KB
testcase_28	AC	147 ms; 5,376 KB

ソースコード

#include <iostream>
#include <fstream>
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string> 
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <random>


using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) { if (flg) { cout << hoge << endl; exit(0); } }
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) { o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o; }
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) { o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o; }
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) { o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o; }
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) { o << "{" << obj.first << ", " << obj.second << "}"; return o; }
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) { o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o; }
void print(void) { cout << endl; }
template <class Head> void print(Head&& head) { cout << head; print(); }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { cout << head << " "; print(forward<Tail>(tail)...); }
template <class T> void chmax(T& a, const T b) { a = max<T>(a, b); }
template <class T> void chmin(T& a, const T b) { a = min<T>(a, b); }
void YN(bool flg) { cout << ((flg) ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << ((flg) ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << ((flg) ? "yes" : "no") << endl; }

int main() {
	ll N, M, K; cin >> N >> M >> K;
	V<ll> L(M), R(M);
	REP(i, M) cin >> L[i] >> R[i];
	V<ll> dp(N + 2, 0);
	dp[1] = 1;
	REP(i,K){
		V<ll> tmp(N+2,0), sum(N+2,0);
		for (int i = 1; i <= N; ++i) sum[i] = (sum[i - 1] + dp[i]) %MOD;
		for (int i = 0; i < M; ++i){
			ll cnt = (MOD + sum[R[i]] - sum[L[i]-1]) %MOD;
			(tmp[L[i]] += cnt) %= MOD;
			(tmp[R[i]+1] += MOD-cnt) %= MOD;
		}
		for (int i = 1; i <= N; ++i) (tmp[i] += tmp[i - 1]) %= MOD;
		dp = tmp;
	}
	cout << dp[N] << endl;
	return 0;
}