提出 #3653889

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

#define FORE(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define REPU(i, a, b) for (int i = (a); i < (b); ++i)
#define REPD(i, a, b) for (int i = (a); i > (b); --i)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())

vector<string> split(const string &s, char c) {
	vector<string> v; stringstream ss(s); string x;
	while (getline(ss, x, c)) v.push_back(x);
	return v;
}
#define DEBUG(args...) { vector<string> _v = split(#args, ','); err(_v.begin(), args); }
void err(vector<string>::iterator it) {}
template<typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
	cerr << "[DEBUG] " << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << '\n';
	err(++it, args...);
}

typedef long long ll;
const int MOD = 1000000007;

template<class T, class U> inline T tmin(T a, U b) { return (a < b) ? a : b; }
template<class T, class U> inline T tmax(T a, U b) { return (a > b) ? a : b; }
template<class T, class U> inline void amax(T &a, U b) { if (b > a) a = b; }
template<class T, class U> inline void amin(T &a, U b) { if (b < a) a = b; }
template<class T> T gcd(T a, T b) { while (b != 0) { T c = a; a = b; b = c % b; } return a; }

const int N = 1005;
int a[N];
ll dp[N], b[N*N];

#define in(x) int x; cin >> x
#define ou(x) cout << x << endl

int main(int argc, char *argv[]) {
	ios_base::sync_with_stdio(false);

	in(n); in(k);

	dp[0] = 0;
	REPU(i, 0, n) {
		cin >> a[i];
		dp[i + 1] = dp[i] + a[i];
	}

	int idx = 0;
	REPU(i, 0, n) REPU(j, i, n) {
		b[idx++] = dp[j + 1] - dp[i];
	}
	ll ans = 0;
	REPD(j, 40, -1) {
		int cnt = 0;
		REPU(i, 0, idx) if (b[i] >> j & 1) {
			cnt++;
		}
		if (cnt >= k) {
			ans |= 1LL << j;
			int nidx = 0;
			REPU(i, 0, idx) if (b[i] >> j & 1) {
				b[nidx++] = b[i];
			}
			idx = nidx;
		}
	}
	ou(ans);

	return 0;
}

提出情報

ジャッジ結果