Problem p03215 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : (b))
#define all(v) (v).begin(), (v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x << " = " << (x) << endl
#define spair(p) cout << #p << ": " << p.fi << " " << p.se << endl
#define sar(a, n)                                                              \
  cout << #a << ":";                                                           \
  rep(pachico, n) cout << " " << a[pachico];                                   \
  cout << endl
#define svec(v)                                                                \
  cout << #v << ":";                                                           \
  rep(pachico, v.size()) cout << " " << v[pachico];                            \
  cout << endl
#define svecp(v)                                                               \
  cout << #v << ":";                                                           \
  each(pachico, v) cout << " {" << pachico.first << ":" << pachico.second      \
                        << "}";                                                \
  cout << endl
#define sset(s)                                                                \
  cout << #s << ":";                                                           \
  each(pachico, s) cout << " " << pachico;                                     \
  cout << endl
#define smap(m)                                                                \
  cout << #m << ":";                                                           \
  each(pachico, m) cout << " {" << pachico.first << ":" << pachico.second      \
                        << "}";                                                \
  cout << endl

using namespace std;

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 1000005;

bool ok[MAX_N], nok[MAX_N];

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, K;
  cin >> n >> K;
  vl a(n), sm(n);
  vl vec;
  rep(i, n) {
    cin >> a[i];
    sm[i + 1] = sm[i] + a[i];
  }
  rep(i, n) {
    srep(j, i + 1, n + 1) { vec.pb(sm[j] - sm[i]); }
  }
  rep(i, len(vec)) { ok[i] = true; }
  ll ans = 0;
  rrep(i, 60) {
    rep(j, len(vec)) { nok[j] = false; }
    int cnt = 0;
    rep(j, len(vec)) {
      if (ok[j]) {
        if ((vec[j] >> i) & 1LL) {
          cnt++;
          nok[j] = true;
        }
      }
    }
    if (cnt >= K) {
      // show(i);
      rep(j, len(vec)) { ok[j] = nok[j]; }
      ans += (1LL << i);
    }
  }
  cout << ans << "\n";
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : (b))
#define all(v) (v).begin(), (v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x << " = " << (x) << endl
#define spair(p) cout << #p << ": " << p.fi << " " << p.se << endl
#define sar(a, n)                                                              \
  cout << #a << ":";                                                           \
  rep(pachico, n) cout << " " << a[pachico];                                   \
  cout << endl
#define svec(v)                                                                \
  cout << #v << ":";                                                           \
  rep(pachico, v.size()) cout << " " << v[pachico];                            \
  cout << endl
#define svecp(v)                                                               \
  cout << #v << ":";                                                           \
  each(pachico, v) cout << " {" << pachico.first << ":" << pachico.second      \
                        << "}";                                                \
  cout << endl
#define sset(s)                                                                \
  cout << #s << ":";                                                           \
  each(pachico, s) cout << " " << pachico;                                     \
  cout << endl
#define smap(m)                                                                \
  cout << #m << ":";                                                           \
  each(pachico, m) cout << " {" << pachico.first << ":" << pachico.second      \
                        << "}";                                                \
  cout << endl

using namespace std;

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 1000005;

bool ok[MAX_N], nok[MAX_N];

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, K;
  cin >> n >> K;
  vl a(n), sm(n + 1);
  vl vec;
  rep(i, n) {
    cin >> a[i];
    sm[i + 1] = sm[i] + a[i];
  }
  rep(i, n) {
    srep(j, i + 1, n + 1) { vec.pb(sm[j] - sm[i]); }
  }
  rep(i, len(vec)) { ok[i] = true; }
  ll ans = 0;
  rrep(i, 60) {
    rep(j, len(vec)) { nok[j] = false; }
    int cnt = 0;
    rep(j, len(vec)) {
      if (ok[j]) {
        if ((vec[j] >> i) & 1LL) {
          cnt++;
          nok[j] = true;
        }
      }
    }
    if (cnt >= K) {
      // show(i);
      rep(j, len(vec)) { ok[j] = nok[j]; }
      ans += (1LL << i);
    }
  }
  cout << ans << "\n";
  return 0;
}