#688967 (C++14) No.1645 AB's abs

提出ソース

結果

問題	No.1645 AB's abs
ユーザー	👑Zack Ni
提出日時	2021-08-13 21:45:31
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	8 ms / 2,000 ms
コード長	6,843 bytes
コンパイル時間	2,083 ms
コンパイル使用メモリ	176,292 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-04-14 17:25:35
合計ジャッジ時間	3,504 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	3 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	3 ms 6,948 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	4 ms 6,944 KB
testcase_09	AC	4 ms 6,940 KB
testcase_10	AC	4 ms 6,940 KB
testcase_11	AC	4 ms 6,940 KB
testcase_12	AC	4 ms 6,940 KB
testcase_13	AC	7 ms 6,940 KB
testcase_14	AC	7 ms 6,940 KB
testcase_15	AC	7 ms 6,940 KB
testcase_16	AC	7 ms 6,944 KB
testcase_17	AC	7 ms 6,940 KB
testcase_18	AC	7 ms 6,944 KB
testcase_19	AC	8 ms 6,944 KB
testcase_20	AC	6 ms 6,940 KB
testcase_21	AC	7 ms 6,940 KB
testcase_22	AC	7 ms 6,940 KB
testcase_23	AC	7 ms 6,940 KB
testcase_24	AC	7 ms 6,940 KB
testcase_25	AC	8 ms 6,944 KB
testcase_26	AC	7 ms 6,944 KB
testcase_27	AC	7 ms 6,944 KB
testcase_28	AC	8 ms 6,944 KB
testcase_29	AC	7 ms 6,940 KB
testcase_30	AC	7 ms 6,944 KB
testcase_31	AC	8 ms 6,940 KB
testcase_32	AC	8 ms 6,940 KB
testcase_33	AC	8 ms 6,940 KB
testcase_34	AC	7 ms 6,944 KB
testcase_35	AC	8 ms 6,944 KB
testcase_36	AC	7 ms 6,940 KB
testcase_37	AC	8 ms 6,944 KB
testcase_38	AC	7 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread(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();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar();
    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(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite(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(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('-');
  }
  while(s--){
    my_putchar(f[s]+'0');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
int A[110];
int N;
Modint dp[110*110*3];
Modint ndp[110*110*3];
const int lim = 110*110*3;
int mid ;
int main(){
  int i;
  mid = (110*110*3) >> 1;
  rd(N);
  {
    int PiIOrLma;
    for(PiIOrLma=(0);PiIOrLma<(N);PiIOrLma++){
      rd(A[PiIOrLma]);
    }
  }
  dp[mid] = 1;
  for(i=(0);i<(N);i++){
    int j;
    for(j=(0);j<(lim);j++){
      ndp[j] = 0;
    }
    for(j=(0);j<(lim);j++){
      if(dp[j] != 0){
        ndp[j+A[i]] += dp[j];
        ndp[j-A[i]] += dp[j];
      }
    }
    for(j=(0);j<(lim);j++){
      dp[j] = ndp[j];
    }
  }
  Modint res;
  res = 0;
  for(i=(0);i<(lim);i++){
    if(dp[i] == 0){
      continue;
    }
    res += Modint(abs(i-mid)) * dp[i];
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay version 20210405-1

// --- original code ---
// //no-unlocked
// #define MD 998244353
// int A[110], N;
// Modint dp[110*110*3];
// Modint ndp[110*110*3];
// const int lim = 110*110*3;
// int mid ;
// { 
//     mid = (110*110*3) >> 1;
//     rd(N, A(N));
//     dp[mid] = 1;
//     rep(i, N){
//         rep(j, lim) ndp[j] = 0;
//         rep(j, lim){
//             if(dp[j] != 0){
//                 ndp[j+A[i]] += dp[j];
//                 ndp[j-A[i]] += dp[j];
//             }
//         }
//         rep(j, lim) dp[j] = ndp[j];
//     }
//     Modint res;
//     res = 0;
//     rep(i, lim){
//         if(dp[i] == 0) continue;
//         res += Modint(abs(i-mid)) * dp[i];
//     }
//     wt(res);
// }

yukicoder

結果

テストケース

ソースコード