結果
| 問題 | No.140 みんなで旅行 |
| ユーザー |
 firiexp
|
| 提出日時 | 2019-10-31 11:08:57 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 3,720 bytes |
| コンパイル時間 | 701 ms |
| コンパイル使用メモリ | 89,604 KB |
| 最終ジャッジ日時 | 2024-11-14 21:48:49 |
| 合計ジャッジ時間 | 1,240 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:17:39: error: '::numeric_limits' has not been declared
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ^~~~~~~~~~~~~~
main.cpp:17:55: error: expected primary-expression before '>' token
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ^
main.cpp:17:61: error: no matching function for call to 'max()'
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ~~~~~^~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39,
from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
254 | max(const _Tp& __a, const _Tp& __b)
| ^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed:
main.cpp:17:61: note: candidate expects 2 arguments, 0 provided
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ~~~~~^~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <cmath>static const int MOD = 1000000007;using ll = long long;using u32 = uint32_t;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;template <class T, class U>vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }template<class... Ts, class U>auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }template <ll M = MOD> struct modint {ll val;modint(const ll x = 0) : val(x) {val = x;while(val < 0) val += M;while(val > M) val -= M;}modint operator+(const modint a) const { return modint(*this) += a; }modint operator-(const modint a) const { return modint(*this) -= a; }modint operator*(const modint a) const { return modint(*this) *= a; }modint operator/(const modint a) const { return modint(*this) /= a; }modint operator-() const { return modint(M-val); }modint inv() const {ll u = 1, v = 0, s = 0, t = 1, m = M, x = val;while (x) {ll q = m/x; swap(s -= q*u, u); swap(t -= q*v, v); swap(m -= q*x, x); }if(s < 0) s += M;return modint(s);}modint pow(ll n) const {ll u = 1, xx = val;while (n > 0){ if (n&1) u = u * xx % M; xx = xx * xx % M; n >>= 1; }return modint(u);}modint& operator+=(const modint a){ val += a.val; if(val >= M) val -= M; return *this; }modint& operator-=(const modint a){ val -= a.val; if(val < 0) val += M; return *this; }modint& operator*=(const modint a){ val = val * a.val % M; return *this; }modint& operator/=(const modint a){ val = val * a.inv().val % M; return *this;}modint& operator=(const int& x){val = x;while(val < 0) val += M;while(val > M) val -= M;return *this;}};class Factorial {using mint = modint<MOD>;vector<mint> facts, factinv;public:explicit Factorial(int n) : facts(static_cast<u32>(n+1)), factinv(static_cast<u32>(n+1)) {facts[0] = 1;for (int i = 1; i < n+1; ++i) facts[i] = facts[i-1]*mint(i);factinv[n] = facts[n].inv();for (int i = n-1; i >= 0; --i) factinv[i] = factinv[i+1] * mint(i+1);}mint fact(int k) const {if(k >= 0) return facts[k]; else return factinv[-k];}mint operator[](const int &k) const {if(k >= 0) return facts[k]; else return factinv[-k];}mint C(int p, int q) const {if(q < 0 || p < q) return 0;return facts[p] * factinv[q] * factinv[p-q];}mint P(int p, int q) const {if(q < 0 || p < q) return 0;return facts[p] * factinv[p-q];}mint H(int p, int q) const {if(p < 0 || q < 0) return 0;return q == 0 ? 1 : C(p+q-1, q);}};using mint = modint<MOD>;int main() {int n;cin >> n;auto dp = make_v(n+1, n+1, mint(0));dp[0][0] = 1;for (int i = 1; i <= n; ++i) {for (int j = 1; j <= i; ++j) {dp[i][j] = dp[i-1][j-1] + mint(j)*dp[i-1][j];}}Factorial f(n);mint ans = 0;for (int j = 1; j <= n; ++j) {mint r = 1, c = mint(j*(j-1));for (int i = n; i >= 1; --i) {ans += r*dp[i][j]*f.C(n, n-i);r *= c;}}cout << ans.val << "\n";return 0;}