problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03138 | #include <cstdio>
#include <iostream>
#define N 100005
using namespace std;
typedef long long ll;
ll n, k, s, x, c, a[N];
bool v;
int main() {
ll i, j;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (i = 40; i >= 0; i--) {
x <<= 1;
if (!((k >> i) & 1) && !v)
continue;
c = 0;
for (j = 0; j < n; j++)
c += (a[i] >> i) & 1;
if (c < n / 2)
x++;
else
v = 1;
}
for (i = 0; i < n; i++)
s += a[i] ^ x;
cout << s << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#define N 100005
using namespace std;
typedef long long ll;
ll n, k, s, x, c, a[N];
bool v;
int main() {
ll i, j;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (i = 40; i >= 0; i--) {
x <<= 1;
if (!((k >> i) & 1) && !v)
continue;
c = 0;
for (j = 0; j < n; j++)
c += (a[j] >> i) & 1;
if (c < (n + 1) / 2)
x++;
else
v = 1;
}
for (i = 0; i < n; i++)
s += a[i] ^ x;
cout << s << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 938,926 | 938,927 | u230265105 | cpp |
p03138 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, x, c, ans, a[100005];
ll f(ll p) {
ll re = 0;
for (ll i = 0; i < n; i++) {
re += (a[i] >> p & 1);
}
return re;
}
int main() {
ll i;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (i = 40; i >= 0; i--) {
if (x + 1LL << i <= k) {
c = f(i);
if (2 * c < n)
x += 1LL << i;
}
}
for (i = 0; i < n; i++)
ans += a[i] ^ x;
cout << ans;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, x, c, ans, a[100005];
ll f(ll p) {
ll re = 0;
for (ll i = 0; i < n; i++) {
re += (a[i] >> p & 1);
}
return re;
}
int main() {
ll i;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (i = 40; i >= 0; i--) {
if (x + (1LL << i) <= k) {
c = f(i);
if (2 * c < n)
x += 1LL << i;
}
}
for (i = 0; i < n; i++)
ans += a[i] ^ x;
cout << ans;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 938,928 | 938,929 | u093170535 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200001];
int cnt[101];
int dp[101];
int n, k;
int dfs(int x, int up, int sum) {
if (x == -1)
return sum;
if (dp[x] && up == 0)
return dp[x];
int ans = 0;
if (up && ((k & (1ll << x)) == 0))
ans = dfs(x - 1, 1, sum + (1ll << x) * cnt[x]);
else if (up)
ans = max(dfs(x - 1, 0, sum + (1ll << x) * cnt[x]),
dfs(x - 1, 1, sum + (1ll << x) * (n - cnt[x])));
else
ans = max(dfs(x - 1, 0, sum + (1ll << x) * cnt[x]),
dfs(x - 1, 0, sum + (1ll << x) * (n - cnt[x])));
if (up == 0)
dp[x] = ans - sum;
return ans;
}
signed main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
int ans, cur = 0;
for (int j = 50; j >= 0; j--) {
int tot = 0;
for (int i = 1; i <= n; i++)
if (a[i] & (1ll << j))
cnt[j]++;
}
printf("%lld", dfs(50, 1, 0));
return 0;
}
/*
3 1
1 6 3
*/ | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200001];
int cnt[101];
int dp[101];
int n, k;
int dfs(int x, int up, int sum) {
if (x == -1)
return sum;
if (dp[x] && up == 0)
return dp[x] + sum;
int ans = 0;
if (up && ((k & (1ll << x)) == 0))
ans = dfs(x - 1, 1, sum + (1ll << x) * cnt[x]);
else if (up)
ans = max(dfs(x - 1, 0, sum + (1ll << x) * cnt[x]),
dfs(x - 1, 1, sum + (1ll << x) * (n - cnt[x])));
else
ans = max(dfs(x - 1, 0, sum + (1ll << x) * cnt[x]),
dfs(x - 1, 0, sum + (1ll << x) * (n - cnt[x])));
if (up == 0)
dp[x] = ans - sum;
return ans;
}
signed main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
int ans, cur = 0;
for (int j = 50; j >= 0; j--) {
int tot = 0;
for (int i = 1; i <= n; i++)
if (a[i] & (1ll << j))
cnt[j]++;
}
printf("%lld", dfs(50, 1, 0));
return 0;
}
/*
3 1
1 6 3
*/ | [
"expression.operation.binary.add"
] | 938,936 | 938,937 | u413057858 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200001];
int cnt[101];
int dp[101];
int n, k;
int dfs(int x, int up, int sum) {
if (x == -1)
return sum;
if (dp[x] && up == 0)
return dp[x];
int ans = 0;
if (up && ((k & (1ll << x)) == 0))
ans = dfs(x - 1, 1, sum + (1ll << x) * cnt[x]);
else if (up)
ans = max(dfs(x - 1, 0, sum + (1ll << x) * cnt[x]),
dfs(x - 1, 1, sum + (1ll << x) * (n - cnt[x])));
else
ans = max(dfs(x - 1, 0, sum + (1ll << x) * cnt[x]),
dfs(x - 1, 0, sum + (1ll << x) * (n - cnt[x])));
if (up == 0)
dp[x] = ans;
return ans;
}
signed main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
int ans, cur = 0;
for (int j = 50; j >= 0; j--) {
int tot = 0;
for (int i = 1; i <= n; i++)
if (a[i] & (1ll << j))
cnt[j]++;
}
printf("%lld", dfs(50, 1, 0));
return 0;
}
/*
3 1
1 6 3
*/ | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200001];
int cnt[101];
int dp[101];
int n, k;
int dfs(int x, int up, int sum) {
if (x == -1)
return sum;
if (dp[x] && up == 0)
return dp[x] + sum;
int ans = 0;
if (up && ((k & (1ll << x)) == 0))
ans = dfs(x - 1, 1, sum + (1ll << x) * cnt[x]);
else if (up)
ans = max(dfs(x - 1, 0, sum + (1ll << x) * cnt[x]),
dfs(x - 1, 1, sum + (1ll << x) * (n - cnt[x])));
else
ans = max(dfs(x - 1, 0, sum + (1ll << x) * cnt[x]),
dfs(x - 1, 0, sum + (1ll << x) * (n - cnt[x])));
if (up == 0)
dp[x] = ans - sum;
return ans;
}
signed main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
int ans, cur = 0;
for (int j = 50; j >= 0; j--) {
int tot = 0;
for (int i = 1; i <= n; i++)
if (a[i] & (1ll << j))
cnt[j]++;
}
printf("%lld", dfs(50, 1, 0));
return 0;
}
/*
3 1
1 6 3
*/ | [
"assignment.change"
] | 938,938 | 938,937 | u413057858 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
// C++14 (GCC 5.4.1)
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (int i = (a); i >= (b); i--)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline T divrup(T a, T b) {
if (a % b)
return a / b + 1;
else
return a / b;
}
#define dbg_v1(i, V) \
do { \
cout << "-v1----\n"; \
rep(i, V.size()) cout << " " << i << "\t:" << V[i] << endl; \
cout << endl; \
} while (0)
#define dbg_v2(i, k, V) \
do { \
cout << "-v2----\n"; \
rep(i, V.size()) { \
rep(k, V[0].size()) cout << " " << V[i][k]; \
cout << endl; \
} \
} while (0)
int main() {
ios::sync_with_stdio(false); // stdoutとcoutの同期解除
cin.tie(nullptr); // cinとcoutの同期解除
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
//-----------------------------------
ll x = 0, ans = 0;
int st = (K == 0) ? -1 : log2(K) + 1;
for (int i = st; i >= 0; i--) {
ll xi = 1 << i;
if (x | xi > K)
continue;
int cnto = 0;
rep(i, N) if (A[i] & xi) cnto++;
if (cnto < N - cnto)
x |= xi;
}
rep(i, N) ans += A[i] ^ x;
cout << ans << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
// C++14 (GCC 5.4.1)
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (int i = (a); i >= (b); i--)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline T divrup(T a, T b) {
if (a % b)
return a / b + 1;
else
return a / b;
}
#define dbg_v1(i, V) \
do { \
cout << "-v1----\n"; \
rep(i, V.size()) cout << " " << i << "\t:" << V[i] << endl; \
cout << endl; \
} while (0)
#define dbg_v2(i, k, V) \
do { \
cout << "-v2----\n"; \
rep(i, V.size()) { \
rep(k, V[0].size()) cout << " " << V[i][k]; \
cout << endl; \
} \
} while (0)
int main() {
ios::sync_with_stdio(false); // stdoutとcoutの同期解除
cin.tie(nullptr); // cinとcoutの同期解除
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
//-----------------------------------
ll x = 0, ans = 0;
int st = (K == 0) ? -1 : log2(K) + 1;
for (int i = st; i >= 0; i--) {
ll xi = 1LL << i;
if ((x | xi) > K)
continue;
int cnto = 0;
rep(i, N) if (A[i] & xi) cnto++;
if (cnto < N - cnto)
x |= xi;
}
rep(i, N) ans += A[i] ^ x;
cout << ans << endl;
return (0);
} | [
"literal.number.type.widen.change",
"control_flow.branch.if.condition.change"
] | 938,939 | 938,940 | u216459554 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int get_rank(long long n) {
int rank = 1;
while (n >= 2) {
n /= 2;
rank++;
}
return rank;
}
int main() {
int N;
long long K;
cin >> N >> K;
int rank_k = get_rank(K);
vector<int> rank_counts(rank_k);
vector<long long> A(N);
for (auto &a : A) {
cin >> a;
long long b = a;
for (int j = 0; j < rank_k; j++) {
if (b % 2 == 0) {
rank_counts.at(j)++;
}
b /= 2;
}
}
long long x = 0;
for (int i = rank_k - 1; i >= 0; i--) {
long long y = 1 << i;
if (rank_counts.at(i) > N / 2 and x + y <= K) {
x += y;
}
}
long long ans;
for (auto a : A) {
ans += x ^ a;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int get_rank(long long n) {
int rank = 1;
while (n >= 2) {
n /= 2;
rank++;
}
return rank;
}
int main() {
int N;
long long K;
cin >> N >> K;
int rank_k = get_rank(K);
vector<int> rank_counts(rank_k);
vector<long long> A(N);
for (auto &a : A) {
cin >> a;
long long b = a;
for (int j = 0; j < rank_k; j++) {
if (b % 2 == 0) {
rank_counts.at(j)++;
}
b /= 2;
}
}
long long x = 0;
for (int i = rank_k - 1; i >= 0; i--) {
long long y = 1LL << i;
if (rank_counts.at(i) > N / 2 and x + y <= K) {
x += y;
}
}
long long ans = 0;
for (auto a : A) {
ans += x ^ a;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.type.widen.change",
"variable_declaration.value.change"
] | 938,945 | 938,944 | u942915776 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
ll __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Printv(v) \
{ \
REP(x, v.size()) { cout << v[x] << (x == v.size() - 1 ? "\n" : " "); } \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<double> VD;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define PI 3.141592653589793238
signed main() {
LCIN(N, K);
VL A(N);
VECCIN(A);
ll ans = 0;
FORR(d, 60, -1) {
if (d != -1 and !(K >> d & 1))
continue;
ll tmp = 0;
REPR(xd, 60) {
ll now = 1LL << xd;
ll cnt = 0;
REP(i, N) if (now & A[i]) cnt++;
if (xd > d) {
if (K & now)
tmp += (N - cnt) * now;
else
tmp += cnt * now;
} else if (xd == d) {
tmp += cnt * now;
} else {
tmp += max(cnt, N - cnt) * now;
}
}
ans = max(ans, tmp);
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
ll __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Printv(v) \
{ \
REP(x, v.size()) { cout << v[x] << (x == v.size() - 1 ? "\n" : " "); } \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<double> VD;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define PI 3.141592653589793238
signed main() {
LCIN(N, K);
VL A(N);
VECCIN(A);
ll ans = 0;
FORR(d, 60, -2) {
if (d != -1 and !(K >> d & 1))
continue;
ll tmp = 0;
REPR(xd, 60) {
ll now = 1LL << xd;
ll cnt = 0;
REP(i, N) if (now & A[i]) cnt++;
if (xd > d) {
if (K & now)
tmp += (N - cnt) * now;
else
tmp += cnt * now;
} else if (xd == d) {
tmp += cnt * now;
} else {
tmp += max(cnt, N - cnt) * now;
}
}
ans = max(ans, tmp);
}
cout << ans << "\n";
}
| [
"literal.number.change",
"call.arguments.change"
] | 938,948 | 938,949 | u139031151 | cpp |
p03138 | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223372036854775807
#define INF 2147483647
#define MOD 1000000007
using namespace std;
ll func(long xx[40][2], ll k) {
ll sum = 0;
long i;
for (i = 0; i < 40; i++) {
long curr = (k & ((ll)1 << i) ? 1 : 0);
sum += ((ll)xx[i][1 - curr] << i);
}
return sum;
}
int main(int argc, char *argv[]) {
long n;
ll k;
scanf("%ld%lld", &n, &k);
vector<ll> a(n);
long i, j;
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
long xx[40][2] = {0};
ll c = 0;
for (j = 0; j < 40; j++) {
for (i = 0; i < n; i++) {
xx[j][(a[i] >> j) & 1]++;
}
c += (xx[j][0] <= xx[j][1] ? 0 : (ll)1 << j);
}
ll max = func(xx, k);
for (i = 0; i < 40; i++) {
if (k & ((ll)1 << i)) {
ll k2 = k - k % ((ll)1 << i);
k2 += c % ((ll)1 << i);
ll tmp = func(xx, k2);
max = MAX(max, tmp);
}
}
printf("%lld\n", max);
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223372036854775807
#define INF 2147483647
#define MOD 1000000007
using namespace std;
ll func(long xx[40][2], ll k) {
ll sum = 0;
long i;
for (i = 0; i < 40; i++) {
long curr = (k & ((ll)1 << i) ? 1 : 0);
sum += ((ll)xx[i][1 - curr] << i);
}
return sum;
}
int main(int argc, char *argv[]) {
long n;
ll k;
scanf("%ld%lld", &n, &k);
vector<ll> a(n);
long i, j;
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
long xx[40][2] = {0};
ll c = 0;
for (j = 0; j < 40; j++) {
for (i = 0; i < n; i++) {
xx[j][(a[i] >> j) & 1]++;
}
c += (xx[j][0] <= xx[j][1] ? 0 : (ll)1 << j);
}
ll max = func(xx, k);
for (i = 0; i < 40; i++) {
if (k & ((ll)1 << i)) {
ll k2 = k - k % ((ll)1 << (i + 1));
k2 += c % ((ll)1 << i);
ll tmp = func(xx, k2);
max = MAX(max, tmp);
}
}
printf("%lld\n", max);
return 0;
}
| [] | 938,950 | 938,951 | u209713918 | cpp |
p03138 | #include <algorithm>
#include <cstring>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define NMAX 100000
#define INF 1e+6
#define scan(arg) cin >> arg
#define prin(arg) cout << arg << "\n"
#define prin2(arg1, arg2) cout << arg1 << " " << arg2 << "\n"
using namespace std;
typedef long long ll;
int n;
ll k;
ll a[100010];
int one[50], kone[50];
ll fast_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
int main() {
scan(n);
scan(k);
rep(i, n) scan(a[i]);
memset(one, 0, sizeof(one));
memset(kone, 0, sizeof(kone));
rep(i, 41) {
rep(j, n) {
if (a[j] & 1) {
one[i]++;
}
a[j] = a[j] >> 1;
}
}
rep(i, 41) {
if (k & 1) {
kone[i]++;
}
k = k >> 1;
}
ll res = 0, suma = 0;
rep(i, 41) {
if (kone[40 - i] & 1) {
ll sumb = fast_pow(2, 40 - i) * one[40 - i];
rep(j, 40 - i) {
sumb += fast_pow(2, j) * max(one[40 - i], n - one[40 - i]);
}
res = max(res, suma + sumb);
suma += fast_pow(2, 40 - i) * (n - one[40 - i]);
} else
suma += fast_pow(2, 40 - i) * one[40 - i];
}
res = max(res, suma);
prin(res);
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define NMAX 100000
#define INF 1e+6
#define scan(arg) cin >> arg
#define prin(arg) cout << arg << "\n"
#define prin2(arg1, arg2) cout << arg1 << " " << arg2 << "\n"
using namespace std;
typedef long long ll;
int n;
ll k;
ll a[100010];
int one[50], kone[50];
ll fast_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
int main() {
scan(n);
scan(k);
rep(i, n) scan(a[i]);
memset(one, 0, sizeof(one));
memset(kone, 0, sizeof(kone));
rep(i, 41) {
rep(j, n) {
if (a[j] & 1) {
one[i]++;
}
a[j] = a[j] >> 1;
}
}
rep(i, 41) {
if (k & 1) {
kone[i]++;
}
k = k >> 1;
}
ll res = 0, suma = 0;
rep(i, 41) {
if (kone[40 - i] & 1) {
ll sumb = fast_pow(2, 40 - i) * one[40 - i];
rep(j, 40 - i) { sumb += fast_pow(2, j) * max(one[j], n - one[j]); }
res = max(res, suma + sumb);
suma += fast_pow(2, 40 - i) * (n - one[40 - i]);
} else
suma += fast_pow(2, 40 - i) * one[40 - i];
}
res = max(res, suma);
prin(res);
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 938,953 | 938,954 | u110996038 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (auto &x : a)
cin >> x;
unsigned long r = 0;
for (int l = 0; l < n; l++)
r += a[l];
for (int i = 0; i < 45; i++) {
unsigned long rr = 0;
for (int j = 0; j < i; j++) {
unsigned long s = 0, t = 0;
for (int l = 0; l < n; l++)
if ((1ULL << j) & a[l])
s += 1ULL << j;
else
t += 1ULL << j;
rr += max(s, t);
}
{
int j = i;
if (!((1ULL << j) & k))
continue;
for (int l = 0; l < n; l++)
rr += (1ULL << j) & (0ULL ^ a[l]);
}
for (int j = i + 1; j < 45; j++) {
for (int l = 0; l < n; l++)
rr += (1ULL << j) & (k ^ a[l]);
}
r = max(r, rr);
}
cout << r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (auto &x : a)
cin >> x;
unsigned long r = 0;
for (int l = 0; l < n; l++)
r += k ^ a[l];
for (int i = 0; i < 45; i++) {
unsigned long rr = 0;
for (int j = 0; j < i; j++) {
unsigned long s = 0, t = 0;
for (int l = 0; l < n; l++)
if ((1ULL << j) & a[l])
s += 1ULL << j;
else
t += 1ULL << j;
rr += max(s, t);
}
{
int j = i;
if (!((1ULL << j) & k))
continue;
for (int l = 0; l < n; l++)
rr += (1ULL << j) & (0ULL ^ a[l]);
}
for (int j = i + 1; j < 45; j++) {
for (int l = 0; l < n; l++)
rr += (1ULL << j) & (k ^ a[l]);
}
r = max(r, rr);
}
cout << r << endl;
}
| [
"assignment.change"
] | 938,955 | 938,956 | u056944756 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll x = 0;
for (ll i = 62; i > 0; i--) {
int c = 0;
ll b = 1LL << i;
REP(j, n) {
if (a[j] & b)
c++;
else
c--;
}
if (c <= 0 && x + b <= k)
x += b;
}
ll ans = 0;
REP(i, n) ans += a[i] ^ x;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll x = 0;
for (ll i = 62; i >= 0; i--) {
int c = 0;
ll b = 1LL << i;
REP(j, n) {
if (a[j] & b)
c++;
else
c--;
}
if (c <= 0 && x + b <= k)
x += b;
}
ll ans = 0;
REP(i, n) ans += a[i] ^ x;
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 938,959 | 938,960 | u540491484 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll x = 0;
for (ll i = 40; i > 0; i--) {
int c = 0;
ll b = 1LL << i;
REP(j, n) {
if (a[j] & b)
c++;
else
c--;
}
if (c <= 0 && x + b <= k)
x += b;
}
ll ans = 0;
REP(i, n) ans += a[i] ^ x;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll x = 0;
for (ll i = 62; i >= 0; i--) {
int c = 0;
ll b = 1LL << i;
REP(j, n) {
if (a[j] & b)
c++;
else
c--;
}
if (c <= 0 && x + b <= k)
x += b;
}
ll ans = 0;
REP(i, n) ans += a[i] ^ x;
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 938,961 | 938,960 | u540491484 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll x = 0;
for (ll i = 40; i > 0; i--) {
int c = 0;
ll b = 1LL << i;
REP(j, n) {
if (a[j] & b)
c++;
else
c--;
}
if (c < 0 && x + b <= k)
x += b;
}
ll ans = 0;
REP(i, n) ans += a[i] ^ x;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll x = 0;
for (ll i = 62; i >= 0; i--) {
int c = 0;
ll b = 1LL << i;
REP(j, n) {
if (a[j] & b)
c++;
else
c--;
}
if (c <= 0 && x + b <= k)
x += b;
}
ll ans = 0;
REP(i, n) ans += a[i] ^ x;
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 938,962 | 938,960 | u540491484 | cpp |
p03138 | #include <iostream>
using namespace std;
using ll = unsigned long long;
ll n, k;
ll arr[100005];
ll cnt_bit[64];
ll x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ll tmp = arr[i];
ll j = 0;
while (tmp) {
if (tmp & 1)
cnt_bit[j]++;
tmp >>= 1;
j++;
}
}
for (int i = 60; i >= 0; i--) {
ll mask = 1ll << i;
if (n - cnt_bit[i] > cnt_bit[i]) {
if (x | mask <= k)
x |= mask;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += arr[i] ^ x;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
using ll = long long;
ll n, k;
ll arr[100005];
ll cnt_bit[64];
ll x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ll tmp = arr[i];
ll j = 0;
while (tmp) {
if (tmp & 1)
cnt_bit[j]++;
tmp >>= 1;
j++;
}
}
for (int i = 60; i >= 0; i--) {
ll mask = 1ll << i;
if (n - cnt_bit[i] > cnt_bit[i]) {
if ((x | mask) <= k)
x |= mask;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += arr[i] ^ x;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.narrow.change",
"control_flow.branch.if.condition.change"
] | 938,973 | 938,974 | u683588090 | cpp |
p03138 | #include <iostream>
using namespace std;
using ll = long long;
ll n, k;
ll arr[100005];
ll cnt_bit[64];
ll x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ll tmp = arr[i];
ll j = 0;
while (tmp) {
if (tmp & 1)
cnt_bit[j]++;
tmp >>= 1;
j++;
}
}
for (int i = 60; i >= 0; i--) {
ll mask = 1ll << i;
if (n - cnt_bit[i] > cnt_bit[i]) {
if (x | mask <= k)
x |= mask;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += arr[i] ^ x;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
using ll = long long;
ll n, k;
ll arr[100005];
ll cnt_bit[64];
ll x;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ll tmp = arr[i];
ll j = 0;
while (tmp) {
if (tmp & 1)
cnt_bit[j]++;
tmp >>= 1;
j++;
}
}
for (int i = 60; i >= 0; i--) {
ll mask = 1ll << i;
if (n - cnt_bit[i] > cnt_bit[i]) {
if ((x | mask) <= k)
x |= mask;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += arr[i] ^ x;
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 938,975 | 938,974 | u683588090 | cpp |
p03138 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(a) (a).begin(), (a).end()
#define OUT(x) out << (x) << endl;
#define M0(x) memset(x, 0, sizeof(x))
#define MINF(x) memset(x, 0x3f, sizeof(x))
#define MMINUS(a) memset(a, 0xff, sizeof(a))
#define ten(n) ((int)1e##n)
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double EPS = 1.0 / LINF;
const char ENDL = '\n'; // for JetBrains IDE only supports yen
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
using namespace std;
class DXXOR {
public:
int N;
ll K;
ll A[ten(5) + 1];
int bit[41];
int bit_K[41]{0};
void solve(std::istream &in, std::ostream &out) {
in >> N >> K;
REP(i, N) in >> A[i];
M0(bit);
// O(1e6)
ll mask = 0;
int keta = -1;
while (mask <= K) {
keta++;
mask = 1ll << keta;
REP(i, N) bit[keta] += ((A[i] & mask) > 0); // any better way?
if (bit[keta] >= N + 1 / 2)
bit_K[keta] = 0;
else
bit_K[keta] = 1;
}
int keta_K = keta - 1;
// herasu
ll argmax = 0;
for (int k = keta_K; k >= 0; k--) {
if (bit_K[k] == 0)
continue;
else {
ll tmp = argmax + (1ll << k);
if (tmp <= K)
argmax = tmp;
else
continue;
}
}
OUT(f(argmax));
}
ll f(ll xi) {
ll ans = 0;
REP(i, N) { ans += A[i] ^ xi; }
return ans;
}
};
int main() {
DXXOR solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(a) (a).begin(), (a).end()
#define OUT(x) out << (x) << endl;
#define M0(x) memset(x, 0, sizeof(x))
#define MINF(x) memset(x, 0x3f, sizeof(x))
#define MMINUS(a) memset(a, 0xff, sizeof(a))
#define ten(n) ((int)1e##n)
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double EPS = 1.0 / LINF;
const char ENDL = '\n'; // for JetBrains IDE only supports yen
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
using namespace std;
class DXXOR {
public:
int N;
ll K;
ll A[ten(5) + 1];
int bit[41];
int bit_K[41]{0};
void solve(std::istream &in, std::ostream &out) {
in >> N >> K;
REP(i, N) in >> A[i];
M0(bit);
// O(1e6)
ll mask = 0;
int keta = -1;
while (mask <= K) {
keta++;
mask = 1ll << keta;
REP(i, N) bit[keta] += ((A[i] & mask) > 0); // any better way?
if (bit[keta] >= (N + 1) / 2)
bit_K[keta] = 0;
else
bit_K[keta] = 1;
}
int keta_K = keta - 1;
// herasu
ll argmax = 0;
for (int k = keta_K; k >= 0; k--) {
if (bit_K[k] == 0)
continue;
else {
ll tmp = argmax + (1ll << k);
if (tmp <= K)
argmax = tmp;
else
continue;
}
}
OUT(f(argmax));
}
ll f(ll xi) {
ll ans = 0;
REP(i, N) { ans += A[i] ^ xi; }
return ans;
}
};
int main() {
DXXOR solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 938,976 | 938,977 | u585670083 | cpp |
p03138 | #include "bits/stdc++.h"
#include <string>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define int ll
//#define slld(t) scanf("%lld",&t)
//#define sd(t) scanf("%d",&t)
//#define pd(t) printf("%d\n",t)
//#define plld(t) printf("%lld\n",t)
#define vec vector<int>
#define vecp vector<pair<int, int>>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define debug(x) cerr << #x << ": " << x << endl
// #define mod 1000000007
#define N 100005
// #define MAX 200005
#define mod1 1000000007
#define mod2 998244353
#define bitcnt __builtin_popcount
#define PI acos(-1)
//#define endl "\n"
// const int inf = (int)1e18 + 10;
const int mod = 1e9 + 7;
const int inf = 1e15;
int mx = 42;
int c[50], a[N], b[N][50] = {{0}};
signed main() {
fast;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
for (int j = 0; j <= mx; j++) {
b[i][j] = ((a[i] & (1ll << j)) > 0);
}
}
for (int j = 0; j <= mx; j++)
c[j] = ((k & (1ll << j)) > 0);
bool t = 0;
int sum = 0;
for (int j = mx; j >= 0; j--) {
int d = c[j], r = 0;
for (int i = 1; i <= n; i++)
r += b[i][j];
if (d == 0 && t == 0)
sum += (1ll << j) * r;
else if (d == 1 && t == 0) {
if (r > n - r) {
sum += (1ll << j) * r;
t = 0;
} else {
sum += (1ll << j) * (n - r);
t = 1;
}
} else if (t == 1) {
if (r > n - r)
sum += (1ll << j) * r;
else
sum += (1ll << j) * (n - r);
}
}
cout << sum << endl;
}
| #include "bits/stdc++.h"
#include <string>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define int ll
//#define slld(t) scanf("%lld",&t)
//#define sd(t) scanf("%d",&t)
//#define pd(t) printf("%d\n",t)
//#define plld(t) printf("%lld\n",t)
#define vec vector<int>
#define vecp vector<pair<int, int>>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define debug(x) cerr << #x << ": " << x << endl
// #define mod 1000000007
#define N 100005
// #define MAX 200005
#define mod1 1000000007
#define mod2 998244353
#define bitcnt __builtin_popcount
#define PI acos(-1)
//#define endl "\n"
// const int inf = (int)1e18 + 10;
const int mod = 1e9 + 7;
const int inf = 1e15;
int mx = 42;
int c[50], a[N], b[N][50] = {{0}};
signed main() {
fast;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
for (int j = 0; j <= mx; j++) {
b[i][j] = ((a[i] & (1ll << j)) > 0);
}
}
for (int j = 0; j <= mx; j++)
c[j] = ((k & (1ll << j)) > 0);
bool t = 0;
int sum = 0;
for (int j = mx; j >= 0; j--) {
int d = c[j], r = 0;
for (int i = 1; i <= n; i++)
r += b[i][j];
if (d == 0 && t == 0)
sum += (1ll << j) * r;
else if (d == 1 && t == 0) {
if (r > n - r) {
sum += (1ll << j) * r;
t = 1;
} else {
sum += (1ll << j) * (n - r);
t = 0;
}
} else if (t == 1) {
if (r > n - r)
sum += (1ll << j) * r;
else
sum += (1ll << j) * (n - r);
}
}
cout << sum << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 938,980 | 938,981 | u564412651 | cpp |
p03138 | #include "bits/stdc++.h"
#include <string>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define int ll
//#define slld(t) scanf("%lld",&t)
//#define sd(t) scanf("%d",&t)
//#define pd(t) printf("%d\n",t)
//#define plld(t) printf("%lld\n",t)
#define vec vector<int>
#define vecp vector<pair<int, int>>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define debug(x) cerr << #x << ": " << x << endl
// #define mod 1000000007
#define N 100005
// #define MAX 200005
#define mod1 1000000007
#define mod2 998244353
#define bitcnt __builtin_popcount
#define PI acos(-1)
//#define endl "\n"
// const int inf = (int)1e18 + 10;
const int mod = 1e9 + 7;
const int inf = 1e15;
int mx = 40;
int c[50], a[N], b[N][50] = {{0}};
signed main() {
fast;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
for (int j = 0; j <= mx; j++) {
b[i][j] = ((a[i] & (1ll << j)) > 0);
}
}
for (int j = 0; j <= mx; j++)
c[j] = ((k & (1ll << j)) > 0);
bool t = 0;
int sum = 0;
for (int j = mx; j >= 0; j--) {
int d = c[j], r = 0;
for (int i = 1; i <= n; i++)
r += b[i][j];
if (d == 0 && t == 0)
sum += (1ll << j) * r;
else if (d == 1 && t == 0) {
if (r > n - r) {
sum += (1ll << j) * r;
t = 0;
} else {
sum += (1ll << j) * (n - r);
t = 1;
}
} else if (t == 1) {
if (r > n - r)
sum += (1ll << j) * r;
else
sum += (1ll << j) * (n - r);
}
}
cout << sum << endl;
}
| #include "bits/stdc++.h"
#include <string>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define int ll
//#define slld(t) scanf("%lld",&t)
//#define sd(t) scanf("%d",&t)
//#define pd(t) printf("%d\n",t)
//#define plld(t) printf("%lld\n",t)
#define vec vector<int>
#define vecp vector<pair<int, int>>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define debug(x) cerr << #x << ": " << x << endl
// #define mod 1000000007
#define N 100005
// #define MAX 200005
#define mod1 1000000007
#define mod2 998244353
#define bitcnt __builtin_popcount
#define PI acos(-1)
//#define endl "\n"
// const int inf = (int)1e18 + 10;
const int mod = 1e9 + 7;
const int inf = 1e15;
int mx = 42;
int c[50], a[N], b[N][50] = {{0}};
signed main() {
fast;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
for (int j = 0; j <= mx; j++) {
b[i][j] = ((a[i] & (1ll << j)) > 0);
}
}
for (int j = 0; j <= mx; j++)
c[j] = ((k & (1ll << j)) > 0);
bool t = 0;
int sum = 0;
for (int j = mx; j >= 0; j--) {
int d = c[j], r = 0;
for (int i = 1; i <= n; i++)
r += b[i][j];
if (d == 0 && t == 0)
sum += (1ll << j) * r;
else if (d == 1 && t == 0) {
if (r > n - r) {
sum += (1ll << j) * r;
t = 1;
} else {
sum += (1ll << j) * (n - r);
t = 0;
}
} else if (t == 1) {
if (r > n - r)
sum += (1ll << j) * r;
else
sum += (1ll << j) * (n - r);
}
}
cout << sum << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 938,982 | 938,981 | u564412651 | cpp |
p03138 | #include <iostream>
#include <vector>
using namespace std;
long long solve(const vector<long long> &a, long long k, int idx, bool k_lt) {
if (idx < 0) {
return 0;
}
long long cnt_z = 0, cnt_o = 0;
for (int i = 0; i < static_cast<int>(a.size()); i++) {
if ((a[i] & (1LL << idx)) == 0) {
cnt_z++;
} else {
cnt_o++;
}
}
if (k_lt) {
return (1LL << idx) * (cnt_z > cnt_o ? cnt_z : cnt_o) +
solve(a, k, idx - 1, true);
} else if ((k & (1LL << idx)) == 0) {
return (1LL << idx) * cnt_o + solve(a, k, idx - 1, false);
} else {
long long fx_z = (1LL << idx) * cnt_z + solve(a, k, idx - 1, true);
long long fx_o = (1LL << idx) * cnt_o + solve(a, k, idx - 1, false);
return (fx_z > fx_o ? fx_z : fx_o);
}
}
int main() {
int n;
long long k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << solve(a, k, 40, false) << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
long long solve(const vector<long long> &a, long long k, int idx, bool k_lt) {
if (idx < 0) {
return 0;
}
long long cnt_z = 0, cnt_o = 0;
for (int i = 0; i < static_cast<int>(a.size()); i++) {
if ((a[i] & (1LL << idx)) == 0) {
cnt_z++;
} else {
cnt_o++;
}
}
if (k_lt) {
return (1LL << idx) * (cnt_z > cnt_o ? cnt_z : cnt_o) +
solve(a, k, idx - 1, true);
} else if ((k & (1LL << idx)) == 0) {
return (1LL << idx) * cnt_o + solve(a, k, idx - 1, false);
} else {
long long fx_z = (1LL << idx) * cnt_z + solve(a, k, idx - 1, false);
long long fx_o = (1LL << idx) * cnt_o + solve(a, k, idx - 1, true);
return (fx_z > fx_o ? fx_z : fx_o);
}
}
int main() {
int n;
long long k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << solve(a, k, 40, false) << endl;
}
| [
"misc.opposites",
"call.arguments.change",
"expression.operation.binary.change"
] | 938,987 | 938,988 | u185690073 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % MOD;
base = base * base % MOD;
}
return tot;
}
int freq[64];
unsigned long long arr[100005];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
unsigned long long k, a;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a;
arr[i] = a;
for (int p = 0; p < 63; ++p)
if ((a >> p) & 1)
++freq[p];
}
unsigned long long x = 0;
for (int pos = 63; pos >= 0; --pos) {
// cout << pos << " " << freq[pos] * 2 << " " << n << endl;
if (freq[pos] * 2 < n && (x | (1ULL << pos)) <= k) {
// cout << "SET BIT " << pos << endl;
x |= 1ULL << pos;
}
}
unsigned long long tot = 0;
for (int i = 0; i < n; ++i)
tot += x ^ arr[i];
cout << x << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % MOD;
base = base * base % MOD;
}
return tot;
}
int freq[64];
unsigned long long arr[100005];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
unsigned long long k, a;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a;
arr[i] = a;
for (int p = 0; p < 63; ++p)
if ((a >> p) & 1)
++freq[p];
}
unsigned long long x = 0;
for (int pos = 63; pos >= 0; --pos) {
// cout << pos << " " << freq[pos] * 2 << " " << n << endl;
if (freq[pos] * 2 < n && (x | (1ULL << pos)) <= k) {
// cout << "SET BIT " << pos << endl;
x |= 1ULL << pos;
}
}
unsigned long long tot = 0;
for (int i = 0; i < n; ++i)
tot += x ^ arr[i];
cout << tot << "\n";
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 938,996 | 938,997 | u276568758 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % MOD;
base = base * base % MOD;
}
return tot;
}
int freq[64];
unsigned long long arr[100005];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
unsigned long long k, a;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a;
arr[i] = a;
for (int p = 0; p < 63; ++p)
if ((a >> p) & 1)
++freq[p];
}
unsigned long long x = 0;
for (int pos = 63; pos >= 0; --pos) {
// cout << pos << " " << freq[pos] * 2 << " " << n << endl;
if (freq[pos] * 2 < n && (x | (1 << pos)) <= k) {
// cout << "SET BIT " << pos << endl;
x |= 1 << pos;
}
}
unsigned long long tot = 0;
for (int i = 0; i < n; ++i)
tot += x ^ arr[i];
cout << tot << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * base % MOD;
base = base * base % MOD;
}
return tot;
}
int freq[64];
unsigned long long arr[100005];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
unsigned long long k, a;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a;
arr[i] = a;
for (int p = 0; p < 63; ++p)
if ((a >> p) & 1)
++freq[p];
}
unsigned long long x = 0;
for (int pos = 63; pos >= 0; --pos) {
// cout << pos << " " << freq[pos] * 2 << " " << n << endl;
if (freq[pos] * 2 < n && (x | (1ULL << pos)) <= k) {
// cout << "SET BIT " << pos << endl;
x |= 1ULL << pos;
}
}
unsigned long long tot = 0;
for (int i = 0; i < n; ++i)
tot += x ^ arr[i];
cout << tot << "\n";
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 938,998 | 938,997 | u276568758 | cpp |
p03138 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll ans = 0;
for (int i = 40; i >= -1; --i) {
if (i != -1 && !(K & (1LL << i))) {
continue;
}
ll tmp = 0;
for (int j = 40; j >= 0; --j) {
ll mask = (1LL << j);
ll c = 0;
for (int k = 0; k < N; ++k) {
if (A[k] & mask) {
++c;
}
}
if (j > i) {
if (K & mask) {
tmp += mask * (N - c);
} else {
tmp += mask * c;
}
} else if (j == i) {
tmp += mask * (N - c);
} else {
tmp += mask * max(c, N - c);
}
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll ans = 0;
for (int i = 40; i >= -1; --i) {
if (i != -1 && !(K & (1LL << i))) {
continue;
}
ll tmp = 0;
for (int j = 40; j >= 0; --j) {
ll mask = (1LL << j);
ll c = 0;
for (int k = 0; k < N; ++k) {
if (A[k] & mask) {
++c;
}
}
if (j > i) {
if (K & mask) {
tmp += mask * (N - c);
} else {
tmp += mask * c;
}
} else if (j == i) {
tmp += mask * c;
} else {
tmp += mask * max(c, N - c);
}
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| [] | 938,999 | 939,000 | u273834941 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
ll cnt[45][2], kbit[45];
ll calc(int x) {
ll ans = 0, pow2 = 1;
rep(i, x) {
if (cnt[i][0] > cnt[i][1])
ans += pow2 * cnt[i][0];
else
ans += pow2 * cnt[i][1];
}
return ans;
}
int main(void) {
ll n, k;
cin >> n >> k;
ll a[n];
rep(i, n) cin >> a[i];
ll pow2 = 1, pow = 1;
rep(i, 42) {
pow2 *= 2;
pow *= 2;
cnt[i][0] = 0;
cnt[i][1] = 0;
kbit[i] = 0;
}
int idx = 42;
while (idx > -1) {
rep(i, n) {
if (a[i] >= pow2) {
cnt[idx][1]++;
a[i] -= pow2;
} else
cnt[idx][0]++;
if (k >= pow2) {
kbit[idx] = 1;
k -= pow2;
}
}
pow2 /= 2;
idx--;
}
/*
rep(i,5)cout<<cnt[i][0];
cout<<endl;
rep(i,5)cout<<cnt[i][1];
cout<<endl;
rep(i,5)cout<<kbit[i];
cout<<endl;*/
ll val = 0, maxf = 0;
for (int i = 42; i > -1; i--) {
// cout<<"i:"<<i<<","<<"k:"<<kbit[i]<<","<<"c[0]:"<<cnt[i][0]<<","<<"c[1]:"<<cnt[i][1]<<endl;
if (kbit[i]) {
if (cnt[i][1] >= cnt[i][0]) {
val += cnt[i][1] * pow + calc(i);
break;
}
ll tmp = calc(i);
if (maxf < val + cnt[i][1] * pow + tmp)
maxf = val + cnt[i][1] * pow + tmp;
val += cnt[i][0] * pow;
} else
val += cnt[i][1] * pow;
pow /= 2;
}
if (val > maxf)
maxf = val;
cout << maxf << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
ll cnt[45][2], kbit[45];
ll calc(int x) {
ll ans = 0, pow2 = 1;
rep(i, x) {
if (cnt[i][0] > cnt[i][1])
ans += pow2 * cnt[i][0];
else
ans += pow2 * cnt[i][1];
pow2 *= 2;
}
return ans;
}
int main(void) {
ll n, k;
cin >> n >> k;
ll a[n];
rep(i, n) cin >> a[i];
ll pow2 = 1, pow = 1;
rep(i, 42) {
pow2 *= 2;
pow *= 2;
cnt[i][0] = 0;
cnt[i][1] = 0;
kbit[i] = 0;
}
int idx = 42;
while (idx > -1) {
rep(i, n) {
if (a[i] >= pow2) {
cnt[idx][1]++;
a[i] -= pow2;
} else
cnt[idx][0]++;
if (k >= pow2) {
kbit[idx] = 1;
k -= pow2;
}
}
pow2 /= 2;
idx--;
}
/*
rep(i,5)cout<<cnt[i][0];
cout<<endl;
rep(i,5)cout<<cnt[i][1];
cout<<endl;
rep(i,5)cout<<kbit[i];
cout<<endl;*/
ll val = 0, maxf = 0;
for (int i = 42; i > -1; i--) {
// cout<<"i:"<<i<<","<<"k:"<<kbit[i]<<","<<"c[0]:"<<cnt[i][0]<<","<<"c[1]:"<<cnt[i][1]<<endl;
if (kbit[i]) {
if (cnt[i][1] >= cnt[i][0]) {
val += cnt[i][1] * pow + calc(i);
break;
}
ll tmp = calc(i);
if (maxf < val + cnt[i][1] * pow + tmp)
maxf = val + cnt[i][1] * pow + tmp;
val += cnt[i][0] * pow;
} else
val += cnt[i][1] * pow;
pow /= 2;
}
if (val > maxf)
maxf = val;
cout << maxf << endl;
return 0;
}
| [
"assignment.add"
] | 939,011 | 939,012 | u582848517 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int arr[41];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
long long int k, t;
vector<long long int> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> t;
v.push_back(t);
}
memset(arr, 0, sizeof(arr));
for (int i = 0; i < n; i++) {
t = v[i];
for (int j = 0; j < 41; j++) {
if (t == 0) {
break;
}
if (t % 2 == 1) {
arr[j]++;
}
}
}
long long int temp = 0;
for (int i = 40; i >= 0; i--) {
if (n - arr[i] > arr[i]) {
if (temp + (1LL << i) <= k) {
temp += (1LL << i);
}
}
}
long long int res = 0;
for (int i = 0; i < n; i++) {
res += (v[i] ^ temp);
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int arr[41];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
long long int k, t;
vector<long long int> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> t;
v.push_back(t);
}
memset(arr, 0, sizeof(arr));
for (int i = 0; i < n; i++) {
t = v[i];
for (int j = 0; j < 41; j++) {
if (t == 0) {
break;
}
if (t % 2 == 1) {
arr[j]++;
}
t /= 2;
}
}
long long int temp = 0;
for (int i = 40; i >= 0; i--) {
if (n - arr[i] > arr[i]) {
if (temp + (1LL << i) <= k) {
temp += (1LL << i);
}
}
}
long long int res = 0;
for (int i = 0; i < n; i++) {
res += (v[i] ^ temp);
}
cout << res << endl;
return 0;
}
| [
"assignment.add"
] | 939,015 | 939,016 | u365058393 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
#define ll long long
using namespace std;
// 119 D
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main(void) {
ll n, k;
cin >> n >> k;
const ll MAX_DIGIT = 41;
vector<ll> a(n);
rep(i, 0, n) { cin >> a[i]; }
ll dp[MAX_DIGIT][2];
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
rep(i, 0, MAX_DIGIT) {
ll mask = (ll)1 << (MAX_DIGIT - i - 1);
int num = 0;
rep(j, 0, n) if (a[j] & mask)++ num;
ll cost0 = mask * num;
ll cost1 = mask * (n - num);
if (dp[i][1] != -1) {
chmax(dp[i + 1][1], dp[i][1] + max(cost0, cost1));
}
if (dp[i][0] != -1) {
if (k & mask) {
chmax(dp[i + 1][1], dp[i][0] + cost0);
}
if (k & mask)
chmax(dp[i + 1][0], dp[i][0] + cost1);
else
chmax(dp[i + 1][0], dp[i][0] + cost0);
}
}
cout << max(dp[MAX_DIGIT - 1][0], dp[MAX_DIGIT - 1][1]) << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
#define ll long long
using namespace std;
// 119 D
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main(void) {
ll n, k;
cin >> n >> k;
const ll MAX_DIGIT = 41;
vector<ll> a(n);
rep(i, 0, n) { cin >> a[i]; }
ll dp[MAX_DIGIT + 1][2];
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
rep(i, 0, MAX_DIGIT) {
ll mask = (ll)1 << (MAX_DIGIT - i - 1);
int num = 0;
rep(j, 0, n) if (a[j] & mask)++ num;
ll cost0 = mask * num;
ll cost1 = mask * (n - num);
if (dp[i][1] != -1) {
chmax(dp[i + 1][1], dp[i][1] + max(cost0, cost1));
}
if (dp[i][0] != -1) {
if (k & mask) {
chmax(dp[i + 1][1], dp[i][0] + cost0);
}
if (k & mask)
chmax(dp[i + 1][0], dp[i][0] + cost1);
else
chmax(dp[i + 1][0], dp[i][0] + cost0);
}
}
cout << max(dp[MAX_DIGIT][0], dp[MAX_DIGIT][1]) << endl;
} | [
"expression.operation.binary.remove"
] | 939,039 | 939,040 | u693569496 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
#define ll long long
using namespace std;
// 119 D
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main(void) {
ll n, k;
cin >> n >> k;
const ll MAX_DIGIT = 41;
vector<ll> a(n);
rep(i, 0, n) { cin >> a[i]; }
ll dp[MAX_DIGIT][2];
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
rep(i, 0, MAX_DIGIT) {
ll mask = (ll)1 << (MAX_DIGIT - i - 1);
int num = 0;
rep(j, 0, n) if (a[j] & mask)++ num;
ll cost0 = mask * num;
ll cost1 = mask * (n - num);
if (dp[i][1] != -1) {
chmax(dp[i + 1][1], dp[i][1] + max(cost0, cost1));
}
if (dp[i][0] != -1) {
if (k & mask) {
chmax(dp[i + 1][1], dp[i][0] + cost0);
}
if (k & mask)
chmax(dp[i + 1][0], dp[i][0] + cost1);
else
chmax(dp[i + 1][0], dp[i][0] + cost0);
}
}
cout << max(dp[MAX_DIGIT][0], dp[MAX_DIGIT][1]) << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
#define ll long long
using namespace std;
// 119 D
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main(void) {
ll n, k;
cin >> n >> k;
const ll MAX_DIGIT = 41;
vector<ll> a(n);
rep(i, 0, n) { cin >> a[i]; }
ll dp[MAX_DIGIT + 1][2];
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
rep(i, 0, MAX_DIGIT) {
ll mask = (ll)1 << (MAX_DIGIT - i - 1);
int num = 0;
rep(j, 0, n) if (a[j] & mask)++ num;
ll cost0 = mask * num;
ll cost1 = mask * (n - num);
if (dp[i][1] != -1) {
chmax(dp[i + 1][1], dp[i][1] + max(cost0, cost1));
}
if (dp[i][0] != -1) {
if (k & mask) {
chmax(dp[i + 1][1], dp[i][0] + cost0);
}
if (k & mask)
chmax(dp[i + 1][0], dp[i][0] + cost1);
else
chmax(dp[i + 1][0], dp[i][0] + cost0);
}
}
cout << max(dp[MAX_DIGIT][0], dp[MAX_DIGIT][1]) << endl;
} | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 939,041 | 939,040 | u693569496 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, s, n) for (int i = (int)(s); i < (int)(n); ++i)
#define ALL(n) (n).begin(), (n).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> mat;
// mat dtable(M, vl(N, 0)); M行N列 のサイズで,0で初期化
const ll MAX_V = 100000;
const ll INF = 1e9;
const ll MOD = 998244353;
int main() {
ll N, K;
cin >> N >> K;
vl A(N);
REP(i, N) cin >> A[i];
mat dtable;
int D;
if (K > 0) {
D = ceil(log2(K));
dtable = mat(D, vl(2, 0));
} else {
D = 0;
dtable = mat(1, vl(2, 0));
}
REP(i, N) {
REP(j, D) {
int d = 1 & (A[i] >> j);
if (d == 0)
dtable[j][0]++;
else
dtable[j][1]++;
}
}
ll X = 0;
for (int i = D - 1; i >= 0; --i) {
if (dtable[i][0] >= dtable[i][1] && (X + (1 << i)) <= K) {
X += (1 << i);
}
}
ll ans = 0;
REP(i, N) ans += (A[i] ^ X);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, s, n) for (int i = (int)(s); i < (int)(n); ++i)
#define ALL(n) (n).begin(), (n).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> mat;
// mat dtable(M, vl(N, 0)); M行N列 のサイズで,0で初期化
const ll MAX_V = 100000;
const ll INF = 1e9;
const ll MOD = 998244353;
int main() {
ll N, K;
cin >> N >> K;
vl A(N);
REP(i, N) cin >> A[i];
mat dtable;
int D;
if (K > 0) {
D = ceil(log2(K)) + 1;
dtable = mat(D, vl(2, 0));
} else {
D = 0;
dtable = mat(1, vl(2, 0));
}
REP(i, N) {
REP(j, D) {
int d = 1 & (A[i] >> j);
if (d == 0)
dtable[j][0]++;
else
dtable[j][1]++;
}
}
ll X = 0;
for (int i = D - 1; i >= 0; --i) {
if (dtable[i][0] >= dtable[i][1] && (X + (1LL << i)) <= K) {
X += (1LL << i);
}
}
ll ans = 0;
REP(i, N) ans += (A[i] ^ X);
cout << ans << endl;
} | [
"assignment.change",
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change"
] | 939,067 | 939,068 | u963682312 | cpp |
p03138 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> vec(n);
for (ll i = 0; i < n; i++) {
cin >> vec[i];
}
ll len = 0;
for (ll i = 1; i <= k; i *= 2) {
len++;
}
ll x = 0;
for (ll i = len - 1; i >= 0; i--) {
ll one = 0, zero = 0;
for (int j = 0; j < n; j++) {
if (vec[j] & (1 << i)) {
one++;
} else {
zero++;
}
}
if (zero > one && (x |= (1 << i)) <= k) {
x |= (1 << i);
}
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += vec[i] ^ x;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> vec(n);
for (ll i = 0; i < n; i++) {
cin >> vec[i];
}
ll len = 0;
for (ll i = 1; i <= k; i *= 2) {
len++;
}
ll x = 0;
for (ll i = len - 1; i >= 0; i--) {
ll one = 0, zero = 0;
for (ll j = 0; j < n; j++) {
if (vec[j] & (1LL << i)) {
one++;
} else {
zero++;
}
}
if (zero > one && (x | (1LL << i)) <= k) {
x |= (1LL << i);
}
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += vec[i] ^ x;
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"assignment.compound.bitwise.replace.remove",
"expression.operator.bitwise.replace.add",
"literal.number.type.widen.change"
] | 939,082 | 939,079 | u146594935 | cpp |
p03138 | // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FER(i, a, b) for (int i = int(a); i < int(b); ++i)
#define IFR(i, a, b) for (int i = int(a); i >= int(b); i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e5 + 5;
ll mm[N];
ll opt[N];
int main() {
int n;
scanf("%d", &n);
ll k;
scanf("%lld", &k);
FER(i, 0, n) scanf("%lld", &mm[i]);
ll cur = 0;
FER(i, 0, 60) {
int c1 = 0, c0 = 0;
FER(j, 0, n) {
if ((mm[j] >> i) & 1)
c1++;
else
c0++;
}
if (c1 >= c0)
opt[i] = (1LL << i) * c1 + cur;
else
opt[i] = (1LL << i) * c0 + cur;
cur = opt[i];
}
ll mx = 0;
ll prev = 0;
// FER(i,0,5)cout<<opt[i]<<" ";
// cout<<endl;
IFR(i, 5, 0) {
if ((k >> i) & 1) {
ll c = 0;
FER(j, 0, n) if ((mm[j] >> i) & 1) c++;
// if(i==2)trace(c);
c = (1LL << i) * c;
// if(i==2)trace(c);
ll val = prev + c;
if (i != 0)
val += opt[i - 1];
mx = max(mx, val);
}
ll d1 = (k >> i) & 1;
FER(j, 0, n) {
ll d2 = (mm[j] >> i) & 1;
if (d1 ^ d2)
prev += (1LL << i);
}
// trace(prev);
// trace(mx);
}
ll val = 0;
FER(i, 0, n) val += mm[i] ^ k;
mx = max(mx, val);
printf("%lld\n", mx);
return 0;
}
| // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FER(i, a, b) for (int i = int(a); i < int(b); ++i)
#define IFR(i, a, b) for (int i = int(a); i >= int(b); i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e5 + 5;
ll mm[N];
ll opt[N];
int main() {
int n;
scanf("%d", &n);
ll k;
scanf("%lld", &k);
FER(i, 0, n) scanf("%lld", &mm[i]);
ll cur = 0;
FER(i, 0, 60) {
int c1 = 0, c0 = 0;
FER(j, 0, n) {
if ((mm[j] >> i) & 1)
c1++;
else
c0++;
}
if (c1 >= c0)
opt[i] = (1LL << i) * c1 + cur;
else
opt[i] = (1LL << i) * c0 + cur;
cur = opt[i];
}
ll mx = 0;
ll prev = 0;
// FER(i,0,5)cout<<opt[i]<<" ";
// cout<<endl;
IFR(i, 59, 0) {
if ((k >> i) & 1) {
ll c = 0;
FER(j, 0, n) if ((mm[j] >> i) & 1) c++;
// if(i==2)trace(c);
c = (1LL << i) * c;
// if(i==2)trace(c);
ll val = prev + c;
if (i != 0)
val += opt[i - 1];
mx = max(mx, val);
}
ll d1 = (k >> i) & 1;
FER(j, 0, n) {
ll d2 = (mm[j] >> i) & 1;
if (d1 ^ d2)
prev += (1LL << i);
}
// trace(prev);
// trace(mx);
}
ll val = 0;
FER(i, 0, n) val += mm[i] ^ k;
mx = max(mx, val);
printf("%lld\n", mx);
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 939,090 | 939,091 | u024867716 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using namespace std;
typedef long long lint;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lint N, K;
cin >> N >> K;
vector<lint> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
// 2進法で表したときの各桁について注目する。（0の数が過半数ならmaxXのその桁は1となる。）
// Kと比較してKのi桁目が1ならmaxXも1にできる。
// (flag)上の桁から見ていってKが1なのにmaxXは0となる場合その先maxXはKによらず1,0を決めれる。
lint one, maxX = 0;
bool flag = false;
for (int i = 39; i >= 0; i--) {
// N個の入力のi桁目の1の数を数える
one = 0;
for (int j = 0; j < N; j++)
if ((1LL << i) & A[j])
one++;
// flagがtrueまたはKのi桁目が1 でかつ0が過半数ならmaxXのi桁目を1にする。
if ((flag || (K & (1LL << i))) && one - N / 2 <= 0)
maxX ^= (1LL << i);
// Kが1でmaxXが0となるならそれ以降は必ずK>maxXが成立するのでflag=trueにしてmaxXの1,0は自由に決めれる。
if (!flag && (K & (1LL << i)) && one - N / 2 > 0)
flag = true;
}
lint ans = 0;
for (int i = 0; i < N; i++)
ans ^= A[i] ^ maxX;
cout << ans << "\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using namespace std;
typedef long long lint;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lint N, K;
cin >> N >> K;
vector<lint> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
// 2進法で表したときの各桁について注目する。（0の数が過半数ならmaxXのその桁は1となる。）
// Kと比較してKのi桁目が1ならmaxXも1にできる。
// (flag)上の桁から見ていってKが1なのにmaxXは0となる場合その先maxXはKによらず1,0を決めれる。
lint one, maxX = 0;
bool flag = false;
for (int i = 39; i >= 0; i--) {
// N個の入力のi桁目の1の数を数える
one = 0;
for (int j = 0; j < N; j++)
if ((1LL << i) & A[j])
one++;
// flagがtrueまたはKのi桁目が1 でかつ0が過半数ならmaxXのi桁目を1にする。
if ((flag || (K & (1LL << i))) && one - N / 2 <= 0)
maxX ^= (1LL << i);
// Kが1でmaxXが0となるならそれ以降は必ずK>maxXが成立するのでflag=trueにしてmaxXの1,0は自由に決めれる。
if (!flag && (K & (1LL << i)) && one - N / 2 > 0)
flag = true;
}
lint ans = 0;
for (int i = 0; i < N; i++)
ans += A[i] ^ maxX;
cout << ans << "\n";
return 0;
} | [
"expression.operator.change"
] | 939,098 | 939,099 | u532573979 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
// xを２進展開した時、各けたの数字を格納した。
vll calc(ll x) {
vll v;
for (int l = 0; l < 41; l++) {
ll c = x % 2;
v.push_back(c);
x /= 2;
}
return v;
}
// xは、A_1,A_2,...,A_Nのつもり。数字の列。
vll counter(vll x) {
//初期化した。
ll N = x.size();
vll cnt(41);
for (int l = 0; l < 41; l++) {
cnt[l] = 0;
}
//各xの各げんA_iの各桁を計算して、その分cntにたす。
for (ll i = 0; i < N; i++) {
vll v = calc(x[i]);
for (ll l = 0; l < 41; l++) {
cnt[l] += v[l];
}
}
return cnt;
}
int main() {
//入力の受け取り
ll N, K;
cin >> N >> K;
vll x;
for (ll i = 0; i < N; i++) {
ll a;
cin >> a;
x.push_back(a);
}
//各桁の買ううんとをした。
vll count = counter(x);
// Kをbinary representした。
vll bin_K = calc(K);
// maxを与えるXを求める。
ll X = 0;
int flag = 0;
//大きい方から決めてく。
for (int l = 41; l >= 0; l--) {
// X_lは、Xのl桁目？
int X_l = 0;
// Kの上位とXの上位が一致していて、かつKのl桁目が0だったり
if ((flag == 0) && (bin_K[l] == 0)) {
X += 0;
}
// Nが偶数かつ個数が拮抗七衛うなら。
else {
if ((N % 2 == 0) and (count[l] == N / 2)) {
X += 0;
} else if (count[l] <= N / 2) {
// 1が真に少数派ならpow(2,l)をたす。
X += pow(2, l);
X_l = 1;
} else {
X += 0;
}
}
if (X_l != bin_K[l]) {
// Kのl桁目とXのl桁目が一致していないなら、flag=1。上から決めてるからね。
flag = 1;
}
}
//最後に、実際の値を計算する。
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans += X ^ x[i];
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
// xを２進展開した時、各けたの数字を格納した。
vll calc(ll x) {
vll v;
for (int l = 0; l < 100; l++) {
ll c = x % 2;
v.push_back(c);
x /= 2;
}
return v;
}
// xは、A_1,A_2,...,A_Nのつもり。数字の列。
vll counter(vll x) {
//初期化した。
ll N = x.size();
vll cnt(100);
for (int l = 0; l < 100; l++) {
cnt[l] = 0;
}
//各xの各げんA_iの各桁を計算して、その分cntにたす。
for (ll i = 0; i < N; i++) {
vll v = calc(x[i]);
for (ll l = 0; l < 100; l++) {
cnt[l] += v[l];
}
}
return cnt;
}
int main() {
//入力の受け取り
ll N, K;
cin >> N >> K;
vll x;
for (ll i = 0; i < N; i++) {
ll a;
cin >> a;
x.push_back(a);
}
//各桁の買ううんとをした。
vll count = counter(x);
// Kをbinary representした。
vll bin_K = calc(K);
// maxを与えるXを求める。
ll X = 0;
int flag = 0;
//大きい方から決めてく。
for (int l = 99; l >= 0; l--) {
// X_lは、Xのl桁目？
int X_l = 0;
// Kの上位とXの上位が一致していて、かつKのl桁目が0だったり
if ((flag == 0) && (bin_K[l] == 0)) {
X += 0;
}
// Nが偶数かつ個数が拮抗七衛うなら。
else {
if ((N % 2 == 0) and (count[l] == N / 2)) {
X += 0;
} else if (count[l] <= N / 2) {
// 1が真に少数派ならpow(2,l)をたす。
X += pow(2, l);
X_l = 1;
} else {
X += 0;
}
}
if (X_l != bin_K[l]) {
// Kのl桁目とXのl桁目が一致していないなら、flag=1。上から決めてるからね。
flag = 1;
}
}
//最後に、実際の値を計算する。
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans += X ^ x[i];
}
cout << ans;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 939,104 | 939,105 | u826487371 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
long long Pow(long long x, long long y) {
if (y == 0)
return 1;
if (y % 2 == 0) {
long long z = Pow(x, y / 2);
return z * z;
}
return x * Pow(x, y - 1);
}
int main() {
long long N, K, A, Dig[40] = {}, KDig[40] = {}, ans = 0;
cin >> N >> K;
for (int i = 0; i < 40; i++) {
if (K % 2 == 1)
KDig[i] = 1;
K /= 2;
}
for (int i = 0; i < N; i++) {
cin >> A;
ans += A;
for (int j = 0; j < 40; j++) {
if (A % 2 == 1)
Dig[j]++;
A /= 2;
}
}
for (int i = 39; i >= 0; i--) {
if (KDig[i] == 0)
continue;
long long count = 0;
for (int j = 39; j > i; j--) {
if (KDig[j] == 0)
count += Dig[j] * Pow(2, j);
else
count += (N - Dig[j]) * Pow(2, j);
}
count += (N - Dig[i]) * Pow(2, i);
for (int j = i - 1; j >= 0; j--) {
count += max(Dig[j], N - Dig[j]) * Pow(2, j);
}
ans = max(ans, count);
}
long long count = 0;
for (int i = 0; i < 40; i++) {
if (KDig[i] == 0)
count += Dig[i] * Pow(2, i);
else
count += (N - Dig[i]) * Pow(2, i);
}
ans = max(ans, count);
cout << ans;
} | #include "bits/stdc++.h"
using namespace std;
long long Pow(long long x, long long y) {
if (y == 0)
return 1;
if (y % 2 == 0) {
long long z = Pow(x, y / 2);
return z * z;
}
return x * Pow(x, y - 1);
}
int main() {
long long N, K, A, Dig[40] = {}, KDig[40] = {}, ans = 0;
cin >> N >> K;
for (int i = 0; i < 40; i++) {
if (K % 2 == 1)
KDig[i] = 1;
K /= 2;
}
for (int i = 0; i < N; i++) {
cin >> A;
ans += A;
for (int j = 0; j < 40; j++) {
if (A % 2 == 1)
Dig[j]++;
A /= 2;
}
}
for (int i = 39; i >= 0; i--) {
if (KDig[i] == 0)
continue;
long long count = 0;
for (int j = 39; j > i; j--) {
if (KDig[j] == 0)
count += Dig[j] * Pow(2, j);
else
count += (N - Dig[j]) * Pow(2, j);
}
count += Dig[i] * Pow(2, i);
for (int j = i - 1; j >= 0; j--) {
count += max(Dig[j], N - Dig[j]) * Pow(2, j);
}
ans = max(ans, count);
}
long long count = 0;
for (int i = 0; i < 40; i++) {
if (KDig[i] == 0)
count += Dig[i] * Pow(2, i);
else
count += (N - Dig[i]) * Pow(2, i);
}
ans = max(ans, count);
cout << ans;
} | [] | 939,108 | 939,109 | u454087021 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MinInF = -1e18;
ll dp[41][2];
int nth_bit(ll num, int n) { return (num >> n) & 1; }
void chmax(ll &a, ll b) { a = max(a, b); }
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i <= 40; i++) {
for (int j = 0; j < 2; j++) {
dp[i][j] = MinInF;
}
}
dp[40][0] = 0;
for (int i = 39; i >= 0; i--) {
ll D = 1LL << i;
int num1 = 0;
for (int j = 0; j < 40; j++)
if (nth_bit(A[j], i))
num1++;
int num0 = N - num1;
if (nth_bit(K, i)) {
chmax(dp[i][0], dp[i + 1][0] + D * num0);
chmax(dp[i][1], dp[i + 1][0] + D * num1);
} else {
chmax(dp[i][0], dp[i + 1][0] + D * num1);
}
chmax(dp[i][1], dp[i + 1][1] + D * max(num0, num1));
}
ll ans = max(dp[0][0], dp[0][1]);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MinInF = -1e18;
ll dp[41][2];
int nth_bit(ll num, int n) { return (num >> n) & 1; }
void chmax(ll &a, ll b) { a = max(a, b); }
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i <= 40; i++) {
for (int j = 0; j < 2; j++) {
dp[i][j] = MinInF;
}
}
dp[40][0] = 0;
for (int i = 39; i >= 0; i--) {
ll D = 1LL << i;
int num1 = 0;
for (int j = 0; j < N; j++)
if (nth_bit(A[j], i))
num1++;
int num0 = N - num1;
if (nth_bit(K, i)) {
chmax(dp[i][0], dp[i + 1][0] + D * num0);
chmax(dp[i][1], dp[i + 1][0] + D * num1);
} else {
chmax(dp[i][0], dp[i + 1][0] + D * num1);
}
chmax(dp[i][1], dp[i + 1][1] + D * max(num0, num1));
}
ll ans = max(dp[0][0], dp[0][1]);
cout << ans << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 939,122 | 939,123 | u258183816 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_r(i, n, m) for (int i = m; i < n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) \
for (auto itr : x) { \
debug(itr); \
}
template <class T> inline void chmax(T &ans, T t) {
if (t > ans)
ans = t;
}
template <class T> inline void chmin(T &ans, T t) {
if (t < ans)
ans = t;
}
ll dp[100][2]; // i桁, small or girigiri?
int main() {
constexpr int max_digit = 50;
ll n, k;
cin >> n >> k;
vector<ll> a(n);
memset(dp, -1, sizeof(dp));
rep(i, n) cin >> a[i];
dp[0][0] = 0;
for (int d = 0; d < max_digit; ++d) {
ll mask = 1LL << (max_digit - d - 1);
int num = 0;
rep(i, n) if (a[i] & mask)++ num;
ll cost0 = mask * num;
ll cost1 = mask * (n - num);
if (dp[d][1] != -1) {
dp[d + 1][1] = max(dp[d + 1][1], dp[d][1] + max(cost0, cost1));
}
if (dp[d][0] != -1) {
if (k & mask) {
dp[d + 1][1] = max(dp[d + 1][1], dp[d][1] + cost0);
}
}
if (dp[d][0] != -1) {
if (k & mask) {
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + cost1);
} else {
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + cost0);
}
}
}
cout << max(dp[max_digit][0], dp[max_digit][1]) << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_r(i, n, m) for (int i = m; i < n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) \
for (auto itr : x) { \
debug(itr); \
}
template <class T> inline void chmax(T &ans, T t) {
if (t > ans)
ans = t;
}
template <class T> inline void chmin(T &ans, T t) {
if (t < ans)
ans = t;
}
ll dp[100][2]; // i桁, small or girigiri?
int main() {
constexpr int max_digit = 50;
ll n, k;
cin >> n >> k;
vector<ll> a(n);
memset(dp, -1, sizeof(dp));
rep(i, n) cin >> a[i];
dp[0][0] = 0;
for (int d = 0; d < max_digit; ++d) {
ll mask = 1LL << (max_digit - d - 1);
int num = 0;
rep(i, n) if (a[i] & mask)++ num;
ll cost0 = mask * num;
ll cost1 = mask * (n - num);
if (dp[d][1] != -1) {
dp[d + 1][1] = max(dp[d + 1][1], dp[d][1] + max(cost0, cost1));
}
if (dp[d][0] != -1) {
if (k & mask) {
dp[d + 1][1] = max(dp[d + 1][1], dp[d][0] + cost0);
}
}
if (dp[d][0] != -1) {
if (k & mask) {
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + cost1);
} else {
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + cost0);
}
}
// cout << dp[d][0] << " " << dp[d][1] << endl;
}
cout << max(dp[max_digit][0], dp[max_digit][1]) << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,141 | 939,142 | u898749314 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
ll dp[100][2];
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
rep(i, 0, 50) {
ll mask = 1LL << (50 - i - 1);
int cnt = 0;
rep(j, 0, N) if (A[j] & mask) cnt++;
ll cost[2] = {mask * cnt, mask * (N - cnt)};
bool OK = (K & mask) ? 1 : 0;
rep(d, 0, 2) rep(p, 0, 2) {
if (dp[i][p] != -1)
chmax(dp[i + 1][p | (!d & OK)], dp[i][p] + cost[d & OK]);
}
}
cout << max(dp[50][0], dp[50][1]) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
ll dp[100][2];
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
rep(i, 0, 50) {
ll mask = 1LL << (50 - i - 1);
int cnt = 0;
rep(j, 0, N) if (A[j] & mask) cnt++;
ll cost[2] = {mask * cnt, mask * (N - cnt)};
bool OK = (K & mask) ? 1 : 0;
rep(d, 0, 2) rep(p, 0, 2) {
if (dp[i][p] != -1)
chmax(dp[i + 1][p | (!d & OK)], dp[i][p] + cost[p ? d : d & OK]);
}
}
cout << max(dp[50][0], dp[50][1]) << endl;
return 0;
}
| [] | 939,143 | 939,144 | u756388720 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<int> bits(40, 0);
rep(i, 40) rep(j, n) if (a.at(j) & ((int)1 << i)) bits.at(i)++;
int ans = 0;
k++;
for (int i = 39; i >= 0; i--) {
if (k & ((int)1 << i)) {
int sum = 0;
for (int j = 39; j > i; j--) {
if (k & ((int)1 << j))
sum += ((int)1 << j) * (n - bits.at(j));
else
sum += ((int)1 << j) * bits.at(j);
}
sum += ((int)1 << i) * bits.at(i);
for (int j = i - 1; j >= 0; j--) {
if (bits.at(i) >= (n + 1) / 2)
sum += ((int)1 << j) * bits.at(j);
else
sum += ((int)1 << j) * (n - bits.at(j));
}
chmax(ans, sum);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<int> bits(40, 0);
rep(i, 40) rep(j, n) if (a.at(j) & ((int)1 << i)) bits.at(i)++;
int ans = 0;
k++;
for (int i = 39; i >= 0; i--) {
if (k & ((int)1 << i)) {
int sum = 0;
for (int j = 39; j > i; j--) {
if (k & ((int)1 << j))
sum += ((int)1 << j) * (n - bits.at(j));
else
sum += ((int)1 << j) * bits.at(j);
}
sum += ((int)1 << i) * bits.at(i);
for (int j = i - 1; j >= 0; j--) {
if (bits.at(j) >= (n + 1) / 2)
sum += ((int)1 << j) * bits.at(j);
else
sum += ((int)1 << j) * (n - bits.at(j));
}
chmax(ans, sum);
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,151 | 939,152 | u807998890 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<int> bits(40, 0);
rep(i, 40) rep(j, n) if (a.at(j) & ((int)1 << i)) bits.at(i)++;
int ans = 0;
for (int i = 39; i >= 0; i--) {
if (k & ((int)1 << i)) {
int sum = 0;
for (int j = 39; j > i; j--) {
if (k & ((int)1 << j))
sum += ((int)1 << j) * (n - bits.at(j));
else
sum += ((int)1 << j) * bits.at(j);
}
sum += ((int)1 << i) * bits.at(i);
for (int j = i - 1; j >= 0; j--) {
if (bits.at(i) >= (n + 1) / 2)
sum += ((int)1 << j) * bits.at(j);
else
sum += ((int)1 << j) * (n - bits.at(j));
}
chmax(ans, sum);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<int> bits(40, 0);
rep(i, 40) rep(j, n) if (a.at(j) & ((int)1 << i)) bits.at(i)++;
int ans = 0;
k++;
for (int i = 39; i >= 0; i--) {
if (k & ((int)1 << i)) {
int sum = 0;
for (int j = 39; j > i; j--) {
if (k & ((int)1 << j))
sum += ((int)1 << j) * (n - bits.at(j));
else
sum += ((int)1 << j) * bits.at(j);
}
sum += ((int)1 << i) * bits.at(i);
for (int j = i - 1; j >= 0; j--) {
if (bits.at(j) >= (n + 1) / 2)
sum += ((int)1 << j) * bits.at(j);
else
sum += ((int)1 << j) * (n - bits.at(j));
}
chmax(ans, sum);
}
}
cout << ans << endl;
} | [
"expression.unary.arithmetic.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,153 | 939,152 | u807998890 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
long long arr[N];
int main() {
int n;
long long k;
cin >> n >> k;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
long long x = 0, res = 0;
for (int i = 40; i >= 0; i--) {
int a = 0;
for (int j = 1; j <= n; j++) {
if (arr[j] & (1LL << i)) {
a++;
}
}
if (x + (1LL << i) <= k && a < n / 2) {
x += (1LL << i);
res += 1LL * (n - a) * (1LL << i);
} else {
res += 1LL * a * (1LL << i);
}
}
cout << max(res, sum) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
long long arr[N];
int main() {
int n;
long long k;
cin >> n >> k;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
long long x = 0, res = 0;
for (int i = 40; i >= 0; i--) {
int a = 0;
for (int j = 1; j <= n; j++) {
if (arr[j] & (1LL << i)) {
a++;
}
}
if ((x + (1LL << i)) <= k && a < (n + 1) / 2) {
x += (1LL << i);
res += 1LL * (n - a) * (1LL << i);
} else {
res += 1LL * a * (1LL << i);
}
}
cout << max(res, sum) << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,154 | 939,155 | u792984973 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using lint = long long;
using namespace std;
const int DGT = 100;
lint N, K;
lint A[100010];
lint cnt[110][2];
lint Kbin[110];
lint dp[110][2];
lint rec(int dgt, int isless) {
if (dgt == -1)
return 0;
if (dp[dgt][isless] != -1)
return dp[dgt][isless];
lint ret = 0;
if (isless == 1) {
if (cnt[dgt][0] >= cnt[dgt][1])
ret = pow(2, dgt) * cnt[dgt][0] + max(rec(dgt - 1, 0), rec(dgt - 1, 1));
else
ret = pow(2, dgt) * cnt[dgt][1] + max(rec(dgt - 1, 0), rec(dgt - 1, 1));
} else {
if (cnt[dgt][0] >= cnt[dgt][1]) {
if (Kbin[dgt] == 0)
ret = pow(2, dgt) * cnt[dgt][0] + rec(dgt - 1, 0);
else
ret = pow(2, dgt) * cnt[dgt][0] + max(rec(dgt - 1, 0), rec(dgt - 1, 1));
} else {
if (Kbin[dgt] == 0)
ret = pow(2, dgt) * cnt[dgt][0] + rec(dgt - 1, 0);
else
ret = pow(2, dgt) * cnt[dgt][1] + rec(dgt - 1, 0);
}
}
dp[dgt][isless] = ret;
return ret;
}
lint solve(int n) {
lint ret = 0;
for (int i = 0; i < 40; i++) {
lint cost[2] = {};
cost[0] = pow(2, i) * cnt[i][0];
cost[1] = pow(2, i) * cnt[i][1];
if (i <= n) {
if (Kbin[n] == 1)
ret += max(cost[0], cost[1]);
else {
if (Kbin[i] == 1)
ret += max(cost[0], cost[1]);
else
ret += cost[0];
}
} else if (i == n) {
ret += cost[0];
} else {
if (Kbin[i] == 1)
ret += max(cost[0], cost[1]);
else
ret += cost[0];
}
}
return ret;
}
int main() {
for (int i = 0; i <= DGT; i++)
for (int j = 0; j < 2; j++)
dp[i][j] = -1;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
lint x = A[i];
for (int j = 0; j <= DGT; j++) {
cnt[j][1 - (x % 2)]++;
x /= 2;
}
}
for (int i = 0; i <= DGT; i++) {
Kbin[i] = K % 2;
K /= 2;
}
lint ans = 0;
for (int i = 0; i < N; i++)
ans += K ^ A[i];
for (int i = 0; i < 40; i++)
ans = max(ans, solve(i));
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using lint = long long;
using namespace std;
const int DGT = 100;
lint N, K;
lint A[100010];
lint cnt[110][2];
lint Kbin[110];
lint dp[110][2];
lint rec(int dgt, int isless) {
if (dgt == -1)
return 0;
if (dp[dgt][isless] != -1)
return dp[dgt][isless];
lint ret = 0;
if (isless == 1) {
if (cnt[dgt][0] >= cnt[dgt][1])
ret = pow(2, dgt) * cnt[dgt][0] + max(rec(dgt - 1, 0), rec(dgt - 1, 1));
else
ret = pow(2, dgt) * cnt[dgt][1] + max(rec(dgt - 1, 0), rec(dgt - 1, 1));
} else {
if (cnt[dgt][0] >= cnt[dgt][1]) {
if (Kbin[dgt] == 0)
ret = pow(2, dgt) * cnt[dgt][0] + rec(dgt - 1, 0);
else
ret = pow(2, dgt) * cnt[dgt][0] + max(rec(dgt - 1, 0), rec(dgt - 1, 1));
} else {
if (Kbin[dgt] == 0)
ret = pow(2, dgt) * cnt[dgt][0] + rec(dgt - 1, 0);
else
ret = pow(2, dgt) * cnt[dgt][1] + rec(dgt - 1, 0);
}
}
dp[dgt][isless] = ret;
return ret;
}
lint solve(int n) {
lint ret = 0;
for (int i = 0; i < 40; i++) {
lint cost[2] = {};
cost[0] = pow(2, i) * cnt[i][0];
cost[1] = pow(2, i) * cnt[i][1];
if (i < n) {
if (Kbin[n] == 1)
ret += max(cost[0], cost[1]);
else {
if (Kbin[i] == 1)
ret += max(cost[0], cost[1]);
else
ret += cost[0];
}
} else if (i == n) {
ret += cost[0];
} else {
if (Kbin[i] == 1)
ret += max(cost[0], cost[1]);
else
ret += cost[0];
}
}
return ret;
}
int main() {
for (int i = 0; i <= DGT; i++)
for (int j = 0; j < 2; j++)
dp[i][j] = -1;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
lint x = A[i];
for (int j = 0; j <= DGT; j++) {
cnt[j][1 - (x % 2)]++;
x /= 2;
}
}
for (int i = 0; i <= DGT; i++) {
Kbin[i] = K % 2;
K /= 2;
}
lint ans = 0;
for (int i = 0; i < N; i++)
ans += K ^ A[i];
for (int i = 0; i < 40; i++)
ans = max(ans, solve(i));
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,159 | 939,160 | u021423660 | cpp |
p03138 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vint;
typedef vector<string> vstr;
typedef pair<ll, ll> pint;
unsigned long long inf = (1LL << 62);
ll mod = 1000000007;
pint dx[4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
ll min(ll a, ll b) {
if (a < b)
return a;
return b;
}
ll max(ll a, ll b) {
if (a < b)
return b;
return a;
}
ll N, K;
vector<ll> A;
ll dp[51][2];
ll cnt[50][2];
int main() {
cin >> N >> K;
A.resize(N);
rep(i, N) {
cin >> A[i];
rep(j, 50) { cnt[j][((A[i] >> j) & 1LL)] += 1; }
}
for (int i = 49; i >= 0; i--) {
dp[i][0] = dp[i + 1][0] + (1LL << i) * cnt[i][!((K >> i) & 1LL)];
if ((1LL << i) < K) {
dp[i][1] = dp[i + 1][1] + (1LL << i) * max(cnt[i][0], cnt[i][1]);
}
if (((K >> i) & 1LL))
dp[i][1] = max(dp[i][1], dp[i + 1][0] + (1LL << i) * cnt[i][1]);
}
cout << max(dp[0][1], dp[0][0]) << endl;
return 0;
} |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vint;
typedef vector<string> vstr;
typedef pair<ll, ll> pint;
unsigned long long inf = (1LL << 62);
ll mod = 1000000007;
pint dx[4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
ll min(ll a, ll b) {
if (a < b)
return a;
return b;
}
ll max(ll a, ll b) {
if (a < b)
return b;
return a;
}
ll N, K;
vector<ll> A;
ll dp[51][2];
ll cnt[50][2];
int main() {
cin >> N >> K;
A.resize(N);
rep(i, N) {
cin >> A[i];
rep(j, 50) { cnt[j][((A[i] >> j) & 1LL)] += 1; }
}
for (int i = 49; i >= 0; i--) {
dp[i][0] = dp[i + 1][0] + (1LL << i) * cnt[i][!((K >> i) & 1LL)];
if ((1LL << (i + 1)) < K) {
dp[i][1] = dp[i + 1][1] + (1LL << i) * max(cnt[i][0], cnt[i][1]);
}
if (((K >> i) & 1LL))
dp[i][1] = max(dp[i][1], dp[i + 1][0] + (1LL << i) * cnt[i][1]);
}
cout << max(dp[0][1], dp[0][0]) << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,161 | 939,162 | u305138467 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<long long> a(n);
for (auto &i : a)
cin >> i;
long long v = 0, ans = 0;
for (int i = 60; i >= 0; i--) {
long long v1 = v + (1ll << i);
if (v1 <= k) {
int pc = 0;
for (int j = 0; j < n; j++)
if (a[j] & (1ll << i))
pc++;
if (pc > n / 2) {
v = v1;
}
}
}
for (auto &i : a)
ans += (i ^ v);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<long long> a(n);
for (auto &i : a)
cin >> i;
long long v = 0, ans = 0;
for (int i = 60; i >= 0; i--) {
long long v1 = v + (1ll << i);
if (v1 <= k) {
int pc = 0;
for (int j = 0; j < n; j++)
if (a[j] & (1ll << i))
pc++;
pc = n - pc;
if (pc > n / 2) {
v = v1;
}
}
}
for (auto &i : a)
ans += (i ^ v);
cout << ans << endl;
return 0;
}
| [
"assignment.add"
] | 939,163 | 939,164 | u251828455 | cpp |
p03138 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define FOR(x, xs) for (auto &x : xs)
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef vector<int> VI;
typedef vector<ll> VL;
template <class T, template <class, class> class C, class charT = char>
void vdump(const C<T, allocator<T>> &v, const charT *delimiter = ", ",
ostream &stream = cout) {
copy(v.begin(), v.end(), ostream_iterator<T>(stream, delimiter));
stream << endl;
}
int main() {
ios::sync_with_stdio(false);
int n;
ll k;
cin >> n >> k;
VL as(n);
FOR(a, as) { cin >> a; }
VI pop(40, 0);
FOR(a, as) {
REP(i, 0, 40) {
if ((a >> i) & 1) {
pop[i]++;
}
}
}
ll maxf = 0;
FOR(a, as) { maxf += a ^ k; }
REP(i, 0, 40) {
if (!(k >> i) & 1) {
continue;
}
ll f = 0;
REP(j, 0, 40) {
if (j < i) {
f += max(pop[j], n - pop[j]) * (1ll << j);
} else if (j == i) {
f += pop[j] * (1ll << j);
} else {
if ((k >> j) & 1) {
f += (n - pop[j]) * (1ll << j);
} else {
f += pop[j] * (1ll << j);
}
}
}
maxf = max(maxf, f);
}
cout << maxf << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define FOR(x, xs) for (auto &x : xs)
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef vector<int> VI;
typedef vector<ll> VL;
template <class T, template <class, class> class C, class charT = char>
void vdump(const C<T, allocator<T>> &v, const charT *delimiter = ", ",
ostream &stream = cout) {
copy(v.begin(), v.end(), ostream_iterator<T>(stream, delimiter));
stream << endl;
}
int main() {
ios::sync_with_stdio(false);
int n;
ll k;
cin >> n >> k;
VL as(n);
FOR(a, as) { cin >> a; }
VI pop(40, 0);
FOR(a, as) {
REP(i, 0, 40) {
if ((a >> i) & 1) {
pop[i]++;
}
}
}
ll maxf = 0;
FOR(a, as) { maxf += a ^ k; }
REP(i, 0, 40) {
if (!((k >> i) & 1)) {
continue;
}
ll f = 0;
REP(j, 0, 40) {
if (j < i) {
f += max(pop[j], n - pop[j]) * (1ll << j);
} else if (j == i) {
f += pop[j] * (1ll << j);
} else {
if ((k >> j) & 1) {
f += (n - pop[j]) * (1ll << j);
} else {
f += pop[j] * (1ll << j);
}
}
}
maxf = max(maxf, f);
}
cout << maxf << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 939,165 | 939,166 | u652683896 | cpp |
p03138 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define FOR(x, xs) for (auto &x : xs)
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef vector<int> VI;
typedef vector<ll> VL;
template <class T, template <class, class> class C, class charT = char>
void vdump(const C<T, allocator<T>> &v, const charT *delimiter = ", ",
ostream &stream = cout) {
copy(v.begin(), v.end(), ostream_iterator<T>(stream, delimiter));
stream << endl;
}
int main() {
ios::sync_with_stdio(false);
int n;
ll k;
cin >> n >> k;
VL as(n);
FOR(a, as) { cin >> a; }
VI pop(40, 0);
FOR(a, as) {
REP(i, 0, 40) {
if ((a >> i) & 1) {
pop[i]++;
}
}
}
ll maxf = 0;
FOR(a, as) { maxf += a ^ k; }
REP(i, 0, 41) {
if (!(k >> i) & 1) {
continue;
}
ll f = 0;
REP(j, 0, 41) {
if (j < i) {
f += max(pop[j], n - pop[j]) * (1ll << j);
} else if (j == i) {
f += pop[j] * (1ll << j);
} else {
if ((k >> j) & 1) {
f += (n - pop[j]) * (1ll << j);
} else {
f += pop[j] * (1ll << j);
}
}
}
maxf = max(maxf, f);
}
cout << maxf << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define FOR(x, xs) for (auto &x : xs)
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
typedef vector<int> VI;
typedef vector<ll> VL;
template <class T, template <class, class> class C, class charT = char>
void vdump(const C<T, allocator<T>> &v, const charT *delimiter = ", ",
ostream &stream = cout) {
copy(v.begin(), v.end(), ostream_iterator<T>(stream, delimiter));
stream << endl;
}
int main() {
ios::sync_with_stdio(false);
int n;
ll k;
cin >> n >> k;
VL as(n);
FOR(a, as) { cin >> a; }
VI pop(40, 0);
FOR(a, as) {
REP(i, 0, 40) {
if ((a >> i) & 1) {
pop[i]++;
}
}
}
ll maxf = 0;
FOR(a, as) { maxf += a ^ k; }
REP(i, 0, 40) {
if (!((k >> i) & 1)) {
continue;
}
ll f = 0;
REP(j, 0, 40) {
if (j < i) {
f += max(pop[j], n - pop[j]) * (1ll << j);
} else if (j == i) {
f += pop[j] * (1ll << j);
} else {
if ((k >> j) & 1) {
f += (n - pop[j]) * (1ll << j);
} else {
f += pop[j] * (1ll << j);
}
}
}
maxf = max(maxf, f);
}
cout << maxf << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 939,167 | 939,166 | u652683896 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll X = 0;
for (int i = 60; i >= 0; i--) {
int a = 0; // 0
int b = 0; // 1
ll p = 1LL << i;
if (X + p > K)
continue;
rep(j, N) {
if (A[i] & p)
b++;
else
a++;
}
if (a > b)
X += p;
}
ll ans = 0;
rep(i, N) ans += A[i] ^ X;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll X = 0;
for (int i = 60; i >= 0; i--) {
int a = 0; // 0
int b = 0; // 1
ll p = 1LL << i;
if (X + p > K)
continue;
rep(j, N) {
if (A[j] & p)
b++;
else
a++;
}
if (a > b)
X += p;
}
ll ans = 0;
rep(i, N) ans += A[i] ^ X;
cout << ans << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,170 | 939,171 | u267022560 | cpp |
p03138 | // https://atcoder.jp/contests/abc118/tasks/abc118_c
// http://ctylim.hatenablog.com/entry/2015/08/30/191553
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define ALL(a) (a).begin(), (a).end()
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define MAXINDEX(c) distance((c).begin(), max_element((c).begin(), (c).end()))
#define MININDEX(c) distance((c).begin(), min_element((c).begin(), (c).end()))
#define DEBUG(x) \
std::cerr << #x << " = " << (x) << " (" << __FILE__ << "::" << __LINE__ \
<< ")" << std::endl;
#define ERROR(s) \
std::cerr << "Error::" << __FILE__ << "::" << __LINE__ \
<< "::" << __FUNCTION__ << "::" << (s) << std::endl;
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
template <typename T> T inputValue() {
T a;
std::cin >> a;
// scanf("%d", &a);
return a;
}
void inputArray(int *p, int a) {
rep(i, a) {
std::cin >> p[i];
// scanf("%d",p+i);
}
}
template <typename T> void inputVector(std::vector<T> *p, int a) {
rep(i, a) {
T input;
std::cin >> input;
// scanf("%d", &input);
p->push_back(input);
}
}
template <typename T> void output(T a, int precision) {
if (precision > 0) {
std::cout << std::setprecision(precision) << a << "\n";
} else {
std::cout << a << "\n";
}
}
using namespace std;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
typedef unsigned long long int ulli;
int main(int argc, char **argv) {
ulli N = inputValue<ulli>();
ulli K = inputValue<ulli>();
vector<ulli> v;
inputVector<ulli>(&v, N);
// cout << N << "," << K << endl;
// cout<< "=---"<<endl;
// EACH(k, v) cout<<*k<<",";
// cout<<endl;
vector<int> bitSum(64, 0);
EACH(k, v) {
ulli t = *k;
for (int i = 0; i < 64 && t != 0; i++) {
bitSum[i] = bitSum[i] + (t & 1);
t = t >> 1;
}
}
ulli d = 0;
int flag = 0;
for (int i = 63; i >= 0; i--) {
ulli K_bit = (K >> i) & 1ll;
ulli A_bit = (bitSum[i] > K / 2 ? 0 : 1);
ulli D_bit;
if (!flag) {
D_bit = K_bit && A_bit;
flag = K_bit && (!A_bit);
} else {
D_bit = A_bit;
}
// cout << K_bit << "," << A_bit << "," << D_bit << ":"<< i<<endl;
d = (d << 1) | (D_bit);
// cout << K_bit << "," << A_bit << endl;
}
// cout<<"d," <<d<< endl;
ulli sum = 0;
EACH(k, v) { sum = sum + (*k ^ d); }
cout << sum << endl;
return 0;
}
// | // https://atcoder.jp/contests/abc118/tasks/abc118_c
// http://ctylim.hatenablog.com/entry/2015/08/30/191553
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define ALL(a) (a).begin(), (a).end()
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define MAXINDEX(c) distance((c).begin(), max_element((c).begin(), (c).end()))
#define MININDEX(c) distance((c).begin(), min_element((c).begin(), (c).end()))
#define DEBUG(x) \
std::cerr << #x << " = " << (x) << " (" << __FILE__ << "::" << __LINE__ \
<< ")" << std::endl;
#define ERROR(s) \
std::cerr << "Error::" << __FILE__ << "::" << __LINE__ \
<< "::" << __FUNCTION__ << "::" << (s) << std::endl;
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
template <typename T> T inputValue() {
T a;
std::cin >> a;
// scanf("%d", &a);
return a;
}
void inputArray(int *p, int a) {
rep(i, a) {
std::cin >> p[i];
// scanf("%d",p+i);
}
}
template <typename T> void inputVector(std::vector<T> *p, int a) {
rep(i, a) {
T input;
std::cin >> input;
// scanf("%d", &input);
p->push_back(input);
}
}
template <typename T> void output(T a, int precision) {
if (precision > 0) {
std::cout << std::setprecision(precision) << a << "\n";
} else {
std::cout << a << "\n";
}
}
using namespace std;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
typedef unsigned long long int ulli;
int main(int argc, char **argv) {
ulli N = inputValue<ulli>();
ulli K = inputValue<ulli>();
vector<ulli> v;
inputVector<ulli>(&v, N);
// cout << N << "," << K << endl;
// cout<< "----"<<endl;
// EACH(k, v) cout<<*k<<",";
// cout<<endl;
vector<int> bitSum(64, 0);
EACH(k, v) {
ulli t = *k;
for (int i = 0; i < 64 && t != 0; i++) {
bitSum[i] = bitSum[i] + (t & 1);
t = t >> 1;
}
}
ulli d = 0;
int flag = 0;
for (int i = 63; i >= 0; i--) {
ulli K_bit = (K >> i) & 1ll;
ulli A_bit = (bitSum[i] > N / 2 ? 0 : 1);
ulli D_bit;
if (!flag) {
D_bit = K_bit && A_bit;
flag = K_bit && (!A_bit);
} else {
D_bit = A_bit;
}
// cout << K_bit << "," << A_bit << "," << D_bit << ":"<< i<<endl;
d = (d << 1) | (D_bit);
}
// cout<<"d," <<d<< endl;
ulli sum = 0;
EACH(k, v) { sum = sum + (*k ^ d); }
cout << sum << endl;
return 0;
}
// | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 939,172 | 939,173 | u599617303 | cpp |
p03138 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPL(i, a, n) for (ll i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ENT "\n"
#define SRTVG(v) sort(v.begin(), v.end(), greater<>())
#define SRTV(v) sort(v.begin(), v.end())
#define SRTAG(a, n) sort(a, a + n, greater<>())
#define MOD 1000000007
#define INF INT_MAX / 2
#define int long long
typedef long long ll;
typedef tuple<int, int, bool> Tb;
typedef pair<int, int> Pii;
typedef vector<int> Vi;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> void YesNo(T &a) {
if (a) {
cout << "Yes" << ENT;
} else {
cout << "No" << ENT;
}
}
template <class T> void YESNO(T &a) {
if (a) {
cout << "YES" << ENT;
} else {
cout << "NO" << ENT;
}
}
int atcoder() {
int n, k;
cin >> n >> k;
Vi a(n);
REP(i, 0, n) cin >> a[i];
int x = 0, cnt = 0, ans = 0;
int mask;
for (mask = 1; mask < k; mask = mask << 1) {
REP(i, 0, n) if (mask & a[i]) cnt++;
if (cnt * 2 < n)
x += mask;
cnt = 0;
}
for (; mask != 0; mask = mask >> 1) {
if ((x & mask) && !(k & mask))
x -= mask;
else if (!(x & mask) && (k & mask))
break;
}
REP(i, 0, n) ans += x ^ a[i];
cout << ans << ENT;
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
atcoder();
return 0;
}
| #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPL(i, a, n) for (ll i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ENT "\n"
#define SRTVG(v) sort(v.begin(), v.end(), greater<>())
#define SRTV(v) sort(v.begin(), v.end())
#define SRTAG(a, n) sort(a, a + n, greater<>())
#define MOD 1000000007
#define INF INT_MAX / 2
#define int long long
typedef long long ll;
typedef tuple<int, int, bool> Tb;
typedef pair<int, int> Pii;
typedef vector<int> Vi;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> void YesNo(T &a) {
if (a) {
cout << "Yes" << ENT;
} else {
cout << "No" << ENT;
}
}
template <class T> void YESNO(T &a) {
if (a) {
cout << "YES" << ENT;
} else {
cout << "NO" << ENT;
}
}
int atcoder() {
int n, k;
cin >> n >> k;
Vi a(n);
REP(i, 0, n) cin >> a[i];
int x = 0, cnt = 0, ans = 0;
int mask;
for (mask = 1; mask <= k; mask = mask << 1) {
REP(i, 0, n) if (mask & a[i]) cnt++;
if (cnt * 2 < n)
x += mask;
cnt = 0;
}
for (; mask != 0; mask = mask >> 1) {
if ((x & mask) && !(k & mask))
x -= mask;
else if (!(x & mask) && (k & mask))
break;
}
REP(i, 0, n) ans += x ^ a[i];
cout << ans << ENT;
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
atcoder();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 939,186 | 939,187 | u635484372 | cpp |
p03138 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main() {
ll N, K;
cin >> N >> K;
ll A[N];
REP(i, N) cin >> A[i];
vector<ll> cnt(40, 0); //下からからi桁に1が何個有るか
REP(j, 40) {
REP(i, N)
if (A[i] >> j & i) {
cnt[j]++;
}
}
K++;
ll ans = 0;
REP(j, 40) {
if (K >> j & 1) {
// Kのj(0)桁目が1のとき
// Kのj(0)桁目を0としたときを考えることができる
ll tmp = 0;
// jbit目が０，j-1までは最適,j+1からはKと同じものを候補として計算する
REP(m, 40) {
if (m < j) {
//最適
tmp += (1LL << m) * max(cnt[m], N - cnt[m]);
} else if (m > j) {
tmp += (K >> m & 1) ? (1LL << m) * (N - cnt[m]) : (1LL << m) * cnt[m];
} else {
// jbit目
tmp += (1LL << m) * cnt[m];
}
}
if (ans < tmp)
ans = tmp;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main() {
ll N, K;
cin >> N >> K;
ll A[N];
REP(i, N) cin >> A[i];
vector<ll> cnt(40, 0); //下からからi桁に1が何個有るか
REP(j, 40) {
REP(i, N)
if (A[i] >> j & 1) {
cnt[j]++;
}
}
K++;
ll ans = 0;
REP(j, 40) {
if (K >> j & 1) {
// Kのj(0)桁目が1のとき
// Kのj(0)桁目を0としたときを考えることができる
ll tmp = 0;
// jbit目が０，j-1までは最適,j+1からはKと同じものを候補として計算する
REP(m, 40) {
if (m < j) {
//最適
tmp += (1LL << m) * max(cnt[m], N - cnt[m]);
} else if (m > j) {
tmp += (K >> m & 1) ? (1LL << m) * (N - cnt[m]) : (1LL << m) * cnt[m];
} else {
// jbit目
tmp += (1LL << m) * cnt[m];
}
}
if (ans < tmp)
ans = tmp;
}
}
cout << ans << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 939,191 | 939,192 | u824337972 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
using i32 = int_fast32_t;
using ui32 = uint_fast32_t;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using ll = i64;
using pi = pair<i32, i32>;
using pll = pair<i64, i64>;
using vi = vector<i32>;
using vll = vector<i64>;
int Main() {
int N;
ll K;
cin >> N >> K;
vll A(N);
for (auto &a : A)
cin >> a;
ll X = 0;
for (int i = 40; i >= 0; i--) {
int c = 0;
for (auto a : A)
if ((a >> i) & 1)
c++;
if (c * 2 > N && X + (1LL << i) <= K)
X += 1LL << i;
}
for (auto &a : A)
a ^= X;
cout << accumulate(all(A), 0LL) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
using i32 = int_fast32_t;
using ui32 = uint_fast32_t;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using ll = i64;
using pi = pair<i32, i32>;
using pll = pair<i64, i64>;
using vi = vector<i32>;
using vll = vector<i64>;
int Main() {
int N;
ll K;
cin >> N >> K;
vll A(N);
for (auto &a : A)
cin >> a;
ll X = 0;
for (int i = 40; i >= 0; i--) {
int c = 0;
for (auto a : A)
if ((a >> i) & 1)
c++;
if (c * 2 < N && X + (1LL << i) <= K)
X += 1LL << i;
}
for (auto &a : A)
a ^= X;
cout << accumulate(all(A), 0LL) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,197 | 939,198 | u572532976 | cpp |
p03138 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
long long int calc(long long int K, vector<long long int> &A) {
long long int N = A.size();
long long int mult = 1;
long long int ans = 0;
for (int i = 0; i < 42; i++) {
long long int count = 0;
for (int j = 0; j < N; j++) {
if ((A[j] & mult) > 0) {
count++;
}
}
if ((K & mult) > 0) {
ans += mult * max(count, N - count);
} else {
ans += mult * count;
}
mult <<= 1;
}
return ans;
}
int main() {
long long int N, K;
cin >> N >> K;
vector<long long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long int mult = 1;
long long int best = calc(K, A);
while (K >= mult) {
if ((best & mult) == 0) {
K -= mult;
best = max(best, calc(K, A));
}
mult <<= 1;
}
cout << best << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
long long int calc(long long int K, vector<long long int> &A) {
long long int N = A.size();
long long int mult = 1;
long long int ans = 0;
for (int i = 0; i < 42; i++) {
long long int count = 0;
for (int j = 0; j < N; j++) {
if ((A[j] & mult) > 0) {
count++;
}
}
if ((K & mult) > 0) {
ans += mult * max(count, N - count);
} else {
ans += mult * count;
}
mult <<= 1;
}
return ans;
}
int main() {
long long int N, K;
cin >> N >> K;
vector<long long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long int mult = 1;
long long int best = calc(K, A);
while (K >= mult) {
if ((K & mult) == 0) {
K -= mult;
best = max(best, calc(K, A));
}
mult <<= 1;
}
cout << best << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,199 | 939,200 | u727099903 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
void chmax(int64_t &a, int64_t b) { a = max(a, b); }
int main() {
int N;
int64_t K, A[100000];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
int64_t dp[41][2];
for (int d = 40; d >= 0; d--)
for (int j = 0; j < 2; j++)
dp[d][j] = -1e18;
dp[40][0] = 0;
for (int d = 39; d >= 0; d--) {
int64_t D = 1LL << d;
int num1 = 0;
for (int i = 0; i < N; i++)
if (A[i] & d)
num1++;
int num0 = N - num1;
if (K & d) {
chmax(dp[d][0], dp[d + 1][0] + D * num0);
chmax(dp[d][1], dp[d + 1][0] + D * num1);
} else {
chmax(dp[d][0], dp[d + 1][0] + D * num1);
}
chmax(dp[d][1], dp[d + 1][1] + D * max(num0, num1));
}
int64_t ans = max(dp[0][0], dp[0][1]);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void chmax(int64_t &a, int64_t b) { a = max(a, b); }
int main() {
int N;
int64_t K, A[100000];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
int64_t dp[41][2];
for (int d = 40; d >= 0; d--)
for (int j = 0; j < 2; j++)
dp[d][j] = -1e18;
dp[40][0] = 0;
for (int d = 39; d >= 0; d--) {
int64_t D = 1LL << d;
int num1 = 0;
for (int i = 0; i < N; i++)
if (A[i] & D)
num1++;
int num0 = N - num1;
if (K & D) {
chmax(dp[d][0], dp[d + 1][0] + D * num0);
chmax(dp[d][1], dp[d + 1][0] + D * num1);
} else {
chmax(dp[d][0], dp[d + 1][0] + D * num1);
}
chmax(dp[d][1], dp[d + 1][1] + D * max(num0, num1));
}
int64_t ans = max(dp[0][0], dp[0][1]);
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 939,208 | 939,209 | u943004959 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define INF (1 << 30)
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
ll res = 0;
for (int d = 60; d >= -1; d--) {
// d桁目について、Kが１でなければcontinue
if (d != -1 && (K & (1LL << d)))
continue;
ll tmp = 0;
for (int e = 60; e >= 0; e--) {
// mask : e番目のビットだけ立たせたもの
ll mask = 1LL << e;
// num : 1が立っている数
int num = 0;
for (int i = 0; i < N; i++)
if (A[i] & mask)
num++;
// dより上位の桁はKと合わせる
if (e > d) {
// Kの e 桁目が１なら１、０なら０
if (K & mask)
tmp += mask * (N - num);
else
tmp += mask * num;
}
// d桁目は０とする
else if (e == d) {
tmp += mask * num;
}
// dより下位の桁については、Greedy
else {
// 多い方に合わせる
tmp += mask * max(num, N - num);
}
}
res = max(res, tmp);
}
cout << res << endl;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define INF (1 << 30)
int main() {
ll N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
ll res = 0;
for (ll d = 60; d >= -1; d--) {
// d桁目について、Kが１でなければcontinue
if (d != -1 && !(K & (1LL << d)))
continue;
ll tmp = 0;
for (ll e = 60; e >= 0; e--) {
// mask : e番目のビットだけ立たせたもの
ll mask = 1LL << e;
// num : 1が立っている数
ll num = 0;
for (ll i = 0; i < N; i++)
if (A[i] & mask)
num++;
// dより上位の桁はKと合わせる
if (e > d) {
// Kの e 桁目が１なら１、０なら０
if (K & mask)
tmp += mask * (N - num);
else
tmp += mask * num;
}
// d桁目は０とする
else if (e == d) {
tmp += mask * num;
}
// dより下位の桁については、Greedy
else {
// 多い方に合わせる
tmp += mask * max(num, N - num);
}
}
res = max(res, tmp);
}
cout << res << endl;
}
| [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 939,210 | 939,211 | u672541593 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define N_MAX 100005
typedef long long ll;
ll n, k, a[N_MAX];
ll l;
vector<int> ks, best; // ks : Kを2進数表記, best : 最適解
ll len(ll K) {
// Kを２進数表記したときの桁数
ll cnt = 1;
while (K >= 2) {
K /= 2;
cnt++;
}
return cnt;
}
ll f(ll x) {
// f(x)を計算する O(n)
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += x ^ a[i];
}
return ans;
}
ll make(ll i) {
// l-1 ~ i+1 bitはks
// iは0
// i-1 ~ 0 bitはbest
ll ans = 0;
for (ll j = 0; j < i; j++) {
if (best[j]) {
ans |= (1ll << j);
}
}
for (ll j = i + 1; j < l; j++) {
if (ks[j]) {
ans |= (1ll << j);
}
}
return ans;
}
int main() {
cin >> n >> k;
l = len(k);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < l; i++) { // iは桁数を表す
int cnt0 = 0, cnt1 = 0;
for (ll j = 0; j < n; j++) { // jはa配列のどれを巡っているかを表す
if (a[j] & (1ll >> i)) {
cnt1++;
} else {
cnt0++;
}
}
if (cnt1 >= cnt0) {
best.push_back(0);
} else {
best.push_back(1);
}
}
for (ll i = 0; i < l; i++) {
ks.push_back(k & (1ll >> i));
}
// rep(i, (int)ks.size()) {
// cout << ks[i];
// }
// cout << endl;
// K以下で最適解探す
ll ma = f(k);
for (ll i = 0; i < l; i++) {
if (ks[i]) {
ma = max(ma, f(make(i)));
}
}
cout << ma << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define N_MAX 100005
typedef long long ll;
ll n, k, a[N_MAX];
ll l;
vector<ll> ks, best; // ks : Kを2進数表記, best : 最適解
ll len(ll K) {
// Kを２進数表記したときの桁数
int cnt = 1;
while (K >= 2) {
K /= 2;
cnt++;
}
return cnt;
}
ll f(ll x) {
// f(x)を計算する O(n)
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += x ^ a[i];
}
return ans;
}
ll make(ll i) {
// l-1 ~ i+1 bitはks
// iは0 (書く必要はない)
// i-1 ~ 0 bitはbest
ll ans = 0;
for (ll j = 0; j < i; j++) {
if (best[j]) {
ans |= (1ll << j);
}
}
for (ll j = i + 1; j < l; j++) {
if (ks[j]) {
ans |= (1ll << j);
}
}
return ans;
}
int main() {
cin >> n >> k;
l = len(k);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < l; i++) { // iは桁数を表す
int cnt0 = 0, cnt1 = 0;
for (ll j = 0; j < n; j++) { // jはa配列のどれを巡っているかを表す
if (a[j] & (1ll << i)) {
cnt1++;
} else {
cnt0++;
}
}
if (cnt1 >= cnt0) {
best.push_back(0);
} else {
best.push_back(1);
}
}
for (ll i = 0; i < l; i++) {
ks.push_back(k & (1ll << i));
}
// rep(i, (int)ks.size()) {
// cout << ks[i];
// }
// cout << endl;
// K以下で最適解探す
ll ma = f(k);
for (ll i = 0; i < l; i++) {
if (ks[i]) {
ma = max(ma, f(make(i)));
}
}
cout << ma << endl;
}
| [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,215 | 939,216 | u320267096 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
ll K;
cin >> N >> K;
ll A[100001];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bitset<60> master;
bitset<60> B;
bitset<60> temp_bit;
master = K;
ll out = 0;
int memo[60];
for (int i = 0; i < N; i++) {
memo[i] = -1;
}
for (int idx = 59; idx >= 0; idx--) {
if (master[idx] == 0) {
continue;
}
B = master;
B[idx] = 0;
for (int bit_cnt = 0; bit_cnt < idx; bit_cnt++) {
int cnt = 0;
if (memo[bit_cnt] != -1) {
cnt = memo[bit_cnt];
} else {
for (int i = 0; i < N; i++) {
temp_bit = A[i];
if (temp_bit[bit_cnt] == 1) {
cnt++;
}
}
memo[bit_cnt] = cnt;
}
if (cnt > (N - cnt)) {
B[bit_cnt] = 0;
} else {
B[bit_cnt] = 1;
}
}
ll X = ll(B.to_ullong());
ll temp = 0;
for (int i = 0; i < N; i++) {
temp += ll(A[i] ^ X);
}
chmax(out, temp);
}
ll X = K;
ll temp = 0;
for (int i = 0; i < N; i++) {
temp += ll(A[i] ^ X);
}
chmax(out, temp);
if (K == 0) {
ll X = 0;
ll temp = 0;
for (int i = 0; i < N; i++) {
temp += ll(A[i] ^ X);
}
out = temp;
}
cout << out;
// system("pause");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
ll K;
cin >> N >> K;
ll A[100001];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bitset<60> master;
bitset<60> B;
bitset<60> temp_bit;
master = K;
ll out = 0;
int memo[60];
for (int i = 0; i < 60; i++) {
memo[i] = -1;
}
for (int idx = 59; idx >= 0; idx--) {
if (master[idx] == 0) {
continue;
}
B = master;
B[idx] = 0;
for (int bit_cnt = 0; bit_cnt < idx; bit_cnt++) {
int cnt = 0;
if (memo[bit_cnt] != -1) {
cnt = memo[bit_cnt];
} else {
for (int i = 0; i < N; i++) {
temp_bit = A[i];
if (temp_bit[bit_cnt] == 1) {
cnt++;
}
}
memo[bit_cnt] = cnt;
}
if (cnt > (N - cnt)) {
B[bit_cnt] = 0;
} else {
B[bit_cnt] = 1;
}
}
ll X = ll(B.to_ullong());
ll temp = 0;
for (int i = 0; i < N; i++) {
temp += ll(A[i] ^ X);
}
chmax(out, temp);
}
ll X = K;
ll temp = 0;
for (int i = 0; i < N; i++) {
temp += ll(A[i] ^ X);
}
chmax(out, temp);
if (K == 0) {
ll X = 0;
ll temp = 0;
for (int i = 0; i < N; i++) {
temp += ll(A[i] ^ X);
}
out = temp;
}
cout << out;
// system("pause");
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 939,225 | 939,226 | u913836622 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que = queue<T>;
template <class T> using pque = priority_queue<T>;
template <class... T> using tup = tuple<T...>;
using vint = vec<int>;
using vvint = vvec<int>;
using vstr = vec<str>;
using pint = pair<int, int>;
using vp = vec<pint>;
using tll = tup<int, int, int>;
using vt = vec<tll>;
using mint = map<int, int>;
using dict = map<str, int>;
using qint = que<int>;
using qp = que<pint>;
using pqint = pque<int>;
using pqp = pque<pint>;
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define fir first
#define sec second
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define ms(v, x) memset(v, x, sizeof(v))
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload3(__VA_ARGS__, revi, _rev, )(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
#define out(x) cout << (x)
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define debug(x) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) print((x) ? "YES" : "NO")
#define Yn(x) print((x) ? "Yes" : "No")
#define yn(x) print((x) ? "yes" : "no")
#define POS(x) print((x) ? "POSSIBLE" : "IMPOSSIBLE")
#define Pos(x) print((x) ? "Possible" : "Impossible")
#define pos(x) print((x) ? "possible" : "impossible")
const int INF = LLONG_MAX - INT_MAX, MOD = 1e9 + 7, LIMIT = 100001;
const int dx4[] = {-1, 0, 1, 0}, dy4[] = {0, -1, 0, 1};
const int dx8[] = {-1, 0, 1, -1, 1, -1, 0, 1},
dy8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const double EPS = 1e-9;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) res *= n--, res /= i;
return res;
}
const str alphabet = "abcdefghijklmnopqrstuvwxyz";
int a, b, c, k, n, m, x, y, z, w, h, res = 0, cnt = 0, sum = 0, mx = -INF,
mn = INF;
str s, t;
bool flag = true;
signed main() {
incant();
cin >> n >> k;
int v[n];
each(i, v) { cin >> i; }
rev(i, 41) {
cnt = 0;
each(j, v) { cnt += j >> i & 1; }
if (2 * cnt < n && (res | (1LL << i) <= k)) {
res |= 1LL << i;
}
}
each(i, v) { sum += i ^ res; }
print(sum);
}
| #include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que = queue<T>;
template <class T> using pque = priority_queue<T>;
template <class... T> using tup = tuple<T...>;
using vint = vec<int>;
using vvint = vvec<int>;
using vstr = vec<str>;
using pint = pair<int, int>;
using vp = vec<pint>;
using tll = tup<int, int, int>;
using vt = vec<tll>;
using mint = map<int, int>;
using dict = map<str, int>;
using qint = que<int>;
using qp = que<pint>;
using pqint = pque<int>;
using pqp = pque<pint>;
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define fir first
#define sec second
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define ms(v, x) memset(v, x, sizeof(v))
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload3(__VA_ARGS__, revi, _rev, )(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
#define out(x) cout << (x)
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define debug(x) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) print((x) ? "YES" : "NO")
#define Yn(x) print((x) ? "Yes" : "No")
#define yn(x) print((x) ? "yes" : "no")
#define POS(x) print((x) ? "POSSIBLE" : "IMPOSSIBLE")
#define Pos(x) print((x) ? "Possible" : "Impossible")
#define pos(x) print((x) ? "possible" : "impossible")
const int INF = LLONG_MAX - INT_MAX, MOD = 1e9 + 7, LIMIT = 100001;
const int dx4[] = {-1, 0, 1, 0}, dy4[] = {0, -1, 0, 1};
const int dx8[] = {-1, 0, 1, -1, 1, -1, 0, 1},
dy8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const double EPS = 1e-9;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) res *= n--, res /= i;
return res;
}
const str alphabet = "abcdefghijklmnopqrstuvwxyz";
int a, b, c, k, n, m, x, y, z, w, h, res = 0, cnt = 0, sum = 0, mx = -INF,
mn = INF;
str s, t;
bool flag = true;
signed main() {
incant();
cin >> n >> k;
int v[n];
each(i, v) { cin >> i; }
rev(i, 41) {
cnt = 0;
each(j, v) { cnt += j >> i & 1; }
if (2 * cnt < n && (res | (1LL << i)) <= k) {
res |= 1LL << i;
}
}
each(i, v) { sum += i ^ res; }
print(sum);
}
| [
"control_flow.branch.if.condition.change"
] | 939,227 | 939,228 | u303059352 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que = queue<T>;
template <class T> using pque = priority_queue<T>;
template <class... T> using tup = tuple<T...>;
using vint = vec<int>;
using vvint = vvec<int>;
using vstr = vec<str>;
using pint = pair<int, int>;
using vp = vec<pint>;
using tll = tup<int, int, int>;
using vt = vec<tll>;
using mint = map<int, int>;
using dict = map<str, int>;
using qint = que<int>;
using qp = que<pint>;
using pqint = pque<int>;
using pqp = pque<pint>;
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define fir first
#define sec second
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define ms(v, x) memset(v, x, sizeof(v))
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload3(__VA_ARGS__, revi, _rev, )(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
#define out(x) cout << (x)
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define debug(x) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) print((x) ? "YES" : "NO")
#define Yn(x) print((x) ? "Yes" : "No")
#define yn(x) print((x) ? "yes" : "no")
#define POS(x) print((x) ? "POSSIBLE" : "IMPOSSIBLE")
#define Pos(x) print((x) ? "Possible" : "Impossible")
#define pos(x) print((x) ? "possible" : "impossible")
const int INF = LLONG_MAX - INT_MAX, MOD = 1e9 + 7, LIMIT = 100001;
const int dx4[] = {-1, 0, 1, 0}, dy4[] = {0, -1, 0, 1};
const int dx8[] = {-1, 0, 1, -1, 1, -1, 0, 1},
dy8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const double EPS = 1e-9;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) res *= n--, res /= i;
return res;
}
const str alphabet = "abcdefghijklmnopqrstuvwxyz";
int a, b, c, k, n, m, x, y, z, w, h, res = 0, cnt = 0, sum = 0, mx = -INF,
mn = INF;
str s, t;
bool flag = true;
signed main() {
incant();
cin >> n >> k;
int v[n];
each(i, v) { cin >> i; }
rev(i, 41) {
cnt = 0;
each(j, v) { cnt += (j >> i) & 1; }
if (2 * cnt < n && res | (1LL << i) <= k) {
res |= 1LL << i;
}
}
each(i, v) { sum += i ^ res; }
print(sum);
}
| #include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que = queue<T>;
template <class T> using pque = priority_queue<T>;
template <class... T> using tup = tuple<T...>;
using vint = vec<int>;
using vvint = vvec<int>;
using vstr = vec<str>;
using pint = pair<int, int>;
using vp = vec<pint>;
using tll = tup<int, int, int>;
using vt = vec<tll>;
using mint = map<int, int>;
using dict = map<str, int>;
using qint = que<int>;
using qp = que<pint>;
using pqint = pque<int>;
using pqp = pque<pint>;
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define fir first
#define sec second
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define ms(v, x) memset(v, x, sizeof(v))
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload3(__VA_ARGS__, revi, _rev, )(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
#define out(x) cout << (x)
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define debug(x) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) print((x) ? "YES" : "NO")
#define Yn(x) print((x) ? "Yes" : "No")
#define yn(x) print((x) ? "yes" : "no")
#define POS(x) print((x) ? "POSSIBLE" : "IMPOSSIBLE")
#define Pos(x) print((x) ? "Possible" : "Impossible")
#define pos(x) print((x) ? "possible" : "impossible")
const int INF = LLONG_MAX - INT_MAX, MOD = 1e9 + 7, LIMIT = 100001;
const int dx4[] = {-1, 0, 1, 0}, dy4[] = {0, -1, 0, 1};
const int dx8[] = {-1, 0, 1, -1, 1, -1, 0, 1},
dy8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const double EPS = 1e-9;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) res *= n--, res /= i;
return res;
}
const str alphabet = "abcdefghijklmnopqrstuvwxyz";
int a, b, c, k, n, m, x, y, z, w, h, res = 0, cnt = 0, sum = 0, mx = -INF,
mn = INF;
str s, t;
bool flag = true;
signed main() {
incant();
cin >> n >> k;
int v[n];
each(i, v) { cin >> i; }
rev(i, 41) {
cnt = 0;
each(j, v) { cnt += j >> i & 1; }
if (2 * cnt < n && (res | (1LL << i)) <= k) {
res |= 1LL << i;
}
}
each(i, v) { sum += i ^ res; }
print(sum);
}
| [
"control_flow.branch.if.condition.change"
] | 939,229 | 939,228 | u303059352 | cpp |
p03138 | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll, int> pii;
typedef vector<ll> VL;
const int MD = (int)1e9 + 7;
void dbg() { cerr << "\n"; }
template <typename T, typename... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
template <class T, class T2> void amax(T &a, T2 b) {
if (a < b)
a = b;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
ll k;
cin >> n >> k;
VL a(n);
rep(i, n) cin >> a[i];
VI z(42);
rep(i, 42) { rep(j, n) z[i] += a[j] >> i & 1; }
ll sp = 0;
rep(i, 42) {
if (z[i] < (n + 1) / 2 && sp + (1LL << i) <= k)
sp += 1LL << i;
}
ll ans = 0;
rep(i, n) ans += sp ^ a[i];
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll, int> pii;
typedef vector<ll> VL;
const int MD = (int)1e9 + 7;
void dbg() { cerr << "\n"; }
template <typename T, typename... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
template <class T, class T2> void amax(T &a, T2 b) {
if (a < b)
a = b;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
ll k;
cin >> n >> k;
VL a(n);
rep(i, n) cin >> a[i];
VI z(42);
rep(i, 42) { rep(j, n) z[i] += a[j] >> i & 1; }
ll sp = 0;
repr(i, 41, 0) {
if (z[i] < (n + 1) / 2 && sp + (1LL << i) <= k)
sp += 1LL << i;
}
ll ans = 0;
rep(i, n) ans += sp ^ a[i];
cout << ans << "\n";
return 0;
}
| [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"call.arguments.add"
] | 939,246 | 939,247 | u714564133 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <math.h>
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fo(i, n) for (ll i = 0; i < n; i++)
#define sz(a) ll((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (auto i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define dbg(x) cout << #x << " = " << x << endl
#define dbg2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define dbg3(x, y, z) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl
#define dbg4(x, y, z, q) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << ", " << #q << " = " << q << endl
#define scan(char_array) scanf("%[^\n]s", &char_array);
ll n, k;
ll cnt[40];
ll fu(ll bit) {
if (bit < 0)
return 0;
ll tmp1 = 0;
ll tmp2 = 0;
if (!((ll)k & ((ll)1 << bit))) {
tmp1 += ((ll)1 << bit) * cnt[bit];
tmp1 += fu(bit - 1);
} else {
FOR(i, 0, bit - 1) { tmp1 += ((ll)1 << i) * max(cnt[i], n - cnt[i]); }
tmp1 += ((ll)1 << bit) * (cnt[bit]);
tmp2 += ((ll)1 << bit) * (n - cnt[bit]);
tmp2 += fu(bit - 1);
}
// dbg3(bit,tmp1,tmp2);
return max(tmp1, tmp2);
}
int main() {
cin >> n >> k;
std::vector<ll> a(n);
fo(i, n) cin >> a[i];
fo(i, 40) cnt[i] = 0;
fo(i, n) {
fo(j, 40) {
if (((ll)1 << j & a[i]))
cnt[j]++;
}
}
ll ans = fu(5);
// dbg(cnt[0]);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <math.h>
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fo(i, n) for (ll i = 0; i < n; i++)
#define sz(a) ll((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (auto i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define dbg(x) cout << #x << " = " << x << endl
#define dbg2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define dbg3(x, y, z) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl
#define dbg4(x, y, z, q) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << ", " << #q << " = " << q << endl
#define scan(char_array) scanf("%[^\n]s", &char_array);
ll n, k;
ll cnt[40];
ll fu(ll bit) {
if (bit < 0)
return 0;
ll tmp1 = 0;
ll tmp2 = 0;
if (!((ll)k & ((ll)1 << bit))) {
tmp1 += ((ll)1 << bit) * cnt[bit];
tmp1 += fu(bit - 1);
} else {
FOR(i, 0, bit - 1) { tmp1 += ((ll)1 << i) * max(cnt[i], n - cnt[i]); }
tmp1 += ((ll)1 << bit) * (cnt[bit]);
tmp2 += ((ll)1 << bit) * (n - cnt[bit]);
tmp2 += fu(bit - 1);
}
// dbg3(bit,tmp1,tmp2);
return max(tmp1, tmp2);
}
int main() {
cin >> n >> k;
std::vector<ll> a(n);
fo(i, n) cin >> a[i];
fo(i, 40) cnt[i] = 0;
fo(i, n) {
fo(j, 40) {
if (((ll)1 << j & a[i]))
cnt[j]++;
}
}
ll ans = fu(39);
// dbg(cnt[0]);
cout << ans << endl;
}
| [
"literal.number.change",
"call.arguments.change"
] | 939,253 | 939,252 | u866529295 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
#define mp make_pair
#define _GLIBCXX_DEBUG
const int INF = 1e15;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const int MAX_DIGIT = 50;
vector<vector<int>> dp(100, vector<int>(2, -1));
signed main() {
int N, K;
cin >> N >> K;
int A[N];
REP(i, N) cin >> A[i];
dp[0][0] = 0;
REP(d, MAX_DIGIT) {
int mask = 1 << (MAX_DIGIT - d - 1);
int num = 0;
for (int i = 0; i < N; i++) {
if (A[i] & mask)
num++;
}
int cost0 = mask * num;
int cost1 = mask * (N - num);
if (dp[d][1] != -1) {
chmax(dp[d + 1][1], dp[d][1] + max(cost0, cost1));
}
if (dp[d][0] != -1) {
if (K & mask) {
chmax(dp[d + 1][1], dp[d][0] + cost0);
}
}
if (dp[d][0] != -1) {
if (K & mask)
chmax(dp[d + 1][0], dp[d][0] + cost1);
else
chmax(dp[d + 1][0], dp[d][0] + cost0);
}
}
cout << max(dp[MAX_DIGIT][0], dp[MAX_DIGIT][1]) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
#define mp make_pair
#define _GLIBCXX_DEBUG
const int INF = 1e15;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const int MAX_DIGIT = 50;
vector<vector<int>> dp(100, vector<int>(2, -1));
signed main() {
int N, K;
cin >> N >> K;
int A[N];
REP(i, N) cin >> A[i];
dp[0][0] = 0;
REP(d, MAX_DIGIT) {
int mask = 1ll << (MAX_DIGIT - d - 1);
int num = 0;
for (int i = 0; i < N; i++) {
if (A[i] & mask)
num++;
}
int cost0 = mask * num;
int cost1 = mask * (N - num);
if (dp[d][1] != -1) {
chmax(dp[d + 1][1], dp[d][1] + max(cost0, cost1));
}
if (dp[d][0] != -1) {
if (K & mask) {
chmax(dp[d + 1][1], dp[d][0] + cost0);
}
}
if (dp[d][0] != -1) {
if (K & mask)
chmax(dp[d + 1][0], dp[d][0] + cost1);
else
chmax(dp[d + 1][0], dp[d][0] + cost0);
}
}
cout << max(dp[MAX_DIGIT][0], dp[MAX_DIGIT][1]) << endl;
} | [] | 939,254 | 939,255 | u342075214 | cpp |
p03138 | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int num[40];
ll a[N];
int main() {
int n;
ll k;
scanf("%d %lld", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
}
for (int i = 0; i <= 39; ++i) {
for (int j = 1; j <= n; ++j) {
if ((a[j] >> i) & 1) {
++num[i];
}
}
}
ll ret = 0, ans = 0;
for (int i = 39; i >= 0; --i) {
if ((ret | (1LL << i)) >= k) {
ans += (ll)num[i] * (1LL << i);
} else {
ans += (ll)max(num[i], n - num[i]) * (1LL << i);
if (n - num[i] > num[i])
ret += (1LL << i);
}
}
printf("%lld\n", ans);
return 0;
} | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int num[40];
ll a[N];
int main() {
int n;
ll k;
scanf("%d %lld", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
}
for (int i = 0; i <= 39; ++i) {
for (int j = 1; j <= n; ++j) {
if ((a[j] >> i) & 1) {
++num[i];
}
}
}
ll ret = 0, ans = 0;
for (int i = 39; i >= 0; --i) {
if ((ret | (1LL << i)) > k) {
ans += (ll)num[i] * (1LL << i);
} else {
ans += (ll)max(num[i], n - num[i]) * (1LL << i);
if (n - num[i] > num[i])
ret += (1LL << i);
}
}
printf("%lld\n", ans);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,258 | 939,259 | u863370423 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
LL n, k;
cin >> n >> k;
vector<LL> a(n);
REP(i, n) cin >> a[i];
LL x = 0;
for (int i = 40; i >= 0; i--) {
if ((x | (1LL << i)) >= k)
continue;
int cnt = 0;
REP(j, n) {
if ((a[j] >> i) & 1)
cnt++;
}
if (cnt * 2 < n)
x |= (1LL << i);
}
LL ans = 0;
REP(i, n) { ans += (a[i] ^ x); }
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
LL n, k;
cin >> n >> k;
vector<LL> a(n);
REP(i, n) cin >> a[i];
LL x = 0;
for (int i = 40; i >= 0; i--) {
if ((x | (1LL << i)) > k)
continue;
int cnt = 0;
REP(j, n) {
if ((a[j] >> i) & 1)
cnt++;
}
if (cnt * 2 < n)
x |= (1LL << i);
}
LL ans = 0;
REP(i, n) { ans += (a[i] ^ x); }
cout << ans << '\n';
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,260 | 939,261 | u385825353 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
ll N, K;
ll A[100000];
int main() {
cin >> N >> K;
rep(i, N) cin >> A[i];
ll one[40];
rep(i, 40) one[i] = 0;
for (ll i = 0; i < 40; i++) {
rep(j, N) {
if (A[j] >> i & 1)
one[i]++;
}
}
ll ans = 0;
for (ll i = 39; i >= 0; i--) {
if (one[i] < N - one[i] && K - ((ll)1 << i) > 0) {
ans += ((ll)1 << i) * (N - one[i]);
K -= ((ll)1 << i);
} else {
ans += ((ll)1 << i) * one[i];
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
ll N, K;
ll A[100000];
int main() {
cin >> N >> K;
rep(i, N) cin >> A[i];
ll one[40];
rep(i, 40) one[i] = 0;
for (ll i = 0; i < 40; i++) {
rep(j, N) {
if (A[j] >> i & 1)
one[i]++;
}
}
ll ans = 0;
for (ll i = 39; i >= 0; i--) {
if (one[i] < N - one[i] && K - ((ll)1 << i) >= 0) {
ans += ((ll)1 << i) * (N - one[i]);
K -= ((ll)1 << i);
} else {
ans += ((ll)1 << i) * one[i];
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,264 | 939,265 | u731886385 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
vvll dp(65, vll(2, -1));
dp[0][0] = 0;
rep(i, 60) {
ll mask = 1LL << (60 - i - 1);
ll cu1 = 0;
rep(j, n) if (a[i] & mask) cu1++;
ll cost0 = mask * cu1;
ll cost1 = mask * (n - cu1);
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost1);
} else {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost0);
}
}
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][0] + cost0);
}
}
if (dp[i][1] != -1) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][1] + max(cost1, cost0));
}
}
COUT(max(dp[60][0], dp[60][1]));
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
vvll dp(65, vll(2, -1));
dp[0][0] = 0;
rep(i, 60) {
ll mask = 1LL << (60 - i - 1);
ll cu1 = 0;
rep(j, n) if (a[j] & mask) cu1++;
ll cost0 = mask * cu1;
ll cost1 = mask * (n - cu1);
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost1);
} else {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost0);
}
}
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][0] + cost0);
}
}
if (dp[i][1] != -1) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][1] + max(cost1, cost0));
}
}
COUT(max(dp[60][0], dp[60][1]));
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 939,271 | 939,272 | u103850114 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
vvll dp(65, vll(2, -1));
dp[0][0] = 0;
rep(i, 60) {
ll mask = 1LL << (60 - i - 1);
ll cu1 = 0;
rep(j, n) if (a[i] & mask) cu1++;
ll cost0 = mask * cu1;
ll cost1 = mask * (n - cu1);
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost1);
} else {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost0);
}
}
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][0] + cost1);
}
}
if (dp[i][1] != -1) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][1] + max(cost1, cost0));
}
}
COUT(max(dp[60][0], dp[60][1]));
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
vvll dp(65, vll(2, -1));
dp[0][0] = 0;
rep(i, 60) {
ll mask = 1LL << (60 - i - 1);
ll cu1 = 0;
rep(j, n) if (a[j] & mask) cu1++;
ll cost0 = mask * cu1;
ll cost1 = mask * (n - cu1);
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost1);
} else {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost0);
}
}
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][0] + cost0);
}
}
if (dp[i][1] != -1) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][1] + max(cost1, cost0));
}
}
COUT(max(dp[60][0], dp[60][1]));
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,273 | 939,272 | u103850114 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
vvll dp(65, vll(2, -1));
dp[0][0] = 0;
rep(i, 60) {
ll mask = 1LL << (60 - i - 1);
ll cu1 = 0;
rep(j, n) if (a[i] & mask) cu1++;
ll cost0 = mask * cu1;
ll cost1 = mask * (n - cu1);
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost1);
} else {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost0);
}
}
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][0] + cost1);
}
}
if (dp[i][1] != -1) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][1] + max(cost1, cost0));
}
}
COUT(max(dp[59][0], dp[59][1]));
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
vvll dp(65, vll(2, -1));
dp[0][0] = 0;
rep(i, 60) {
ll mask = 1LL << (60 - i - 1);
ll cu1 = 0;
rep(j, n) if (a[j] & mask) cu1++;
ll cost0 = mask * cu1;
ll cost1 = mask * (n - cu1);
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost1);
} else {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost0);
}
}
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][0] + cost0);
}
}
if (dp[i][1] != -1) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][1] + max(cost1, cost0));
}
}
COUT(max(dp[60][0], dp[60][1]));
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 939,274 | 939,272 | u103850114 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
vvll dp(60, vll(2, -1));
dp[0][0] = 0;
rep(i, 60) {
ll mask = 1LL << (60 - i - 1);
ll cu1 = 0;
rep(j, n) if (a[i] & mask) cu1++;
ll cost0 = mask * cu1;
ll cost1 = mask * (n - cu1);
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost1);
} else {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost0);
}
}
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][0] + cost1);
}
}
if (dp[i][1] != -1) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][1] + max(cost1, cost0));
}
}
COUT(max(dp[59][0], dp[59][1]));
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
vvll dp(65, vll(2, -1));
dp[0][0] = 0;
rep(i, 60) {
ll mask = 1LL << (60 - i - 1);
ll cu1 = 0;
rep(j, n) if (a[j] & mask) cu1++;
ll cost0 = mask * cu1;
ll cost1 = mask * (n - cu1);
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost1);
} else {
dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + cost0);
}
}
if (dp[i][0] != -1) {
if (k & mask) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][0] + cost0);
}
}
if (dp[i][1] != -1) {
dp[i + 1][1] = max(dp[i + 1][1], dp[i][1] + max(cost1, cost0));
}
}
COUT(max(dp[60][0], dp[60][1]));
}
| [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 939,275 | 939,272 | u103850114 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int, int>, int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll pow2(ll a, ll x) {
if (x == 0)
return 1;
else
return pow2(a, x - 1) * a;
}
int main() {
cout << fixed << setprecision(15);
ll N, K;
cin >> N >> K;
vector<ll> A(N);
REP(i, N) { cin >> A[i]; }
vector<vector<int>> data(N, vector<int>(40));
data.assign(N, vector<int>(40, 0));
REP(i, N) {
ll bina = A[i];
for (int j = 0; bina > 0; j++) {
data[i][j] = bina % 2;
bina = bina / 2;
}
}
vector<ll> C(40, 0);
REP(i, N) {
REP(j, 40) {
// cout << data[i][j];
if (data[i][j] == 1) {
C[j]++;
}
}
// cout << endl;
}
// vector<int> KX(40);
// ll bina = K;
// int kx_counter = 0;
// for (int i = 0; bina>0 ; i++){
// KX[i] = bina%2;
// bina = bina/2;
// kx_counter = i;
// }
ll ans = 0;
for (int i = 40; i >= 0; i--) {
if (C[i] <= N / 2) {
ll temp;
temp = ans + pow2(2, i);
// cout << i << ":" << temp << endl;
if (temp > K) {
ans = ans;
} else {
ans += temp;
}
}
}
// cout << ans << endl;
ll ans2 = 0;
REP(i, N) { ans2 += ans ^ A[i]; }
cout << ans2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int, int>, int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll pow2(ll a, ll x) {
if (x == 0)
return 1;
else
return pow2(a, x - 1) * a;
}
int main() {
cout << fixed << setprecision(15);
ll N, K;
cin >> N >> K;
vector<ll> A(N);
REP(i, N) { cin >> A[i]; }
vector<vector<int>> data(N, vector<int>(40));
data.assign(N, vector<int>(40, 0));
REP(i, N) {
ll bina = A[i];
for (int j = 0; bina > 0; j++) {
data[i][j] = bina % 2;
bina = bina / 2;
}
}
vector<ll> C(40, 0);
REP(i, N) {
REP(j, 40) {
// cout << data[i][j];
if (data[i][j] == 1) {
C[j]++;
}
}
// cout << endl;
}
// vector<int> KX(40);
// ll bina = K;
// int kx_counter = 0;
// for (int i = 0; bina>0 ; i++){
// KX[i] = bina%2;
// bina = bina/2;
// kx_counter = i;
// }
ll ans = 0;
for (int i = 40; i >= 0; i--) {
if (C[i] <= N / 2) {
ll temp;
temp = ans + pow2(2, i);
// cout << i << ":" << temp << endl;
if (temp > K) {
ans = ans;
} else {
ans = temp;
}
}
}
// cout << ans << endl;
ll ans2 = 0;
REP(i, N) { ans2 += ans ^ A[i]; }
cout << ans2 << endl;
return 0;
} | [
"assignment.value.change"
] | 939,282 | 939,283 | u443975466 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vecctor<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>>
#define PL pair<ll, ll>
ll d1[4] = {1, -1, 0, 0};
ll d2[4] = {0, 0, 1, -1};
int main() {
ll N, K;
cin >> N >> K;
VL A(N);
rep(i, 0, N) cin >> A[i];
VVL dp(100, VL(2, -1));
dp[0][0] = 0;
rep(d, 0, 50) {
ll mask = 1LL << (50 - d - 1);
ll c = 0;
rep(i, 0, N) if (A[i] & mask) c++;
ll c0 = c * mask;
ll c1 = (N - c) * mask;
if (dp[d][1] != -1) {
dp[d + 1][1] = max(dp[d + 1][1], dp[d][0] + max(c0, c1));
}
if (dp[d][0] != -1) {
if (K & mask) {
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + c0);
}
}
if (dp[d][0] != -1) {
if (K & mask)
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + c1);
else
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + c0);
}
}
cout << max(dp[50][0], dp[50][1]) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vecctor<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>>
#define PL pair<ll, ll>
ll d1[4] = {1, -1, 0, 0};
ll d2[4] = {0, 0, 1, -1};
int main() {
ll N, K;
cin >> N >> K;
VL A(N);
rep(i, 0, N) cin >> A[i];
VVL dp(100, VL(2, -1));
dp[0][0] = 0;
rep(d, 0, 50) {
ll mask = 1LL << (50 - d - 1);
ll c = 0;
rep(i, 0, N) if (A[i] & mask) c++;
ll c0 = c * mask;
ll c1 = (N - c) * mask;
if (dp[d][1] != -1) {
dp[d + 1][1] = max(dp[d + 1][1], dp[d][1] + max(c0, c1));
}
if (dp[d][0] != -1) {
if (K & mask) {
dp[d + 1][1] = max(dp[d + 1][1], dp[d][0] + c0);
}
}
if (dp[d][0] != -1) {
if (K & mask)
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + c1);
else
dp[d + 1][0] = max(dp[d + 1][0], dp[d][0] + c0);
}
}
cout << max(dp[50][0], dp[50][1]) << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 939,288 | 939,289 | u893584578 | cpp |
p03138 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
using edge = struct {
ll to;
ll cost;
};
typedef string str;
typedef std::pair<ll, ll> pl;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
typedef std::priority_queue<ll> pq;
typedef std::priority_queue<ll, vl, greater<ll>>
pql; // priority queue taking from the lower value.
typedef std::vector<edge> gr;
const ll MOD = 1e9 + 7;
const ll ZERO = 0;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979323846;
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a, b) cout << (a) << " " << (b) << endl
#define prl3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define rpr(i, n, ans) \
rep((i), (n)) { \
if ((i) < n - 1) \
prs((ans[(i)])); \
else if ((i) == n - 1) \
prl((ans[(i)])); \
}
#define cpr(i, n, ans) rep((i), (n)) prl((ans[(i)]))
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define rin1(i, n, a) rep((i), (n)) cin >> (a[(i)])
#define rin2(i, n, a, b) rep((i), (n)) cin >> (a[(i)]) >> (b[(i)])
#define rin3(i, n, a, b, c) \
rep((i), (n)) cin >> (a[(i)]) >> (b[(i)]) >> (c[(i)])
#define rin1_m1(i, n, a) \
rep((i), (n)) { \
cin >> (a[(i)]); \
a[(i)]--; \
}
#define rin2_m1(i, n, a, b) \
rep((i), (n)) { \
cin >> (a[(i)]) >> (b[(i)]); \
a[(i)]--; \
b[(i)]--; \
}
#define rin3_m1(i, n, a, b, c) \
rep((i), (n)) { \
cin >> (a[(i)]) >> (b[(i)]) >> (c[(i)])a[(i)]--; \
b[(i)]--; \
c[(i)]--; \
}
#define matin(i, h, j, w, a) rep((i), (h)) rep((j), (w)) cin >> a[i][j]
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for (auto &(kv) : (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define beto(a, b, c) (a) < (b) && (b) < (c)
#define betc(a, b, c) (a) <= (b) && (b) <= (c)
#define rsort(a, n) sort(a, a + n, greater<>())
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
cout << fixed << setprecision(digits) << (num) << endl;
#define XOR(a, b) (a) ^ (b)
#define char_to_str(c) string(1, (c))
class UnionFind {
vl parents, set_size;
public:
UnionFind() {}
UnionFind(ll n) {
parents = set_size = vl(n);
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
x = root_find(x);
y = root_find(y);
if (x == y)
return;
if (set_size[x] < set_size[y]) {
parents[y] = x;
set_size[x] += set_size[y];
} else {
parents[x] = y;
set_size[y] += set_size[x];
}
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll combination(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
(numerator *= ll(n - i)) %= MOD;
(denomenator *= modinv(i + 1, MOD)) %= MOD;
}
return (numerator * denomenator) % MOD;
}
ll bin_search(ll key, ll A[], ll left, ll right) {
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end..
// In other words, A[right], not A[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (A[mid] == key)
return mid;
else if (A[mid] > key)
right = mid - 1;
else if (A[mid] < key)
left = mid + 1;
}
return -1;
}
ll lower_bound_bin_search(ll key, ll A[], ll left, ll right) {
if (A[left] >= key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] < key && key <= A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] < key && key <= A[mid])
return mid;
else if (A[mid - 1] >= key)
right = mid - 1;
else if (A[mid] < key)
left = mid;
}
return -1; // all the elements < key
}
ll inf_bin_search(ll key, ll A[], ll left, ll right) {
if (A[left] > key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] <= key && key < A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] <= key && key < A[mid])
return mid;
else if (A[mid - 1] > key)
right = mid - 1;
else if (A[mid] <= key)
left = mid;
}
return -1; // all the elements <= key
}
ll upper_bound_bin_search(ll key, ll A[], ll left, ll right) {
if (A[right] <= key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] <= key && key < A[right])
return right - 1;
else
return -1;
}
if (A[mid] <= key && key < A[mid + 1])
return mid;
else if (A[mid] > key)
right = mid;
else if (A[mid + 1] <= key)
left = mid + 1;
}
return -1; // all the elements > key
}
ll sup_bin_search(ll key, ll A[], ll left, ll right) {
if (A[right] < key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] < key && key <= A[right])
return right - 1;
else
return -1;
}
if (A[mid] < key && key <= A[mid + 1])
return mid;
else if (A[mid] >= key)
right = mid;
else if (A[mid + 1] < key)
left = mid + 1;
}
return -1; // all the elements >= key
}
ll fact(ll n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll bool_sum(ll a1, ll a2) {
if (a1 == 1 || a2 == 1)
return 1;
return 0;
}
mll prime_decomposition(ll n) {
ll i = 2;
mll table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
ll char_to_idx(char c) {
ll idx = 0;
Forchar(cc, 'a', 'z') {
if (c == cc)
return idx;
else
idx++;
}
}
/*
const ll N_VERTEX = 310;
ll a, b, t;
ll dist[N_VERTEX][N_VERTEX];
void warshall_floyd(ll n){
rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] +
dist[k][j]);
}
int main(void){
in2(n, m);
rep(i, n) rep(j, n) {if (i != j) dist[i][j] = INF; else dist[i][i] = 0;}
rep(i, m){
in3(a, b, t);
a--; b--;
dist[a][b] = t;
dist[b][a] = t;
}
warshall_floyd(n);
}
const ll N_VERTEX = 310;
gr G[N_VERTEX];
ll dist[N_VERTEX], a, b, t, n, m;
void dijkstra(ll start, ll n) {
priority_queue<pl, vector<pl>, greater<pl>> edge_costs;
fill(dist, dist + n, INF);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
pl edge_cost = edge_costs.top();
edge_costs.pop();
ll idx = edge_cost.second;
ll cost = edge_cost.first;
if (dist[idx] < cost) continue;
rep(i, G[idx].size()){
edge e = G[idx][i];
if (dist[e.to] > dist[idx] + e.cost){
dist[e.to] = dist[idx] + e.cost;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
int main(void){
in2(n, m);
rep(i, m){
in3(a, b, t);
a--; b--;
G[a].pb({b, t});
G[b].pb({a, t});
}
dijkstra(0, n);
}
*/
/*
# 1. The usage of map pair
map<pl, ll> cnt;
cnt[{i, j}] = 0;
items(kv, cnt){
prl2(kv.first, kv.second);
}
# 2. The usage of pair sort
vpl c;
rep(i, n){
ll a, b;
in2(a, b);
c.pb(mp(a, b));
}
sort(all(c));
# 3. The usage of next_permutation and combination (factorial search)
ll a[8];
rep(i, 8) a[i] = i;
do{
}while(next_permutation(a, a+n));
// here, combination
ll n, r;
ll i1, i2, ..., ir;
For(i1, n - r, n) For(i2, n - r - 1, i1) ... For(ir, n - 2 * r + 1, irr){
process;}
# 4. sort vector in descending order
sort(rall(v));
# 5. bit search
ll n;
in1(n);
const ll base = 3;
ll upper = 1;
rep(i, n) upper *= base;
rep(i, upper){
ll tmp = i;
rep(j, n){
rep(k, base) if (tmp % base == k) prl(k);
tmp /= base;
}
}
# 6. imos method
// used when we would like to count the number which
// shows how many times the numbers between l and r belongs to smt.
// This method is composed of three process.
ll n, m, s[MAX_M], l, r;
in2(n, m);
rep(i, m) s[i] = 0;
// 1st step
rep(i, n){
in3(l, r, c);
l--; r--; // if l starts from 1.
s[l] += c; s[r + 1] -= c;
}
// 2nd step
rep(i, m - 1) s[i + 1] += s[i];
// 3rd step: judgement...
#7. shakutori method
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll n, s[MAX_N]
in1(n);
rin1(i, n, s);
while (l < n){
r = max(r, l);
if (l == r){val = s[l]; r++;}
while(r < n && val * s[r] <= k){val *= s[r]; r++;}
if (val <= k) answer = max(r - l, answer);
val /= s[l]; l++;
}
#8. priority queue
pq q;
ll answer = 0;
ll v;
rep(i, n) q.push(a[i]);
rep(i, m){
v = q.top(); q.pop(); // get the top value and dump the value from queue
v /= 2; q.push(v); // add the new value
}
while(!q.empty()){
answer += q.top();
q.pop();
}
#9. The shortest path between the k-th edge and another edge (Tree)
ll depth[MAX_N];
gr tree[MAX_N];
void dfs(ll now, ll prev, ll all_cost){
depth[now] = all_cost;
items(e, tree[now]){
if (e.to == prev) continue;
dfs(e.to, now, all_cost + e.cost);
}
}
ll n, k, a, b, c;
in2(n, k);
rep(i, n - 1){
in3(a, b, c);
a--; b--;
tree[a].pb({b, c});
tree[b].pb({a, c});
}
k--;
dfs(k, -1, 0);
#10. Visiting Subtree using recurrent function (ABC138D)
gr tree[MAX_N];
ll c[MAX_N];
bool visited[MAX_N];
void dfs(ll source, ll parent, ll val){
visited[source] = true;
c[source] += val;
rep(i, tree[source].size()){
ll vertex = tree[source][i].to;
if (vertex == parent) continue;
dfs(vertex, source, c[source]);
}
}
#11. bfs ABC146D
1. first create a tree.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
#12. grid to distance matrix
ll w, h;
ll pos_to_idx(ll x, ll y){
return y * w + x;
}
int main(void){
in2(h, w);
rep(y, h){
in1(s);
rep(x, w){
if (s[x] == '#') wall[x][y] = true;
else wall[x][y] = false;
}
}
rep(i1, h * w)rep(i2, h * w) if (i1 == i2) dist[i1][i2] = 0; else
dist[i1][i2] = INF;
rep(x, w)rep(y, h){
ll idx1 = pos_to_idx(x, y); ll idx2;
if (wall[x][y]) continue;
if (x != 0 && !wall[x - 1][y]){
idx2 = pos_to_idx(x - 1, y);
dist[idx1][idx2] = 1;
}
if (x != w - 1 && !wall[x + 1][y]){
idx2 = pos_to_idx(x + 1, y);
dist[idx1][idx2] = 1;
}
if (y != 0 && !wall[x][y - 1]){
idx2 = pos_to_idx(x, y - 1);
dist[idx1][idx2] = 1;
}
if (y != h - 1 && !wall[x][y + 1]){
idx2 = pos_to_idx(x, y + 1);
dist[idx1][idx2] = 1;
}
}
}
*/
const ll MAX_N = 200005;
bool okay = false;
ll answer = 0;
ll n, k, a[MAX_N], a_max;
ll each_bit[50];
int main(void) {
in2(n, k);
a_max = k;
rep(i, n) {
in1(a[i]);
a_max = max(a[i], a_max);
}
ll bit_size = 0;
while (true) {
bit_size++;
a_max /= 2;
if (a_max == 0)
break;
}
rep(i, n) {
ll a_copy = a[i];
rep(j, bit_size) {
each_bit[j] += a_copy % 2;
a_copy /= 2;
}
}
ll X = 0;
vl k_bits;
bool up_okay = false;
while (true) {
k_bits.pb(k % 2);
k /= 2;
if (k == 0)
break;
}
ll k_bits_size = k_bits.size();
revrep(i, k_bits_size) {
ll k_bit = k_bits[i];
if (each_bit[i] >= n - each_bit[i])
up_okay = true;
else if (each_bit[i] < n - each_bit[i] && (up_okay || k_bit))
X += power_normal(2, i);
}
rep(i, n) answer += XOR(X, a[i]);
prl(answer);
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
using edge = struct {
ll to;
ll cost;
};
typedef string str;
typedef std::pair<ll, ll> pl;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
typedef std::priority_queue<ll> pq;
typedef std::priority_queue<ll, vl, greater<ll>>
pql; // priority queue taking from the lower value.
typedef std::vector<edge> gr;
const ll MOD = 1e9 + 7;
const ll ZERO = 0;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979323846;
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a, b) cout << (a) << " " << (b) << endl
#define prl3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define rpr(i, n, ans) \
rep((i), (n)) { \
if ((i) < n - 1) \
prs((ans[(i)])); \
else if ((i) == n - 1) \
prl((ans[(i)])); \
}
#define cpr(i, n, ans) rep((i), (n)) prl((ans[(i)]))
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define rin1(i, n, a) rep((i), (n)) cin >> (a[(i)])
#define rin2(i, n, a, b) rep((i), (n)) cin >> (a[(i)]) >> (b[(i)])
#define rin3(i, n, a, b, c) \
rep((i), (n)) cin >> (a[(i)]) >> (b[(i)]) >> (c[(i)])
#define rin1_m1(i, n, a) \
rep((i), (n)) { \
cin >> (a[(i)]); \
a[(i)]--; \
}
#define rin2_m1(i, n, a, b) \
rep((i), (n)) { \
cin >> (a[(i)]) >> (b[(i)]); \
a[(i)]--; \
b[(i)]--; \
}
#define rin3_m1(i, n, a, b, c) \
rep((i), (n)) { \
cin >> (a[(i)]) >> (b[(i)]) >> (c[(i)])a[(i)]--; \
b[(i)]--; \
c[(i)]--; \
}
#define matin(i, h, j, w, a) rep((i), (h)) rep((j), (w)) cin >> a[i][j]
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for (auto &(kv) : (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define beto(a, b, c) (a) < (b) && (b) < (c)
#define betc(a, b, c) (a) <= (b) && (b) <= (c)
#define rsort(a, n) sort(a, a + n, greater<>())
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
cout << fixed << setprecision(digits) << (num) << endl;
#define XOR(a, b) (a) ^ (b)
#define char_to_str(c) string(1, (c))
class UnionFind {
vl parents, set_size;
public:
UnionFind() {}
UnionFind(ll n) {
parents = set_size = vl(n);
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
x = root_find(x);
y = root_find(y);
if (x == y)
return;
if (set_size[x] < set_size[y]) {
parents[y] = x;
set_size[x] += set_size[y];
} else {
parents[x] = y;
set_size[y] += set_size[x];
}
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll combination(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
(numerator *= ll(n - i)) %= MOD;
(denomenator *= modinv(i + 1, MOD)) %= MOD;
}
return (numerator * denomenator) % MOD;
}
ll bin_search(ll key, ll A[], ll left, ll right) {
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end..
// In other words, A[right], not A[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (A[mid] == key)
return mid;
else if (A[mid] > key)
right = mid - 1;
else if (A[mid] < key)
left = mid + 1;
}
return -1;
}
ll lower_bound_bin_search(ll key, ll A[], ll left, ll right) {
if (A[left] >= key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] < key && key <= A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] < key && key <= A[mid])
return mid;
else if (A[mid - 1] >= key)
right = mid - 1;
else if (A[mid] < key)
left = mid;
}
return -1; // all the elements < key
}
ll inf_bin_search(ll key, ll A[], ll left, ll right) {
if (A[left] > key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] <= key && key < A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] <= key && key < A[mid])
return mid;
else if (A[mid - 1] > key)
right = mid - 1;
else if (A[mid] <= key)
left = mid;
}
return -1; // all the elements <= key
}
ll upper_bound_bin_search(ll key, ll A[], ll left, ll right) {
if (A[right] <= key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] <= key && key < A[right])
return right - 1;
else
return -1;
}
if (A[mid] <= key && key < A[mid + 1])
return mid;
else if (A[mid] > key)
right = mid;
else if (A[mid + 1] <= key)
left = mid + 1;
}
return -1; // all the elements > key
}
ll sup_bin_search(ll key, ll A[], ll left, ll right) {
if (A[right] < key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] < key && key <= A[right])
return right - 1;
else
return -1;
}
if (A[mid] < key && key <= A[mid + 1])
return mid;
else if (A[mid] >= key)
right = mid;
else if (A[mid + 1] < key)
left = mid + 1;
}
return -1; // all the elements >= key
}
ll fact(ll n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll bool_sum(ll a1, ll a2) {
if (a1 == 1 || a2 == 1)
return 1;
return 0;
}
mll prime_decomposition(ll n) {
ll i = 2;
mll table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
ll char_to_idx(char c) {
ll idx = 0;
Forchar(cc, 'a', 'z') {
if (c == cc)
return idx;
else
idx++;
}
}
/*
const ll N_VERTEX = 310;
ll a, b, t;
ll dist[N_VERTEX][N_VERTEX];
void warshall_floyd(ll n){
rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] +
dist[k][j]);
}
int main(void){
in2(n, m);
rep(i, n) rep(j, n) {if (i != j) dist[i][j] = INF; else dist[i][i] = 0;}
rep(i, m){
in3(a, b, t);
a--; b--;
dist[a][b] = t;
dist[b][a] = t;
}
warshall_floyd(n);
}
const ll N_VERTEX = 310;
gr G[N_VERTEX];
ll dist[N_VERTEX], a, b, t, n, m;
void dijkstra(ll start, ll n) {
priority_queue<pl, vector<pl>, greater<pl>> edge_costs;
fill(dist, dist + n, INF);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
pl edge_cost = edge_costs.top();
edge_costs.pop();
ll idx = edge_cost.second;
ll cost = edge_cost.first;
if (dist[idx] < cost) continue;
rep(i, G[idx].size()){
edge e = G[idx][i];
if (dist[e.to] > dist[idx] + e.cost){
dist[e.to] = dist[idx] + e.cost;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
int main(void){
in2(n, m);
rep(i, m){
in3(a, b, t);
a--; b--;
G[a].pb({b, t});
G[b].pb({a, t});
}
dijkstra(0, n);
}
*/
/*
# 1. The usage of map pair
map<pl, ll> cnt;
cnt[{i, j}] = 0;
items(kv, cnt){
prl2(kv.first, kv.second);
}
# 2. The usage of pair sort
vpl c;
rep(i, n){
ll a, b;
in2(a, b);
c.pb(mp(a, b));
}
sort(all(c));
# 3. The usage of next_permutation and combination (factorial search)
ll a[8];
rep(i, 8) a[i] = i;
do{
}while(next_permutation(a, a+n));
// here, combination
ll n, r;
ll i1, i2, ..., ir;
For(i1, n - r, n) For(i2, n - r - 1, i1) ... For(ir, n - 2 * r + 1, irr){
process;}
# 4. sort vector in descending order
sort(rall(v));
# 5. bit search
ll n;
in1(n);
const ll base = 3;
ll upper = 1;
rep(i, n) upper *= base;
rep(i, upper){
ll tmp = i;
rep(j, n){
rep(k, base) if (tmp % base == k) prl(k);
tmp /= base;
}
}
# 6. imos method
// used when we would like to count the number which
// shows how many times the numbers between l and r belongs to smt.
// This method is composed of three process.
ll n, m, s[MAX_M], l, r;
in2(n, m);
rep(i, m) s[i] = 0;
// 1st step
rep(i, n){
in3(l, r, c);
l--; r--; // if l starts from 1.
s[l] += c; s[r + 1] -= c;
}
// 2nd step
rep(i, m - 1) s[i + 1] += s[i];
// 3rd step: judgement...
#7. shakutori method
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll n, s[MAX_N]
in1(n);
rin1(i, n, s);
while (l < n){
r = max(r, l);
if (l == r){val = s[l]; r++;}
while(r < n && val * s[r] <= k){val *= s[r]; r++;}
if (val <= k) answer = max(r - l, answer);
val /= s[l]; l++;
}
#8. priority queue
pq q;
ll answer = 0;
ll v;
rep(i, n) q.push(a[i]);
rep(i, m){
v = q.top(); q.pop(); // get the top value and dump the value from queue
v /= 2; q.push(v); // add the new value
}
while(!q.empty()){
answer += q.top();
q.pop();
}
#9. The shortest path between the k-th edge and another edge (Tree)
ll depth[MAX_N];
gr tree[MAX_N];
void dfs(ll now, ll prev, ll all_cost){
depth[now] = all_cost;
items(e, tree[now]){
if (e.to == prev) continue;
dfs(e.to, now, all_cost + e.cost);
}
}
ll n, k, a, b, c;
in2(n, k);
rep(i, n - 1){
in3(a, b, c);
a--; b--;
tree[a].pb({b, c});
tree[b].pb({a, c});
}
k--;
dfs(k, -1, 0);
#10. Visiting Subtree using recurrent function (ABC138D)
gr tree[MAX_N];
ll c[MAX_N];
bool visited[MAX_N];
void dfs(ll source, ll parent, ll val){
visited[source] = true;
c[source] += val;
rep(i, tree[source].size()){
ll vertex = tree[source][i].to;
if (vertex == parent) continue;
dfs(vertex, source, c[source]);
}
}
#11. bfs ABC146D
1. first create a tree.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
#12. grid to distance matrix
ll w, h;
ll pos_to_idx(ll x, ll y){
return y * w + x;
}
int main(void){
in2(h, w);
rep(y, h){
in1(s);
rep(x, w){
if (s[x] == '#') wall[x][y] = true;
else wall[x][y] = false;
}
}
rep(i1, h * w)rep(i2, h * w) if (i1 == i2) dist[i1][i2] = 0; else
dist[i1][i2] = INF;
rep(x, w)rep(y, h){
ll idx1 = pos_to_idx(x, y); ll idx2;
if (wall[x][y]) continue;
if (x != 0 && !wall[x - 1][y]){
idx2 = pos_to_idx(x - 1, y);
dist[idx1][idx2] = 1;
}
if (x != w - 1 && !wall[x + 1][y]){
idx2 = pos_to_idx(x + 1, y);
dist[idx1][idx2] = 1;
}
if (y != 0 && !wall[x][y - 1]){
idx2 = pos_to_idx(x, y - 1);
dist[idx1][idx2] = 1;
}
if (y != h - 1 && !wall[x][y + 1]){
idx2 = pos_to_idx(x, y + 1);
dist[idx1][idx2] = 1;
}
}
}
*/
const ll MAX_N = 200005;
bool okay = false;
ll answer = 0;
ll n, k, a[MAX_N], a_max;
ll each_bit[50];
int main(void) {
in2(n, k);
a_max = k;
rep(i, n) {
in1(a[i]);
a_max = max(a[i], a_max);
}
ll bit_size = 0;
while (true) {
bit_size++;
a_max /= 2;
if (a_max == 0)
break;
}
rep(i, n) {
ll a_copy = a[i];
rep(j, bit_size) {
each_bit[j] += a_copy % 2;
a_copy /= 2;
}
}
ll X = 0;
vl k_bits;
bool up_okay = false;
while (true) {
k_bits.pb(k % 2);
k /= 2;
if (k == 0)
break;
}
ll k_bits_size = k_bits.size();
revrep(i, k_bits_size) {
ll k_bit = k_bits[i];
if (each_bit[i] >= n - each_bit[i] && k_bit)
up_okay = true;
else if (each_bit[i] < n - each_bit[i] && (up_okay || k_bit))
X += power_normal(2, i);
}
rep(i, n) answer += XOR(X, a[i]);
prl(answer);
}
| [
"control_flow.branch.if.condition.change"
] | 939,293 | 939,294 | u767543103 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int ll; // ＾o＾
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto &x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort((x).rbegin(), (x).rend())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define BR cout << "\n";
#define cauto const auto &
#define dump(...) \
{ \
auto __DUMP_NAME_LIST__ = split(#__VA_ARGS__, ','); \
print(__DUMP_NAME_LIST__, __VA_ARGS__); \
BR; \
}
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VD = std::vector<double>;
// using VI = std::vector<int>;
// using VVI = std::vector<std::vector<int>>;
using VVL = std::vector<std::vector<ll>>;
using std::cout;
// using std::endl;
constexpr char endl = '\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::sort;
using std::stack;
using std::string;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr ll INF = 1LL << 60;
template <class T> std::istream &operator>>(std::istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class S, class T>
std::ostream &operator<<(std::ostream &os, const std::pair<S, T> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
inline std::list<std::string> split(std::string str, char del) {
std::list<std::string> sList;
string s = "";
for (const auto &c : str) {
if (c == del) {
sList.emplace_back(s);
s = "";
} else {
if (c != ' ' || del == ' ') {
s += c;
}
}
}
sList.emplace_back(s);
return sList;
}
struct Preprocessing {
Preprocessing() {
std::cin.tie(0);
std::ios::sync_with_stdio(0);
};
};
template <class T> struct has_begin {
private:
template <class U>
static auto check(U x) -> decltype(x.begin(), std::true_type{});
static std::false_type check(...);
public:
static bool const value = decltype(check(std::declval<T>()))::value;
};
inline void print(std::list<std::string> &str);
template <
class Primitive, class... Tail,
std::enable_if_t<!has_begin<Primitive>::value, std::nullptr_t> = nullptr>
inline void print(std::list<std::string> &str, const Primitive &x,
const Tail &...tail);
template <class Container, class... Tail>
inline auto print(std::list<std::string> &str, const Container &c,
const Tail &...tail) -> decltype(c.begin());
template <class... Tail>
inline void print(std::list<std::string> &str, const std::string &s,
const Tail &...tail);
template <class Container>
inline auto printSingle(const Container &c) -> decltype(c.begin()) {
for (const auto &x : c) {
std::cout << x << " ";
}
std::cout << "\n";
return c.begin();
}
template <class Primitive, std::enable_if_t<!has_begin<Primitive>::value,
std::nullptr_t> = nullptr>
inline void printSingle(const Primitive &x) {
std::cout << x << " ";
}
inline void print(std::list<std::string> &str) {}
template <
class Primitive, class... Tail,
std::enable_if_t<!has_begin<Primitive>::value, std::nullptr_t> = nullptr>
inline void print(std::list<std::string> &str, const Primitive &x,
const Tail &...tail) {
std::cout << *str.begin() << ":" << x << " ";
if (sizeof...(tail) > 0) {
std::cout << "\n";
str.pop_front();
print(str, tail...);
}
}
template <class Container, class... Tail>
inline auto print(std::list<std::string> &str, const Container &c,
const Tail &...tail) -> decltype(c.begin()) {
std::cout << "-- " << *str.begin() << " --\n";
for (const auto &x : c) {
printSingle(x);
BR;
}
std::cout << "\n";
str.pop_front();
print(str, tail...);
return c.begin();
}
template <class... Tail>
inline void print(std::list<std::string> &str, const std::string &s,
const Tail &...tail) {
std::cout << *str.begin() << ":" << s << "\n";
str.pop_front();
print(str, tail...);
}
//=============================================================================================
// ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
// ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// ll pow(ll a, ll b) { ll ans = 1; while (b > 0) { if (b % 2 == 1) { ans *= a;
// ans %= MOD; }b /= 2; a *= a; a %= MOD; }return ans; } ll comb(ll a, ll b) {
// static constexpr ll size = 1e6; static VL fac(size); static VL finv(size);
// static VL inv(size); static ll n = 0; if (n > a) { return fac[a] * (finv[b] *
// finv[a - b] % MOD) % MOD; }fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1]
// = 1; FOR(i, 2, a + 1) { inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; fac[i] =
// fac[i - 1] * (ll)i%MOD; finv[i] = finv[i - 1] * inv[i] % MOD; }n = a + 1;
// return comb(a, b); } multiset<ll> prime_decomposition(ll n) { ll i = 2;
// multiset<ll> table{}; while (i * i <= n) { while (n % i == 0) { n /= i;
// table.emplace(i); }++i; }if (n > 1) { table.emplace(n); return table; }return
// table; } vector<bool> eratosthenes(ll n) { vector<bool> lst(n + 1, true);
// lst[0] = lst[1] = false; FOR(i, 2, n / 2 + 1) { lst[i * 2] = false; }for (ll
// i = 3; i <= n; i += 2) { if (lst[i] == false) { continue; }FOR(j, 2, n / i +
// 1) { lst[i*j] = false; } }return lst; }
//==============================================================================================
signed main() {
constexpr ll max = 60;
ll n, k;
cin >> n >> k;
vector<bitset<max>> v;
v.reserve(n);
REP(i, n) {
ll tmp;
cin >> tmp;
v.emplace_back(bitset<max>(tmp));
}
ll ans = 0;
auto K = bitset<max>(k);
ll two = 1;
REP(i, max - 1) { two *= 2; }
ll f = -1;
RREP(i, max) {
if (K[i] == 1) {
f = i;
break;
}
}
RREP(i, max) {
ll a = 0, b = 0;
REPC(x, v) {
if (x[i] == 1) {
++a;
} else {
++b;
}
}
if (b > a && i <= f) {
if (i == f) {
RFOR(j, 0, i) {
if (K[j] == 1) {
f = j;
break;
}
}
}
ans += b * two;
} else {
ans += a * two;
}
two /= 2;
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int ll; // ＾o＾
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto &x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort((x).rbegin(), (x).rend())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define BR cout << "\n";
#define cauto const auto &
#define dump(...) \
{ \
auto __DUMP_NAME_LIST__ = split(#__VA_ARGS__, ','); \
print(__DUMP_NAME_LIST__, __VA_ARGS__); \
BR; \
}
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VD = std::vector<double>;
// using VI = std::vector<int>;
// using VVI = std::vector<std::vector<int>>;
using VVL = std::vector<std::vector<ll>>;
using std::cout;
// using std::endl;
constexpr char endl = '\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::sort;
using std::stack;
using std::string;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr ll INF = 1LL << 60;
template <class T> std::istream &operator>>(std::istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class S, class T>
std::ostream &operator<<(std::ostream &os, const std::pair<S, T> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
inline std::list<std::string> split(std::string str, char del) {
std::list<std::string> sList;
string s = "";
for (const auto &c : str) {
if (c == del) {
sList.emplace_back(s);
s = "";
} else {
if (c != ' ' || del == ' ') {
s += c;
}
}
}
sList.emplace_back(s);
return sList;
}
struct Preprocessing {
Preprocessing() {
std::cin.tie(0);
std::ios::sync_with_stdio(0);
};
};
template <class T> struct has_begin {
private:
template <class U>
static auto check(U x) -> decltype(x.begin(), std::true_type{});
static std::false_type check(...);
public:
static bool const value = decltype(check(std::declval<T>()))::value;
};
inline void print(std::list<std::string> &str);
template <
class Primitive, class... Tail,
std::enable_if_t<!has_begin<Primitive>::value, std::nullptr_t> = nullptr>
inline void print(std::list<std::string> &str, const Primitive &x,
const Tail &...tail);
template <class Container, class... Tail>
inline auto print(std::list<std::string> &str, const Container &c,
const Tail &...tail) -> decltype(c.begin());
template <class... Tail>
inline void print(std::list<std::string> &str, const std::string &s,
const Tail &...tail);
template <class Container>
inline auto printSingle(const Container &c) -> decltype(c.begin()) {
for (const auto &x : c) {
std::cout << x << " ";
}
std::cout << "\n";
return c.begin();
}
template <class Primitive, std::enable_if_t<!has_begin<Primitive>::value,
std::nullptr_t> = nullptr>
inline void printSingle(const Primitive &x) {
std::cout << x << " ";
}
inline void print(std::list<std::string> &str) {}
template <
class Primitive, class... Tail,
std::enable_if_t<!has_begin<Primitive>::value, std::nullptr_t> = nullptr>
inline void print(std::list<std::string> &str, const Primitive &x,
const Tail &...tail) {
std::cout << *str.begin() << ":" << x << " ";
if (sizeof...(tail) > 0) {
std::cout << "\n";
str.pop_front();
print(str, tail...);
}
}
template <class Container, class... Tail>
inline auto print(std::list<std::string> &str, const Container &c,
const Tail &...tail) -> decltype(c.begin()) {
std::cout << "-- " << *str.begin() << " --\n";
for (const auto &x : c) {
printSingle(x);
BR;
}
std::cout << "\n";
str.pop_front();
print(str, tail...);
return c.begin();
}
template <class... Tail>
inline void print(std::list<std::string> &str, const std::string &s,
const Tail &...tail) {
std::cout << *str.begin() << ":" << s << "\n";
str.pop_front();
print(str, tail...);
}
//=============================================================================================
// ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
// ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// ll pow(ll a, ll b) { ll ans = 1; while (b > 0) { if (b % 2 == 1) { ans *= a;
// ans %= MOD; }b /= 2; a *= a; a %= MOD; }return ans; } ll comb(ll a, ll b) {
// static constexpr ll size = 1e6; static VL fac(size); static VL finv(size);
// static VL inv(size); static ll n = 0; if (n > a) { return fac[a] * (finv[b] *
// finv[a - b] % MOD) % MOD; }fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1]
// = 1; FOR(i, 2, a + 1) { inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; fac[i] =
// fac[i - 1] * (ll)i%MOD; finv[i] = finv[i - 1] * inv[i] % MOD; }n = a + 1;
// return comb(a, b); } multiset<ll> prime_decomposition(ll n) { ll i = 2;
// multiset<ll> table{}; while (i * i <= n) { while (n % i == 0) { n /= i;
// table.emplace(i); }++i; }if (n > 1) { table.emplace(n); return table; }return
// table; } vector<bool> eratosthenes(ll n) { vector<bool> lst(n + 1, true);
// lst[0] = lst[1] = false; FOR(i, 2, n / 2 + 1) { lst[i * 2] = false; }for (ll
// i = 3; i <= n; i += 2) { if (lst[i] == false) { continue; }FOR(j, 2, n / i +
// 1) { lst[i*j] = false; } }return lst; }
//==============================================================================================
signed main() {
constexpr ll max = 60;
ll n, k;
cin >> n >> k;
vector<bitset<max>> v;
v.reserve(n);
REP(i, n) {
ll tmp;
cin >> tmp;
v.emplace_back(bitset<max>(tmp));
}
ll ans = 0;
auto K = bitset<max>(k);
ll two = 1;
REP(i, max - 1) { two *= 2; }
ll f = -1;
RREP(i, max) {
if (K[i] == 1) {
f = i;
break;
}
}
RREP(i, max) {
ll a = 0, b = 0;
REPC(x, v) {
if (x[i] == 1) {
++a;
} else {
++b;
}
}
if (b > a && i <= f) {
if (i == f) {
f = -1;
RFOR(j, 0, i) {
if (K[j] == 1) {
f = j;
break;
}
}
}
ans += b * two;
} else {
ans += a * two;
}
two /= 2;
}
cout << ans << endl;
} | [
"assignment.add"
] | 939,308 | 939,309 | u715750943 | cpp |
p03138 | #include <bits/stdc++.h>
typedef long long ll;
#define reps(i, s, n) for (ll(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
#define All(x) (x).begin(), (x).end()
using namespace std;
signed main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
vector<ll> bitadd(63, 0);
for (auto &a : A)
cin >> a;
for (ll j = 0; j < 63; j++) {
ll cnt1 = 0;
for (int i = 0; i < N; i++) {
if (A[i] & (1LL << j))
cnt1++;
}
ll cnt0 = N - cnt1;
if (cnt0 > cnt1) {
bitadd[j] = (1LL << j) * (cnt0 - cnt1);
}
}
ll ans = 0;
ll asum = accumulate(A.begin(), A.end(), 0LL);
ll pre = 0;
for (ll i = 62; i >= 0; i--) {
if (K & (1LL << i)) {
ll tmpsum = asum;
for (ll j = 0; j < i; j++)
asum += bitadd[j];
tmpsum += pre;
ans = max(ans, tmpsum);
pre += bitadd[i];
}
}
ans = max(ans, pre + asum);
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
#define reps(i, s, n) for (ll(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
#define All(x) (x).begin(), (x).end()
using namespace std;
signed main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
vector<ll> bitadd(63, 0);
for (auto &a : A)
cin >> a;
for (ll j = 0; j < 63; j++) {
ll cnt1 = 0;
for (int i = 0; i < N; i++) {
if (A[i] & (1LL << j))
cnt1++;
}
ll cnt0 = N - cnt1;
if (cnt0 > cnt1) {
bitadd[j] = (1LL << j) * (cnt0 - cnt1);
}
}
ll ans = 0;
ll asum = accumulate(A.begin(), A.end(), 0LL);
ll pre = 0;
for (ll i = 62; i >= 0; i--) {
if (K & (1LL << i)) {
ll tmpsum = asum;
for (ll j = 0; j < i; j++)
tmpsum += bitadd[j];
tmpsum += pre;
ans = max(ans, tmpsum);
pre += bitadd[i];
}
}
ans = max(ans, pre + asum);
cout << ans << endl;
} | [
"assignment.variable.change",
"identifier.change"
] | 939,310 | 939,311 | u003019316 | cpp |
p03138 | /*** keep hungry and calm CoolGuang!***/
#pragma GCC optimize(2)
#include <algorithm>
#include <bits/stdc++.h>
#include <stdio.h>
#define debug(x) cout << #x << ":" << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
const ll INF = 1e18;
const int maxn = 1e6 + 18;
const int mod = 998244353;
inline bool read(ll &num) {
char in;
bool IsN = false;
in = getchar();
if (in == EOF)
return false;
while (in != '-' && (in < '0' || in > '9'))
in = getchar();
if (in == '-') {
IsN = true;
num = 0;
} else
num = in - '0';
while (in = getchar(), in >= '0' && in <= '9') {
num *= 10, num += in - '0';
}
if (IsN)
num = -num;
return true;
}
ll n, m, p;
ll st[100];
ll dp[100][2]; ///被限制 不被限制
int main() {
scanf("%lld%lld", &n, &m);
ll sum = 0;
for (int i = 1; i <= n; i++) {
ll x;
read(x);
for (ll k = 0; k <= 45; k++)
if (x >> k & 1ll)
st[k]++;
sum += x;
}
if (m == 0) {
printf("%lld\n", sum);
return 0;
}
int f = 0;
int mx = log2(m);
dp[mx][0] = st[mx] * (1ll << mx);
dp[mx][1] = (ll)(n - st[mx]) * (1ll << mx);
ll ans = 0;
for (int k = mx + 1; k <= 45; k++)
ans += (1ll << k) * st[k];
for (ll k = mx - 1; k >= 0; k--) {
if (m >> k & 1ll) {
dp[k][1] = dp[k + 1][1] + (1ll << k) * (n - st[k]);
dp[k][0] = max(dp[k + 1][1] + (1ll << k) * st[k], dp[k][0]); ///取0
dp[k][0] = max(dp[k + 1][0] + (1ll << k) * st[k], dp[k][0]);
dp[k][0] = max(dp[k + 1][0] + (1ll << k) * (n - st[k]), dp[k][0]);
} else {
dp[k][1] = dp[k + 1][1] + (1ll << k) * st[k];
dp[k][0] = max(dp[k + 1][0] + (1ll << k) * st[k], dp[k][0]);
dp[k][0] = max(dp[k + 1][1] + (1ll << k) * (n - st[k]), dp[k][0]);
}
}
printf("%lld\n", max(dp[0][0], dp[0][1]) + ans);
return 0;
}
| /*** keep hungry and calm CoolGuang!***/
#pragma GCC optimize(2)
#include <algorithm>
#include <bits/stdc++.h>
#include <stdio.h>
#define debug(x) cout << #x << ":" << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
const ll INF = 1e18;
const int maxn = 1e6 + 18;
const int mod = 998244353;
inline bool read(ll &num) {
char in;
bool IsN = false;
in = getchar();
if (in == EOF)
return false;
while (in != '-' && (in < '0' || in > '9'))
in = getchar();
if (in == '-') {
IsN = true;
num = 0;
} else
num = in - '0';
while (in = getchar(), in >= '0' && in <= '9') {
num *= 10, num += in - '0';
}
if (IsN)
num = -num;
return true;
}
ll n, m, p;
ll st[100];
ll dp[100][2]; ///被限制 不被限制
int main() {
scanf("%lld%lld", &n, &m);
ll sum = 0;
for (int i = 1; i <= n; i++) {
ll x;
read(x);
for (ll k = 0; k <= 45; k++)
if (x >> k & 1ll)
st[k]++;
sum += x;
}
if (m == 0) {
printf("%lld\n", sum);
return 0;
}
int f = 0;
int mx = log2(m);
dp[mx][0] = st[mx] * (1ll << mx);
dp[mx][1] = (ll)(n - st[mx]) * (1ll << mx);
ll ans = 0;
for (int k = mx + 1; k <= 45; k++)
ans += (1ll << k) * st[k];
for (ll k = mx - 1; k >= 0; k--) {
if (m >> k & 1ll) {
dp[k][1] = dp[k + 1][1] + (1ll << k) * (n - st[k]);
dp[k][0] = max(dp[k + 1][1] + (1ll << k) * st[k], dp[k][0]); ///取0
dp[k][0] = max(dp[k + 1][0] + (1ll << k) * st[k], dp[k][0]);
dp[k][0] = max(dp[k + 1][0] + (1ll << k) * (n - st[k]), dp[k][0]);
} else {
dp[k][1] = dp[k + 1][1] + (1ll << k) * st[k];
dp[k][0] = max(dp[k + 1][0] + (1ll << k) * st[k], dp[k][0]);
dp[k][0] = max(dp[k + 1][0] + (1ll << k) * (n - st[k]), dp[k][0]);
}
}
printf("%lld\n", max(dp[0][0], dp[0][1]) + ans);
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 939,312 | 939,313 | u577127055 | cpp |
p03138 | //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const ll INF = 1e9;
const ll LINF = ll(1e18) + 1;
const ll MOD = 1000000007;
const ll dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const ll Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n, k;
vector<ll> a;
ll dight(ll l) {
ll count = 0;
while (l) {
l /= 2;
count++;
}
return count;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
ll keta = dight(k);
vector<ll> count(60, 0);
for (ll i = 0; i < n; i++) {
ll temp;
cin >> temp;
a.push_back(temp);
for (ll j = 0; j < 59; j++) {
if ((1LL << j) & temp) {
count[j]++;
}
}
}
/*
cout<<keta<<"\n";
debug(count);
*/
ll ans = 0;
vector<ll> ansd(keta, 0);
for (ll i = 59; i >= 0; i--) {
if (i >= keta) {
ans += (1LL << i) * count[i];
} else {
if (((1LL << i) & k)) {
ansd[i] = (1LL << i) * (n - count[i]) + ans; //あとは自由
ans += (1LL << i) * (count[i]);
} else {
ans += (1LL << i) * (n - count[i]);
}
for (int j = keta - 1; j > i; j--) {
if (ansd[j] != 0)
ansd[j] += (1LL << i) * max((n - count[i]), count[i]);
}
}
}
/*
cout<<ans<<"\n";
debug(ansd);
*/
rep(i, keta) { chmax(ans, ansd[i]); }
cout << ans << "\n";
}
| //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const ll INF = 1e9;
const ll LINF = ll(1e18) + 1;
const ll MOD = 1000000007;
const ll dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const ll Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n, k;
vector<ll> a;
ll dight(ll l) {
ll count = 0;
while (l) {
l /= 2;
count++;
}
return count;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
ll keta = dight(k);
vector<ll> count(60, 0);
for (ll i = 0; i < n; i++) {
ll temp;
cin >> temp;
a.push_back(temp);
for (ll j = 0; j < 59; j++) {
if ((1LL << j) & temp) {
count[j]++;
}
}
}
/*
cout<<keta<<"\n";
debug(count);
*/
ll ans = 0;
vector<ll> ansd(keta, 0);
for (ll i = 59; i >= 0; i--) {
if (i >= keta) {
ans += (1LL << i) * count[i];
} else {
if (((1LL << i) & k)) {
ansd[i] = (1LL << i) * (count[i]) + ans; //あとは自由
ans += (1LL << i) * (n - count[i]);
} else {
ans += (1LL << i) * (count[i]);
}
for (int j = keta - 1; j > i; j--) {
if (ansd[j] != 0)
ansd[j] += (1LL << i) * max((n - count[i]), count[i]);
}
}
}
/*
cout<<ans<<"\n";
debug(ansd);
*/
rep(i, keta) { chmax(ans, ansd[i]); }
cout << ans << "\n";
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 939,316 | 939,317 | u155416173 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const int INF = 1001001001;
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y)
swap(x, y);
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> Type lcm(Type x, Type y) { return x * y / gcd(x, y); }
template <class Type> bool is_prime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binary_search_judge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binary_search(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binary_search_judge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
int main() {
ll d = 50;
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(d + 1, vector<ll>(2, -1));
dp[0][0] = 0;
for (int i = 1; i <= d; i++) {
ll mask = 1LL << d - i;
ll num = 0;
for (int j = 0; j < n; j++)
if (a[j] & mask)
num++;
ll count1 = mask * num;
ll count0 = mask * (n - num);
if (dp[i - 1][0] != -1) {
dp[i][0] = dp[i - 1][0] + max(count0, count1);
}
if (dp[i - 1][1] != -1) {
if (k & mask)
dp[i][0] = max(dp[i][0], dp[i - 1][1] + count1);
}
if (dp[i - 1][1] != -1) {
if (k & mask)
dp[i][1] = dp[i - 1][1] + count0;
else
dp[i][1] = dp[i - 1][1] + count1;
}
}
cout << max(dp[d][0], dp[d][1]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const int INF = 1001001001;
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y)
swap(x, y);
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> Type lcm(Type x, Type y) { return x * y / gcd(x, y); }
template <class Type> bool is_prime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binary_search_judge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binary_search(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binary_search_judge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
int main() {
ll d = 50;
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(d + 1, vector<ll>(2, -1));
dp[0][1] = 0;
for (int i = 1; i <= d; i++) {
ll mask = 1LL << d - i;
ll num = 0;
for (int j = 0; j < n; j++)
if (a[j] & mask)
num++;
ll count1 = mask * num;
ll count0 = mask * (n - num);
if (dp[i - 1][0] != -1) {
dp[i][0] = dp[i - 1][0] + max(count0, count1);
}
if (dp[i - 1][1] != -1) {
if (k & mask)
dp[i][0] = max(dp[i][0], dp[i - 1][1] + count1);
}
if (dp[i - 1][1] != -1) {
if (k & mask)
dp[i][1] = dp[i - 1][1] + count0;
else
dp[i][1] = dp[i - 1][1] + count1;
}
}
cout << max(dp[d][0], dp[d][1]) << endl;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 939,332 | 939,333 | u999989620 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(), greater<int>());
#define INF 999999999
#define MOD 1000000007
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(), (X).end()
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
ll N, K;
vector<ll> A;
void input() {
#ifdef __LOCAL
fs::path p = __FILE__;
fs::path input, output;
input = output = p.parent_path();
input += string("/input/") + string(p.stem()) + string(".txt");
output += string("/output/") + string(p.stem()) + string(".txt");
freopen(input.c_str(), "r", stdin);
freopen(output.c_str(), "w", stdout);
#endif
cin >> N >> K;
A = fetch_vec<ll>(N);
}
int solve() {
input();
ll ans = 0;
int M = 41;
for (int j = M; j >= 0; j--) {
ll X = 0;
ll ansj = 0;
if (!((K >> j) & 1))
continue;
for (int k = M; k > j; k--)
X |= K & (1LL << k);
for (int i = (j - 1); i >= 0; i--) {
int chk = 0;
for (auto a : A)
chk += (a >> i) & 1;
if (2 * chk >= N)
continue;
else
X |= (1LL << i);
}
REP(i, N) ansj += X ^ A[i];
ans = max(ans, ansj);
}
cout << ans << endl;
return 0;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(), greater<int>());
#define INF 999999999
#define MOD 1000000007
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(), (X).end()
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
ll N, K;
vector<ll> A;
void input() {
#ifdef __LOCAL
fs::path p = __FILE__;
fs::path input, output;
input = output = p.parent_path();
input += string("/input/") + string(p.stem()) + string(".txt");
output += string("/output/") + string(p.stem()) + string(".txt");
freopen(input.c_str(), "r", stdin);
freopen(output.c_str(), "w", stdout);
#endif
cin >> N >> K;
A = fetch_vec<ll>(N);
}
int solve() {
input();
ll ans = 0;
int M = 41;
K++;
for (int j = M; j >= 0; j--) {
ll X = 0;
ll ansj = 0;
if (!((K >> j) & 1))
continue;
for (int k = M; k > j; k--)
X |= K & (1LL << k);
for (int i = (j - 1); i >= 0; i--) {
int chk = 0;
for (auto a : A)
chk += (a >> i) & 1;
if (2 * chk >= N)
continue;
else
X |= (1LL << i);
}
REP(i, N) ansj += X ^ A[i];
ans = max(ans, ansj);
}
// ll X = K;
// ll ansj=0;
// REP(i,N) ansj += X^A[i];
// ans = max(ans,ansj);
cout << ans << endl;
return 0;
}
int main() {
solve();
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 939,343 | 939,344 | u858670323 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 60; i >= -1; i--) {
if (!((k >> i) & 1LL) && i != -1) {
continue;
}
ll tmp = 0LL;
for (int j = 60; j >= 0; j--) {
ll mask = (1LL << j);
ll count = 0LL;
for (int k = 0; k < n; k++) {
if (a[k] & mask) {
count++;
}
}
if (i < j) {
if (k & mask) {
tmp += (n - count) * mask;
} else {
tmp += count * mask;
}
} else if (i == j) {
tmp += (n - count) * mask;
} else {
tmp += mask * max(count, n - count);
}
}
// cout << tmp << endl;
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 60; i >= -1; i--) {
if (!((k >> i) & 1LL) && i != -1) {
continue;
}
ll tmp = 0LL;
for (int j = 60; j >= 0; j--) {
ll mask = (1LL << j);
ll count = 0LL;
for (int k = 0; k < n; k++) {
if (a[k] & mask) {
count++;
}
}
if (i < j) {
if (k & mask) {
tmp += (n - count) * mask;
} else {
tmp += count * mask;
}
} else if (i == j) {
tmp += count * mask;
} else {
tmp += mask * max(count, n - count);
}
}
// cout << tmp << endl;
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | [] | 939,348 | 939,349 | u471212175 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<vector<int>> dp(60, vector<int>(2, -(1LL << 60)));
// dp[桁][K以下が確定している]
dp[40][0] = 0;
for (int i = 40; i >= 0; i--) {
int num1 = 0;
for (int j = 0; j < N; j++) {
if (1LL & A[j] >> i)
num1++;
}
int num0 = N - num1;
// K以下が確定していない状態からの遷移
if (1LL & K >> i) {
// i番目bit==1を採用 -> K以下未確定
dp[i][0] = max(dp[i][0], dp[i + 1][0] + num0 * (1LL << i));
// i番目bit==0を採用 -> K以下確定
dp[i][1] = max(dp[i][0], dp[i + 1][0] + num1 * (1LL << i));
} else {
// i番目bit==1を採用 -> K+1以上確定
// i番目bit==0を採用 -> K以下未確定
dp[i][0] = max(dp[i][0], dp[i + 1][0] + num1 * (1LL << i));
}
// K以下が確定している状態からの遷移
dp[i][1] = max(dp[i][1], dp[i + 1][1] + max(num0, num1) * (1LL << i));
}
cout << max(dp[0][0], dp[0][1]) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<vector<int>> dp(60, vector<int>(2, -(1LL << 60)));
// dp[桁][K以下が確定している]
dp[40][0] = 0;
for (int i = 40; i >= 0; i--) {
int num1 = 0;
for (int j = 0; j < N; j++) {
if (1LL & A[j] >> i)
num1++;
}
int num0 = N - num1;
// K以下が確定していない状態からの遷移
if (1LL & K >> i) {
// i番目bit==1を採用 -> K以下未確定
dp[i][0] = max(dp[i][0], dp[i + 1][0] + num0 * (1LL << i));
// i番目bit==0を採用 -> K以下確定
dp[i][1] = max(dp[i][1], dp[i + 1][0] + num1 * (1LL << i));
} else {
// i番目bit==1を採用 -> K+1以上確定
// i番目bit==0を採用 -> K以下未確定
dp[i][0] = max(dp[i][0], dp[i + 1][0] + num1 * (1LL << i));
}
// K以下が確定している状態からの遷移
dp[i][1] = max(dp[i][1], dp[i + 1][1] + max(num0, num1) * (1LL << i));
}
cout << max(dp[0][0], dp[0][1]) << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 939,354 | 939,355 | u344122377 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n;
ll k, a[100010];
int n1[100010];
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, n) {
rep(j, 61) { n1[j] += a[i] >> j & 1; }
}
ll ans = 0, sum = 0;
rep(i, 60) {
if (n - n1[i] > n1[i] && sum + (1LL << i) <= k) {
sum += 1LL << i;
ans += (n - n1[i]) * (1LL << i);
} else {
ans += n1[i] * (1LL << i);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n;
ll k, a[100010];
int n1[100010];
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, n) {
rep(j, 61) { n1[j] += a[i] >> j & 1; }
}
ll ans = 0, sum = 0;
rrep(i, 60) {
if (n - n1[i] > n1[i] && sum + (1LL << i) <= k) {
sum += 1LL << i;
ans += (n - n1[i]) * (1LL << i);
} else {
ans += n1[i] * (1LL << i);
}
}
cout << ans << endl;
}
| [
"identifier.change",
"call.function.change"
] | 939,360 | 939,361 | u864667985 | cpp |
p03138 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> d(61, 0);
rep(i, n) rep(j, 61) d[j] += a[i] >> j & 1; //各桁の１の合計
ll x = 0, sum = 0;
repr(i, 60) {
if (d[i] < n - d[i] && x + 1LL << i <= k) //０の方が多い場合は桁を１にする。
{
x += 1LL << i;
sum += (n - d[i]) * 1LL << i;
} else
sum += d[i] * 1LL << i;
}
OP(sum);
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> d(61, 0);
rep(i, n) rep(j, 61) d[j] += a[i] >> j & 1; //各桁の１の合計
ll x = 0, sum = 0;
repr(i, 60) {
if (d[i] < n - d[i] &&
x + (1LL << i) <= k) //０の方が多い場合は桁を１にする。
{
x += 1LL << i;
sum += (n - d[i]) * 1LL << i;
} else
sum += d[i] * 1LL << i;
}
OP(sum);
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 939,367 | 939,368 | u016189984 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
const lint MAX = 10000000;
lint fac[MAX], finv[MAX], inv[MAX];
void COMinit() // 二項係数を求める時は前処理としてCOMinit()をする
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lint i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(lint n, lint k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
lint primary(lint num) {
if (num < 2)
return 0;
else if (num == 2)
return 1;
else if (num % 2 == 0)
return 0; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return 0;
}
}
// 素数である
return 1;
}
int main() {
lint N, K;
lint ans = 0;
cin >> N >> K;
lint M[N];
lint x[60];
rep(i, 60) { x[i] = 0; }
rep(i, N) { cin >> M[i]; }
rep(i, N) {
lint h = log2(M[i]) + 1;
rep(j, h) {
if (M[i] % 2 == 1)
x[j]++;
M[i] /= 2;
}
}
lint g = log2(K);
repm(i, 60) {
if ((N - x[i]) > x[i] && pow(2, i) <= K) {
ans += (lint)pow(2, i) * (N - x[i]);
K = -(lint)pow(2, i);
} else {
ans += (lint)pow(2, i) * x[i];
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
typedef long long lint;
const lint MOD = 1000000007;
const lint MAX = 10000000;
lint fac[MAX], finv[MAX], inv[MAX];
void COMinit() // 二項係数を求める時は前処理としてCOMinit()をする
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lint i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(lint n, lint k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
lint primary(lint num) {
if (num < 2)
return 0;
else if (num == 2)
return 1;
else if (num % 2 == 0)
return 0; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return 0;
}
}
// 素数である
return 1;
}
int main() {
lint N, K;
lint ans = 0;
cin >> N >> K;
lint M[N];
lint x[60];
rep(i, 60) { x[i] = 0; }
rep(i, N) { cin >> M[i]; }
rep(i, N) {
lint h = log2(M[i]) + 1;
rep(j, h) {
if (M[i] % 2 == 1)
x[j]++;
M[i] /= 2;
}
}
lint g = log2(K);
repm(i, 60) {
if ((N - x[i]) > x[i] && pow(2, i) <= K) {
ans += (lint)pow(2, i) * (N - x[i]);
K -= (lint)pow(2, i);
} else {
ans += (lint)pow(2, i) * x[i];
}
}
cout << ans;
}
| [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 939,373 | 939,374 | u768204022 | cpp |
p03138 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1LL << 60;
constexpr int INF = 3000000007;
const double INFD = 1e100;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// ----------------------------------------------------------------------------
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll res = 0;
for (int d = 60; d >= -1; d--) {
if (d != -1 && !(K & (1LL << d)))
continue;
ll tmp = 0;
for (int e = 60; e >= 0; e--) {
ll mask = (1LL << e);
int num = 0;
for (int i = 0; i < N; i++) {
if (A[i] & mask)
num++;
}
if (e > d) {
if (K & mask) {
tmp += mask * (N - num);
} else {
tmp += mask * num;
}
} else if (e == d) {
tmp += mask * num;
} else {
tmp += max(N - num, num);
}
}
chmax(res, tmp);
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1LL << 60;
constexpr int INF = 3000000007;
const double INFD = 1e100;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// ----------------------------------------------------------------------------
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll res = 0;
for (int d = 60; d >= -1; d--) {
if (d != -1 && !(K & (1LL << d)))
continue;
ll tmp = 0;
for (int e = 60; e >= 0; e--) {
ll mask = (1LL << e);
int num = 0;
for (int i = 0; i < N; i++) {
if (A[i] & mask)
num++;
}
if (e > d) {
if (K & mask) {
tmp += mask * (N - num);
} else {
tmp += mask * num;
}
} else if (e == d) {
tmp += mask * num;
} else {
tmp += mask * max(N - num, num);
}
}
chmax(res, tmp);
}
cout << res << endl;
return 0;
}
| [
"assignment.change"
] | 939,375 | 939,376 | u550014122 | cpp |
p03138 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1LL << 60;
constexpr int INF = 3000000007;
const double INFD = 1e100;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// ----------------------------------------------------------------------------
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll res = 0;
for (int d = 40; d >= -1; d--) {
if (d != -1 && !(K & (1LL << d)))
continue;
ll tmp = 0;
for (int e = 40; e >= 0; e--) {
ll mask = (1LL << e);
int num = 0;
for (int i = 0; i < N; i++) {
if (A[i] & mask)
num++;
}
if (e > d) {
if (K & mask) {
tmp += mask * (N - num);
} else {
tmp += mask * num;
}
} else if (e == d) {
tmp += mask * num;
} else {
tmp += max(N - num, num);
}
}
chmax(res, tmp);
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1LL << 60;
constexpr int INF = 3000000007;
const double INFD = 1e100;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// ----------------------------------------------------------------------------
int main() {
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll res = 0;
for (int d = 60; d >= -1; d--) {
if (d != -1 && !(K & (1LL << d)))
continue;
ll tmp = 0;
for (int e = 60; e >= 0; e--) {
ll mask = (1LL << e);
int num = 0;
for (int i = 0; i < N; i++) {
if (A[i] & mask)
num++;
}
if (e > d) {
if (K & mask) {
tmp += mask * (N - num);
} else {
tmp += mask * num;
}
} else if (e == d) {
tmp += mask * num;
} else {
tmp += mask * max(N - num, num);
}
}
chmax(res, tmp);
}
cout << res << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 939,377 | 939,376 | u550014122 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vll a(n);
vll ss(60);
REP(i, n) {
cin >> a[i];
REP(j, 50) {
if ((a[i] >> j) & 1)
ss[j]++;
}
}
ll res = 0;
// feasible set : X <= K
REP(i, 50) {
ll mask = 0;
REPR(j, i + 1) {
if (mask | (1LL << j) <= k && n - ss[j] > ss[j])
mask |= (1LL << j);
}
ll cur = 0, bi = 1;
REP(j, n) cur += (a[j] ^ mask);
res = max(res, cur);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vll a(n);
vll ss(60);
REP(i, n) {
cin >> a[i];
REP(j, 50) {
if ((a[i] >> j) & 1)
ss[j]++;
}
}
ll res = 0;
// 最大桁数 i 桁で feasibke な mask := X(i) <= K を構築
REP(i, 50) {
ll mask = 0;
REPR(j, i + 1) {
if (mask + (1LL << j) <= k && n - ss[j] > ss[j])
mask += (1LL << j);
}
ll cur = 0;
REP(j, n) cur += (a[j] ^ mask);
res = max(res, cur);
}
cout << res << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operator.change",
"variable_declaration.remove"
] | 939,384 | 939,385 | u986276444 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
template <class T> using lim = numeric_limits<T>;
typedef long long ll;
typedef long double ld;
const int maxBit = 62;
int bitCount[maxBit + 1];
void addToCount(ll x) {
for (int i = 0; i < maxBit; i++) {
bitCount[i] += x % 2;
x /= 2;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
memset(bitCount, 0, sizeof bitCount);
int n;
ll k;
cin >> n >> k;
ll a[n];
// add the number to the bitCount
for (int i = 0; i < n; i++) {
cin >> a[i];
addToCount(a[i]);
}
ll best = 0;
// computing the optimal x
// 1 if more 0's than 1's, 0 otherwise
for (int i = maxBit; i >= 0; i--) {
ll toAdd = (bitCount[i] <= n / 2) * (1LL << i);
if (best + toAdd < k) {
best += toAdd;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += best ^ a[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> using lim = numeric_limits<T>;
typedef long long ll;
typedef long double ld;
const int maxBit = 62;
int bitCount[maxBit + 1];
void addToCount(ll x) {
for (int i = 0; i < maxBit; i++) {
bitCount[i] += x % 2;
x /= 2;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
memset(bitCount, 0, sizeof bitCount);
int n;
ll k;
cin >> n >> k;
ll a[n];
// add the number to the bitCount
for (int i = 0; i < n; i++) {
cin >> a[i];
addToCount(a[i]);
}
ll best = 0;
// computing the optimal x
// 1 if more 0's than 1's, 0 otherwise
for (int i = maxBit; i >= 0; i--) {
ll toAdd = (bitCount[i] <= n / 2) * (1LL << i);
if (best + toAdd <= k) {
best += toAdd;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += best ^ a[i];
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,386 | 939,387 | u712768978 | cpp |
p03138 | #include <bits/stdc++.h>
#define fastio1 ios_base::sync_with_stdio(false)
#define fastio2 cin.tie(NULL)
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
fastio1;
fastio2;
ll n, k;
cin >> n >> k;
vector<ll> a(n);
int maxBits = 45;
ll tracker[maxBits];
for (int i = 0; i < maxBits; i++) {
tracker[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
ll temp = a[i];
int b = 0;
while (temp > 0) {
tracker[b] += (temp % 2);
temp /= 2;
b++;
}
}
ll x = 0;
for (int i = maxBits - 1; i >= 0; i--) {
if (tracker[i] < n - tracker[i]) {
if (x + 1LL << i <= k) {
x += 1LL << i;
}
}
}
ll total = 0;
for (int i = 0; i < n; i++) {
total += x ^ a[i];
}
cout << total << endl;
} | #include <bits/stdc++.h>
#define fastio1 ios_base::sync_with_stdio(false)
#define fastio2 cin.tie(NULL)
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
fastio1;
fastio2;
ll n, k;
cin >> n >> k;
vector<ll> a(n);
int maxBits = 45;
ll tracker[maxBits];
for (int i = 0; i < maxBits; i++) {
tracker[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
ll temp = a[i];
int b = 0;
while (temp > 0) {
tracker[b] += (temp % 2);
temp /= 2;
b++;
}
}
ll x = 0;
for (int i = maxBits - 1; i >= 0; i--) {
if (tracker[i] < n - tracker[i]) {
if (x + (1LL << i) <= k) {
x += (1LL << i);
}
}
}
ll total = 0;
for (int i = 0; i < n; i++) {
total += x ^ a[i];
}
cout << total << endl;
} | [
"control_flow.branch.if.condition.change"
] | 939,388 | 939,389 | u712768978 | cpp |
p03138 | #include <bits/stdc++.h>
#define fastio1 ios_base::sync_with_stdio(false)
#define fastio2 cin.tie(NULL)
#define LL long long
#define MOD 1000000007
using namespace std;
int main() {
fastio1;
fastio2;
LL n, k;
cin >> n >> k;
vector<LL> a(n);
int tracker[42] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
LL temp = a[i];
int b = 1;
while (temp > 0) {
tracker[42 - b] += temp % 2;
temp /= 2;
b++;
}
}
LL x = 0;
for (int i = 0; i < 42; i++) {
if (x + (tracker[i] < n - tracker[i]) * (1 << (41 - i)) <= k) {
x += (tracker[i] < n - tracker[i]) * (1 << (41 - i));
}
}
LL total = 0;
for (int i = 0; i < n; i++) {
total += x ^ a[i];
}
cout << total << endl;
} | #include <bits/stdc++.h>
#define fastio1 ios_base::sync_with_stdio(false)
#define fastio2 cin.tie(NULL)
#define LL long long
#define MOD 1000000007
using namespace std;
int main() {
fastio1;
fastio2;
LL n, k;
cin >> n >> k;
vector<LL> a(n);
int tracker[42] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
LL temp = a[i];
int b = 1;
while (temp > 0) {
tracker[42 - b] += temp % 2;
temp /= 2;
b++;
}
}
LL x = 0;
for (int i = 0; i < 42; i++) {
if (x + (tracker[i] < n - tracker[i]) * (1LL << (41 - i)) <= k) {
x += (tracker[i] < n - tracker[i]) * (1LL << (41 - i));
}
}
LL total = 0;
for (int i = 0; i < n; i++) {
total += x ^ a[i];
}
cout << total << endl;
} | [
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change"
] | 939,390 | 939,391 | u712768978 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll x = 0;
bool hari = true; // 数字が張り付いてるか？
for (int i = 60; i >= 0; i--) { // 上の桁から順に見ていく
int count = 0;
// その桁の1の数を数える
for (auto a : v)
count += a >> i & 1;
// 0にできたら嬉しいときと、1にできたら嬉しいときがある
if (count * 2 > n) {
if (k >> i == 1)
hari = false; // 張り付きが取れる
} else {
// 張り付きが取れてるかkのそのbitが1とかでそこを1にできる
if (!hari || k >> i & 1 == 1)
x |= 1ll << i;
}
}
ll ans = 0;
for (auto a : v)
ans += a ^ x;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll x = 0;
bool hari = true; // 数字が張り付いてるか？
for (int i = 60; i >= 0; i--) { // 上の桁から順に見ていく
int count = 0;
// その桁の1の数を数える
for (auto a : v)
count += a >> i & 1;
// 0にできたら嬉しいときと、1にできたら嬉しいときがある
if (count * 2 > n) {
if (k >> i & 1 == 1)
hari = false; // 張り付きが取れる
} else {
// 張り付きが取れてるかkのそのbitが1とかでそこを1にできる
if (!hari || k >> i & 1 == 1)
x |= 1ll << i;
}
}
ll ans = 0;
for (auto a : v)
ans += a ^ x;
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,392 | 939,393 | u561186440 | cpp |
p03138 | #include <bits/stdc++.h>
#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 FOR(i, n, m) for (int i = n; i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= m; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(std::unique(all(x)), x.end());
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
const double PI = acos(-1);
using namespace std;
vector<int> dx = {1, 0, -1, 0};
vector<int> dy = {0, 1, 0, -1};
template <class T> bool chmax(T &a, const T &b) {
if (a <= b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b <= a) {
a = b;
return 1;
}
return 0;
}
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
bool smaller = false;
ll ans = 0;
rrep(d, 42) {
int now = (bool)(k & (1LL << d));
ll c0 = 0, c1 = 0;
rep(i, n) {
if (a[i] & (1LL << d))
c1++;
else
c0++;
}
if (smaller) {
ans += (ll)(1LL << d) * max(c0, c1);
} else {
if (now == 1 && (c0 >= c1))
smaller = true;
if (now == 1)
ans += (ll)(1LL << d) * max(c0, c1);
else
ans += (ll)(1LL << d) * c1;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#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 FOR(i, n, m) for (int i = n; i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= m; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(std::unique(all(x)), x.end());
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
const double PI = acos(-1);
using namespace std;
vector<int> dx = {1, 0, -1, 0};
vector<int> dy = {0, 1, 0, -1};
template <class T> bool chmax(T &a, const T &b) {
if (a <= b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b <= a) {
a = b;
return 1;
}
return 0;
}
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
bool smaller = false;
ll ans = 0;
rrep(d, 42) {
int now = (bool)(k & (1LL << d));
ll c0 = 0, c1 = 0;
rep(i, n) {
if (a[i] & (1LL << d))
c1++;
else
c0++;
}
if (smaller) {
ans += (ll)(1LL << d) * max(c0, c1);
} else {
if (now == 1 && (c1 >= c0))
smaller = true;
if (now == 1)
ans += (ll)(1LL << d) * max(c0, c1);
else
ans += (ll)(1LL << d) * c1;
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 939,403 | 939,404 | u649915042 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
//#define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
typedef pair<ll, ll> l_l;
ll inf = (ll)1E18;
#define rep(i, l, r) for (ll i = l; i <= r; i++)
#define pb push_back
ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
void Max(ll &pos, ll val) { pos = max(pos, val); } // Max(dp[n],dp[n-1]);
void Min(ll &pos, ll val) { pos = min(pos, val); }
void Add(ll &pos, ll val) { pos = mod(pos + val); }
dd EPS = 1E-9;
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
////////////////////////////
int main() {
fastio ll n, k;
cin >> n >> k;
ll a[n];
rep(i, 0, n - 1) cin >> a[i];
ll N = 50;
ll c[N];
memset(c, 0, sizeof(c));
rep(i, 0, n - 1) {
rep(j, 0, N - 1) {
if ((a[i] >> (N - 1 - j)) & 1)
c[j]++;
}
}
// rep(i,0,N-1)cout<<c[i]<<" ";cout<<endl;
ll dp[N][2];
memset(dp, 0, sizeof(dp));
dp[0][0] = -1;
rep(i, 1, N - 1) {
ll p = 1ll << (N - 1 - i);
if ((k >> (N - 1 - i)) & 1) {
if (dp[i - 1][1] >= 0)
dp[i][1] = dp[i - 1][1] + (n - c[i]) * p; // Xとして1使う
} else {
if (dp[i - 1][1] >= 0)
dp[i][1] = dp[i - 1][1] + c[i] * p; // Xとして1使わない
}
if ((k >> (N - 1 - i)) & 1) {
if (dp[i - 1][0] >= 0)
dp[i][0] = dp[i - 1][0] + max(c[i], (n - c[i])) * p;
if (dp[i - 1][1] >= 0)
Max(dp[i][0], dp[i - 1][1] + c[i] * p);
} else {
if (dp[i - 1][0] >= 0)
dp[i][0] = dp[i - 1][0] + max(c[i], (n - c[i])) * p;
}
Max(dp[i][1], dp[i][0]);
}
/*
rep(j,0,1){
rep(i,0,N-1)cout<<dp[i][j]<<" ";
cout<<endl;
}
cout<<max(dp[N-1][0],dp[N-1][1])<<endl;
*/
cout << dp[N - 1][1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
//#define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
typedef pair<ll, ll> l_l;
ll inf = (ll)1E18;
#define rep(i, l, r) for (ll i = l; i <= r; i++)
#define pb push_back
ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
void Max(ll &pos, ll val) { pos = max(pos, val); } // Max(dp[n],dp[n-1]);
void Min(ll &pos, ll val) { pos = min(pos, val); }
void Add(ll &pos, ll val) { pos = mod(pos + val); }
dd EPS = 1E-9;
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
////////////////////////////
int main() {
fastio ll n, k;
cin >> n >> k;
ll a[n];
rep(i, 0, n - 1) cin >> a[i];
ll N = 50;
ll c[N];
memset(c, 0, sizeof(c));
rep(i, 0, n - 1) {
rep(j, 0, N - 1) {
if ((a[i] >> (N - 1 - j)) & 1)
c[j]++;
}
}
// rep(i,0,N-1)cout<<c[i]<<" ";cout<<endl;
ll dp[N][2];
memset(dp, -1, sizeof(dp));
dp[0][1] = 0;
rep(i, 1, N - 1) {
ll p = 1ll << (N - 1 - i);
if ((k >> (N - 1 - i)) & 1) {
if (dp[i - 1][1] >= 0)
dp[i][1] = dp[i - 1][1] + (n - c[i]) * p; // Xとして1使う
} else {
if (dp[i - 1][1] >= 0)
dp[i][1] = dp[i - 1][1] + c[i] * p; // Xとして1使わない
}
if ((k >> (N - 1 - i)) & 1) {
if (dp[i - 1][0] >= 0)
dp[i][0] = dp[i - 1][0] + max(c[i], (n - c[i])) * p;
if (dp[i - 1][1] >= 0)
Max(dp[i][0], dp[i - 1][1] + c[i] * p);
} else {
if (dp[i - 1][0] >= 0)
dp[i][0] = dp[i - 1][0] + max(c[i], (n - c[i])) * p;
}
Max(dp[i][1], dp[i][0]);
}
/*
rep(j,0,1){
rep(i,0,N-1)cout<<dp[i][j]<<" ";
cout<<endl;
}
*/
cout << dp[N - 1][1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 939,415 | 939,416 | u763881112 | cpp |
p03138 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (int i = a; i >= b; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N) \
sort(A, A + N, \
[](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
#define endl '\n'
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &&x : v)
is >> x;
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
os << p.first << ' ' << p.second;
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = begin(v); i != end(v); ++i) {
if (i != begin(v))
os << ' ';
os << *i;
}
return os;
}
ll C[50];
int main() {
ll N, K, A[100007], M = 0, sum = 0;
cin >> N >> K;
rep(i, N) {
cin >> A[i];
ll P = A[i];
ll T = 0;
while (P > 0) {
if (P % 2 == 1) {
C[T]++;
}
T++;
P /= 2;
}
}
ll X = pow(2, 40);
rRep(i, 40, 1) {
if (X > K) {
X /= 2;
continue;
}
if (C[i] <= (N - 1) / 2 && M + X <= K) {
M += X;
}
X /= 2;
}
rep(i, N) { sum += A[i] ^ M; }
cout << sum << endl;
} | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (int i = a; i >= b; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N) \
sort(A, A + N, \
[](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
#define endl '\n'
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &&x : v)
is >> x;
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
os << p.first << ' ' << p.second;
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = begin(v); i != end(v); ++i) {
if (i != begin(v))
os << ' ';
os << *i;
}
return os;
}
ll C[50];
int main() {
ll N, K, A[100007], M = 0, sum = 0;
cin >> N >> K;
rep(i, N) {
cin >> A[i];
ll P = A[i];
ll T = 0;
while (P > 0) {
if (P % 2 == 1) {
C[T]++;
}
T++;
P /= 2;
}
}
ll X = pow(2, 40);
rRep(i, 40, 0) {
if (X > K) {
X /= 2;
continue;
}
if (C[i] <= (N - 1) / 2 && M + X <= K) {
M += X;
}
X /= 2;
}
rep(i, N) { sum += A[i] ^ M; }
cout << sum << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 939,419 | 939,420 | u008229752 | cpp |
p03138 | #include <bits/stdc++.h>
#define INF 2147483647
#define INF_LL 9223372036854775807
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<ll> B(41, 0);
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < 41; j++) {
if (A[i] & (1LL << j))
B[j]++;
}
}
ll K_ = 0, ans = 0;
for (ll i = 40; (i >= 0); i--) {
if ((K - K_) > (1LL << i) && (N - B[i]) > B[i]) {
K_ += 1LL << i;
ans += (N - B[i]) * (1LL << i);
} else {
ans += B[i] * (1LL << i);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define INF 2147483647
#define INF_LL 9223372036854775807
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<ll> B(50, 0);
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < 50; j++) {
if (A[i] & (1LL << j))
B[j]++;
}
}
ll K_ = 0, ans = 0;
for (ll i = 49; (i >= 0); i--) {
if ((K - K_) >= (1LL << i) && (N - B[i]) >= B[i]) {
K_ += 1LL << i;
ans += (N - B[i]) * (1LL << i);
} else {
ans += B[i] * (1LL << i);
}
}
cout << ans << endl;
} | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 939,429 | 939,430 | u326966549 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(41, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 41; ++j) {
if (a[i] & (1LL << j))
++l[j];
}
}
vector<ll> dp(2, -INF);
dp[1] = 0;
for (ll i = 40; i >= 0; --i) {
vector<ll> nex(2, -INF);
if (dp[0] != -INF) {
nex[0] = max(nex[0], dp[0] + (1LL << i) * (n - l[i]));
nex[0] = max(nex[0], dp[0] + (1LL << i) * l[i]);
}
if (dp[1] < 0)
continue;
// 立てる場合
if (k & (1LL << i)) {
// 限界まで伸ばす
nex[1] = max(nex[0], dp[1] + (1LL << i) * (n - l[i]));
nex[0] = max(nex[1], dp[1] + (1LL << i) * l[i]);
} else {
// 立てられない場合
nex[1] = max(nex[1], dp[1] + (1LL << i) * l[i]);
}
dp = move(nex);
}
cout << *max_element(dp.begin(), dp.end()) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(45, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 45; ++j) {
if (a[i] & (1LL << j))
++l[j];
}
}
vector<ll> dp(2, -INF);
dp[1] = 0;
for (ll i = 44; i >= 0; --i) {
vector<ll> nex(2, -INF);
if (dp[0] != -INF) {
nex[0] = max(nex[0], dp[0] + (1LL << i) * (n - l[i]));
nex[0] = max(nex[0], dp[0] + (1LL << i) * l[i]);
}
if (dp[1] < 0)
continue;
// 立てる場合
if (k & (1LL << i)) {
nex[1] = max(nex[1], dp[1] + (1LL << i) * (n - l[i]));
// 限界まで伸ばす
nex[0] = max(nex[0], dp[1] + (1LL << i) * l[i]);
} else {
// 立てられない場合
nex[1] = max(nex[1], dp[1] + (1LL << i) * l[i]);
}
dp = move(nex);
}
cout << *max_element(dp.begin(), dp.end()) << endl;
}
| [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 939,431 | 939,432 | u705918648 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(50, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 50; ++j) {
if (a[i] & (1LL << j))
++l[j];
}
}
vector<ll> dp(2, -INF);
dp[1] = 0;
for (ll i = 49; i >= 0; --i) {
vector<ll> nex(2, -INF);
if (dp[0] != -INF) {
nex[0] = max(nex[0], dp[0] + (1LL << i) * (n - l[i]));
nex[0] = max(nex[0], dp[0] + (1LL << i) * l[i]);
}
if (dp[1] < 0)
continue;
// 立てる場合
if (k & (1LL << i)) {
// 限界まで伸ばす
nex[1] = max(nex[0], dp[1] + (1LL << i) * (n - l[i]));
nex[0] = max(nex[1], dp[1] + (1LL << i) * l[i]);
} else {
// 立てられない場合
nex[1] = max(nex[1], dp[1] + (1LL << i) * l[i]);
}
dp = move(nex);
}
cout << *max_element(dp.begin(), dp.end()) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(45, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 45; ++j) {
if (a[i] & (1LL << j))
++l[j];
}
}
vector<ll> dp(2, -INF);
dp[1] = 0;
for (ll i = 44; i >= 0; --i) {
vector<ll> nex(2, -INF);
if (dp[0] != -INF) {
nex[0] = max(nex[0], dp[0] + (1LL << i) * (n - l[i]));
nex[0] = max(nex[0], dp[0] + (1LL << i) * l[i]);
}
if (dp[1] < 0)
continue;
// 立てる場合
if (k & (1LL << i)) {
nex[1] = max(nex[1], dp[1] + (1LL << i) * (n - l[i]));
// 限界まで伸ばす
nex[0] = max(nex[0], dp[1] + (1LL << i) * l[i]);
} else {
// 立てられない場合
nex[1] = max(nex[1], dp[1] + (1LL << i) * l[i]);
}
dp = move(nex);
}
cout << *max_element(dp.begin(), dp.end()) << endl;
}
| [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 939,433 | 939,432 | u705918648 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(45, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 45; ++j) {
if (a[i] & (1LL << j))
++l[j];
}
}
vector<ll> dp(2, -INF);
dp[1] = 0;
for (ll i = 44; i >= 0; --i) {
vector<ll> nex(2, -INF);
if (dp[0] != -INF) {
nex[0] = max(nex[0], dp[0] + (1LL << i) * (n - l[i]));
nex[0] = max(nex[0], dp[0] + (1LL << i) * l[i]);
}
if (dp[1] < 0)
continue;
// 立てる場合
if (k & (1LL << i)) {
nex[0] = max(nex[0], dp[1] + (1LL << i) * (n - l[i]));
// 限界まで伸ばす
nex[1] = max(nex[1], dp[1] + (1LL << i) * l[i]);
} else {
// 立てられない場合
nex[1] = max(nex[1], dp[1] + (1LL << i) * l[i]);
}
dp = move(nex);
}
cout << *max_element(dp.begin(), dp.end()) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
// l: 立っているものの数 0の時はこれが加算される
vector<ll> l(45, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = 0; j < 45; ++j) {
if (a[i] & (1LL << j))
++l[j];
}
}
vector<ll> dp(2, -INF);
dp[1] = 0;
for (ll i = 44; i >= 0; --i) {
vector<ll> nex(2, -INF);
if (dp[0] != -INF) {
nex[0] = max(nex[0], dp[0] + (1LL << i) * (n - l[i]));
nex[0] = max(nex[0], dp[0] + (1LL << i) * l[i]);
}
if (dp[1] < 0)
continue;
// 立てる場合
if (k & (1LL << i)) {
nex[1] = max(nex[1], dp[1] + (1LL << i) * (n - l[i]));
// 限界まで伸ばす
nex[0] = max(nex[0], dp[1] + (1LL << i) * l[i]);
} else {
// 立てられない場合
nex[1] = max(nex[1], dp[1] + (1LL << i) * l[i]);
}
dp = move(nex);
}
cout << *max_element(dp.begin(), dp.end()) << endl;
}
| [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 939,434 | 939,432 | u705918648 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[100010];
ll one[64], zero[64];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
ll cnt = 0;
for (ll i = k; i != 0; cnt++)
i /= 2;
for (int i = 0; i < n; i++) {
ll ba = a[i];
for (int j = 0; j < cnt; j++) {
if (ba % 2)
one[j]++;
else
zero[j]++;
ba /= 2;
}
}
ll x = 0;
for (ll i = cnt - 1, j = pow(2, i); i >= 0; i--, j /= 2) {
if (zero[i] > one[i]) {
if (k >= x + j)
x += j;
else
break;
}
}
ll ans = 0;
for (int i = 0; i < n; i++)
ans += (a[i] ^ x);
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[100010];
ll one[64], zero[64];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
ll cnt = 0;
for (ll i = k; i != 0; cnt++)
i /= 2;
for (int i = 0; i < n; i++) {
ll ba = a[i];
for (int j = 0; j < cnt; j++) {
if (ba % 2)
one[j]++;
else
zero[j]++;
ba /= 2;
}
}
ll x = 0;
for (ll i = cnt - 1, j = pow(2, i); i >= 0; i--, j /= 2) {
if (zero[i] > one[i]) {
if (k >= x + j)
x += j;
}
}
ll ans = 0;
for (int i = 0; i < n; i++)
ans += (a[i] ^ x);
cout << ans << "\n";
return 0;
}
| [
"control_flow.branch.else.remove"
] | 939,439 | 939,440 | u288035794 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
ll dp[100][2];
int main() {
int n;
ll k;
cin >> n >> k;
ll a[n];
rep(i, n) cin >> a[i];
rep(i, 100) {
dp[i][0] = -1;
dp[i][1] = -1;
}
dp[50][0] = 0;
for (int d = 49; d >= 0; d--) {
ll mask = 1LL << d;
int num = 0;
rep(i, n) if (a[i] & mask) num++;
if (k & mask) { // Xの下からd桁目が１
if (dp[d + 1][0] >= 0) {
chmax(dp[d][0], dp[d + 1][0] + mask * (n - num));
chmax(dp[d][1], dp[d + 1][0] + mask * num);
}
if (dp[d + 1][1] >= 0)
chmax(dp[d][1], dp[d + 1][1] + max(num, n - num));
} else {
if (dp[d + 1][0] >= 0)
chmax(dp[d][0], dp[d + 1][0] + mask * num);
if (dp[d + 1][1] >= 0)
chmax(dp[d][1], dp[d + 1][1] + max(num, n - num));
}
}
ll ans = max(dp[0][0], dp[0][1]);
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
ll dp[100][2];
int main() {
int n;
ll k;
cin >> n >> k;
ll a[n];
rep(i, n) cin >> a[i];
rep(i, 100) {
dp[i][0] = -1;
dp[i][1] = -1;
}
dp[50][0] = 0;
for (int d = 49; d >= 0; d--) {
ll mask = 1LL << d;
int num = 0;
rep(i, n) if (a[i] & mask) num++;
if (k & mask) { // Xの下からd桁目が１
if (dp[d + 1][0] >= 0) {
chmax(dp[d][0], dp[d + 1][0] + mask * (n - num));
chmax(dp[d][1], dp[d + 1][0] + mask * num);
}
if (dp[d + 1][1] >= 0)
chmax(dp[d][1], dp[d + 1][1] + mask * max(num, n - num));
} else {
if (dp[d + 1][0] >= 0)
chmax(dp[d][0], dp[d + 1][0] + mask * num);
if (dp[d + 1][1] >= 0)
chmax(dp[d][1], dp[d + 1][1] + mask * max(num, n - num));
}
}
ll ans = max(dp[0][0], dp[0][1]);
cout << ans << endl;
}
| [
"expression.operation.binary.add"
] | 939,441 | 939,442 | u139300044 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
//桁DP
ll dp[100][2];
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(k);
rep(i, n) cin >> a[i];
rep(i, 100) {
dp[i][0] = -1;
dp[i][1] = -1;
}
dp[45][0] = 0;
for (int i = 44; i >= 0; i--) {
ll mask = 1LL << i;
int num = 0;
rep(j, n) if (a[j] & mask) num++;
if (dp[i + 1][1] >= 0)
chmax(dp[i][1], dp[i + 1][1] + mask * max(num, n - num));
if (dp[i + 1][0] >= 0) {
if (k & (1LL << i)) {
chmax(dp[i][1], dp[i + 1][0] + mask * num);
chmax(dp[i][0], dp[i + 1][0] + mask * (n - num));
} else {
chmax(dp[i][0], dp[i + 1][0] + mask * num);
}
}
}
cout << max(dp[0][0], dp[0][1]) << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
//桁DP
ll dp[100][2];
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
rep(i, 100) {
dp[i][0] = -1;
dp[i][1] = -1;
}
dp[45][0] = 0;
for (int i = 44; i >= 0; i--) {
ll mask = 1LL << i;
int num = 0;
rep(j, n) if (a[j] & mask) num++;
if (dp[i + 1][1] >= 0)
chmax(dp[i][1], dp[i + 1][1] + mask * max(num, n - num));
if (dp[i + 1][0] >= 0) {
if (k & (1LL << i)) {
chmax(dp[i][1], dp[i + 1][0] + mask * num);
chmax(dp[i][0], dp[i + 1][0] + mask * (n - num));
} else {
chmax(dp[i][0], dp[i + 1][0] + mask * num);
}
}
}
cout << max(dp[0][0], dp[0][1]) << endl;
}
| [
"preprocessor.define.value.change"
] | 939,443 | 939,444 | u139300044 | cpp |
p03138 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007ll;
// const ll mod = 10007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define bbrep(n) for (int bbit = 0; bbit < (1 << n); bbit++)
#define erep(i, container) for (auto &i : container)
#define itrep(i, container) for (auto i : container)
#define irep(i, n) for (ll i = n - 1; i >= (ll)0ll; i--)
#define rrep(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query \
int qq; \
std::cin >> qq; \
rep(qqq, qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a), 0ll)
#define keta fixed << setprecision
#define vout(a) \
erep(qxqxqx, a) std::cout << qxqxqx << ' '; \
std::cout << std::endl;
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
#define case std::cout << "Case #" << qqq + 1 << ":"
#define RES(a, i, j) \
a.resize(i); \
rep(ii, i) a[ii].resize(j);
#define RESRES(a, i, j, k) \
a.resize(i); \
rep(ii, i) a[ii].resize(j); \
reprep(ii, jj, i, j){dp[ii][jj].resize(k)};
#define res resize
#define as assign
#define ffor for (;;)
#define ppri(a, b) std::cout << a << " " << b << std::endl
#define pppri(a, b, c) std::cout << a << " " << b << " " << c << std::endl
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define ssum(a) accumulate(a, 0ll)
#define stirng string
#define gin(a, b) \
int a, b; \
std::cin >> a >> b; \
a--; \
b--;
#define popcount __builtin_popcount
//#define grid_input(a,type) int h,w;std::cin >>
//h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];
// typedef long long T;
ll ceil(ll a, ll b) { return ((a + b - 1) / b); }
const int INF = 2000000000;
// const ll INF64 =3223372036854775807ll;
// const ll INF64 = 9223372036854775807ll;
const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
// const ll MOD = 1000003ll;
const ll OD = 1000000000000007ll;
const dou pi = 3.141592653589793;
//メモ
// tuple<hoge,huga,foo> tのget関数はget<i>(t)
// resizeはメンバ関数
//三項演算子を覚えよう
int main() {
ll n, k;
std::cin >> n >> k;
VEC(ll, a, n);
std::vector<ll> c(40), cc(40);
std::vector<ll> d(40, 1);
rep(i, 39) d[i + 1] = d[i] * 2;
rep(i, n) {
rep(j, 40) {
if ((1ll << j) & a[i])
c[j] += d[j];
else
cc[j] += d[j];
}
}
ll ans = 0;
rep(i, n) ans += k ^ a[i];
ll di = 0;
ll kk = ans;
// std::cout << ans << std::endl;
// vout(c);
// vout(cc);
// std::cout << std::endl;
// vout(c);
rep(i, 40) {
if ((1ll << i) > k)
break;
if (k & (1ll << i)) {
if (c[i] < cc[i]) {
chmax(ans, kk + (c[i] - cc[i]) + di);
} else {
chmax(ans, kk + (c[i] - cc[i]) + di);
di += c[i] - cc[i];
// std::cout << di << std::endl;
}
} else {
if (c[i] > cc[i])
di += c[i] - cc[i]; //得する
}
// std::cout << di << std::endl;
// std::cout << ans << std::endl;
}
std::cout << ans << std::endl;
}
| #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007ll;
// const ll mod = 10007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define bbrep(n) for (int bbit = 0; bbit < (1 << n); bbit++)
#define erep(i, container) for (auto &i : container)
#define itrep(i, container) for (auto i : container)
#define irep(i, n) for (ll i = n - 1; i >= (ll)0ll; i--)
#define rrep(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query \
int qq; \
std::cin >> qq; \
rep(qqq, qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a), 0ll)
#define keta fixed << setprecision
#define vout(a) \
erep(qxqxqx, a) std::cout << qxqxqx << ' '; \
std::cout << std::endl;
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
#define case std::cout << "Case #" << qqq + 1 << ":"
#define RES(a, i, j) \
a.resize(i); \
rep(ii, i) a[ii].resize(j);
#define RESRES(a, i, j, k) \
a.resize(i); \
rep(ii, i) a[ii].resize(j); \
reprep(ii, jj, i, j){dp[ii][jj].resize(k)};
#define res resize
#define as assign
#define ffor for (;;)
#define ppri(a, b) std::cout << a << " " << b << std::endl
#define pppri(a, b, c) std::cout << a << " " << b << " " << c << std::endl
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define ssum(a) accumulate(a, 0ll)
#define stirng string
#define gin(a, b) \
int a, b; \
std::cin >> a >> b; \
a--; \
b--;
#define popcount __builtin_popcount
//#define grid_input(a,type) int h,w;std::cin >>
//h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];
// typedef long long T;
ll ceil(ll a, ll b) { return ((a + b - 1) / b); }
const int INF = 2000000000;
// const ll INF64 =3223372036854775807ll;
// const ll INF64 = 9223372036854775807ll;
const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
// const ll MOD = 1000003ll;
const ll OD = 1000000000000007ll;
const dou pi = 3.141592653589793;
//メモ
// tuple<hoge,huga,foo> tのget関数はget<i>(t)
// resizeはメンバ関数
//三項演算子を覚えよう
int main() {
ll n, k;
std::cin >> n >> k;
VEC(ll, a, n);
std::vector<ll> c(40), cc(40);
std::vector<ll> d(40, 1);
rep(i, 39) d[i + 1] = d[i] * 2;
rep(i, n) {
rep(j, 40) {
if ((1ll << j) & a[i])
c[j] += d[j];
else
cc[j] += d[j];
}
}
ll ans = 0;
rep(i, n) ans += k ^ a[i];
ll di = 0;
ll kk = ans;
// std::cout << ans << std::endl;
// vout(c);
// vout(cc);
// std::cout << std::endl;
// vout(c);
rep(i, 40) {
if ((1ll << i) > k)
break;
if (k & (1ll << i)) {
if (c[i] < cc[i]) {
chmax(ans, kk + (c[i] - cc[i]) + di);
} else {
chmax(ans, kk + (c[i] - cc[i]) + di);
di += c[i] - cc[i];
// std::cout << di << std::endl;
}
} else {
if (cc[i] > c[i])
di += cc[i] - c[i]; //得する
}
// std::cout << di << std::endl;
// std::cout << ans << std::endl;
}
std::cout << ans << std::endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 939,450 | 939,451 | u539011156 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, bit_k[63] = {}, bit_sum[63][2] = {};
long long k, a, ans;
bool islimit;
cin >> n >> k;
for (int j = 0; j < 63; j++) {
bit_k[j] = k % 2;
k = k / 2;
}
for (int i = 0; i < n; i++) {
cin >> a;
for (int j = 0; j < 63; j++) {
bit_sum[j][a % 2] += 1;
a = a / 2;
}
}
islimit = true;
ans = 0;
for (int i = 62; i >= 0; i--) {
ans = ans * 2;
if (islimit) {
if (bit_k[i] == 0) {
ans += bit_sum[i][1];
} else {
if (bit_sum[i][0] > bit_sum[i][1]) {
islimit = false;
}
ans += max(bit_sum[i][0], bit_sum[i][1]);
}
} else {
ans += max(bit_sum[i][0], bit_sum[i][1]);
}
}
cout << ans << '\n';
} |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n, bit_k[63] = {}, bit_sum[63][2] = {};
long long k, a, ans;
bool islimit;
cin >> n >> k;
for (int i = 0; i < 63; i++) {
bit_k[i] = k % 2;
k = k / 2;
}
for (int i = 0; i < n; i++) {
cin >> a;
for (int j = 0; j < 63; j++) {
bit_sum[j][a % 2] += 1;
a = a / 2;
}
}
islimit = true;
ans = 0;
for (int i = 62; i >= 0; i--) {
ans = ans * 2;
if (islimit) {
if (bit_k[i] == 0) {
ans += bit_sum[i][1];
} else {
if (bit_sum[i][1] > bit_sum[i][0]) {
islimit = false;
}
ans += max(bit_sum[i][0], bit_sum[i][1]);
}
} else {
ans += max(bit_sum[i][0], bit_sum[i][1]);
}
}
cout << ans << '\n';
} | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"literal.number.change",
"control_flow.branch.i... | 939,456 | 939,457 | u899084195 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> k(50);
int cnt = 0;
while (K > 0) {
if (K % 2 == 1)
k.at(cnt)++;
K /= 2;
cnt++;
}
cnt--;
vector<int> bitA(50);
for (int i = 0; i < N; i++) {
long long x = A.at(i);
int count = 0;
while (x > 0) {
if (x % 2 == 1)
bitA.at(count)++;
x /= 2;
count++;
}
}
long long ans = 0;
for (int j = cnt; j >= -1; j--) {
vector<int> y(50);
if (k.at(j) == 0)
continue;
for (int s = 0; s < 50; s++) {
if (j == s)
y.at(s) = 0;
else if (j < s)
y.at(s) = k.at(s);
else if (j > s)
y.at(s) = -1;
}
long long ansx = 0;
long long count2 = 1;
for (int i = 0; i < 50; i++) {
long long mx;
if (y.at(i) == 0)
mx = bitA.at(i);
else if (y.at(i) == 1)
mx = N - bitA.at(i);
else if (y.at(i) == -1)
mx = max(bitA.at(i), N - bitA.at(i));
ansx += count2 * mx;
count2 *= 2;
}
ans = max(ans, ansx);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> k(50);
int cnt = 0;
while (K > 0) {
if (K % 2 == 1)
k.at(cnt)++;
K /= 2;
cnt++;
}
cnt--;
vector<int> bitA(50);
for (int i = 0; i < N; i++) {
long long x = A.at(i);
int count = 0;
while (x > 0) {
if (x % 2 == 1)
bitA.at(count)++;
x /= 2;
count++;
}
}
long long ans = 0;
for (int j = cnt; j >= -1; j--) {
vector<int> y(50);
if (j >= 0 && k.at(j) == 0)
continue;
for (int s = 0; s < 50; s++) {
if (j == s)
y.at(s) = 0;
else if (j < s)
y.at(s) = k.at(s);
else if (j > s)
y.at(s) = -1;
}
long long ansx = 0;
long long count2 = 1;
for (int i = 0; i < 50; i++) {
long long mx;
if (y.at(i) == 0)
mx = bitA.at(i);
else if (y.at(i) == 1)
mx = N - bitA.at(i);
else if (y.at(i) == -1)
mx = max(bitA.at(i), N - bitA.at(i));
ansx += count2 * mx;
count2 *= 2;
}
ans = max(ans, ansx);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,462 | 939,463 | u618649215 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> k(50);
int cnt = 0;
while (K > 0) {
if (K % 2 == 1)
k.at(cnt)++;
K /= 2;
cnt++;
}
cnt--;
vector<int> bitA(50);
for (int i = 0; i < N; i++) {
long long x = A.at(i);
int count = 0;
while (x > 0) {
if (x % 2 == 1)
bitA.at(count)++;
x /= 2;
count++;
}
}
long long ans = 0;
for (int j = cnt; j >= -1; j--) {
vector<int> y(50);
if (k.at(j) == 0)
continue;
for (int s = 0; s < 50; s++) {
if (j == s)
y.at(s) = 0;
else if (j < s)
y.at(s) = k.at(s);
else if (j > s)
y.at(s) = -1;
}
long long ansx = 0;
long long count2 = 1;
for (int i = 0; i < 50; i++) {
long long mx;
if (y.at(i) == 0)
mx = bitA.at(i);
else if (y.at(i) == 1)
mx = N - bitA.at(i);
else if (y.at(i) == -1)
mx = max(bitA.at(i), N - bitA.at(i));
ansx += count2 * mx;
count2 *= 2;
}
ans = max(ans, ansx);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N;
long long K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int> k(50);
int cnt = 0;
while (K > 0) {
if (K % 2 == 1)
k.at(cnt)++;
K /= 2;
cnt++;
}
cnt--;
vector<int> bitA(50);
for (int i = 0; i < N; i++) {
long long x = A.at(i);
int count = 0;
while (x > 0) {
if (x % 2 == 1)
bitA.at(count)++;
x /= 2;
count++;
}
}
long long ans = 0;
for (int j = cnt; j >= -1; j--) {
vector<int> y(50);
if (j > 0 && k.at(j) == 0)
continue;
for (int s = 0; s < 50; s++) {
if (j == s)
y.at(s) = 0;
else if (j < s)
y.at(s) = k.at(s);
else if (j > s)
y.at(s) = -1;
}
long long ansx = 0;
long long count2 = 1;
for (int i = 0; i < 50; i++) {
long long mx;
if (y.at(i) == 0)
mx = bitA.at(i);
else if (y.at(i) == 1)
mx = N - bitA.at(i);
else if (y.at(i) == -1)
mx = max(bitA.at(i), N - bitA.at(i));
ansx += count2 * mx;
count2 *= 2;
}
ans = max(ans, ansx);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 939,462 | 939,464 | u618649215 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.