Problem p02662 (C++) — buggy submission, verdict: Time Limit Exceeded

#pragma GCC optimize("O3")

#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using LDOUBLE = long double;
using FLOAT = float;

#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)

#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)

#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)

#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)

#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))

static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }

#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)

static inline void inputStringSpSeparated(char *pcStr) {
  char *pcCur = pcStr;
  for (;;) {
    char c = getchar();
    if (('\\n' == c) || (EOF == c) || (' ' == c)) {
      break;
    }
    *pcCur = c;
    pcCur++;
  }
  *pcCur = '\\0';
}

static inline void inputString(char *pcStr) {
  char *pcCur = pcStr;
  for (;;) {
    char c = getchar();
    if (('\\n' == c) || (EOF == c)) {
      break;
    }
    *pcCur = c;
    pcCur++;
  }
  *pcCur = '\\0';
}

static inline SQWORD inputSQWORD(void) {
  SQWORD sqNumber = 0;
  SQWORD sqMultiplier = 1;
  bool bRead = false;
  for (;;) {
    char c = getchar();
    if (!bRead) {
      if ('-' == c) {
        sqMultiplier = -1;
      }
    }
    if (('0' <= c) && (c <= '9')) {
      sqNumber *= 10LL;
      sqNumber += (SQWORD)(c - '0');
      bRead = true;
    } else {
      if (bRead) {
        return sqNumber * sqMultiplier;
      }
    }
  }
}

static inline SDWORD inputSDWORD(void) {
  SDWORD lNumber = 0;
  SDWORD lMultiplier = 1;
  bool bRead = false;
  for (;;) {
    char c = getchar();
    if (!bRead) {
      if ('-' == c) {
        lMultiplier = -1;
      }
    }
    if (('0' <= c) && (c <= '9')) {
      lNumber *= 10;
      lNumber += (c - '0');
      bRead = true;
    } else {
      if (bRead) {
        return lNumber * lMultiplier;
      }
    }
  }
}

static inline DOUBLE inputFP(void) {
  DOUBLE dInt = 0.0;
  DOUBLE dFrac = 0.0;
  DOUBLE dMultiplier = 1.0;
  DWORD dwFpCnt = 0;
  DOUBLE *pdCur = &dInt;
  bool bRead = false;
  for (;;) {
    char c = getchar();
    if (!bRead) {
      if ('-' == c) {
        dMultiplier = -1;
      }
    }
    if ('.' == c) {
      pdCur = &dFrac;
    } else if (('0' <= c) && (c <= '9')) {
      (*pdCur) *= 10;
      (*pdCur) += (DOUBLE)(c - '0');
      bRead = true;
      if (pdCur == &dFrac) {
        dwFpCnt++;
      }
    } else {
      if (bRead) {
        return dMultiplier *
               (dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
      }
    }
  }
}

/*----------------------------------------------*/
/**
 *  mod による操作ライブラリ
 */
#define ANS_MOD (1000000007)

class MODINT {
  static SQWORD MOD;
  SQWORD m_x;

public:
  MODINT(SQWORD val) { m_x = (val % MOD + MOD) % MOD; };
  MODINT() { m_x = 0; }
  static void Init(SQWORD sqMod) { MOD = sqMod; }

  MODINT &operator+=(const MODINT a) {
    m_x = (m_x + a.m_x) % MOD;
    return *this;
  };
  MODINT &operator-=(const MODINT a) {
    m_x = (m_x - a.m_x + MOD) % MOD;
    return *this;
  };
  MODINT &operator*=(const MODINT a) {
    m_x = (m_x * a.m_x) % MOD;
    return *this;
  };
  MODINT pow(SQWORD t) const {
    if (!t)
      return 1;
    MODINT a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }
  MODINT operator+(const MODINT a) const {
    MODINT res(*this);
    return (res += a);
  }
  MODINT operator-(const MODINT a) const {
    MODINT res(*this);
    return (res -= a);
  }
  MODINT operator*(const MODINT a) const {
    MODINT res(*this);
    return (res *= a);
  }
  MODINT operator/(const MODINT a) const {
    MODINT res(*this);
    return (res /= a);
  }

  /* 逆元 */
  MODINT inv() const { return pow(MOD - 2); }

  /* 除算 */
  MODINT &operator/=(const MODINT a) { return (*this) *= a.inv(); }

  /* 整数版 */
  MODINT &operator+=(const SQWORD a) {
    *this += MODINT(a);
    return *this;
  };
  MODINT &operator-=(const SQWORD a) {
    *this -= MODINT(a);
    return *this;
  };
  MODINT &operator*=(const SQWORD a) {
    *this *= MODINT(a);
    return *this;
  };
  MODINT &operator/=(const SQWORD a) {
    *this /= MODINT(a);
    return *this;
  };

  SQWORD getVal() { return m_x; };
};
SQWORD MODINT::MOD = ANS_MOD;

/*----------------------------------------------*/

#define MAX_S (3000)
#define MAX_N (3000)

int main(void) {
  SQWORD sqN = inputSQWORD();
  SQWORD sqS = inputSQWORD();

  vector<SQWORD> vsqA;
  for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {
    SQWORD sqA = inputSQWORD();
    vsqA.emplace_back(sqA);
  }
  sort(vsqA.begin(), vsqA.end());

  vector<SQWORD> vsqSum;
  SQWORD sqSum = 0;
  vsqSum.emplace_back(sqSum);
  for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {
    sqSum += vsqA[sqIdx];
    vsqSum.emplace_back(sqSum);
  }

  /*
   *   dp[i][j](k)
   * A[k]までを考慮したとき、i個を使って合計をjにするような組み合わせの場合の数
   */
  const SDWORD lAnsMod = 998244353;
  MODINT::Init(lAnsMod);
  static SDWORD s_aalDp[MAX_N + 1][MAX_S + 1];
  s_aalDp[0][0] = 1;

  for (SQWORD sqIdxA = 0; sqIdxA < sqN; sqIdxA++) {
    SQWORD sqA = vsqA[sqIdxA];
    for (SQWORD sqCnt = sqIdxA; 0 <= sqCnt; sqCnt--) {
      for (SQWORD sqSum = vsqSum[sqCnt]; sqSum <= sqS - sqA; sqSum++) {
        //            for (SQWORD sqSum = 0; sqSum <= sqS - sqA; sqSum++) {

        s_aalDp[sqCnt + 1][sqSum + sqA] += s_aalDp[sqCnt][sqSum];
        if (lAnsMod <= s_aalDp[sqCnt + 1][sqSum + sqA]) {
          s_aalDp[sqCnt + 1][sqSum + sqA] -= lAnsMod;
        }
      }
    }
#if 0
        printf("----\\n");
        for (SQWORD sqDpIdx = 0; sqDpIdx <= sqN; sqDpIdx++) {
            for (SQWORD sqSum = 0; sqSum <= sqS; sqSum++) {
                printf("%lld ", s_aalDp[sqDpIdx][sqSum]);
            }
            printf("\\n");
        }
#endif
  }

#if 0
    for (SQWORD sqIdx = 0; sqIdx <= sqN; sqIdx++) {
        printf("%lld ", s_aamiDp[sqIdx][sqS]);
    } 
    printf("\\n");

#endif

  vector<SQWORD> vecPow2;
  SQWORD sqPow = 1;
  vecPow2.emplace_back(sqPow);
  for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {
    sqPow *= 2;
    sqPow %= lAnsMod;
    vecPow2.emplace_back(sqPow);
  }

  MODINT miAns(0);
  for (SQWORD sqNum = 0; sqNum <= sqN; sqNum++) {
    miAns += s_aalDp[sqNum][sqS] * vecPow2[sqN - sqNum];
  }

  printf("%lld\\n", miAns);

  return 0;
}


Error: TLE

Fixed submission:

#pragma GCC optimize("O3")

#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using LDOUBLE = long double;
using FLOAT = float;

#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)

#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)

#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)

#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)

#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))

static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }

