Problem p02649 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cerr << '\\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
  cerr << arg << " ";
  Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
  out << "[";
  if (!v.empty()) {
    rep(i, 0, sz(v) - 1) out << v[i] << ", ";
    out << v.back();
  }
  out << "]";
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
  out << "(" << v.first << ", " << v.second << ")";
  return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

ll C[2010][2010];

void C_init(int n) {
  n++;
  rep(i, 0, n) C[i][0] = 1;
  rep(i, 1, n) {
    rep(j, 1, i + 1) { C[i][j] = C[i - 1][j] + C[i - 1][j - 1]; }
  }
}

vector<ll> moebius(vector<ll> f) { // inverse of the first zeta
  int n = sz(f);
  for (int i = 0; (1 << i) < n; i++) {
    rep(j, 0, n) if (!(j & (1 << i))) f[j] -= f[j | (1 << i)];
  }
  return f;
}

int N, K, S, T;
int A[110];

const int L = 18;
ll dp[(1 << L)];

void solve() {
  C_init(51);
  cin >> N >> K >> T >> S; // S-> or, T-> and
  if ((S & T) != T) {
    cout << 0 << "\\n";
    return;
  }
  int M = 0;
  rep(i, 0, N) {
    int a;
    cin >> a;
    if (((T & a) == T) && (S & a) == a)
      A[M++] = a;
  }
  N = M;
  rep(bit, 0, (1 << L)) { //(1が立っているところが0)
    rep(i, 0, N) {
      int cnt = 0;
      rep(j, i + 1, N) {
        if ((A[i] & bit) == (A[j] & bit))
          cnt++;
      }
      rep(j, 0, min(cnt, K - 1) + 1) { dp[bit] += C[cnt][j]; }
    }
  }
  // int rans = 0;
  // rep(i, 1, (1 << N)) {
  // 	int s = 0, t = (1 << L) - 1;
  // 	if(__builtin_popcount(i) > K) continue;
  // 	rep(j, 0, N) {
  // 		if(!(i & (1 << j))) continue;
  // 		s |= A[j];
  // 		t &= A[j];
  // 	}
  // 	if(s == S && t == T) rans++;
  // }
  auto ans = moebius(vl(dp, dp + (1 << L)));
  // debug(ans);
  cout << ans[((1 << L) - 1 - S) | T] << "\\n";
}

uint32_t rd() {
  uint32_t res;
#ifdef __MINGW32__
  asm volatile("rdrand %0" : "=a"(res)::"cc");
#else
  res = std::random_device()();
#endif
  return res;
}

int main() {
#ifndef LOCAL
  ios::sync_with_stdio(false);
  cin.tie(0);
#endif
  cout << fixed;
  cout.precision(20);
  cerr << fixed;
  cerr.precision(6);
  rng.seed(rd());
#ifdef LOCAL
  // freopen("in.txt", "wt", stdout); //for tester
  if (!freopen("in.txt", "rt", stdin))
    return 1;
#endif
  solve();
  cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\\n";
  return 0;
}


Error: 0
Time: 0.044300 s.


Fixed submission:

#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cerr << '\\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
  cerr << arg << " ";
  Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
  out << "[";
  if (!v.empty()) {
    rep(i, 0, sz(v) - 1) out << v[i] << ", ";
    out << v.back();
  }
  out << "]";
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
  out << "(" << v.first << ", " << v.second << ")";
  return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

ll C[2010][2010];

void C_init(int n) {
  n++;
  rep(i, 0, n) C[i][0] = 1;
  rep(i, 1, n) {
    rep(j, 1, i + 1) { C[i][j] = C[i - 1][j] + C[i - 1][j - 1]; }
  }
}

vector<ll> moebius(vector<ll> f) { // inverse of the first zeta
  int n = sz(f);
  for (int i = 0; (1 << i) < n; i++) {
    rep(j, 0, n) if (!(j & (1 << i))) f[j] -= f[j | (1 << i)];
  }
  return f;
}

int N, K, S, T;
int A[110];

const int L = 5;
ll dp[(1 << L)];

void solve() {
  C_init(51);
  cin >> N >> K >> T >> S; // S-> or, T-> and
  if ((S & T) != T) {
    cout << 0 << "\\n";
    return;
  }
  int M = 0;
  rep(i, 0, N) {
    int a;
    cin >> a;
    if (((T & a) == T) && (S & a) == a)
      A[M++] = a;
  }
  N = M;
  rep(bit, 0, (1 << L)) { //(1が立っているところが0)
    rep(i, 0, N) {
      int cnt = 0;
      rep(j, i + 1, N) {
        if ((A[i] & bit) == (A[j] & bit))
          cnt++;
      }
      rep(j, 0, min(cnt, K - 1) + 1) { dp[bit] += C[cnt][j]; }
    }
  }
  // int rans = 0;
  // rep(i, 1, (1 << N)) {
  // 	int s = 0, t = (1 << L) - 1;
  // 	if(__builtin_popcount(i) > K) continue;
  // 	rep(j, 0, N) {
  // 		if(!(i & (1 << j))) continue;
  // 		s |= A[j];
  // 		t &= A[j];
  // 	}
  // 	if(s == S && t == T) rans++;
  // }
  auto ans = moebius(vl(dp, dp + (1 << L)));
  // debug(ans);
  cout << ans[((1 << L) - 1 - S) | T] << "\\n";
}

uint32_t rd() {
  uint32_t res;
#ifdef __MINGW32__
  asm volatile("rdrand %0" : "=a"(res)::"cc");
#else
  res = std::random_device()();
#endif
  return res;
}

int main() {
#ifndef LOCAL
  ios::sync_with_stdio(false);
  cin.tie(0);
#endif
  cout << fixed;
  cout.precision(20);
  cerr << fixed;
  cerr.precision(6);
  rng.seed(rd());
#ifdef LOCAL
  // freopen("in.txt", "wt", stdout); //for tester
  if (!freopen("in.txt", "rt", stdin))
    return 1;
#endif
  solve();
  cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\\n";
  return 0;
}