結果
問題 | No.2176 LRM Question 1 |
ユーザー | hitonanode |
提出日時 | 2023-01-06 21:27:44 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 44 ms / 2,000 ms |
コード長 | 12,764 bytes |
コンパイル時間 | 1,720 ms |
コンパイル使用メモリ | 180,204 KB |
実行使用メモリ | 7,168 KB |
最終ジャッジ日時 | 2024-11-30 17:13:35 |
合計ジャッジ時間 | 2,645 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 42 ms
7,040 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 3 ms
5,248 KB |
testcase_08 | AC | 1 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 36 ms
6,400 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 44 ms
7,168 KB |
testcase_15 | AC | 33 ms
6,144 KB |
testcase_16 | AC | 27 ms
5,760 KB |
testcase_17 | AC | 3 ms
5,248 KB |
testcase_18 | AC | 2 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 1 ms
5,248 KB |
testcase_21 | AC | 18 ms
5,248 KB |
testcase_22 | AC | 3 ms
5,248 KB |
testcase_23 | AC | 16 ms
5,248 KB |
testcase_24 | AC | 1 ms
5,248 KB |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <cmath>#include <complex>#include <deque>#include <forward_list>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iostream>#include <limits>#include <list>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#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, typename V>void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v<< ','; os << ']'; return os; }template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);},tpl); return is; }template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) {((os << args << ','), ...);}, tpl); return os << ')'; }template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os<< v << ','; os << '}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os <<'}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v <<','; os << '}'; return os; }template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for(auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCALconst string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET<< std::endl#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " <<__FILE__ << COLOR_RESET << std::endl : std::cerr)#else#define dbg(x) ((void)0)#define dbgif(cond, x) ((void)0)#endifstruct ModIntRuntime {private:static int md;public:using lint = long long;static int mod() { return md; }int val_;static std::vector<ModIntRuntime> &facs() {static std::vector<ModIntRuntime> facs_;return facs_;}static int &get_primitive_root() {static int primitive_root_ = 0;if (!primitive_root_) {primitive_root_ = [&]() {std::set<int> fac;int v = md - 1;for (lint i = 2; i * i <= v; i++)while (v % i == 0) fac.insert(i), v /= i;if (v > 1) fac.insert(v);for (int g = 1; g < md; g++) {bool ok = true;for (auto i : fac)if (ModIntRuntime(g).power((md - 1) / i) == 1) {ok = false;break;}if (ok) return g;}return -1;}();}return primitive_root_;}static void set_mod(const int &m) {if (md != m) facs().clear();md = m;get_primitive_root() = 0;}ModIntRuntime &_setval(lint v) {val_ = (v >= md ? v - md : v);return *this;}int val() const noexcept { return val_; }ModIntRuntime() : val_(0) {}ModIntRuntime(lint v) { _setval(v % md + md); }explicit operator bool() const { return val_ != 0; }ModIntRuntime operator+(const ModIntRuntime &x) const {return ModIntRuntime()._setval((lint)val_ + x.val_);}ModIntRuntime operator-(const ModIntRuntime &x) const {return ModIntRuntime()._setval((lint)val_ - x.val_ + md);}ModIntRuntime operator*(const ModIntRuntime &x) const {return ModIntRuntime()._setval((lint)val_ * x.val_ % md);}ModIntRuntime operator/(const ModIntRuntime &x) const {return ModIntRuntime()._setval((lint)val_ * x.inv().val() % md);}ModIntRuntime operator-() const { return ModIntRuntime()._setval(md - val_); }ModIntRuntime &operator+=(const ModIntRuntime &x) { return *this = *this + x; }ModIntRuntime &operator-=(const ModIntRuntime &x) { return *this = *this - x; }ModIntRuntime &operator*=(const ModIntRuntime &x) { return *this = *this * x; }ModIntRuntime &operator/=(const ModIntRuntime &x) { return *this = *this / x; }friend ModIntRuntime operator+(lint a, const ModIntRuntime &x) {return ModIntRuntime()._setval(a % md + x.val_);}friend ModIntRuntime operator-(lint a, const ModIntRuntime &x) {return ModIntRuntime()._setval(a % md - x.val_ + md);}friend ModIntRuntime operator*(lint a, const ModIntRuntime &x) {return ModIntRuntime()._setval(a % md * x.val_ % md);}friend ModIntRuntime operator/(lint a, const ModIntRuntime &x) {return ModIntRuntime()._setval(a % md * x.inv().val() % md);}bool operator==(const ModIntRuntime &x) const { return val_ == x.val_; }bool operator!=(const ModIntRuntime &x) const { return val_ != x.val_; }bool operator<(const ModIntRuntime &x) const {return val_ < x.val_;} // To use std::map<ModIntRuntime, T>friend std::istream &operator>>(std::istream &is, ModIntRuntime &x) {lint t;return is >> t, x = ModIntRuntime(t), is;}friend std::ostream &operator<<(std::ostream &os, const ModIntRuntime &x) {return os << x.val_;}lint power(lint n) const {lint ans = 1, tmp = this->val_;while (n) {if (n & 1) ans = ans * tmp % md;tmp = tmp * tmp % md;n /= 2;}return ans;}ModIntRuntime pow(lint n) const { return power(n); }ModIntRuntime inv() const { return this->pow(md - 2); }ModIntRuntime fac() const {int l0 = facs().size();if (l0 > this->val_) return facs()[this->val_];facs().resize(this->val_ + 1);for (int i = l0; i <= this->val_; i++)facs()[i] = (i == 0 ? ModIntRuntime(1) : facs()[i - 1] * ModIntRuntime(i));return facs()[this->val_];}ModIntRuntime doublefac() const {lint k = (this->val_ + 1) / 2;return (this->val_ & 1)? ModIntRuntime(k * 2).fac() / (ModIntRuntime(2).pow(k) * ModIntRuntime(k).fac()): ModIntRuntime(k).fac() * ModIntRuntime(2).pow(k);}ModIntRuntime nCr(const ModIntRuntime &r) const {return (this->val_ < r.val_) ? ModIntRuntime(0): this->fac() / ((*this - r).fac() * r.fac());}ModIntRuntime sqrt() const {if (val_ == 0) return 0;if (md == 2) return val_;if (power((md - 1) / 2) != 1) return 0;ModIntRuntime b = 1;while (b.power((md - 1) / 2) == 1) b += 1;int e = 0, m = md - 1;while (m % 2 == 0) m >>= 1, e++;ModIntRuntime x = power((m - 1) / 2), y = (*this) * x * x;x *= (*this);ModIntRuntime z = b.power(m);while (y != 1) {int j = 0;ModIntRuntime t = y;while (t != 1) j++, t *= t;z = z.power(1LL << (e - j - 1));x *= z, z *= z, y *= z;e = j;}return ModIntRuntime(std::min(x.val_, md - x.val_));}};int ModIntRuntime::md = 1;int main() {lint L, R, M;cin >> L >> R >> M;if (L >= M) {puts("0");return 0;}chmin(R, M - 1);using mint = ModIntRuntime;mint::set_mod(M);vector<mint> dp(R + 1, 1);FOR(i, 1, dp.size()) dp.at(i) = dp.at(i - 1) * i;FOR(i, 1, dp.size()) dp.at(i) *= dp.at(i - 1);mint ret = 0;FOR(n, L, R + 1) ret += dp.at(n);cout << ret << endl;}