結果

問題 No.1513 simple 門松列 problem
ユーザー LayCurseLayCurse
提出日時 2021-05-21 22:10:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 67 ms / 3,000 ms
コード長 8,946 bytes
コンパイル時間 2,669 ms
コンパイル使用メモリ 216,756 KB
実行使用メモリ 4,500 KB
最終ジャッジ日時 2023-07-31 15:38:46
合計ジャッジ時間 3,976 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
4,380 KB
testcase_01 AC 3 ms
4,376 KB
testcase_02 AC 67 ms
4,404 KB
testcase_03 AC 3 ms
4,376 KB
testcase_04 AC 3 ms
4,400 KB
testcase_05 AC 2 ms
4,384 KB
testcase_06 AC 3 ms
4,396 KB
testcase_07 AC 3 ms
4,384 KB
testcase_08 AC 3 ms
4,432 KB
testcase_09 AC 2 ms
4,384 KB
testcase_10 AC 3 ms
4,380 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 3 ms
4,376 KB
testcase_14 AC 65 ms
4,380 KB
testcase_15 AC 65 ms
4,380 KB
testcase_16 AC 66 ms
4,500 KB
testcase_17 AC 43 ms
4,404 KB
testcase_18 AC 16 ms
4,380 KB
testcase_19 AC 3 ms
4,380 KB
testcase_20 AC 11 ms
4,464 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define MD (998244353U)
struct Modint{
  unsigned val;
  Modint(){
    val=0;
  }
  Modint(int a){
    val = ord(a);
  }
  Modint(unsigned a){
    val = ord(a);
  }
  Modint(long long a){
    val = ord(a);
  }
  Modint(unsigned long long a){
    val = ord(a);
  }
  inline unsigned ord(unsigned a){
    return a%MD;
  }
  inline unsigned ord(int a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned ord(unsigned long long a){
    return a%MD;
  }
  inline unsigned ord(long long a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned get(){
    return val;
  }
  inline Modint &operator++(){
    val++;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator--(){
    if(val == 0){
      val = MD - 1;
    }
    else{
      --val;
    }
    return *this;
  }
  inline Modint operator++(int a){
    Modint res(*this);
    val++;
    if(val >= MD){
      val -= MD;
    }
    return res;
  }
  inline Modint operator--(int a){
    Modint res(*this);
    if(val == 0){
      val = MD - 1;
    }
    else{
      --val;
    }
    return res;
  }
  inline Modint &operator+=(Modint a){
    val += a.val;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator-=(Modint a){
    if(val < a.val){
      val = val + MD - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  inline Modint &operator*=(Modint a){
    val = ((unsigned long long)val*a.val)%MD;
    return *this;
  }
  inline Modint &operator/=(Modint a){
    return *this *= a.inverse();
  }
  inline Modint operator+(Modint a){
    return Modint(*this)+=a;
  }
  inline Modint operator-(Modint a){
    return Modint(*this)-=a;
  }
  inline Modint operator*(Modint a){
    return Modint(*this)*=a;
  }
  inline Modint operator/(Modint a){
    return Modint(*this)/=a;
  }
  inline Modint operator+(int a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(int a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(int a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(int a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator+(long long a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(long long a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(long long a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(long long a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator-(void){
    Modint res;
    if(val){
      res.val=MD-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  inline operator bool(void){
    return val!=0;
  }
  inline operator int(void){
    return get();
  }
  inline operator long long(void){
    return get();
  }
  inline Modint inverse(){
    int a = val;
    int b = MD;
    int u = 1;
    int v = 0;
    int t;
    Modint res;
    while(b){
      t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if(u < 0){
      u += MD;
    }
    res.val = u;
    return res;
  }
  inline Modint pw(unsigned long long b){
    Modint a(*this);
    Modint res;
    res.val = 1;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  inline bool operator==(int a){
    return ord(a)==val;
  }
  inline bool operator!=(int a){
    return ord(a)!=val;
  }
}
;
inline Modint operator+(int a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(int a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(int a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(int a, Modint b){
  return Modint(a)/=b;
}
inline Modint operator+(long long a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(long long a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(long long a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(long long a, Modint b){
  return Modint(a)/=b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
int isKado(int x,int y,int z){
  if(x==y||y==z||z==x){
    return 0;
  }
  if(x < y  &&  y < z){
    return 0;
  }
  if(x > y  &&  y > z){
    return 0;
  }
  return 1;
}
Modint dp[2][201][201];
Modint sm[2][202][202];
Modint nx[2][201][201];
int main(){
  int Lj4PdHRW, i;
  int N;
  rd(N);
  int K;
  rd(K);
  Modint res1 = 0;
  Modint res2 = 0;
  dp[0][K][K] = 1;
  for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
    int j, m;
    for(m=(0);m<(2);m++){
      int i;
      for(i=(0);i<(K+1);i++){
        int j;
        for(j=(0);j<(K+1);j++){
          nx[m][i][j] = 0;
        }
      }
    }
    for(m=(0);m<(2);m++){
      int i;
      for(i=(0);i<(K+1);i++){
        int j;
        for(j=(0);j<(K+1);j++){
          sm[m][i+1][j] = sm[m][i][j] + dp[m][i][j];
        }
      }
    }
    for(j=(0);j<(K+1);j++){
      int k;
      for(k=(0);k<(K);k++){
        if(j==k){
          continue;
        }
        if(j==K){
          nx[0][j][k] += dp[0][K][j];
          nx[1][j][k] += dp[1][K][j];
          nx[1][j][k] += dp[0][K][j] * k;
          continue;
        }
        if(j < k){
          nx[0][j][k] += sm[0][K+1][j] - sm[0][j+1][j] - dp[0][k][j];
          nx[1][j][k] += sm[1][K+1][j] - sm[1][j+1][j] - dp[1][k][j];
          nx[1][j][k] += (sm[0][K+1][j] - sm[0][j+1][j] - dp[0][k][j]) * k;
        }
        if(j > k){
          nx[0][j][k] += dp[0][K][j] + sm[0][j][j] - dp[0][k][j];
          nx[1][j][k] += dp[1][K][j] + sm[1][j][j] - dp[1][k][j];
          nx[1][j][k] += (dp[0][K][j] + sm[0][j][j] - dp[0][k][j]) * k;
        }
      }
    }
    for(m=(0);m<(2);m++){
      int i;
      for(i=(0);i<(K+1);i++){
        for(j=(0);j<(K+1);j++){
          dp[m][i][j] = nx[m][i][j];
        }
      }
    }
  }
  for(i=(0);i<(K+1);i++){
    int j;
    for(j=(0);j<(K+1);j++){
      res1 += dp[0][i][j];
    }
  }
  for(i=(0);i<(K+1);i++){
    int j;
    for(j=(0);j<(K+1);j++){
      res2 += dp[1][i][j];
    }
  }
  wt_L(res1);
  wt_L(' ');
  wt_L(res2);
  wt_L('\n');
  return 0;
}
// cLay version 20210508-1 [beta]

// --- original code ---
// #define MD 998244353
// 
// int isKado(int x,int y,int z){
//   if(x==y||y==z||z==x) return 0;
//   if(x < y < z) return 0;
//   if(x > y > z) return 0;
//   return 1;
// }
// 
// Modint dp[2][201][201], sm[2][202][202], nx[2][201][201];
// 
// {
//   int @N, @K;
//   Modint res1 = 0, res2 = 0;
// 
//   dp[0][K][K] = 1;
//   rep(N){
//     rep(m,2) rep(i,K+1) rep(j,K+1) nx[m][i][j] = 0;
//     rep(m,2) rep(i,K+1) rep(j,K+1) sm[m][i+1][j] = sm[m][i][j] + dp[m][i][j];
//     rep(j,K+1) rep(k,K){
//       if(j==k) continue;
//       if(j==K){
//         nx[0][j][k] += dp[0][K][j];
//         nx[1][j][k] += dp[1][K][j];
//         nx[1][j][k] += dp[0][K][j] * k;
//         continue;
//       }
//       if(j < k){
//         nx[0][j][k] += sm[0][K+1][j] - sm[0][j+1][j] - dp[0][k][j];
//         nx[1][j][k] += sm[1][K+1][j] - sm[1][j+1][j] - dp[1][k][j];
//         nx[1][j][k] += (sm[0][K+1][j] - sm[0][j+1][j] - dp[0][k][j]) * k;
//       }
//       if(j > k){
//         nx[0][j][k] += dp[0][K][j] + sm[0][j][j] - dp[0][k][j];
//         nx[1][j][k] += dp[1][K][j] + sm[1][j][j] - dp[1][k][j];
//         nx[1][j][k] += (dp[0][K][j] + sm[0][j][j] - dp[0][k][j]) * k;
//       }
//     }
//     rep(m,2) rep(i,K+1) rep(j,K+1) dp[m][i][j] = nx[m][i][j];
//   }
//   rep(i,K+1) rep(j,K+1) res1 += dp[0][i][j];
//   rep(i,K+1) rep(j,K+1) res2 += dp[1][i][j];
//   wt(res1,res2);
// }
0