#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)

static inline void inputStringSpSeparated(char *pcStr) {
  char *pcCur = pcStr;
  for (;;) {
    char c = getchar();
    if (('\\n' == c) || (EOF == c) || (' ' == c)) {
      break;
    }
    *pcCur = c;
    pcCur++;
  }
  *pcCur = '\\0';
}

static inline void inputString(char *pcStr) {
  char *pcCur = pcStr;
  for (;;) {
    char c = getchar();
    if (('\\n' == c) || (EOF == c)) {
      break;
    }
    *pcCur = c;
    pcCur++;
  }
  *pcCur = '\\0';
}

static inline SQWORD inputSQWORD(void) {
  SQWORD sqNumber = 0;
  SQWORD sqMultiplier = 1;
  bool bRead = false;
  for (;;) {
    char c = getchar();
    if (!bRead) {
      if ('-' == c) {
        sqMultiplier = -1;
      }
    }
    if (('0' <= c) && (c <= '9')) {
      sqNumber *= 10LL;
      sqNumber += (SQWORD)(c - '0');
      bRead = true;
    } else {
      if (bRead) {
        return sqNumber * sqMultiplier;
      }
    }
  }
}

static inline SDWORD inputSDWORD(void) {
  SDWORD lNumber = 0;
  SDWORD lMultiplier = 1;
  bool bRead = false;
  for (;;) {
    char c = getchar();
    if (!bRead) {
      if ('-' == c) {
        lMultiplier = -1;
      }
    }
    if (('0' <= c) && (c <= '9')) {
      lNumber *= 10;
      lNumber += (c - '0');
      bRead = true;
    } else {
      if (bRead) {
        return lNumber * lMultiplier;
      }
    }
  }
}

