結果
| 問題 | No.616 へんなソート |
| ユーザー |
 firiexp
|
| 提出日時 | 2019-12-10 10:58:14 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 2,001 bytes |
| コンパイル時間 | 674 ms |
| コンパイル使用メモリ | 86,148 KB |
| 最終ジャッジ日時 | 2024-11-14 21:56:39 |
| 合計ジャッジ時間 | 1,255 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、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: n
ソースコード
#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<ll M = 1000000007>struct modint{ll val;modint(): val(0){}template<typename T>explicit modint(T t){val = t%M; if(val < 0) val += M;}modint pow(ll k){modint res(1), x(val);while(k){if(k&1) res *= x;x *= x;k >>= 1;}return res;}template<typename T>modint& operator=(T a){ val = a%M; if(val < 0) val += M; return *this; }modint inv() {return pow(M-2);}modint& operator+=(modint a){ val += a.val; if(val >= M) val -= M; return *this;}modint& operator-=(modint a){ val += M-a.val; if(val >= M) val -= M; return *this;}modint& operator*=(modint a){ val = 1LL*val*a.val%M; return *this;}modint& operator/=(modint a){ return (*this) *= a.inv();}modint operator+(modint a) const {return modint(val) +=a;}modint operator-(modint a) const {return modint(val) -=a;}modint operator*(modint a) const {return modint(val) *=a;}modint operator/(modint a) const {return modint(val) /=a;}modint operator-(){ return modint(-val);}bool operator==(const modint a) const {return val == a.val;}bool operator!=(const modint a) const {return val != a.val;}bool operator<(const modint a) const {return val < a.val;}};using mint = modint<MOD>;int main() {int n, k;cin >> n >> k;vector<mint> dp(k+1, mint(1));for (int i = 1; i <= n; ++i) {for (int j = k-i; j >= 0; --j) {dp[j+i] -= dp[j];}for (int j = 0; j < k; ++j) {dp[j+1] += dp[j];}}cout << dp.back().val << "\n";return 0;}