結果
問題 | No.1492 01文字列と転倒 |
ユーザー | Iván Soto |
提出日時 | 2021-05-10 12:49:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 842 ms / 4,000 ms |
コード長 | 7,399 bytes |
コンパイル時間 | 2,215 ms |
コンパイル使用メモリ | 207,404 KB |
実行使用メモリ | 18,904 KB |
最終ジャッジ日時 | 2024-09-19 17:23:55 |
合計ジャッジ時間 | 9,607 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 842 ms
18,876 KB |
testcase_03 | AC | 795 ms
17,920 KB |
testcase_04 | AC | 712 ms
17,200 KB |
testcase_05 | AC | 601 ms
15,488 KB |
testcase_06 | AC | 627 ms
15,800 KB |
testcase_07 | AC | 694 ms
16,640 KB |
testcase_08 | AC | 828 ms
18,904 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,940 KB |
testcase_14 | AC | 637 ms
15,804 KB |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | AC | 11 ms
6,940 KB |
testcase_17 | AC | 606 ms
15,360 KB |
testcase_18 | AC | 13 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 8 ms
6,944 KB |
testcase_21 | AC | 501 ms
13,952 KB |
testcase_22 | AC | 12 ms
6,944 KB |
testcase_23 | AC | 5 ms
6,940 KB |
ソースコード
/*** author: ivanzuki* created: Sun May 09 2021**/#include <bits/stdc++.h>using namespace std;template <typename T>T inverse(T a, T m) {T u = 0, v = 1;while (a != 0) {T t = m / a;m -= t * a; swap(a, m);u -= t * v; swap(u, v);}assert(m == 1);return u;}template <typename T>class Modular {public:using Type = typename decay<decltype(T::value)>::type;constexpr Modular() : value() {}template <typename U>Modular(const U& x) {value = normalize(x);}template <typename U>static Type normalize(const U& x) {Type v;if (-mod() <= x && x < mod()) v = static_cast<Type>(x);else v = static_cast<Type>(x % mod());if (v < 0) v += mod();return v;}const Type& operator()() const { return value; }template <typename U>explicit operator U() const { return static_cast<U>(value); }constexpr static Type mod() { return T::value; }Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }Modular& operator++() { return *this += 1; }Modular& operator--() { return *this -= 1; }Modular operator++(int) { Modular result(*this); *this += 1; return result; }Modular operator--(int) { Modular result(*this); *this -= 1; return result; }Modular operator-() const { return Modular(-value); }template <typename U = T>typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {#ifdef _WIN32uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;asm("divl %4; \n\t": "=a" (d), "=d" (m): "d" (xh), "a" (xl), "r" (mod()));value = m;#elsevalue = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));#endifreturn *this;}template <typename U = T>typename enable_if<is_same<typename Modular<U>::Type, long long>::value, Modular>::type& operator*=(const Modular& rhs) {long long q = static_cast<long long>(static_cast<long double>(value) * rhs.value / mod());value = normalize(value * rhs.value - q * mod());return *this;}template <typename U = T>typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {value = normalize(value * rhs.value);return *this;}Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }friend const Type& abs(const Modular& x) { return x.value; }template <typename U>friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);template <typename U>friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);template <typename V, typename U>friend V& operator>>(V& stream, Modular<U>& number);private:Type value;};template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }template<typename T, typename U>Modular<T> power(const Modular<T>& a, const U& b) {assert(b >= 0);Modular<T> x = a, res = 1;U p = b;while (p > 0) {if (p & 1) res *= x;x *= x;p >>= 1;}return res;}template <typename T>bool IsZero(const Modular<T>& number) {return number() == 0;}template <typename T>string to_string(const Modular<T>& number) {return to_string(number());}// U == std::ostream? but done this way because of fastoutputtemplate <typename U, typename T>U& operator<<(U& stream, const Modular<T>& number) {return stream << number();}// U == std::istream? but done this way because of fastinputtemplate <typename U, typename T>U& operator>>(U& stream, Modular<T>& number) {typename common_type<typename Modular<T>::Type, long long>::type x;stream >> x;number.value = Modular<T>::normalize(x);return stream;}using ModType = int;struct VarMod { static ModType value; };ModType VarMod::value;ModType& md = VarMod::value;using Mint = Modular<VarMod>;// dp[i][b][k][close] ->// dp[i + 1][b + 1][k + close][close]// dp[i + 1][b - 1][k][close + 1]int main() {ios_base::sync_with_stdio(false);cin.tie(0);int n;cin >> n >> md;vector<vector<Mint>> dp(2 * n + 1, vector<Mint>(n * n + 1));dp[0][0] = 1;for (int i = 0; i < 2 * n; i++) {vector<vector<Mint>> new_dp(2 * n + 1, vector<Mint>(n * n + 1));for (int b = 0; b <= i; b++) {if (i % 2 != b % 2) {continue;}int c = (i - b) / 2;for (int k = 0; k <= n * n; k++) {if (b + 1 <= n && k + c <= n * n) {new_dp[b + 1][k + c] += dp[b][k];}if (b > 0 && c + 1 <= n) {new_dp[b - 1][k] += dp[b][k];}}}swap(dp, new_dp);}for (int k = 0; k <= n * n; k++) {cout << dp[0][k] << '\n';}return 0;}