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

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
// adjust problem by problem
const double EPS = 1e-8;
const double PI = acos(-1.0);
#ifdef __GNUC__
int popcount(int n) { return __builtin_popcount(n); }
int popcount(ll n) { return __builtin_popcountll(n); }
#endif
#ifndef __GNUC__
template <class T> int popcount(T n) {
  int cnt = 0;
  while (n) {
    if (n % 2)
      cnt++;
    n /= 2;
  }
  return cnt;
}
#endif
template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T> T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++)
    res = (res * 10 + str[i] - '0');
  return res;
}
template <class T> T gcd(T a, T b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
bool EQ(double a, double b) { return abs(a - b) < EPS; }
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0)
        res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}

int N, C;
int how[31];
int beat[31];
int dp[2][1 << 16];
int cnts[1 << 16];

int main() {

  while (cin >> N >> C && (N | C)) {
    for (int i = 0; i < N; i++) {
      int mask = 0;
      for (int j = 0; j < 16; j++) {
        int a;
        cin >> a;
        mask |= (a << j);
      }
      beat[i] = mask;
    }
    for (int i = 0; i < C; i++) {
      int mask = 0;
      for (int j = 0; j < 16; j++) {
        int a;
        cin >> a;
        mask |= (a << j);
      }
      how[i] = mask;
    }
    int cur = 0;
    int nxt = 1;
    for (int mask = 0; mask < (1 << 16); mask++) {
      cnts[mask] = popcount(mask);
    }
    for (int pos = N; pos >= 0; pos--) {
      for (int mask = 0; mask < (1 << 16); mask++) {
        int res = 0;
        if (pos == N)
          res = 0;
        else {
          int cmask = mask | beat[pos];
          for (int i = 0; i < C; i++) {
            int tmp = cmask & how[i];
            res = max(res, dp[nxt][cmask ^ tmp] + cnts[tmp]);
          }
        }
        dp[cur][mask] = res;
      }
      swap(cur, nxt);
    }
    cout << dp[nxt][0] << endl;
  }

  return 0;
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
// adjust problem by problem
const double EPS = 1e-8;
const double PI = acos(-1.0);
#ifdef __GNUC__
int popcount(int n) { return __builtin_popcount(n); }
int popcount(ll n) { return __builtin_popcountll(n); }
#endif
#ifndef __GNUC__
template <class T> int popcount(T n) {
  int cnt = 0;
  while (n) {
    if (n % 2)
      cnt++;
    n /= 2;
  }
  return cnt;
}
#endif
template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T> T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++)
    res = (res * 10 + str[i] - '0');
  return res;
}
template <class T> T gcd(T a, T b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
bool EQ(double a, double b) { return abs(a - b) < EPS; }
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0)
        res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}

int N, C;
int how[31];
int beat[31];
int dp[2][1 << 16];

int main() {

  while (cin >> N >> C && (N | C)) {
    for (int i = 0; i < N; i++) {
      int mask = 0;
      for (int j = 0; j < 16; j++) {
        int a;
        cin >> a;
        mask |= (a << j);
      }
      beat[i] = mask;
    }
    for (int i = 0; i < C; i++) {
      int mask = 0;
      for (int j = 0; j < 16; j++) {
        int a;
        cin >> a;
        mask |= (a << j);
      }
      how[i] = mask;
    }
    int cur = 0;
    int nxt = 1;
    for (int pos = N; pos >= 0; pos--) {
      for (int mask = 0; mask < (1 << 16); mask++) {
        int res = 0;
        if (pos == N)
          res = 0;
        else {
          int cmask = mask | beat[pos];
          for (int i = 0; i < C; i++) {
            int tmp = cmask & how[i];
            res = max(res, dp[nxt][cmask ^ tmp] + popcount(tmp));
          }
        }
        dp[cur][mask] = res;
      }
      swap(cur, nxt);
    }
    cout << dp[nxt][0] << endl;
  }

  return 0;
}