結果

問題 No.1492 01文字列と転倒
ユーザー ningenMeningenMe
提出日時 2021-04-30 21:43:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,017 ms / 4,000 ms
コード長 7,120 bytes
コンパイル時間 2,723 ms
コンパイル使用メモリ 209,880 KB
実行使用メモリ 18,816 KB
最終ジャッジ日時 2023-09-26 05:38:25
合計ジャッジ時間 11,746 ms
ジャッジサーバーID
(参考情報)
judge12 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,384 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1,017 ms
18,816 KB
testcase_03 AC 920 ms
18,024 KB
testcase_04 AC 868 ms
17,040 KB
testcase_05 AC 719 ms
15,436 KB
testcase_06 AC 729 ms
15,704 KB
testcase_07 AC 772 ms
16,708 KB
testcase_08 AC 972 ms
18,812 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 1 ms
4,380 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 1 ms
4,380 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 716 ms
15,648 KB
testcase_15 AC 3 ms
4,380 KB
testcase_16 AC 13 ms
4,376 KB
testcase_17 AC 698 ms
15,448 KB
testcase_18 AC 15 ms
4,384 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 10 ms
4,380 KB
testcase_21 AC 554 ms
13,868 KB
testcase_22 AC 13 ms
4,380 KB
testcase_23 AC 6 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h> 
using namespace std; 
using int128  = __int128_t; 
using int64   = long long; 
using int32   = int; 
using uint128 = __uint128_t; 
using uint64  = unsigned long long; 
using uint32  = unsigned int; 

#define ALL(obj) (obj).begin(),(obj).end() 
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>; 

constexpr int64 MOD = 1'000'000'000LL + 7; //' 
constexpr int64 MOD2 = 998244353; 
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL; 
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //' 
constexpr long double PI = 3.1415926535897932384626433L; 

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} 
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} 
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} 
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} 
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} 
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} 
void print(void) {cout << endl;} 
template <class Head> void print(Head&& head) {cout << head;print();} 
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} 
template <class T> void chmax(T& a, const T b){a=max(a,b);} 
template <class T> void chmin(T& a, const T b){a=min(a,b);} 
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;} 
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;} 
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b) 
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} 
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} 
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} 

/*
 * @title RuntimeModInt - 実行時ModInt
 * @docs md/util/RuntimeModInt.md
 */
template<long long& mod> class RuntimeModInt {
public:
    long long x;
    constexpr RuntimeModInt():x(0) {}
    constexpr RuntimeModInt(long long y) : x(y>=0?(y%mod): (mod - (-y)%mod)%mod) {}
    RuntimeModInt &operator+=(const RuntimeModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator+=(const long long y) {RuntimeModInt p(y);if((x += p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator+=(const int y) {RuntimeModInt p(y);if((x += p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator-=(const RuntimeModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator-=(const long long y) {RuntimeModInt p(y);if((x += mod - p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator-=(const int y) {RuntimeModInt p(y);if((x += mod - p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator*=(const RuntimeModInt &p) {x = (x * p.x % mod);return *this;}
    RuntimeModInt &operator*=(const long long y) {RuntimeModInt p(y);x = (x * p.x % mod);return *this;}
    RuntimeModInt &operator*=(const int y) {RuntimeModInt p(y);x = (x * p.x % mod);return *this;}
    RuntimeModInt &operator^=(const RuntimeModInt &p) {x = (x ^ p.x) % mod;return *this;}
    RuntimeModInt &operator^=(const long long y) {RuntimeModInt p(y);x = (x ^ p.x) % mod;return *this;}
    RuntimeModInt &operator^=(const int y) {RuntimeModInt p(y);x = (x ^ p.x) % mod;return *this;}
    RuntimeModInt &operator/=(const RuntimeModInt &p) {*this *= p.inv();return *this;}
    RuntimeModInt &operator/=(const long long y) {RuntimeModInt p(y);*this *= p.inv();return *this;}
    RuntimeModInt &operator/=(const int y) {RuntimeModInt p(y);*this *= p.inv();return *this;}
    RuntimeModInt operator=(const int y) {RuntimeModInt p(y);*this = p;return *this;}
    RuntimeModInt operator=(const long long y) {RuntimeModInt p(y);*this = p;return *this;}
    RuntimeModInt operator-() const {return RuntimeModInt(-x); }
    RuntimeModInt operator++() {x++;if(x>=mod) x-=mod;return *this;}
    RuntimeModInt operator--() {x--;if(x<0) x+=mod;return *this;}
    RuntimeModInt operator+(const RuntimeModInt &p) const { return RuntimeModInt(*this) += p; }
    RuntimeModInt operator-(const RuntimeModInt &p) const { return RuntimeModInt(*this) -= p; }
    RuntimeModInt operator*(const RuntimeModInt &p) const { return RuntimeModInt(*this) *= p; }
    RuntimeModInt operator/(const RuntimeModInt &p) const { return RuntimeModInt(*this) /= p; }
    RuntimeModInt operator^(const RuntimeModInt &p) const { return RuntimeModInt(*this) ^= p; }
    bool operator==(const RuntimeModInt &p) const { return x == p.x; }
    bool operator!=(const RuntimeModInt &p) const { return x != p.x; }
    RuntimeModInt inv() const {int a=x,b=mod,u=1,v=0,t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);} return RuntimeModInt(u);}
    RuntimeModInt pow(long long n) const {RuntimeModInt ret(1), mul(x);for(;n > 0;mul *= mul,n >>= 1) if(n & 1) ret *= mul;return ret;}
    friend ostream &operator<<(ostream &os, const RuntimeModInt &p) {return os << p.x;}
    friend istream &operator>>(istream &is, RuntimeModInt &a) {long long t;is >> t;a = RuntimeModInt<mod>(t);return (is);}
};
long long runtime_mod;
using modint = RuntimeModInt<runtime_mod>;

/** 
 * @url  
 * @est 
 */  
int main() { 
    cin.tie(0);ios::sync_with_stdio(false);
    int N,M; cin >> N >> M;
    runtime_mod = M;
    int K = N*N;
    auto dp = multivector(N+1,K+1,modint(0));
    auto tp = dp;
    dp[0][0] = 1;
    for(int n=0;n<2*N;++n) {
        for(int i=0;i<=N;++i) {
            for(int j=0;j<=K;++j) {
                tp[i][j]=0;                
            }
        }
        for(int i=0;i<=N;++i) {
            int zero = i, one = n-i;
            for(int j=0;j<=K;++j) {
                //zero
                if(i+1<=N && j+one<=K) tp[i+1][j+one] += dp[i][j];
                //one
                if(i<=N && zero >= one+1) tp[i][j] += dp[i][j];
            }
        }
        swap(tp,dp);
    }
    for(int i=0;i<=K;++i) {
        cout << dp[N][i] << "\n";
    }
    return 0; 
} 
0