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

const int LG = 21;
const int FN = 1 << 20;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

#define forn(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x)                                                                \\
  sort(all(x));                                                                \\
  (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Yes[2] = {"No", "Yes"};
string YES[2] = {"NO", "YES"};

ll inq(ll x, ll y) {
  if (!y)
    re 1 % MOD;
  ll l = inq(x, y / 2);
  if (y % 2)
    re l *l % MOD *x % MOD;
  re l *l % MOD;
}

ll rev(ll x) { return inq(x, MOD - 2); }

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics() {
  __precomputed_combinatorics = 1;
  __fact.resize(FN);
  __ufact.resize(FN);
  __rev.resize(FN);
  __rev[1] = 1;
  for (int i = 2; i < FN; i++)
    __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
  __fact[0] = 1, __ufact[0] = 1;
  for (int i = 1; i < FN; i++)
    __fact[i] = __fact[i - 1] * i % MOD,
    __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x) {
  if (!__precomputed_combinatorics)
    __precompute_combinatorics();
  return __fact[x];
}

ll cnk(int n, int k) {
  if (k < 0 || k > n)
    return 0;
  if (!__precomputed_combinatorics)
    __precompute_combinatorics();
  return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

int Root(int x, vector<int> &root) {
  if (x == root[x])
    return x;
  return root[x] = Root(root[x], root);
}

void Merge(int v, int u, vector<int> &root, vector<int> &sz) {
  v = Root(v, root), u = Root(u, root);
  if (v == u)
    return;
  if (sz[v] < sz[u]) {
    sz[u] += sz[v];
    root[v] = u;
  } else {
    sz[v] += sz[u];
    root[u] = v;
  }
}

int ok(int x, int n) { return 0 <= x && x < n; }

void bfs(int v, vi &dist, vector<vi> &graph) {
  fill(all(dist), -1);
  dist[v] = 0;
  vi q = {v};
  for (int i = 0; i < q.size(); i++) {
    for (auto u : graph[q[i]]) {
      if (dist[u] == -1) {
        dist[u] = dist[q[i]] + 1;
        q.push_back(u);
      }
    }
  }
}

vector<int> z_func(string &s) {
  vector<int> z(s.size());
  z[0] = s.size();
  int L = 0, R = 0;
  for (int i = 1; i < s.size(); i++) {
    z[i] = max(0, min(z[i - L], R - i));
    while (i + z[i] < s.size() && s[i + z[i]] == s[z[i]])
      z[i]++;
    if (i + z[i] > R) {
      R = i + z[i];
      L = i;
    }
  }
  return z;
}

vector<int> p_func(string &s) {
  vector<int> p(s.size());
  for (int i = 1; i < s.size(); i++) {
    int j = p[i - 1];
    while (j > 0 && s[i] != s[j])
      j = p[j - 1];
    if (s[i] == s[j])
      j++;
    p[i] = j;
  }
  return p;
}

vector<int> d1_func(string &s) {
  vector<int> d1(s.size());
  int L = 0, R = -1;
  for (int i = 0; i < s.size(); i++) {
    int k = 0;
    if (i <= R)
      k = min(R - i + 1, d1[R - i + L]);
    while (i + k < s.size() && i - k >= 0 && s[i - k] == s[i + k])
      k++;
    d1[i] = k--;
    if (i + k > R) {
      L = i - k;
      R = i + k;
    }
  }
  return d1;
}

vector<int> d2_func(string &s) {
  vector<int> d2(s.size());
  int L = 0, R = -1;
  for (int i = 1; i < s.size(); i++) {
    int k = 0;
    if (i <= R)
      k = min(R - i + 1, d2[R - i + L + 1]);
    while (i + k < s.size() && i - k - 1 >= 0 && s[i - k - 1] == s[i + k])
      k++;
    d2[i] = k--;
    if (i + k > R) {
      L = i - k - 1;
      R = i + k;
    }
  }
  return d2;
}

ll log10(ll x) {
  if (x < 10)
    re 1;
  re 1 + log10(x / 10);
}

ll ds(ll x) {
  if (x < 10)
    return x;
  re x % 10 + ds(x / 10);
}

double sqr(double x) { return x * x; }

bool in(int x, int y) { return ((x & y) == x); }

int read_bits(int x, int num) {
  int y = 0;
  for (int i = 0; i < 18; i++) {
    if (num & (1 << i)) {
      if (x & (1 << i))
        y = 2 * y + 1;
      else
        y = 2 * y;
    }
  }
  return y;
}

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, k, s, t;
  cin >> n >> k >> s >> t;
  if (!in(s, t)) {
    cout << 0;
    return 0;
  }
  vector<int> a;
  forn(i, n) {
    int x;
    cin >> x;
    if (!in(x, t))
      continue;
    if (!in(s, x))
      continue;
    a.push_back(x);
  }
  n = a.size();
  t -= s;
  for (int i = 0; i < n; i++) {
    a[i] -= s;
    a[i] = read_bits(a[i], t);
  }
  t = read_bits(t, t);
  int x = t + 1;
  assert((x & (x - 1)) == 0);
  ll ans = 0;

  vector<vll> cnk(60, vector<ll>(60));
  for (int i = 0; i < 60; i++) {
    cnk[i][0] = cnk[i][i] = 1;
    for (int j = 1; j < i; j++)
      cnk[i][j] = cnk[i - 1][j] + cnk[i - 1][j - 1];
  }
  for (int u = 0; u < x; u++) {
    map<int, int> A;
    for (int i = 0; i < n; i++) {
      A[a[i] & u]++;
    }
    int s = popcount(u) % 2 ? -1 : 1;
    ll f = 0;
    for (auto x : A) {
      for (int j = 1; j <= min(k, x.second); j++)
        f += cnk[x.second][j];
    }
    ans = ans + s * f;
  }
  cout << ans;
}

/* Note:
Check constants at the beginning of the code.
    N is set to 4e5 but be careful in problems with large constant factor.
    Setting N in every problem is more effective.
Check corner cases.
    N = 1
No def int long long for now.
Add something here.
*/


Error: TLE

Fixed submission:

const int LG = 21;
const int FN = 1 << 20;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

#define forn(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x)                                                                \\
  sort(all(x));                                                                \\
  (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Yes[2] = {"No", "Yes"};
string YES[2] = {"NO", "YES"};

ll inq(ll x, ll y) {
  if (!y)
    re 1 % MOD;
  ll l = inq(x, y / 2);
  if (y % 2)
    re l *l % MOD *x % MOD;
  re l *l % MOD;
}

ll rev(ll x) { return inq(x, MOD - 2); }

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics() {
  __precomputed_combinatorics = 1;
  __fact.resize(FN);
  __ufact.resize(FN);
  __rev.resize(FN);
  __rev[1] = 1;
  for (int i = 2; i < FN; i++)
    __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
  __fact[0] = 1, __ufact[0] = 1;
  for (int i = 1; i < FN; i++)
    __fact[i] = __fact[i - 1] * i % MOD,
    __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x) {
  if (!__precomputed_combinatorics)
    __precompute_combinatorics();
  return __fact[x];
}

ll cnk(int n, int k) {
  if (k < 0 || k > n)
    return 0;
  if (!__precomputed_combinatorics)
    __precompute_combinatorics();
  return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

int Root(int x, vector<int> &root) {
  if (x == root[x])
    return x;
  return root[x] = Root(root[x], root);
}

void Merge(int v, int u, vector<int> &root, vector<int> &sz) {
  v = Root(v, root), u = Root(u, root);
  if (v == u)
    return;
  if (sz[v] < sz[u]) {
    sz[u] += sz[v];
    root[v] = u;
  } else {
    sz[v] += sz[u];
    root[u] = v;
  }
}

int ok(int x, int n) { return 0 <= x && x < n; }

void bfs(int v, vi &dist, vector<vi> &graph) {
  fill(all(dist), -1);
  dist[v] = 0;
  vi q = {v};
  for (int i = 0; i < q.size(); i++) {
    for (auto u : graph[q[i]]) {
      if (dist[u] == -1) {
        dist[u] = dist[q[i]] + 1;
        q.push_back(u);
      }
    }
  }
}

vector<int> z_func(string &s) {
  vector<int> z(s.size());
  z[0] = s.size();
  int L = 0, R = 0;
  for (int i = 1; i < s.size(); i++) {
    z[i] = max(0, min(z[i - L], R - i));
    while (i + z[i] < s.size() && s[i + z[i]] == s[z[i]])
      z[i]++;
    if (i + z[i] > R) {
      R = i + z[i];
      L = i;
    }
  }
  return z;
}

vector<int> p_func(string &s) {
  vector<int> p(s.size());
  for (int i = 1; i < s.size(); i++) {
    int j = p[i - 1];
    while (j > 0 && s[i] != s[j])
      j = p[j - 1];
    if (s[i] == s[j])
      j++;
    p[i] = j;
  }
  return p;
}

vector<int> d1_func(string &s) {
  vector<int> d1(s.size());
  int L = 0, R = -1;
  for (int i = 0; i < s.size(); i++) {
    int k = 0;
    if (i <= R)
      k = min(R - i + 1, d1[R - i + L]);
    while (i + k < s.size() && i - k >= 0 && s[i - k] == s[i + k])
      k++;
    d1[i] = k--;
    if (i + k > R) {
      L = i - k;
      R = i + k;
    }
  }
  return d1;
}

vector<int> d2_func(string &s) {
  vector<int> d2(s.size());
  int L = 0, R = -1;
  for (int i = 1; i < s.size(); i++) {
    int k = 0;
    if (i <= R)
      k = min(R - i + 1, d2[R - i + L + 1]);
    while (i + k < s.size() && i - k - 1 >= 0 && s[i - k - 1] == s[i + k])
      k++;
    d2[i] = k--;
    if (i + k > R) {
      L = i - k - 1;
      R = i + k;
    }
  }
  return d2;
}

ll log10(ll x) {
  if (x < 10)
    re 1;
  re 1 + log10(x / 10);
}

ll ds(ll x) {
  if (x < 10)
    return x;
  re x % 10 + ds(x / 10);
}

double sqr(double x) { return x * x; }

bool in(int x, int y) { return ((x & y) == x); }

int read_bits(int x, int num) {
  int y = 0;
  for (int i = 0; i < 18; i++) {
    if (num & (1 << i)) {
      if (x & (1 << i))
        y = 2 * y + 1;
      else
        y = 2 * y;
    }
  }
  return y;
}

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, k, s, t;
  cin >> n >> k >> s >> t;
  if (!in(s, t)) {
    cout << 0;
    return 0;
  }
  vector<int> a;
  forn(i, n) {
    int x;
    cin >> x;
    if (!in(x, t))
      continue;
    if (!in(s, x))
      continue;
    a.push_back(x);
  }
  n = a.size();
  t -= s;
  for (int i = 0; i < n; i++) {
    a[i] -= s;
    a[i] = read_bits(a[i], t);
  }
  t = read_bits(t, t);
  int x = t + 1;
  assert((x & (x - 1)) == 0);
  map<int, map<int, map<int, ll>>> dp;
  dp[0][t][0] = 1;
  for (int i = 0; i < n; i++) {
    map<int, map<int, map<int, ll>>> dp2 = dp;
    for (auto mask : dp) {
      for (auto mask2 : mask.second) {
        for (auto sel : mask2.second) {
          dp2[mask.first | a[i]][mask2.first & a[i]][sel.first + 1] +=
              sel.second;
        }
      }
    }
    swap(dp, dp2);
  }
  ll ans = 0;
  for (int sel = 1; sel <= k; sel++)
    ans += dp[t][0][sel];
  cout << ans;
  return 0;
}

/* Note:
Check constants at the beginning of the code.
    N is set to 4e5 but be careful in problems with large constant factor.
    Setting N in every problem is more effective.
Check corner cases.
    N = 1
No def int long long for now.
Add something here.
*/