Problem p02695 (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 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;

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

void printVector(vector<SQWORD> vec) {
  for (auto m : vec) {
    printf("%lld ", m);
  }
  printf("\\n");
}

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

struct stRequrement {
  SQWORD sqA;
  SQWORD sqB;
  SQWORD sqC;
  SQWORD sqD;

  stRequrement(SQWORD a, SQWORD b, SQWORD c, SQWORD d)
      : sqA(a), sqB(b), sqC(c), sqD(d){};
};

bool operator<(const stRequrement &a, const stRequrement &b) {
  return a.sqA < b.sqA;
}

static SQWORD s_sqMaxScore = 0;

static void testMaxScore(vector<SQWORD> &vsqA,
                         const vector<stRequrement> &vstReq) {
  SQWORD sqScore = 0;
  for (auto r : vstReq) {
    SQWORD sqIdxA = r.sqA - 1;
    SQWORD sqIdxB = r.sqB - 1;
    if (vsqA[sqIdxB] - vsqA[sqIdxA] == r.sqC) {
      sqScore += r.sqD;
    }
  }

  s_sqMaxScore = max(s_sqMaxScore, sqScore);
}

static void getPermutation(vector<SQWORD> &vsqA,
                           const vector<stRequrement> &vstReq, SQWORD sqIdxPrev,
                           SQWORD sqN, SQWORD sqM) {
  SQWORD sqPrevA = 0;
  if (sqIdxPrev == -1) {
    sqPrevA = 1;
  } else {
    sqPrevA = vsqA[sqIdxPrev];
  }
  for (SQWORD sqCurA = sqPrevA; sqCurA <= sqM; sqCurA++) {
    vsqA[sqIdxPrev + 1] = sqCurA;
    if (sqN - 1 <= sqIdxPrev + 1) {
      testMaxScore(vsqA, vstReq);
    } else {
      getPermutation(vsqA, vstReq, sqIdxPrev + 1, sqN, sqM);
    }
  }
}

int main(void) {
  SQWORD sqN = inputSQWORD();
  SQWORD sqM = inputSQWORD();
  SQWORD sqQ = inputSQWORD();

  vector<stRequrement> vstReqs;
  for (SQWORD sqQueryIdx = 0; sqQueryIdx < sqQ; sqQueryIdx++) {
    SQWORD sqA = inputSQWORD();
    SQWORD sqB = inputSQWORD();
    SQWORD sqC = inputSQWORD();
    SQWORD sqD = inputSQWORD();
    vstReqs.emplace_back(sqA, sqB, sqC, sqD);
  }
  sort(vstReqs.begin(), vstReqs.end());

  vector<SQWORD> vsqA(sqN, -1);
  getPermutation(vsqA, vstReqs, -1, sqN, sqM);

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

  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 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;

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

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

struct stRequrement {
  SQWORD sqA;
  SQWORD sqB;
  SQWORD sqC;
  SQWORD sqD;

  stRequrement(SQWORD a, SQWORD b, SQWORD c, SQWORD d)
      : sqA(a), sqB(b), sqC(c), sqD(d){};
};

bool operator<(const stRequrement &a, const stRequrement &b) {
  return a.sqA < b.sqA;
}

SQWORD getPnts(vector<stRequrement> &vstReqs, SQWORD sqBitMap, SQWORD sqN,
               SQWORD sqM) {
  vector<SQWORD> vsqNums(sqN, -1);

  vsqNums[0] = 1;
  SQWORD sqCurIdx = 0;
  SQWORD sqPnt = 0;
  for (SQWORD sqReqIdx = 0; sqReqIdx < vstReqs.size(); ++sqReqIdx) {
    if (sqBitMap & (0x1 << sqReqIdx)) {
      auto &r = vstReqs[sqReqIdx];
      SQWORD sqIdxA = r.sqA - 1; /* 0-indexed */
      SQWORD sqIdxB = r.sqB - 1; /* 0-indexed */

      while (sqCurIdx < sqIdxA) {
        if (vsqNums[sqCurIdx + 1] == -1) {
          vsqNums[sqCurIdx + 1] = vsqNums[sqCurIdx];
        } else {
          if (vsqNums[sqCurIdx + 1] < vsqNums[sqCurIdx]) {
            /* Impossible */
            return 0;
          }
        }
        sqCurIdx++;
      }

      if (vsqNums[sqIdxB] != -1) {
        if (vsqNums[sqIdxB] != vsqNums[sqIdxA] + r.sqC) {
          /* Impossible */
          return 0;
        }
      }
      vsqNums[sqIdxB] = vsqNums[sqIdxA] + r.sqC;
      sqPnt += r.sqD;
    }
  }

  while (sqCurIdx < sqN - 1) {
    if (vsqNums[sqCurIdx + 1] == -1) {
      vsqNums[sqCurIdx + 1] = vsqNums[sqCurIdx];
    } else {
      if (vsqNums[sqCurIdx + 1] < vsqNums[sqCurIdx]) {
        /* Impossible */
        return 0;
      }
    }
    sqCurIdx++;
  }

  if (sqM < vsqNums[sqN - 1]) {
    return 0;
  }
  return sqPnt;
}

int main(void) {
  SQWORD sqN = inputSQWORD();
  SQWORD sqM = inputSQWORD();
  SQWORD sqQ = inputSQWORD();

  vector<stRequrement> vstReqs;
  for (SQWORD sqQueryIdx = 0; sqQueryIdx < sqQ; sqQueryIdx++) {
    SQWORD sqA = inputSQWORD();
    SQWORD sqB = inputSQWORD();
    SQWORD sqC = inputSQWORD();
    SQWORD sqD = inputSQWORD();
    vstReqs.emplace_back(sqA, sqB, sqC, sqD);
  }
  sort(vstReqs.begin(), vstReqs.end());

  SQWORD sqMaxPtn = ((SQWORD)1 << sqQ) - 1;
  SQWORD sqAns = 0;
  for (SQWORD sqBitMap = 0; sqBitMap <= sqMaxPtn; sqBitMap++) {
    SQWORD sqPnt = getPnts(vstReqs, sqBitMap, sqN, sqM);
    sqAns = max(sqPnt, sqAns);
  }
  printf("%lld\\n", sqAns);

  return 0;
}