static inline DOUBLE inputFP(void) {
  DOUBLE dInt = 0.0;
  DOUBLE dFrac = 0.0;
  DOUBLE dMultiplier = 1.0;
  DWORD dwFpCnt = 0;
  DOUBLE *pdCur = &dInt;
  bool bRead = false;
  for (;;) {
    char c = getchar();
    if (!bRead) {
      if ('-' == c) {
        dMultiplier = -1;
      }
    }
    if ('.' == c) {
      pdCur = &dFrac;
    } else if (('0' <= c) && (c <= '9')) {
      (*pdCur) *= 10;
      (*pdCur) += (DOUBLE)(c - '0');
      bRead = true;
      if (pdCur == &dFrac) {
        dwFpCnt++;
      }
    } else {
      if (bRead) {
        return dMultiplier *
               (dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
      }
    }
  }
}

/*----------------------------------------------*/
/**
 *  mod による操作ライブラリ
 */
#define ANS_MOD (1000000007)

class MODINT {
  static SQWORD MOD;
  SQWORD m_x;

public:
  MODINT(SQWORD val) { m_x = (val % MOD + MOD) % MOD; };
  MODINT() { m_x = 0; }
  static void Init(SQWORD sqMod) { MOD = sqMod; }

  MODINT &operator+=(const MODINT a) {
    m_x = (m_x + a.m_x) % MOD;
    return *this;
  };
  MODINT &operator-=(const MODINT a) {
    m_x = (m_x - a.m_x + MOD) % MOD;
    return *this;
  };
  MODINT &operator*=(const MODINT a) {
    m_x = (m_x * a.m_x) % MOD;
    return *this;
  };
  MODINT pow(SQWORD t) const {
    if (!t)
      return 1;
    MODINT a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }
  MODINT operator+(const MODINT a) const {
    MODINT res(*this);
    return (res += a);
  }
  MODINT operator-(const MODINT a) const {
    MODINT res(*this);
    return (res -= a);
  }
  MODINT operator*(const MODINT a) const {
    MODINT res(*this);
    return (res *= a);
  }
  MODINT operator/(const MODINT a) const {
    MODINT res(*this);
    return (res /= a);
  }

  /* 逆元 */
  MODINT inv() const { return pow(MOD - 2); }

  /* 除算 */
  MODINT &operator/=(const MODINT a) { return (*this) *= a.inv(); }

  /* 整数版 */
  MODINT &operator+=(const SQWORD a) {
    *this += MODINT(a);
    return *this;
  };
  MODINT &operator-=(const SQWORD a) {
    *this -= MODINT(a);
    return *this;
  };
  MODINT &operator*=(const SQWORD a) {
    *this *= MODINT(a);
    return *this;
  };
  MODINT &operator/=(const SQWORD a) {
    *this /= MODINT(a);
    return *this;
  };

  SQWORD getVal() { return m_x; };
};
SQWORD MODINT::MOD = ANS_MOD;

/*----------------------------------------------*/

#define MAX_S (3000)
#define MAX_N (3000)

int main(void) {
  SDWORD lN = inputSQWORD();
  SDWORD lS = inputSQWORD();

  vector<SDWORD> vlA;
  for (SQWORD sqIdx = 0; sqIdx < lN; sqIdx++) {
    SDWORD lA = inputSQWORD();
    vlA.emplace_back(lA);
  }

  /*
   *   dp[i][j](k)
   * A[k]までを考慮したとき、i個を使って合計をjにするような組み合わせの場合の数
   */
#define ANS_MOD_L 998244353
  MODINT::Init(ANS_MOD_L);
  static SDWORD s_aalDp[MAX_N + 1][MAX_S + 1];
  s_aalDp[0][0] = 1;

  for (SQWORD sqIdxA = 0; sqIdxA < lN; sqIdxA++) {
    SDWORD lA = vlA[sqIdxA];
    for (SDWORD lCnt = sqIdxA; 0 <= lCnt; lCnt--) {
      for (SDWORD lSum = 0; lSum <= lS - lA; lSum++) {
        SDWORD lNext = s_aalDp[lCnt + 1][lSum + lA] + s_aalDp[lCnt][lSum];
        if (ANS_MOD_L <= lNext) {
          lNext -= ANS_MOD_L;
        }
        s_aalDp[lCnt + 1][lSum + lA] = lNext;
      }
    }
#if 0
        printf("----\\n");
        for (SQWORD sqDpIdx = 0; sqDpIdx <= sqN; sqDpIdx++) {
            for (SQWORD sqSum = 0; sqSum <= sqS; sqSum++) {
                printf("%lld ", s_aamiDp[sqDpIdx][sqSum]);
            }
            printf("\\n");
        }
#endif
  }

#if 0
    for (SQWORD sqIdx = 0; sqIdx <= sqN; sqIdx++) {
        printf("%lld ", s_aamiDp[sqIdx][sqS]);
    } 
    printf("\\n");

#endif

  vector<SQWORD> vecPow2;
  SQWORD sqPow = 1;
  vecPow2.emplace_back(sqPow);
  for (SQWORD sqIdx = 0; sqIdx < lN; sqIdx++) {
    sqPow *= 2;
    sqPow %= ANS_MOD_L;
    vecPow2.emplace_back(sqPow);
  }

  MODINT miAns(0);
  for (SQWORD sqNum = 0; sqNum <= lN; sqNum++) {
    miAns += s_aalDp[sqNum][lS] * vecPow2[lN - sqNum];
  }

  printf("%lld\\n", miAns);

  return 0;
}