結果
問題 | No.801 エレベーター |
ユーザー | tokoharu_procon |
提出日時 | 2019-03-17 23:12:24 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,236 ms / 2,000 ms |
コード長 | 5,446 bytes |
コンパイル時間 | 1,796 ms |
コンパイル使用メモリ | 179,988 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-08 02:06:47 |
合計ジャッジ時間 | 22,501 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 14 ms
6,944 KB |
testcase_04 | AC | 14 ms
6,940 KB |
testcase_05 | AC | 14 ms
6,940 KB |
testcase_06 | AC | 14 ms
6,940 KB |
testcase_07 | AC | 15 ms
6,940 KB |
testcase_08 | AC | 14 ms
6,940 KB |
testcase_09 | AC | 13 ms
6,944 KB |
testcase_10 | AC | 14 ms
6,944 KB |
testcase_11 | AC | 14 ms
6,944 KB |
testcase_12 | AC | 15 ms
6,940 KB |
testcase_13 | AC | 1,226 ms
6,940 KB |
testcase_14 | AC | 1,236 ms
6,944 KB |
testcase_15 | AC | 1,226 ms
6,944 KB |
testcase_16 | AC | 1,231 ms
6,940 KB |
testcase_17 | AC | 1,232 ms
6,940 KB |
testcase_18 | AC | 1,217 ms
6,940 KB |
testcase_19 | AC | 1,215 ms
6,944 KB |
testcase_20 | AC | 1,225 ms
6,944 KB |
testcase_21 | AC | 1,230 ms
6,940 KB |
testcase_22 | AC | 1,203 ms
6,940 KB |
testcase_23 | AC | 1,195 ms
6,940 KB |
testcase_24 | AC | 1,214 ms
6,944 KB |
testcase_25 | AC | 1,179 ms
6,944 KB |
testcase_26 | AC | 1,186 ms
6,944 KB |
testcase_27 | AC | 1,205 ms
6,944 KB |
testcase_28 | AC | 1,200 ms
6,940 KB |
コンパイルメッセージ
main.cpp: In instantiation of 'auto exvector(const T&, SIZE_T ...) [with T = mint<>; SIZE_T = {int}]': main.cpp:207:15: 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]
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long LL;typedef pair<LL, LL> PII;// chmax, chmintemplate <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 detailtemplate <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;}int main() {mint<> ans;int N, M, K;cin >> N >> M >> K;vector<PII> input;for (int i = 0; i < M; i++) {int a, b;cin >> a >> b;input.push_back(PII(a, b));}vector<mint<>> a, b, c;int length = N + 2;a = exvector(mint<>(), length);a[1] = 1;for (int z = 0; z < K; z++) {b.clear();c = exvector(mint<>(), length);partial_sum(a.begin(), a.end(), back_inserter(b));for (int i = 0; i < M; i++) {int l = input[i].first;int r = input[i].second;mint<> val = b[r] - b[l - 1];c[l] += val;c[r + 1] -= val;}a.clear();partial_sum(c.begin(), c.end(), back_inserter(a));}cout << a[N] << endl;return 0;}