結果

問題 No.801 エレベーター
ユーザー tokoharu_procon
提出日時 2019-03-17 22:01:03
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,375 ms / 2,000 ms
コード長 5,778 bytes
コンパイル時間 2,028 ms
コンパイル使用メモリ 180,452 KB
実行使用メモリ 77,624 KB
最終ジャッジ日時 2024-07-07 22:50:14
合計ジャッジ時間 23,984 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In instantiation of 'auto exvector(const T&, SIZE_T ...) [with T = mint<>; SIZE_T = {int, int}]':
main.cpp:214:21:   required from here
main.cpp:57:37: warning: narrowing conversion of 'dims#0' from 'int' to 'long unsigned int' [-Wnarrowing]
   57 |   std::vector<std::size_t> vec_dims{dims...};
      |                                     ^~~~
main.cpp:57:37: warning: narrowing conversion of 'dims#0' from 'int' to 'long unsigned int' [-Wnarrowing]
main.cpp:57:37: warning: narrowing conversion of 'dims#1' from 'int' to 'long unsigned int' [-Wnarrowing]
main.cpp:57:37: warning: narrowing conversion of 'dims#1' from 'int' to 'long unsigned int' [-Wnarrowing]

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
// chmax, chmin
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };
template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };
namespace detail {
template <typename T, std::size_t NDIMS>
struct vector_builder {
  using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;
  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
    if (!dims.empty()) dims.pop_back();
    return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
  }
};
template <typename T>
struct vector_builder<T, 1> {
  using type = std::vector<T>;
  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    return type(dims.empty() ? 0 : dims.back(), v);
  }
};
}  // namespace detail
template <typename T, typename... SIZE_T>
auto exvector(const T& v, SIZE_T... dims) {
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}
using namespace std;
//********************  dumps ************************//
template <typename T>
void dump(const T& data, vector<int>& iter) {
  cout << data << " ";
}
template <typename T>
void dump(const vector<T>& data, vector<int>& iter) {
  for (auto elem : data) dump(elem, iter);
  cout << endl;
}
template <typename T>
void dump(const vector<vector<T>>& data, vector<int>& iter) {
  for (auto elem : iter) {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++) {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}
template <typename T>
void dump(const vector<T>& data, int dummy) {
  for (int i = 0; i < data.size(); i++) {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T& data) {  // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////
long long mul(long long a, long long b, const long long MOD) {
  return b ? (mul(a * 2, b / 2, MOD) + (b & 1 ? a : 0)) % MOD : 0;
}
long long bpow(long long a, long long b, const long long MOD) {
  return (b ? bpow(a * a % MOD, b / 2, MOD) * (b & 1 ? a : 1) : 1) % MOD;
}
long long inv(long long a, const long long MOD) {
  return bpow(a, MOD - 2, MOD);
}
vector<long long> MODS = {1000000007};
template <int kind = 0>
class mint {
 public:
  long long v;
  mint() : v(0) {}
  mint(long long v) : v((v % MODS[kind] + MODS[kind]) % MODS[kind]) {}
  long long get_mod() { return MODS[kind]; }
  long long get_val() { return v; }
};
template <int kind>
ostream& operator<<(ostream& os, const mint<kind>& x) {
  return os << x.v;
}
template <int kind>
mint<kind>& operator+=(mint<kind>& a, mint<kind> b) {
  return a = a.v + b.v;
}
template <int kind>
mint<kind>& operator-=(mint<kind>& a, mint<kind> b) {
  return a = a.v - b.v;
}
template <int kind>
mint<kind>& operator*=(mint<kind>& a, mint<kind> b) {
  return a = a.v * b.v;
}
template <int kind>
mint<kind>& operator/=(mint<kind>& a, mint<kind> b) {
  return a = a.v * inv(b.v, a.get_mod());
}
template <int kind>
mint<kind> operator+(mint<kind> a, mint<kind> b) {
  return a += b;
}
template <int kind>
mint<kind> operator-(mint<kind> a, mint<kind> b) {
  return a -= b;
}
template <int kind>
mint<kind> operator*(mint<kind> a, mint<kind> b) {
  return a *= b;
}
template <int kind>
mint<kind> operator/(mint<kind> a, mint<kind> b) {
  return a /= b;
}
template <int kind>
mint<kind>& operator+=(mint<kind>& a, long long b) {
  return a = a.v + b;
}
template <int kind>
mint<kind>& operator-=(mint<kind>& a, long long b) {
  return a = a.v - b;
}
template <int kind>
mint<kind>& operator*=(mint<kind>& a, long long b) {
  return a = a.v * b;
}
template <int kind>
mint<kind>& operator/=(mint<kind>& a, long long b) {
  return a = a.v * inv(b, a.get_mod());
}
template <int kind>
mint<kind> operator+(mint<kind> a, long long b) {
  return a += b;
}
template <int kind>
mint<kind> operator-(mint<kind> a, long long b) {
  return a -= b;
}
template <int kind>
mint<kind> operator*(mint<kind> a, long long b) {
  return a *= b;
}
template <int kind>
mint<kind> operator/(mint<kind> a, long long b) {
  return a /= b;
}
vector<mint<>> kaijo;
void init() {
  kaijo.push_back(mint<>(1));
  for (int i = 1; i <= 400000; i++) {
    kaijo.push_back(kaijo.back() * i);
  }
}
mint<> comb(LL N, LL K) {
  if (K < 0) return mint<>(0);
  if (K > N) return mint<>(0);
  return kaijo[N] / kaijo[N - K] / kaijo[K];
}
int main() {
  init();
  mint<> ans;
  int N, M, K;
  cin >> N >> M >> K;
  auto dp = exvector(mint<>(0), K + 1, N + 2);
  vector<PII> input;
  for (int i = 0; i < M; i++) {
    int a, b;
    cin >> a >> b;
    input.push_back(PII(a, b));
  }
  dp[0][1] = 1;
  for (int z = 0; z < K; z++) {
    for (int i = 1; i <= N; i++) dp[z][i] += dp[z][i - 1];
    for (int i = 0; i < M; i++) {
      int l = input[i].first;
      int r = input[i].second;
      mint<> val = dp[z][r] - dp[z][l - 1];
      dp[z + 1][l] += val;
      dp[z + 1][r + 1] -= val;
    }
    for (int i = 1; i <= N + 1; i++) dp[z + 1][i] += dp[z + 1][i - 1];
    dp[z + 1][0] = 0;
  }
  // ans = accumulate(dp[K].begin(), dp[K].end(), mint<>(0));
  cout << dp[K][N] << endl;
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0