結果
| 問題 | No.801 エレベーター |
| ユーザー |
 arktan763
|
| 提出日時 | 2020-01-11 18:26:40 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 83 ms / 2,000 ms |
| コード長 | 7,598 bytes |
| コンパイル時間 | 1,497 ms |
| コンパイル使用メモリ | 172,000 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-11-25 06:51:52 |
| 合計ジャッジ時間 | 3,616 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define int long long// #define double long double#define FOR(i, a, b) for(int i = (a); i < (b); ++i)#define FORR(i, a, b) for(int i = (a); i > (b); --i)#define REP(i, n) for(int i = 0; i < (n); ++i)#define REPR(i, n) for(int i = n; i >= 0; i--)#define FOREACH(x, a) for(auto &(x) : (a))#define VECCIN(x) \for(auto &youso_ : (x)) cin >> youso_#define bitcnt(x) __builtin_popcount(x)#define lbit(x) __builtin_ffsll(x)#define rbit(x) (64 - __builtin_clzll(x))#define fi first#define se second#define All(a) (a).begin(), (a).end()#define rAll(a) (a).rbegin(), (a).rend()#define cinfast() cin.tie(0), ios::sync_with_stdio(false)#define PERM(c) \sort(All(c)); \for(bool cp = true; cp; cp = next_permutation(All(c)))#define COMB(n, k) \for(ll bit = (1LL << k) - 1; bit < (1LL << n); bit = next_combination(bit))#define PERM2(n, k) \COMB(n, k) { \vector<int> sel; \for(int bitindex = 0; bitindex < n; bitindex++) \if(bit >> bitindex & 1) sel.emplace_back(bitindex); \PERM(sel) { Printv(sel); } \}#define MKORDER(n) \vector<int> od(n); \iota(All(od), 0LL);template <typename T = long long> inline T IN() {T x;cin >> x;return (x);}inline void CIN() {}template <class Head, class... Tail>inline void CIN(Head &&head, Tail &&... tail) {cin >> head;CIN(move(tail)...);}template <class Head> inline void COUT(Head &&head) { cout << (head) << "\n"; }template <class Head, class... Tail>inline void COUT(Head &&head, Tail &&... tail) {cout << (head) << " ";COUT(forward<Tail>(tail)...);}#define CCIN(...) \char __VA_ARGS__; \CIN(__VA_ARGS__)#define DCIN(...) \double __VA_ARGS__; \CIN(__VA_ARGS__)#define LCIN(...) \long long __VA_ARGS__; \CIN(__VA_ARGS__)#define SCIN(...) \string __VA_ARGS__; \CIN(__VA_ARGS__)#define Printv(v) \{ \FOREACH(x, v) { cout << x << " "; } \cout << "\n"; \}template <typename T = string> inline void eputs(T s) {cout << s << "\n";exit(0);}template <typename A, size_t N, typename T>void Fill(A (&array)[N], const T &val) {std::fill((T *)array, (T *)(array + N), val);}long long next_combination(long long sub) {long long x = sub & -sub, y = sub + x;return (((sub & ~y) / x) >> 1) | y;}// generic lambdastemplate <typename F>#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)[[nodiscard]]#elif defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)__attribute__((warn_unused_result))#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)static inline constexpr decltype(auto)fix(F &&f) noexcept {return [f = std::forward<F>(f)](auto &&... args) {return f(f, std::forward<decltype(args)>(args)...);};}template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;template <typename T> using PQ = priority_queue<T>;typedef long long ll;typedef vector<ll> VL;typedef vector<VL> VVL;typedef pair<ll, ll> PL;typedef vector<PL> VPL;typedef vector<bool> VB;typedef vector<double> VD;typedef vector<string> VS;const int INF = 1e9;const int MOD = 1e9 + 7;// const int MOD = 998244353;const ll LINF = 1e18;const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};#define PI 3.141592653589793238#define EPS 1e-7// 1000000007 で割ったあまりを扱う構造体template <int MOD> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if(val < 0) v += MOD;}constexpr int getmod() { return MOD; }constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }constexpr Fp operator+(const Fp &r) const noexcept {return Fp(*this) += r;}constexpr Fp operator-(const Fp &r) const noexcept {return Fp(*this) -= r;}constexpr Fp operator*(const Fp &r) const noexcept {return Fp(*this) *= r;}constexpr Fp operator/(const Fp &r) const noexcept {return Fp(*this) /= r;}constexpr Fp &operator+=(const Fp &r) noexcept {val += r.val;if(val >= MOD) val -= MOD;return *this;}constexpr Fp &operator-=(const Fp &r) noexcept {val -= r.val;if(val < 0) val += MOD;return *this;}constexpr Fp &operator*=(const Fp &r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp &operator/=(const Fp &r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while(b) {long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}val = val * u % MOD;if(val < 0) val += MOD;return *this;}constexpr bool operator==(const Fp &r) const noexcept {return this->val == r.val;}constexpr bool operator!=(const Fp &r) const noexcept {return this->val != r.val;}friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {return os << x.val;}friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {return is >> x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {if(n == 0) return 1;auto t = modpow(a, n / 2);t = t * t;if(n & 1) t = t * a;return t;}};using mint = Fp<MOD>;mint dp[2][3030], imos[2][3030], sum[2][3030];signed main() {LCIN(N, M, K);VPL lr;REP(i, M) {LCIN(l, r);l--, r--;lr.emplace_back(l, r);}ll now = 0, nex = 1;Fill(sum[now], 1LL);sum[now][0] = 0;REP(i, K) {Fill(imos[nex], 0LL);Fill(sum[nex], 0LL);REP(j, M) {ll l = lr[j].fi, r = lr[j].se;mint val = sum[now][r + 1] - sum[now][l];imos[nex][l] += val, imos[nex][r + 1] -= val;}REP(i, N) { imos[nex][i + 1] += imos[nex][i]; }REP(i, N) { sum[nex][i + 1] += sum[nex][i] + imos[nex][i]; }swap(now, nex);}cout << imos[now][N - 1] << "\n";}