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 |
|---|---|---|---|---|---|---|---|
p03032 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
template <typename T> istream &operator>>(istream &is, vector<T> &vs) {
for (T &v : vs)
is >> v;
return is;
}
int main() {
LL N, K;
cin >> N >> K;
vector<LL> V(N);
cin >> V;
LL vmax = 0;
for (int L = 0; L < min(N, K); ++L) {
for (int R = 0; R + L < min(N, K); ++R) {
priority_queue<LL> que;
LL sum = 0;
for (int i = 0; i < L; i++) {
sum += V[i];
if (V[i] < 0)
que.push(-V[i]);
}
for (int i = 0; i < R; i++) {
int r = N - i - 1;
sum += V[r];
if (V[r] < 0)
que.push(-V[r]);
}
for (int k = 0; k < K - (L + R); ++k) {
if (que.empty())
break;
sum += que.top();
que.pop();
}
vmax = max(vmax, sum);
}
}
cout << vmax << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
template <typename T> istream &operator>>(istream &is, vector<T> &vs) {
for (T &v : vs)
is >> v;
return is;
}
int main() {
LL N, K;
cin >> N >> K;
vector<LL> V(N);
cin >> V;
LL vmax = 0;
for (int L = 0; L <= min(N, K); ++L) {
for (int R = 0; R + L <= min(N, K); ++R) {
priority_queue<LL> que;
LL sum = 0;
for (int i = 0; i < L; i++) {
sum += V[i];
if (V[i] < 0)
que.push(-V[i]);
}
for (int i = 0; i < R; i++) {
int r = N - i - 1;
sum += V[r];
if (V[r] < 0)
que.push(-V[r]);
}
for (int k = 0; k < K - (L + R); ++k) {
if (que.empty())
break;
sum += que.top();
que.pop();
}
vmax = max(vmax, sum);
}
}
cout << vmax << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,448 | 842,449 | u116523315 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 54;
int n, k;
int a[N];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
int ans = 0;
for (int i = 0; i <= min(n, k); ++i) {
for (int j = n - 1; j >= max(i - 1, n - (k - i)); --j) {
set<pair<int, int>> s;
for (int l = 0; l < n; ++l) {
if (l >= i && l <= j)
continue;
s.emplace(a[l], l);
}
int bakk = k - s.size();
int cur = 0;
for (const auto &e : s) {
if (e.first < 0 && bakk > 0) {
--bakk;
continue;
}
cur += e.first;
}
ans = max(ans, cur);
}
}
printf("%d", ans);
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 54;
int n, k;
int a[N];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
int ans = 0;
for (int i = 0; i <= min(n, k); ++i) {
for (int j = n - 1; j >= max(i - 1, n - (k - i) - 1); --j) {
set<pair<int, int>> s;
for (int l = 0; l < n; ++l) {
if (l >= i && l <= j)
continue;
s.emplace(a[l], l);
}
int bakk = k - s.size();
int cur = 0;
for (const auto &e : s) {
if (e.first < 0 && bakk > 0) {
--bakk;
continue;
}
cur += e.first;
}
ans = max(ans, cur);
}
}
printf("%d", ans);
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 842,452 | 842,453 | u953463534 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 54;
int n, k;
int a[N];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
int ans = 0;
for (int i = 0; i <= min(n, k); ++i) {
for (int j = n - 1; j >= max(i - 1, n - k - i); --j) {
set<pair<int, int>> s;
for (int l = 0; l < n; ++l) {
if (l >= i && l <= j)
continue;
s.emplace(a[l], l);
}
int bakk = k - s.size();
int cur = 0;
for (const auto &e : s) {
if (e.first < 0 && bakk > 0) {
--bakk;
continue;
}
cur += e.first;
}
ans = max(ans, cur);
}
}
printf("%d", ans);
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 54;
int n, k;
int a[N];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
int ans = 0;
for (int i = 0; i <= min(n, k); ++i) {
for (int j = n - 1; j >= max(i - 1, n - (k - i) - 1); --j) {
set<pair<int, int>> s;
for (int l = 0; l < n; ++l) {
if (l >= i && l <= j)
continue;
s.emplace(a[l], l);
}
int bakk = k - s.size();
int cur = 0;
for (const auto &e : s) {
if (e.first < 0 && bakk > 0) {
--bakk;
continue;
}
cur += e.first;
}
ans = max(ans, cur);
}
}
printf("%d", ans);
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| [
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 842,454 | 842,453 | u953463534 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 54;
int n, k;
int a[N];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
int ans = 0;
for (int i = 0; i <= min(n, k); ++i) {
for (int j = n - 1; j >= max(i - 1, n - k - 1); --j) {
set<pair<int, int>> s;
for (int l = 0; l < n; ++l) {
if (l >= i && l <= j)
continue;
s.emplace(a[l], l);
}
int bakk = k - s.size();
int cur = 0;
for (const auto &e : s) {
if (e.first < 0 && bakk > 0) {
--bakk;
continue;
}
cur += e.first;
}
ans = max(ans, cur);
}
}
printf("%d", ans);
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 54;
int n, k;
int a[N];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
scanf("%d", a + i);
int ans = 0;
for (int i = 0; i <= min(n, k); ++i) {
for (int j = n - 1; j >= max(i - 1, n - (k - i) - 1); --j) {
set<pair<int, int>> s;
for (int l = 0; l < n; ++l) {
if (l >= i && l <= j)
continue;
s.emplace(a[l], l);
}
int bakk = k - s.size();
int cur = 0;
for (const auto &e : s) {
if (e.first < 0 && bakk > 0) {
--bakk;
continue;
}
cur += e.first;
}
ans = max(ans, cur);
}
}
printf("%d", ans);
}
int main() {
init();
int t = 1; // scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| [
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 842,455 | 842,453 | u953463534 | cpp |
p03032 | #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define show1(a) cout << #a << " = " << a << endl
#define show2(a, b) cout << #a << " = " << a << "; " << #b << " = " << b << endl
using namespace std;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
const int maxn = 2e5 + 5;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int a[55];
int main() {
fastio();
int n, k;
cin >> n >> k;
rep(i, 1, n) cin >> a[i];
int ans = 0;
rep(i, 0, k) {
rep(L, 0, i) {
int R = i - L;
multiset<int> st;
rep(j, 1, L) st.insert(a[j]);
rep(j, 1, R) st.insert(a[n - j + 1]);
rep(j, 1, k - i) {
if (st.size() == 0)
break;
auto it = st.begin();
int v = *it;
if (v >= 0)
break;
st.erase(it);
}
int tmp = 0;
for (int x : st)
tmp += x;
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define show1(a) cout << #a << " = " << a << endl
#define show2(a, b) cout << #a << " = " << a << "; " << #b << " = " << b << endl
using namespace std;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
const int maxn = 2e5 + 5;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int a[55];
int main() {
fastio();
int n, k;
cin >> n >> k;
rep(i, 1, n) cin >> a[i];
int ans = 0;
rep(i, 0, min(k, n)) {
rep(L, 0, i) {
int R = i - L;
multiset<int> st;
rep(j, 1, L) st.insert(a[j]);
rep(j, 1, R) st.insert(a[n - j + 1]);
rep(j, 1, k - i) {
if (st.size() == 0)
break;
auto it = st.begin();
int v = *it;
if (v >= 0)
break;
st.erase(it);
}
int tmp = 0;
for (int x : st)
tmp += x;
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 842,464 | 842,465 | u074650488 | cpp |
p03032 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define print(x) cout << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n, k;
cin >> n >> k;
deque<ll> q;
rep(i, n) {
ll v;
cin >> v;
q.push_back(v);
}
ll ans = 0;
rep(r, k) {
rep(l, k) {
rep(d, k) {
deque<ll> qq = q;
priority_queue<ll, vector<ll>, greater<ll>> pq;
if ((r + l) > (int)qq.size())
continue;
if ((r + l + d) > k)
continue;
rep(i, r) {
pq.push(qq.front());
qq.pop_front();
}
rep(i, l) {
pq.push(qq.back());
qq.pop_back();
}
rep(i, d) {
if (pq.size())
if (pq.top() < 0)
pq.pop();
}
ll tmp = 0;
while (!pq.empty()) {
tmp += pq.top();
pq.pop();
}
maxs(ans, tmp);
}
}
}
print(ans);
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define print(x) cout << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n, k;
cin >> n >> k;
deque<ll> q;
rep(i, n) {
ll v;
cin >> v;
q.push_back(v);
}
ll ans = 0;
rep(r, k + 1) {
rep(l, k + 1) {
rep(d, k + 1) {
deque<ll> qq = q;
priority_queue<ll, vector<ll>, greater<ll>> pq;
if ((r + l) > (int)qq.size())
continue;
if ((r + l + d) > k)
continue;
// show(1);
rep(i, r) {
pq.push(qq.front());
qq.pop_front();
}
rep(i, l) {
pq.push(qq.back());
qq.pop_back();
}
rep(i, d) {
if (pq.size())
if (pq.top() < 0)
pq.pop();
}
ll tmp = 0;
while (!pq.empty()) {
tmp += pq.top();
pq.pop();
}
// show(tmp);
maxs(ans, tmp);
}
}
}
print(ans);
return 0;
} | [
"expression.operation.binary.add"
] | 842,472 | 842,473 | u814715203 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// long long mod = 998244353;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t % 13;
} else {
return modpow(m, n - 1) * m % 13;
}
}
long long power(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = pow(m, n / 2);
return t * t;
} else {
return pow(m, n - 1) * m;
}
}
long long moddiv(long long a, long long b) {
return (a * modpow(b, mod - 2)) % mod;
}
const ll INF = 1LL << 60;
string change_binary(long long a) {
string ret;
for (int i = 31; i >= 0; i--) {
ret += (a >> i & 1) + '0';
}
return ret;
}
ll nCkmod(ll n, ll k) {
ll denomi = 1;
for (int i = n; i > n - k; i--) {
denomi *= i;
denomi %= mod;
}
ll numera = 1;
REP(i, k) {
numera *= (i + 1);
numera %= mod;
}
return moddiv(denomi, numera);
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
REP(i, n) { cin >> v[i]; }
ll ans = 0;
REP(i, n + 1) {
REP(j, n + 1) {
vector<ll> neg;
ll cur = 0;
if (i + j <= k) {
REP(l, i) {
if (v[l] < 0) {
neg.push_back(v[l]);
}
cur += v[l];
}
REP(l, j) {
if (v[n - 1 - l] < 0) {
neg.push_back(v[n - 1 - l]);
}
cur += v[n - 1 - l];
}
sort(neg.begin(), neg.end());
REP(l, min(k - i - j, (ll)neg.size())) { cur -= neg[l]; }
ans = max(ans, cur);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// long long mod = 998244353;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t % 13;
} else {
return modpow(m, n - 1) * m % 13;
}
}
long long power(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = pow(m, n / 2);
return t * t;
} else {
return pow(m, n - 1) * m;
}
}
long long moddiv(long long a, long long b) {
return (a * modpow(b, mod - 2)) % mod;
}
const ll INF = 1LL << 60;
string change_binary(long long a) {
string ret;
for (int i = 31; i >= 0; i--) {
ret += (a >> i & 1) + '0';
}
return ret;
}
ll nCkmod(ll n, ll k) {
ll denomi = 1;
for (int i = n; i > n - k; i--) {
denomi *= i;
denomi %= mod;
}
ll numera = 1;
REP(i, k) {
numera *= (i + 1);
numera %= mod;
}
return moddiv(denomi, numera);
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
REP(i, n) { cin >> v[i]; }
ll ans = 0;
REP(i, n + 1) {
REP(j, n + 1) {
vector<ll> neg;
ll cur = 0;
if (i + j <= min(k, n)) {
REP(l, i) {
if (v[l] < 0) {
neg.push_back(v[l]);
}
cur += v[l];
}
REP(l, j) {
if (v[n - 1 - l] < 0) {
neg.push_back(v[n - 1 - l]);
}
cur += v[n - 1 - l];
}
sort(neg.begin(), neg.end());
REP(l, min(k - i - j, (ll)neg.size())) { cur -= neg[l]; }
ans = max(ans, cur);
}
}
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 842,478 | 842,479 | u687204015 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define rep(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
#define INF 1000000000000000000
#define MAX 200001
#define MOD 1000000007
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
int main() {
int N, K;
ll res = 0;
cin >> N >> K;
deque<int> dq;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
dq.push_back(v);
}
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K; j++) {
if (i + j > K)
continue;
auto dq_copy = dq;
int re = K - i - j;
vector<int> hou;
int idx = 0;
while (i != idx) {
hou.push_back(dq_copy.front());
dq_copy.pop_front();
idx++;
}
idx = 0;
while (j != idx) {
hou.push_back(dq_copy.back());
dq_copy.pop_back();
idx++;
}
ll ans = 0;
sort(hou.begin(), hou.end());
int s = hou.size();
for (int k = 0; k < s; k++) {
if (hou[k] >= 0 || re == 0)
ans += hou[k];
else
re--;
}
res = max(res, ans);
}
}
cout << res << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define rep(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
#define INF 1000000000000000000
#define MAX 200001
#define MOD 1000000007
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
int main() {
int N, K;
ll res = 0;
cin >> N >> K;
deque<int> dq;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
dq.push_back(v);
}
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K; j++) {
if (i + j > K || i + j > N)
continue;
auto dq_copy = dq;
int re = K - i - j;
vector<int> hou;
int idx = 0;
while (i != idx) {
hou.push_back(dq_copy.front());
dq_copy.pop_front();
idx++;
}
idx = 0;
while (j != idx) {
hou.push_back(dq_copy.back());
dq_copy.pop_back();
idx++;
}
ll ans = 0;
sort(hou.begin(), hou.end());
int s = hou.size();
for (int k = 0; k < s; k++) {
if (hou[k] >= 0 || re == 0)
ans += hou[k];
else
re--;
}
res = max(res, ans);
}
}
cout << res << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 842,480 | 842,481 | u266874640 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
ll ans = 0;
rep(l, 0, k + 1) {
rep(r, 0, k - l) {
if (l + r > n)
continue;
int d = k - l - r;
ll now = 0;
vector<int> s;
rep(i, 0, l) {
now += v[i];
s.push_back(v[i]);
}
rep(i, n - r, n) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, 0, d) {
if (i >= s.size() || s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
ll ans = 0;
rep(l, 0, k + 1) {
rep(r, 0, k - l + 1) {
if (l + r > n)
continue;
int d = k - l - r;
ll now = 0;
vector<int> s;
rep(i, 0, l) {
now += v[i];
s.push_back(v[i]);
}
rep(i, n - r, n) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, 0, d) {
if (i >= s.size() || s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.add"
] | 842,486 | 842,487 | u688789047 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
int ans = 0;
rep(l, 0, k + 1) {
rep(r, 0, k - l) {
if (l + r > n)
continue;
int d = k - l - r;
int now = 0;
vector<int> s;
rep(i, 0, l) {
now += v[i];
s.push_back(v[i]);
}
rep(i, n - r, n) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, 0, d) {
if (i >= s.size() || s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
ll ans = 0;
rep(l, 0, k + 1) {
rep(r, 0, k - l + 1) {
if (l + r > n)
continue;
int d = k - l - r;
ll now = 0;
vector<int> s;
rep(i, 0, l) {
now += v[i];
s.push_back(v[i]);
}
rep(i, n - r, n) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, 0, d) {
if (i >= s.size() || s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 842,488 | 842,487 | u688789047 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
ll ans = 0;
rep(l, 0, k + 1) {
rep(r, 0, k - l) {
if (l + r > n)
continue;
int d = k - l - r;
ll now = 0;
vector<int> x;
rep(i, 0, l) {
now += v[i];
x.push_back(v[i]);
}
rep(i, n - r, n) {
now += v[i];
x.push_back(v[i]);
}
sort(x.begin(), x.end());
rep(i, 0, d) {
if (i >= x.size())
break;
if (x[i] > 0)
break;
now -= x[i];
}
chmax(ans, now);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
ll ans = 0;
rep(l, 0, k + 1) {
rep(r, 0, k - l + 1) {
if (l + r > n)
continue;
int d = k - l - r;
ll now = 0;
vector<int> x;
rep(i, 0, l) {
now += v[i];
x.push_back(v[i]);
}
rep(i, n - r, n) {
now += v[i];
x.push_back(v[i]);
}
sort(x.begin(), x.end());
rep(i, 0, d) {
if (i >= x.size())
break;
if (x[i] > 0)
break;
now -= x[i];
}
chmax(ans, now);
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.add"
] | 842,489 | 842,490 | u688789047 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
int ans = 0;
rep(l, 0, k + 1) {
rep(r, 0, k - l) {
if (l + r > n)
continue;
int d = k - l - r;
int now = 0;
vector<int> x;
rep(i, 0, l) {
now += v[i];
x.push_back(v[i]);
}
rep(i, n - r, n) {
now += v[i];
x.push_back(v[i]);
}
sort(x.begin(), x.end());
rep(i, 0, d) {
if (i >= x.size())
break;
if (x[i] > 0)
break;
now -= x[i];
}
chmax(ans, now);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
ll ans = 0;
rep(l, 0, k + 1) {
rep(r, 0, k - l + 1) {
if (l + r > n)
continue;
int d = k - l - r;
ll now = 0;
vector<int> x;
rep(i, 0, l) {
now += v[i];
x.push_back(v[i]);
}
rep(i, n - r, n) {
now += v[i];
x.push_back(v[i]);
}
sort(x.begin(), x.end());
rep(i, 0, d) {
if (i >= x.size())
break;
if (x[i] > 0)
break;
now -= x[i];
}
chmax(ans, now);
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 842,491 | 842,490 | u688789047 | cpp |
p03032 | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int>> RHEAP;
const int N = 100010, M = 1010;
int n, m;
int a[N];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
int res = 0;
for (int l = 0; l <= min(n, m); l++)
for (int r = 0; r <= min(n, m - l); r++) {
vector<int> t;
for (int i = 0; i < l; i++)
t.PB(a[i]);
for (int i = 0, j = n - 1; i < r; i++, j--)
t.PB(a[j]);
int cnt = m - l - r, sum = 0;
sort(t.begin(), t.end());
for (auto u : t)
if (cnt && u < 0)
cnt--;
else
sum += u;
res = max(res, sum);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int>> RHEAP;
const int N = 100010, M = 1010;
int n, m;
int a[N];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
int res = 0;
for (int l = 0; l <= min(n, m); l++)
for (int r = 0; r <= min(n - l, m - l); r++) {
vector<int> t;
for (int i = 0; i < l; i++)
t.PB(a[i]);
for (int i = 0, j = n - 1; i < r; i++, j--)
t.PB(a[j]);
int cnt = m - l - r, sum = 0;
sort(t.begin(), t.end());
for (auto u : t)
if (cnt && u < 0)
cnt--;
else
sum += u;
res = max(res, sum);
}
cout << res << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 842,496 | 842,497 | u866538547 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<bool>> vvb;
typedef vector<vector<double>> vvd;
typedef vector<vector<string>> vvs;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
// cout<<fixed<<setprecision(10);
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;
}
template <class T> void debug(T v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//以降 cin の入力元が 'input.txt' になる
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
signed main() {
gearup;
int n, k;
cin >> n >> k;
vl v(n);
rep(i, n) cin >> v[i];
ll res = 0;
for (int left = 0; left <= k; left++) {
for (int right = 0; right <= k; right++) {
if (left + right > n)
continue;
ll ttl = left + right;
ll dif = k - ttl;
vl tmp;
rep(j, left) tmp.push_back(v[j]);
rep(j, right) tmp.push_back(v[n - j - 1]);
sort(all(tmp));
rep(j, min(dif, ttl)) {
if (tmp[j] < 0)
tmp[j] = 0;
}
ll ans = accumulate(all(tmp), 0LL);
res = max(res, ans);
}
}
out(res);
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<bool>> vvb;
typedef vector<vector<double>> vvd;
typedef vector<vector<string>> vvs;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
// cout<<fixed<<setprecision(10);
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;
}
template <class T> void debug(T v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//以降 cin の入力元が 'input.txt' になる
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
signed main() {
gearup;
int n, k;
cin >> n >> k;
vl v(n);
rep(i, n) cin >> v[i];
ll res = 0;
for (int left = 0; left <= k; left++) {
for (int right = 0; right <= k - left; right++) {
if (left + right > n)
continue;
ll ttl = left + right;
ll dif = k - ttl;
vl tmp;
rep(j, left) tmp.push_back(v[j]);
rep(j, right) tmp.push_back(v[n - j - 1]);
sort(all(tmp));
rep(j, min(dif, ttl)) {
if (tmp[j] < 0)
tmp[j] = 0;
}
ll ans = accumulate(all(tmp), 0LL);
res = max(res, ans);
}
}
out(res);
} | [
"control_flow.loop.for.condition.change"
] | 842,498 | 842,499 | u929582923 | cpp |
p03032 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define FLASH \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); \
i += 1 - 2 * ((begin) > \
(end))) // rep(i, 1, 5) --> {1,2,3,4} // rep(i, 5, 1) -->
// {4,3,2,1} // rep(it, end(v), begin(v)) --> *it
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
int res = 0;
rep(i, 0, k) rep(j, 0, k - i) {
int z = k - i - j;
if (i + j > n)
continue;
if (z < 0)
continue;
priority_queue<int> q;
rep(a, 0, i) q.push(-v[a]);
rep(a, 0, j) q.push(-v[n - 1 - a]);
int now = 0;
while (now < z && !q.empty()) {
int t = q.top();
if (t < 0)
break;
q.pop();
now++;
}
int tmp = 0;
while (!q.empty()) {
int t = q.top();
q.pop();
tmp -= t;
}
res = max(tmp, res);
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define FLASH \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); \
i += 1 - 2 * ((begin) > \
(end))) // rep(i, 1, 5) --> {1,2,3,4} // rep(i, 5, 1) -->
// {4,3,2,1} // rep(it, end(v), begin(v)) --> *it
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
int res = 0;
rep(i, 0, k + 1) rep(j, 0, k + 1 - i) {
int z = k - i - j;
if (i + j > n)
continue;
if (z < 0)
continue;
priority_queue<int> q;
rep(a, 0, i) q.push(-v[a]);
rep(a, 0, j) q.push(-v[n - 1 - a]);
int now = 0;
while (now < z && !q.empty()) {
int t = q.top();
if (t < 0)
break;
q.pop();
now++;
}
int tmp = 0;
while (!q.empty()) {
int t = q.top();
q.pop();
tmp -= t;
}
res = max(tmp, res);
}
cout << res;
return 0;
} | [
"expression.operation.binary.add"
] | 842,500 | 842,501 | u494904817 | cpp |
p03032 | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER \
ios_base::sync_with_stdio(0); \
cin.tie(0)
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
return out << "(" << a.first << "," << a.second << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &a) {
for (const A &it : a)
out << it << " ";
return out;
}
template <class A, class B> istream &operator>>(istream &in, pair<A, B> &a) {
return in >> a.first >> a.second;
}
template <class A> istream &operator>>(istream &in, vector<A> &a) {
for (A &i : a)
in >> i;
return in;
}
// ifstream cinn("in.in");ofstream coutt("out.out");
int poww(const int &a, int b, const int &m = MOD) {
if (b == 0)
return 1;
int x = poww(a, b / 2, m);
x = x * x % m;
if (b & 1)
x = x * a % m;
return x;
}
int ceil(const int &a, const int &b) { return (a + b - 1) / b; }
////Read:
// Check corner cases, n==1;
//
////Some function:
//__builtin_popcountll(),
int n, c, dp[55][55][55][55];
vi v;
int f(int i, int cnt, int mxgap, int lst) {
if (i == n) {
mxgap = max(mxgap, i - lst - 1);
if (cnt + (n - cnt - mxgap) * 2 <= c)
return 0;
return -INF;
}
int &ans = dp[i][cnt][mxgap][lst + 1];
if (ans != -INF)
return ans;
ans = v[i] + f(i + 1, cnt + 1, max(mxgap, i - lst - 1), i);
ans = max(ans, f(i + 1, cnt, mxgap, lst));
}
signed main() {
FASTER;
cin >> n >> c;
v = vi(n);
cin >> v;
for (int i = 0; i < 55; i++) {
for (int j = 0; j < 55; j++) {
for (int k = 0; k < 55; k++) {
for (int l = 0; l < 55; l++) {
dp[i][j][k][l] = -INF;
}
}
}
}
cout << f(0, 0, 0, -1);
}
| #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER \
ios_base::sync_with_stdio(0); \
cin.tie(0)
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
return out << "(" << a.first << "," << a.second << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &a) {
for (const A &it : a)
out << it << " ";
return out;
}
template <class A, class B> istream &operator>>(istream &in, pair<A, B> &a) {
return in >> a.first >> a.second;
}
template <class A> istream &operator>>(istream &in, vector<A> &a) {
for (A &i : a)
in >> i;
return in;
}
// ifstream cinn("in.in");ofstream coutt("out.out");
int poww(const int &a, int b, const int &m = MOD) {
if (b == 0)
return 1;
int x = poww(a, b / 2, m);
x = x * x % m;
if (b & 1)
x = x * a % m;
return x;
}
int ceil(const int &a, const int &b) { return (a + b - 1) / b; }
////Read:
// Check corner cases, n==1;
//
////Some function:
//__builtin_popcountll(),
int n, c, dp[55][55][55][55];
vi v;
int f(int i, int cnt, int mxgap, int lst) {
if (i == n) {
mxgap = max(mxgap, i - lst - 1);
if (cnt + (n - cnt - mxgap) * 2 <= c)
return 0;
return -INF;
}
int &ans = dp[i][cnt][mxgap][lst + 1];
if (ans != -INF)
return ans;
ans = v[i] + f(i + 1, cnt + 1, max(mxgap, i - lst - 1), i);
ans = max(ans, f(i + 1, cnt, mxgap, lst));
return ans;
}
signed main() {
FASTER;
cin >> n >> c;
v = vi(n);
cin >> v;
for (int i = 0; i < 55; i++) {
for (int j = 0; j < 55; j++) {
for (int k = 0; k < 55; k++) {
for (int l = 0; l < 55; l++) {
dp[i][j][k][l] = -INF;
}
}
}
}
cout << f(0, 0, 0, -1);
}
| [
"control_flow.return.add"
] | 842,510 | 842,511 | u047858101 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
int N, K;
cin >> N >> K;
vi v(N);
rep(i, N) cin >> v[i];
ll ans = 0;
rep(l, min(N, K)) {
rep(r, min(N - l, K - l)) {
if (l + r == 0)
continue;
vi a;
a.reserve(l + r);
rep(i, l) a.push_back(v[i]);
rep(i, r) a.push_back(v[N - 1 - i]);
sort(rall(a));
int back = min(K - l - r, l + r);
while (back > 0 && (*a.rbegin()) < 0)
a.pop_back(), back--;
ans = max(ans, accumulate(all(a), 0ll));
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
int N, K;
cin >> N >> K;
vi v(N);
rep(i, N) cin >> v[i];
ll ans = 0;
rep(l, min(N, K) + 1) {
rep(r, min(N - l, K - l) + 1) {
if (l + r == 0)
continue;
vi a;
a.reserve(l + r);
rep(i, l) a.push_back(v[i]);
rep(i, r) a.push_back(v[N - 1 - i]);
sort(rall(a));
int back = min(K - l - r, l + r);
while (back > 0 && (*a.rbegin()) < 0)
a.pop_back(), back--;
ans = max(ans, accumulate(all(a), 0ll));
}
}
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 842,512 | 842,513 | u857147058 | cpp |
p03032 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) \
(distance(v.begin(), low2way(v, x))) //配列vでx未満の要素数を返す
#define idx_upper(v, x) \
(distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) \
(v.size() - idx_lower(v, x)) //配列vでx以上の要素数を返す
#define idx_upper2(v, x) \
(v.size() - idx_upper(v, x)) //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
template <typename T> T lcm(T x, T y) {
T z = gcd(x, y);
return x * y / z;
}
template <typename T> bool primejudge(T n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++) {
if (n % i == 0) {
return false;
}
i++;
}
return true;
}
//場合によって使い分ける
// const ll dx[4]={1,0,-1,0};
// const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// 2次元配列の宣言
// vector<vector<ll>> field(h, vector<ll>(w));
int main() {
cout << fixed << setprecision(30);
ll N, K;
cin >> N >> K;
vec V(N);
loop(i, N) cin >> V[i];
ll ans = 0;
loop(i, K + 1) {
ll L = i; //左から取り出す個数
if (L > N)
continue;
ll Limit = K - L; //右から取り出すことのできる上限
loop(j, Limit) {
ll R = j;
if (L + R > N)
continue;
vector<ll> select;
loop(x, L) { select.push_back(V[x]); }
loop(y, R) { select.push_back(V[N - 1 - y]); }
sort(all(select));
ll remain = K - (L + R);
ll preans = 0;
loop(k, L + R) {
if (remain > 0 && select[k] < 0) {
remain--;
continue;
}
preans += select[k];
}
ans = max(ans, preans);
}
}
putout(ans);
return 0;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) \
(distance(v.begin(), low2way(v, x))) //配列vでx未満の要素数を返す
#define idx_upper(v, x) \
(distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) \
(v.size() - idx_lower(v, x)) //配列vでx以上の要素数を返す
#define idx_upper2(v, x) \
(v.size() - idx_upper(v, x)) //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
template <typename T> T lcm(T x, T y) {
T z = gcd(x, y);
return x * y / z;
}
template <typename T> bool primejudge(T n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++) {
if (n % i == 0) {
return false;
}
i++;
}
return true;
}
//場合によって使い分ける
// const ll dx[4]={1,0,-1,0};
// const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// 2次元配列の宣言
// vector<vector<ll>> field(h, vector<ll>(w));
int main() {
cout << fixed << setprecision(30);
ll N, K;
cin >> N >> K;
vec V(N);
loop(i, N) cin >> V[i];
ll ans = 0;
loop(i, K + 1) {
ll L = i; //左から取り出す個数
if (L > N)
continue;
ll Limit = K - L; //右から取り出すことのできる上限
loop(j, Limit + 1) {
ll R = j;
if (L + R > N)
continue;
vector<ll> select;
loop(x, L) { select.push_back(V[x]); }
loop(y, R) { select.push_back(V[N - 1 - y]); }
sort(all(select));
ll remain = K - (L + R);
ll preans = 0;
loop(k, L + R) {
if (remain > 0 && select[k] < 0) {
remain--;
continue;
}
preans += select[k];
}
ans = max(ans, preans);
}
}
putout(ans);
return 0;
}
| [
"expression.operation.binary.add"
] | 842,514 | 842,515 | u607229598 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template <class T> using arr = vector<vector<T>>;
template <class T> void pr(T x) { cout << x << endl; }
template <class T> void prvec(vector<T> &a) {
rep(i, a.size() - 1) { cout << a[i] << " "; }
pr(a[a.size() - 1]);
}
template <class T> void prarr(arr<T> &a) {
rep(i, a.size()) if (a[i].empty()) pr("");
else prvec(a[i]);
}
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;
}
int n, k;
deque<int> v;
int Plus = 0, Minus = 0;
int ans = 0;
void dfs(deque<int> dq, priority_queue<int, vector<int>, greater<int>> pq,
int sum, int plus_i, int minus_i, int plus_o, int minus_o, int step) {
chmax(ans, sum);
if (step == k)
return;
if (dq.empty()) {
if (pq.top() >= 0)
return;
else {
int t = pq.top();
dq.push_front(t);
pq.pop();
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1, step + 1);
dq.pop_front();
dq.push_back(t);
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1, step + 1);
}
} else {
if (plus_i == 0) {
if (pq.top() >= 0)
return;
else {
int t = pq.top();
dq.push_front(t);
pq.pop();
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1,
step + 1);
dq.pop_front();
dq.push_back(t);
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1,
step + 1);
}
} else {
if (pq.top() >= 0) {
priority_queue<int, vector<int>, greater<int>> tq = pq;
int t = dq.front();
dq.pop_front();
tq.push(t);
dfs(dq, tq, sum + t, plus_i - (t >= 0), minus_i - (t < 0),
plus_o + (t >= 0), minus_o + (t < 0), step + 1);
dq.push_front(t);
t = dq.back();
dq.pop_back();
pq.push(t);
dfs(dq, pq, sum + t, plus_i - (t >= 0), minus_i - (t < 0),
plus_o + (t >= 0), minus_o + (t < 0), step + 1);
dq.push_back(t);
} else {
int t = pq.top();
dq.push_front(t);
pq.pop();
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1,
step + 1);
dq.pop_front();
dq.push_back(t);
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1,
step + 1);
dq.pop_back();
priority_queue<int, vector<int>, greater<int>> tq = pq;
t = dq.front();
dq.pop_front();
tq.push(t);
dfs(dq, tq, sum + t, plus_i - (t >= 0), minus_i - (t < 0),
plus_o + (t >= 0), minus_o + (t < 0), step + 1);
dq.push_front(t);
t = dq.back();
dq.pop_back();
pq.push(t);
dfs(dq, pq, sum + t, plus_i - (t >= 0), minus_i - (t < 0),
plus_o + (t >= 0), minus_o + (t < 0), step + 1);
dq.push_back(t);
}
}
}
}
int main() {
cin >> n >> k;
rep(i, n) {
int a;
cin >> a;
v.push_back(a);
}
FOR(i, 1, k) {
if (i > n)
break;
rep(left, i + 1) {
deque<int> w = v;
int right = i - left;
vector<int> s;
rep(l, left) {
s.push_back(v.front());
v.pop_front();
}
rep(r, right) {
s.push_back(v.back());
v.pop_back();
}
sort(s.rbegin(), s.rend());
// prvec(s);
rep(l, k - i) {
if (s.empty() || s.back() > 0)
break;
s.pop_back();
}
int sum = 0;
rep(l, s.size()) sum += s[l];
chmax(ans, sum);
v = w;
}
}
pr(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template <class T> using arr = vector<vector<T>>;
template <class T> void pr(T x) { cout << x << endl; }
template <class T> void prvec(vector<T> &a) {
rep(i, a.size() - 1) { cout << a[i] << " "; }
pr(a[a.size() - 1]);
}
template <class T> void prarr(arr<T> &a) {
rep(i, a.size()) if (a[i].empty()) pr("");
else prvec(a[i]);
}
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;
}
int n, k;
deque<int> v;
int Plus = 0, Minus = 0;
int ans = 0;
void dfs(deque<int> dq, priority_queue<int, vector<int>, greater<int>> pq,
int sum, int plus_i, int minus_i, int plus_o, int minus_o, int step) {
chmax(ans, sum);
if (step == k)
return;
if (dq.empty()) {
if (pq.top() >= 0)
return;
else {
int t = pq.top();
dq.push_front(t);
pq.pop();
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1, step + 1);
dq.pop_front();
dq.push_back(t);
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1, step + 1);
}
} else {
if (plus_i == 0) {
if (pq.top() >= 0)
return;
else {
int t = pq.top();
dq.push_front(t);
pq.pop();
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1,
step + 1);
dq.pop_front();
dq.push_back(t);
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1,
step + 1);
}
} else {
if (pq.top() >= 0) {
priority_queue<int, vector<int>, greater<int>> tq = pq;
int t = dq.front();
dq.pop_front();
tq.push(t);
dfs(dq, tq, sum + t, plus_i - (t >= 0), minus_i - (t < 0),
plus_o + (t >= 0), minus_o + (t < 0), step + 1);
dq.push_front(t);
t = dq.back();
dq.pop_back();
pq.push(t);
dfs(dq, pq, sum + t, plus_i - (t >= 0), minus_i - (t < 0),
plus_o + (t >= 0), minus_o + (t < 0), step + 1);
dq.push_back(t);
} else {
int t = pq.top();
dq.push_front(t);
pq.pop();
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1,
step + 1);
dq.pop_front();
dq.push_back(t);
dfs(dq, pq, sum - t, plus_i, minus_i + 1, plus_o, minus_o - 1,
step + 1);
dq.pop_back();
priority_queue<int, vector<int>, greater<int>> tq = pq;
t = dq.front();
dq.pop_front();
tq.push(t);
dfs(dq, tq, sum + t, plus_i - (t >= 0), minus_i - (t < 0),
plus_o + (t >= 0), minus_o + (t < 0), step + 1);
dq.push_front(t);
t = dq.back();
dq.pop_back();
pq.push(t);
dfs(dq, pq, sum + t, plus_i - (t >= 0), minus_i - (t < 0),
plus_o + (t >= 0), minus_o + (t < 0), step + 1);
dq.push_back(t);
}
}
}
}
int main() {
cin >> n >> k;
rep(i, n) {
int a;
cin >> a;
v.push_back(a);
}
FOR(i, 1, k + 1) {
if (i > n)
break;
rep(left, i + 1) {
deque<int> w = v;
int right = i - left;
vector<int> s;
rep(l, left) {
s.push_back(v.front());
v.pop_front();
}
rep(r, right) {
s.push_back(v.back());
v.pop_back();
}
sort(s.rbegin(), s.rend());
// prvec(s);
rep(l, k - i) {
if (s.empty() || s.back() > 0)
break;
s.pop_back();
}
int sum = 0;
rep(l, s.size()) sum += s[l];
chmax(ans, sum);
v = w;
}
}
pr(ans);
return 0;
} | [
"expression.operation.binary.add"
] | 842,516 | 842,517 | u370785250 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
ll ans = 0;
for (ll i = 1; i < min(n, k); i++) {
for (ll j = 0; j <= i; j++) {
ll tans = 0;
ll count = k - i;
priority_queue<ll, vector<ll>, greater<ll>> q;
for (ll l = 0; l < j; l++) {
tans += v[l];
q.push(v[l]);
}
for (ll l = 0; l < i - j; l++) {
tans += v[n - 1 - l];
q.push(v[n - 1 - l]);
}
while (q.size() && count > 0 && q.top() < 0) {
tans -= q.top();
q.pop();
count--;
}
ans = max(ans, tans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
ll ans = 0;
for (ll i = 1; i <= min(n, k); i++) {
for (ll j = 0; j <= i; j++) {
ll tans = 0;
ll count = k - i;
priority_queue<ll, vector<ll>, greater<ll>> q;
for (ll l = 0; l < j; l++) {
tans += v[l];
q.push(v[l]);
}
for (ll l = 0; l < i - j; l++) {
tans += v[n - 1 - l];
q.push(v[n - 1 - l]);
}
while (q.size() && count > 0 && q.top() < 0) {
tans -= q.top();
q.pop();
count--;
}
ans = max(ans, tans);
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,518 | 842,519 | u718758485 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0;
for (int l = 0; l <= k; l++) {
for (int r = 0; r <= k; r++) {
if (l + r > n || l + r > k)
break;
vector<int> V;
rep(i, l) V.push_back(a[i]);
rep(i, r) V.push_back(a[n - i - 1]);
sort(V.begin(), V.end());
int d = k - l - r;
int tot = 0;
rep(i, V.size()) {
if (i < d && a[i] < 0)
continue;
tot += V[i];
}
ans = max(ans, tot);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0;
for (int l = 0; l <= k; l++) {
for (int r = 0; r <= k; r++) {
if (l + r > n || l + r > k)
break;
vector<int> V;
rep(i, l) V.push_back(a[i]);
rep(i, r) V.push_back(a[n - i - 1]);
sort(V.begin(), V.end());
int d = k - l - r;
int tot = 0;
rep(i, V.size()) {
if (i < d && V[i] < 0)
continue;
tot += V[i];
}
ans = max(ans, tot);
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 842,524 | 842,525 | u194930818 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
int N, K;
int main() {
cin >> N >> K;
vector<ll> V(N);
rep(i, N) { cin >> V[i]; }
ll ans = 0;
for (int l = 0; l < K; l++) {
for (int r = 0; r < K - l; r++) {
if (l + r > N)
continue;
int d = K - l - r;
vector<ll> S;
for (int i = 0; i < l; i++) {
S.push_back(V[i]);
}
for (int i = N - r; i < N; i++) {
S.push_back(V[i]);
}
sort(S.begin(), S.end());
for (int i = 0; i < d && i < (int)S.size(); i++) {
S[i] = max(S[i], 0LL);
}
ans = max(ans, accumulate(S.begin(), S.end(), 0LL));
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
int N, K;
int main() {
cin >> N >> K;
vector<int> V(N);
rep(i, N) { cin >> V[i]; }
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N)
continue;
int d = K - l - r;
vector<int> S;
for (int i = 0; i < l; i++) {
S.push_back(V[i]);
}
for (int i = N - r; i < N; i++) {
S.push_back(V[i]);
}
sort(S.begin(), S.end());
for (int i = 0; i < d && i < (int)S.size(); i++) {
S[i] = max(S[i], 0);
}
ans = max(ans, accumulate(S.begin(), S.end(), 0LL));
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 842,536 | 842,537 | u107464079 | cpp |
p03032 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define repk(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define repdown(i, j, k) for (int(i) = (j); (i) >= (j); (i)--)
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vd = std::vector<double>;
using vll = std::vector<long long int>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using namespace std;
const int Mod = (1e9) + 7;
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
const ll INF = 10241024;
long double INFD = 100100100;
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T1, class T2> inline void Abs(T1 &a) { a > 0 ? a : -a; }
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
//_____________________array calc____________________________________//
/*
vvi mul(vvi &A, vvi &B){
vvi C(A.size(), vi(B.size()))
rep(i,A.size()){
rep(j,B.size()){
rep(k,B[0].size()){
C[i][j] = (C[i][j] A[i][k] + B[k][j]) % Mod;
}
}
}
return C;
}
vvi pow(vvi A, ll n){
vvi B(A.size(), vi(A.size()));
rep(i=0;i<A.size();i++){
B[i][i] = 1;
}
while (n >0){
if (n & 1) B = mul(B, A);
A = mul(A, A);
n = n >> 1;
}
return B;
}
*/
//_____________________Bynary Indexed Tree __________________________//
/*
const max_st = (1 << 15) - 1;
int bit[max_st];
int sum (int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
*/
//_____________________ following sorce code_________________________//
int n, k;
vll gem;
void input() {
IN(n, k);
gem.resize(n);
rep(i, n) { IN(gem[i]); }
}
void solve() {
input();
ll ans = -(1e18);
int ti = min(n, k);
rep(i, ti + 1) rep(j, ti + 1) {
if (i + j > ti)
continue;
vll vec;
rep(l, i) vec.pb(gem[l]);
rep(l, j) vec.pb(gem[n - 1 - l]);
sort(vec.begin(), vec.end());
for (int l = 0; l < vec.size() && l < k - (i + j); k++) {
if (vec[l] >= 0)
break;
vec[l] = 0;
}
ll res = 0;
for (auto c : vec) {
res += c;
}
chmax(ans, res);
}
OUT(ans);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define repk(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define repdown(i, j, k) for (int(i) = (j); (i) >= (j); (i)--)
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vd = std::vector<double>;
using vll = std::vector<long long int>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using namespace std;
const int Mod = (1e9) + 7;
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
const ll INF = 10241024;
long double INFD = 100100100;
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T1, class T2> inline void Abs(T1 &a) { a > 0 ? a : -a; }
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
//_____________________array calc____________________________________//
/*
vvi mul(vvi &A, vvi &B){
vvi C(A.size(), vi(B.size()))
rep(i,A.size()){
rep(j,B.size()){
rep(k,B[0].size()){
C[i][j] = (C[i][j] A[i][k] + B[k][j]) % Mod;
}
}
}
return C;
}
vvi pow(vvi A, ll n){
vvi B(A.size(), vi(A.size()));
rep(i=0;i<A.size();i++){
B[i][i] = 1;
}
while (n >0){
if (n & 1) B = mul(B, A);
A = mul(A, A);
n = n >> 1;
}
return B;
}
*/
//_____________________Bynary Indexed Tree __________________________//
/*
const max_st = (1 << 15) - 1;
int bit[max_st];
int sum (int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
*/
//_____________________ following sorce code_________________________//
int n, k;
vll gem;
void input() {
IN(n, k);
gem.resize(n);
rep(i, n) { IN(gem[i]); }
}
void solve() {
input();
ll ans = -(1e18);
int ti = min(n, k);
rep(i, ti + 1) rep(j, ti + 1) {
if (i + j > ti)
continue;
vll vec;
rep(l, i) vec.pb(gem[l]);
rep(l, j) vec.pb(gem[n - 1 - l]);
sort(vec.begin(), vec.end());
for (int l = 0; l < vec.size() && l < k - (i + j); l++) {
if (vec[l] >= 0)
break;
vec[l] = 0;
}
ll res = 0;
for (auto c : vec) {
res += c;
}
chmax(ans, res);
}
OUT(ans);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"identifier.change"
] | 842,541 | 842,542 | u264405855 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
int main() {
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
ll n, k;
cin >> n >> k;
vll v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
ll ans = 0;
for (ll i = 0; i < min(n, k); i++) {
for (ll j = 0; j < min(n - i, k - i); j++) {
ll sum = 0;
priority_queue<ll, vll, greater<ll>> pq;
for (ll l = 0; l < i; l++) {
sum += v[l];
if (v[l] < 0)
pq.push(v[l]);
}
for (ll l = 0; l < j; l++) {
sum += v[n - 1 - l];
if (v[n - 1 - l] < 0)
pq.push(v[n - 1 - l]);
}
ll x = min(k - i - j, (ll)pq.size());
while (x--) {
sum -= pq.top();
pq.pop();
}
ans = max(ans, sum);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
int main() {
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
ll n, k;
cin >> n >> k;
vll v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
ll ans = 0;
for (ll i = 0; i <= min(n, k); i++) {
for (ll j = 0; j <= min(n - i, k - i); j++) {
ll sum = 0;
priority_queue<ll, vll, greater<ll>> pq;
for (ll l = 0; l < i; l++) {
sum += v[l];
if (v[l] < 0)
pq.push(v[l]);
}
for (ll l = 0; l < j; l++) {
sum += v[n - 1 - l];
if (v[n - 1 - l] < 0)
pq.push(v[n - 1 - l]);
}
ll x = min(k - i - j, (ll)pq.size());
while (x--) {
sum -= pq.top();
pq.pop();
}
ans = max(ans, sum);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,544 | 842,545 | u071019032 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() : n(0) { ; }
modint(ll m) : n(m) {
if (n >= mod)
n %= mod;
else if (n < 0)
n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
a.n += b.n;
if (a.n >= mod)
a.n -= mod;
return a;
}
modint operator-=(modint &a, modint b) {
a.n -= b.n;
if (a.n < 0)
a.n += mod;
return a;
}
modint operator*=(modint &a, modint b) {
a.n = ((ll)a.n * b.n) % mod;
return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)
return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)
res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)
return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
int N, K;
cin >> N >> K;
vec v(N);
rep(i, N) cin >> v[i];
int ans = 0;
int mi = min(N, K);
Rep1(i, 0, mi) {
Rep1(j, 0, mi) {
priority_queue<int, vector<int>, greater<int>> pq;
int res = 0;
rep(k, i) {
res += v[k];
if (v[k] < 0)
pq.push(v[k]);
}
rep(k, j) {
res += v[N - 1 - k];
if (v[N - 1 - k] < 0)
pq.push(v[N - 1 - k]);
}
rep(k, K - i - j) {
if (!pq.empty()) {
res -= pq.top();
pq.pop();
}
}
ans = max(ans, res);
}
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// init_f();
// init();
// int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() : n(0) { ; }
modint(ll m) : n(m) {
if (n >= mod)
n %= mod;
else if (n < 0)
n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
a.n += b.n;
if (a.n >= mod)
a.n -= mod;
return a;
}
modint operator-=(modint &a, modint b) {
a.n -= b.n;
if (a.n < 0)
a.n += mod;
return a;
}
modint operator*=(modint &a, modint b) {
a.n = ((ll)a.n * b.n) % mod;
return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)
return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)
res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)
return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
int N, K;
cin >> N >> K;
vec v(N);
rep(i, N) cin >> v[i];
int ans = 0;
int mi = min(N, K);
Rep1(i, 0, mi) {
Rep1(j, 0, mi - i) {
priority_queue<int, vector<int>, greater<int>> pq;
int res = 0;
rep(k, i) {
res += v[k];
if (v[k] < 0)
pq.push(v[k]);
}
rep(k, j) {
res += v[N - 1 - k];
if (v[N - 1 - k] < 0)
pq.push(v[N - 1 - k]);
}
rep(k, K - i - j) {
if (!pq.empty()) {
res -= pq.top();
pq.pop();
}
}
ans = max(ans, res);
}
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// init_f();
// init();
// int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| [
"expression.operation.binary.add"
] | 842,548 | 842,549 | u132371041 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
int ans = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; i + j <= K; j++) {
int L = min(i, N);
int R = min(j, N - i);
vector<int> tmp;
while (L)
tmp.push_back(V.at(--L));
while (R)
tmp.push_back(V.at(N - 1 - --R));
int sum = accumulate(tmp.begin(), tmp.end(), 0);
ans = max(ans, sum);
sort(tmp.begin(), tmp.end());
for (int k = 0; k < min(K - i - j, (int)tmp.size()); k++) {
sum -= tmp.at(k);
ans = max(ans, sum);
}
}
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
int ans = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; i + j <= K; j++) {
int L = min(i, N);
int R = min(j, max(0, N - i));
vector<int> tmp;
while (L)
tmp.push_back(V.at(--L));
while (R)
tmp.push_back(V.at(N - 1 - --R));
int sum = accumulate(tmp.begin(), tmp.end(), 0);
ans = max(ans, sum);
sort(tmp.begin(), tmp.end());
for (int k = 0; k < min(K - i - j, (int)tmp.size()); k++) {
sum -= tmp.at(k);
ans = max(ans, sum);
}
}
}
cout << ans << "\n";
} | [
"call.add",
"call.arguments.change"
] | 842,556 | 842,557 | u045289115 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= min(k, n); l++) {
for (int r = 0; r <= min(k, n) - l; r++) {
vector<int> s;
ll now = 0;
rep(i, l) s.push_back(v[i]), now += v[l];
rep(i, r) s.push_back(v[n - 1 - i]), now += v[n - 1 - i];
sort(ALL(s));
for (int i = 0; i < min(k - l - r, (int)s.size()); ++i) {
if (s[i] < 0)
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= min(k, n); l++) {
for (int r = 0; r <= min(k, n) - l; r++) {
vector<int> s;
ll now = 0;
rep(i, l) s.push_back(v[i]), now += v[i];
rep(i, r) s.push_back(v[n - 1 - i]), now += v[n - 1 - i];
sort(ALL(s));
for (int i = 0; i < min(k - l - r, (int)s.size()); ++i) {
if (s[i] < 0)
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 842,558 | 842,559 | u455067221 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9 + 7;
constexpr lint mod2 = 998244353;
int main() {
int n, k, m = 0;
cin >> n >> k;
deque<int> d;
rep(i, n) {
int e;
cin >> e;
d.push_back(e);
}
rep(i, k + 1) {
rep(j, k - i + 1) {
int t = 0, a = 0, b = 0;
deque<int> c = d;
priority_queue<int, vector<int>, greater<int>> pq;
while (a < i && !c.empty()) {
pq.push(c.front());
c.pop_front();
++a;
}
while (b < j && !c.empty()) {
pq.push(c.back());
c.pop_back();
++b;
}
rep(l, k - a - b) {
if (!pq.empty())
break;
if (pq.top() < 0)
pq.pop();
else
break;
}
while (!pq.empty()) {
t += pq.top();
pq.pop();
}
m = max(m, t);
}
}
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9 + 7;
constexpr lint mod2 = 998244353;
int main() {
int n, k, m = 0;
cin >> n >> k;
deque<int> d;
rep(i, n) {
int e;
cin >> e;
d.push_back(e);
}
rep(i, k + 1) {
rep(j, k - i + 1) {
int t = 0, a = 0, b = 0;
deque<int> c = d;
priority_queue<int, vector<int>, greater<int>> pq;
while (a < i && !c.empty()) {
pq.push(c.front());
c.pop_front();
++a;
}
while (b < j && !c.empty()) {
pq.push(c.back());
c.pop_back();
++b;
}
rep(l, k - a - b) {
if (pq.empty())
break;
if (pq.top() < 0)
pq.pop();
else
break;
}
while (!pq.empty()) {
t += pq.top();
pq.pop();
}
m = max(m, t);
}
}
cout << m << endl;
return 0;
} | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 842,562 | 842,563 | u757584836 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef map<int, int> MII;
typedef queue<int> QI;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef stack<PII> SPII;
typedef deque<int> DI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI; //大きい順
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<int>> PQLP;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) 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 SORTR(c) sort((c).rbegin(), (c).rend())
#define LB lower_bound
#define UB upper_bound
#define NEXP next_permutation
#define FI first
#define SE second
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define REPR(i, n) FORR(i, 0, n)
#define BREP(bit, N) for (int bit = 0; bit < (1 << N); ++bit)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const LL LINF = LLONG_MAX / 2;
const LL MOD = 1e9 + 7;
const LL MODD = 998244353;
const int MAX = 510000;
inline bool Eq(double a, double b) { return fabs(b - a) < EPS; }
// other
//-------------------------------------------
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;
}
#define COUT(x) cout << (x) << endl
#define COUT2(x, y) cout << (x) << " " << (y) << endl
#define PR(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
#define BC(x) __builtin_popcountll(x)
void cYes() {
COUT("Yes");
exit(0);
}
void cNo() {
COUT("No");
exit(0);
}
void cYES() {
COUT("YES");
exit(0);
}
void cNO() {
COUT("NO");
exit(0);
}
void cyes() {
COUT("yes");
exit(0);
}
void cno() {
COUT("no");
exit(0);
}
VI dx = {1, 0, -1, 0, 1, 1, -1, -1};
VI dy = {0, 1, 0, -1, 1, -1, 1, -1};
VC dc = {'R', 'D', 'L', 'U'};
VS ds = {"R", "D", "L", "U", "RD", "RU", "LD", "LU"};
LL Gcd(LL a, LL b) { return __gcd(a, b); }
LL Lcm(LL a, LL b) { return a / Gcd(a, b) * b; }
LL ModPow(LL A, LL N, LL M) {
LL res = 1;
while (N > 0) {
if (N & 1)
res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
LL fac[MAX], finv[MAX], inv[MAX];
void ConInit(LL M) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
LL COM(int n, int k, LL M) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
void VCout(auto v) {
int N = SZ(v);
REP(i, N) {
cout << v.at(i);
if (i == N - 1)
cout << endl;
else
cout << " ";
}
return;
}
void Press(auto &v) { v.erase(unique(ALL(v)), v.end()); }
int Vcount(auto v, auto x) {
auto a = UB(ALL(v), x);
auto b = LB(ALL(v), x);
return a - b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N, K;
cin >> N >> K;
DI dq;
REP(i, N) {
int V;
cin >> V;
dq.PB(V);
}
LL ans = 0;
REP(i, K) {
REP(j, K) {
if (i + j > K)
continue;
if (i + j > N)
continue;
DI q(dq);
VI a;
REP(k, i) {
int x = q.front();
q.POF();
a.PB(x);
}
REP(k, j) {
int x = q.back();
q.POB();
a.PB(x);
}
SORT(a);
int M = K - (i + j);
chmin(M, i + j);
REP(k, M) {
if (a.at(k) < 0)
a.at(k) = 0;
else
break;
}
LL del = 0;
for (int k : a) {
del += k;
}
chmax(ans, del);
}
}
COUT(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef map<int, int> MII;
typedef queue<int> QI;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef stack<PII> SPII;
typedef deque<int> DI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI; //大きい順
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<int>> PQLP;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) 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 SORTR(c) sort((c).rbegin(), (c).rend())
#define LB lower_bound
#define UB upper_bound
#define NEXP next_permutation
#define FI first
#define SE second
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define REPR(i, n) FORR(i, 0, n)
#define BREP(bit, N) for (int bit = 0; bit < (1 << N); ++bit)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const LL LINF = LLONG_MAX / 2;
const LL MOD = 1e9 + 7;
const LL MODD = 998244353;
const int MAX = 510000;
inline bool Eq(double a, double b) { return fabs(b - a) < EPS; }
// other
//-------------------------------------------
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;
}
#define COUT(x) cout << (x) << endl
#define COUT2(x, y) cout << (x) << " " << (y) << endl
#define PR(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
#define BC(x) __builtin_popcountll(x)
void cYes() {
COUT("Yes");
exit(0);
}
void cNo() {
COUT("No");
exit(0);
}
void cYES() {
COUT("YES");
exit(0);
}
void cNO() {
COUT("NO");
exit(0);
}
void cyes() {
COUT("yes");
exit(0);
}
void cno() {
COUT("no");
exit(0);
}
VI dx = {1, 0, -1, 0, 1, 1, -1, -1};
VI dy = {0, 1, 0, -1, 1, -1, 1, -1};
VC dc = {'R', 'D', 'L', 'U'};
VS ds = {"R", "D", "L", "U", "RD", "RU", "LD", "LU"};
LL Gcd(LL a, LL b) { return __gcd(a, b); }
LL Lcm(LL a, LL b) { return a / Gcd(a, b) * b; }
LL ModPow(LL A, LL N, LL M) {
LL res = 1;
while (N > 0) {
if (N & 1)
res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
LL fac[MAX], finv[MAX], inv[MAX];
void ConInit(LL M) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
LL COM(int n, int k, LL M) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
void VCout(auto v) {
int N = SZ(v);
REP(i, N) {
cout << v.at(i);
if (i == N - 1)
cout << endl;
else
cout << " ";
}
return;
}
void Press(auto &v) { v.erase(unique(ALL(v)), v.end()); }
int Vcount(auto v, auto x) {
auto a = UB(ALL(v), x);
auto b = LB(ALL(v), x);
return a - b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N, K;
cin >> N >> K;
DI dq;
REP(i, N) {
int V;
cin >> V;
dq.PB(V);
}
int ans = 0;
REP(i, K + 1) {
REP(j, K + 1) {
if (i + j > K)
continue;
if (i + j > N)
continue;
DI q(dq);
VI a;
REP(k, i) {
int x = q.front();
q.POF();
a.PB(x);
}
REP(k, j) {
int x = q.back();
q.POB();
a.PB(x);
}
SORT(a);
int M = K - (i + j);
chmin(M, i + j);
REP(k, M) {
if (a.at(k) < 0)
a.at(k) = 0;
else
break;
}
int del = 0;
for (int k : a) {
del += k;
}
chmax(ans, del);
}
}
COUT(ans);
return 0;
}
| [
"variable_declaration.type.change"
] | 842,567 | 842,568 | u276588887 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
deque<ll> q, Q;
rep(i, 0, n) {
ll a;
cin >> a;
q.push_back(a);
}
Q = q;
ll an = 0, MX = 0;
priority_queue<ll, vector<ll>, greater<ll>> pq, vc;
rep(i, 0, k) {
rep(j, 0, k - i) {
if (i + j > n)
continue;
an = 0;
rep(I, 0, i) {
an += q.front();
pq.push(q.front());
q.pop_front();
}
rep(J, 0, j) {
an += q.back();
pq.push(q.back());
q.pop_back();
}
rep(K, 0, k - i - j) {
if (!pq.empty() && pq.top() < 0) {
an -= pq.top();
pq.pop();
}
}
MX = max(MX, an);
pq = vc;
q = Q;
}
}
cout << MX << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
deque<ll> q, Q;
rep(i, 0, n) {
ll a;
cin >> a;
q.push_back(a);
}
Q = q;
ll an = 0, MX = 0;
priority_queue<ll, vector<ll>, greater<ll>> pq, vc;
rep(i, 0, k + 1) {
rep(j, 0, k - i + 1) {
if (i + j > n)
continue;
an = 0;
rep(I, 0, i) {
an += q.front();
pq.push(q.front());
q.pop_front();
}
rep(J, 0, j) {
an += q.back();
pq.push(q.back());
q.pop_back();
}
rep(K, 0, k - i - j) {
if (!pq.empty() && pq.top() < 0) {
an -= pq.top();
pq.pop();
}
}
MX = max(MX, an);
pq = vc;
q = Q;
}
}
cout << MX << endl;
}
| [
"expression.operation.binary.add"
] | 842,569 | 842,570 | u293156359 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for (i64 i = 1; i <= n; ++i)
#define RREP(i, n) for (i64 i = n - 1; i >= 0; --i)
#define RREPS(i, n) for (i64 i = n; i >= 1; --i)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb push_back
#define mp make_pair
#define F first
#define S second
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 C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
int main() {
i64 N, K;
cin >> N >> K;
vector<i64> V(N);
REP(i, N) cin >> V[i];
i64 maxv = 0;
REP(l, K) {
for (i64 r = 0; (l + r) <= min(N, K); r++) {
priority_queue<i64, vector<i64>, greater<i64>> jewl;
REP(i, l) jewl.push(V[i]);
REP(i, r) jewl.push(V[N - 1 - i]);
REP(i, K - (l + r)) {
if (jewl.empty())
break;
if (jewl.top() >= 0)
break;
jewl.pop();
}
i64 sv = 0;
while (!jewl.empty()) {
sv += jewl.top();
jewl.pop();
}
chmax(maxv, sv);
}
}
cout << maxv << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for (i64 i = 1; i <= n; ++i)
#define RREP(i, n) for (i64 i = n - 1; i >= 0; --i)
#define RREPS(i, n) for (i64 i = n; i >= 1; --i)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb push_back
#define mp make_pair
#define F first
#define S second
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 C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
int main() {
i64 N, K;
cin >> N >> K;
vector<i64> V(N);
REP(i, N) cin >> V[i];
i64 maxv = 0;
REP(l, K + 1) {
for (i64 r = 0; (l + r) <= min(N, K); r++) {
priority_queue<i64, vector<i64>, greater<i64>> jewl;
REP(i, l) jewl.push(V[i]);
REP(i, r) jewl.push(V[N - 1 - i]);
REP(i, K - (l + r)) {
if (jewl.empty())
break;
if (jewl.top() >= 0)
break;
jewl.pop();
}
i64 sv = 0;
while (!jewl.empty()) {
sv += jewl.top();
jewl.pop();
}
chmax(maxv, sv);
}
}
cout << maxv << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 842,571 | 842,572 | u461336793 | cpp |
p03032 |
#include <time.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream> // ifstream, ofstream
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <omp.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
typedef int64_t ll;
using namespace std;
const ll INF = 1e10;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> value;
for (ll i1 = 0; i1 < n; i1++) {
ll temp;
cin >> temp;
value.push_back(temp);
}
ll sum_value = accumulate(value.begin(), value.end(), 0LL);
ll ans = 0;
for (ll l = 0; l < min(k, n); l++) {
for (ll r = 0; r < min(k - l, n - l); r++) {
int64_t last_value = 0;
for (ll i1 = l; i1 < n - r; i1++) {
last_value += value[i1];
}
vector<ll> pickup;
for (ll i1 = 0; i1 < l; i1++) {
pickup.push_back(value[i1]);
}
for (ll i1 = n - r; i1 < n; i1++) {
pickup.push_back(value[i1]);
}
sort(pickup.begin(), pickup.end());
for (ll i1 = 0; i1 < min(k - l - r, (ll)pickup.size()); i1++) {
if (pickup[i1] < 0) {
last_value += pickup[i1];
}
}
if (sum_value - last_value > ans) {
ans = sum_value - last_value;
}
}
}
cout << ans << endl;
}
|
#include <time.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream> // ifstream, ofstream
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <omp.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
typedef int64_t ll;
using namespace std;
const ll INF = 1e10;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> value;
for (ll i1 = 0; i1 < n; i1++) {
ll temp;
cin >> temp;
value.push_back(temp);
}
ll sum_value = accumulate(value.begin(), value.end(), 0LL);
ll ans = 0;
for (ll l = 0; l <= min(k, n); l++) {
for (ll r = 0; r <= min(k - l, n - l); r++) {
int64_t last_value = 0;
for (ll i1 = l; i1 < n - r; i1++) {
last_value += value[i1];
}
vector<ll> pickup;
for (ll i1 = 0; i1 < l; i1++) {
pickup.push_back(value[i1]);
}
for (ll i1 = n - r; i1 < n; i1++) {
pickup.push_back(value[i1]);
}
sort(pickup.begin(), pickup.end());
for (ll i1 = 0; i1 < min(k - l - r, (ll)pickup.size()); i1++) {
if (pickup[i1] < 0) {
last_value += pickup[i1];
}
}
if (sum_value - last_value > ans) {
ans = sum_value - last_value;
}
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,588 | 842,589 | u279976468 | cpp |
p03032 |
#include <time.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream> // ifstream, ofstream
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <omp.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
typedef int64_t ll;
using namespace std;
const ll INF = 1e10;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> value;
for (ll i1 = 0; i1 < n; i1++) {
ll temp;
cin >> temp;
value.push_back(temp);
}
ll sum_value = accumulate(value.begin(), value.end(), 0LL);
ll ans = 0;
for (ll l = 0; l < min(k, n); l++) {
for (ll r = 0; r < min(k - l, n); r++) {
int64_t last_value = 0;
for (ll i1 = l; i1 < n - r; i1++) {
last_value += value[i1];
}
vector<ll> pickup;
for (ll i1 = 0; i1 < l; i1++) {
pickup.push_back(value[i1]);
}
for (ll i1 = n - r; i1 < n; i1++) {
pickup.push_back(value[i1]);
}
sort(pickup.begin(), pickup.end());
for (ll i1 = 0; i1 < min(k - l - r, (ll)pickup.size()); i1++) {
if (pickup[i1] < 0) {
last_value += pickup[i1];
}
}
if (sum_value - last_value > ans) {
ans = sum_value - last_value;
}
}
}
cout << ans << endl;
}
|
#include <time.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream> // ifstream, ofstream
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <omp.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
typedef int64_t ll;
using namespace std;
const ll INF = 1e10;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> value;
for (ll i1 = 0; i1 < n; i1++) {
ll temp;
cin >> temp;
value.push_back(temp);
}
ll sum_value = accumulate(value.begin(), value.end(), 0LL);
ll ans = 0;
for (ll l = 0; l <= min(k, n); l++) {
for (ll r = 0; r <= min(k - l, n - l); r++) {
int64_t last_value = 0;
for (ll i1 = l; i1 < n - r; i1++) {
last_value += value[i1];
}
vector<ll> pickup;
for (ll i1 = 0; i1 < l; i1++) {
pickup.push_back(value[i1]);
}
for (ll i1 = n - r; i1 < n; i1++) {
pickup.push_back(value[i1]);
}
sort(pickup.begin(), pickup.end());
for (ll i1 = 0; i1 < min(k - l - r, (ll)pickup.size()); i1++) {
if (pickup[i1] < 0) {
last_value += pickup[i1];
}
}
if (sum_value - last_value > ans) {
ans = sum_value - last_value;
}
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,590 | 842,589 | u279976468 | cpp |
p03032 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
// typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = 1001001001;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef tuple<string, int, int> T;
int main() {
int n, k;
cin >> n >> k;
vector<ll> dq(n);
rep(i, n) { cin >> dq[i]; }
ll ans = 0;
for (ll l = 0; l < k; l++) {
for (ll r = 0; r <= k - l; r++) {
if (l + r > n)
break;
ll d = k - l - r;
ll now = 0;
vector<ll> s;
for (ll i = 0; i < l; i++) {
now += dq[i];
s.push_back(dq[i]);
}
for (ll i = n - r; i < n; i++) {
now += dq[i];
s.push_back(dq[i]);
}
sort(s.begin(), s.end());
for (ll i = 0; i < d; i++) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
// typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = 1001001001;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef tuple<string, int, int> T;
int main() {
int n, k;
cin >> n >> k;
vector<ll> dq(n);
rep(i, n) { cin >> dq[i]; }
ll ans = 0;
for (ll l = 0; l <= k; l++) {
for (ll r = 0; r <= k - l; r++) {
if (l + r > n)
break;
ll d = k - l - r;
ll now = 0;
vector<ll> s;
for (ll i = 0; i < l; i++) {
now += dq[i];
s.push_back(dq[i]);
}
for (ll i = n - r; i < n; i++) {
now += dq[i];
s.push_back(dq[i]);
}
sort(s.begin(), s.end());
for (ll i = 0; i < d; i++) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,597 | 842,598 | u564182781 | cpp |
p03032 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
// typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = 1001001001;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef tuple<string, int, int> T;
int main() {
int n, k;
cin >> n >> k;
vector<ll> dq(n);
rep(i, n) { cin >> dq[i]; }
ll ans = 0;
for (ll l = 0; l < k; l++) {
for (ll r = 0; r < k - l; r++) {
if (l + r > n)
break;
ll d = k - l - r;
ll now = 0;
vector<ll> s;
for (ll i = 0; i < l; i++) {
now += dq[i];
s.push_back(dq[i]);
}
for (ll i = n - r; i < n; i++) {
now += dq[i];
s.push_back(dq[i]);
}
sort(s.begin(), s.end());
for (ll i = 0; i < d; i++) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
// typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = 1001001001;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef tuple<string, int, int> T;
int main() {
int n, k;
cin >> n >> k;
vector<ll> dq(n);
rep(i, n) { cin >> dq[i]; }
ll ans = 0;
for (ll l = 0; l <= k; l++) {
for (ll r = 0; r <= k - l; r++) {
if (l + r > n)
break;
ll d = k - l - r;
ll now = 0;
vector<ll> s;
for (ll i = 0; i < l; i++) {
now += dq[i];
s.push_back(dq[i]);
}
for (ll i = n - r; i < n; i++) {
now += dq[i];
s.push_back(dq[i]);
}
sort(s.begin(), s.end());
for (ll i = 0; i < d; i++) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,599 | 842,598 | u564182781 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
int uu = 0;
for (int i = 0; i < min(k + 1, n + 1); i++) {
for (int j = 0; j < min(k - i + 1, n + 1); j++) {
vector<int> a;
for (int l = 0; l < i; l++) {
a.push_back(v.at(l));
}
for (int l = 0; l < j; l++) {
a.push_back(v.at(n - l - 1));
}
sort(a.begin(), a.end());
int yyyy = a.size();
int f = min(k - i - j, yyyy);
for (int l = 0; l < f; l++) {
if (a.at(l) < 0) {
a.at(l) = 0;
} else {
break;
}
}
int r = 0;
for (int l = 0; l < a.size(); l++) {
r += a.at(l);
}
uu = max(uu, r);
}
}
cout << uu << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
int uu = 0;
for (int i = 0; i < min(k + 1, n + 1); i++) {
for (int j = 0; j < min(k - i + 1, n + 1 - i); j++) {
vector<int> a;
for (int l = 0; l < i; l++) {
a.push_back(v.at(l));
}
for (int l = 0; l < j; l++) {
a.push_back(v.at(n - l - 1));
}
sort(a.begin(), a.end());
int yyyy = a.size();
int f = min(k - i - j, yyyy);
for (int l = 0; l < f; l++) {
if (a.at(l) < 0) {
a.at(l) = 0;
} else {
break;
}
}
int r = 0;
for (int l = 0; l < a.size(); l++) {
r += a.at(l);
}
uu = max(uu, r);
}
}
cout << uu << endl;
} | [
"control_flow.loop.for.condition.change"
] | 842,616 | 842,617 | u577774192 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
int uu = 0;
for (int i = 0; i < min(k + 1, n); i++) {
for (int j = 0; j < min(k - i + 1, n); j++) {
vector<int> a;
for (int l = 0; l < i; l++) {
a.push_back(v.at(l));
}
for (int l = 0; l < j; l++) {
a.push_back(v.at(n - l - 1));
}
sort(a.begin(), a.end());
int yyyy = a.size();
int f = min(k - i - j, yyyy);
for (int l = 0; l < f; l++) {
if (a.at(l) < 0) {
a.at(l) = 0;
} else {
break;
}
}
int r = 0;
for (int l = 0; l < a.size(); l++) {
r += a.at(l);
}
uu = max(uu, r);
}
}
cout << uu << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
int uu = 0;
for (int i = 0; i < min(k + 1, n + 1); i++) {
for (int j = 0; j < min(k - i + 1, n + 1 - i); j++) {
vector<int> a;
for (int l = 0; l < i; l++) {
a.push_back(v.at(l));
}
for (int l = 0; l < j; l++) {
a.push_back(v.at(n - l - 1));
}
sort(a.begin(), a.end());
int yyyy = a.size();
int f = min(k - i - j, yyyy);
for (int l = 0; l < f; l++) {
if (a.at(l) < 0) {
a.at(l) = 0;
} else {
break;
}
}
int r = 0;
for (int l = 0; l < a.size(); l++) {
r += a.at(l);
}
uu = max(uu, r);
}
}
cout << uu << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 842,618 | 842,617 | u577774192 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define SIZE 100
using namespace std;
using ll = long long int;
ll bfs(deque<ll> dq, priority_queue<ll, vector<ll>, greater<ll>> q, ll k) {
if (k == 0) {
ll ans = 0;
ll v = q.top();
q.pop();
ans += v;
return ans;
}
ll ans = 0;
// D の左端
if (!dq.empty()) {
deque<ll> n_d = dq;
priority_queue<ll, vector<ll>, greater<ll>> n_q = q;
ll v = n_d.front();
n_d.pop_front();
n_q.push(v);
ans = max(ans, bfs(n_d, n_q, k - 1));
}
// D の右端
if (!dq.empty()) {
deque<ll> n_d = dq;
priority_queue<ll, vector<ll>, greater<ll>> n_q = q;
ll v = n_d.back();
n_d.pop_back();
n_q.push(v);
ans = max(ans, bfs(n_d, n_q, k - 1));
}
// 宝石を左端
if (!q.empty()) {
deque<ll> n_d = dq;
priority_queue<ll, vector<ll>, greater<ll>> n_q = q;
ll v = q.top();
n_q.pop();
n_d.push_front(v);
ans = max(ans, bfs(n_d, n_q, k - 1));
}
// 宝石を右端
if (!q.empty()) {
deque<ll> n_d = dq;
priority_queue<ll, vector<ll>, greater<ll>> n_q = q;
ll v = q.top();
n_q.pop();
n_d.push_back(v);
ans = max(ans, bfs(n_d, n_q, k - 1));
}
return ans;
}
int main() {
ll n, k;
cin >> n >> k;
deque<ll> dq;
for (size_t _ = 0; _ < n; _++) {
ll vi;
cin >> vi;
dq.push_back(vi);
}
ll ans = 0;
for (size_t i = 0; i <= k; i++) {
for (size_t j = 0; j <= i; j++) {
// 宝石を取る
deque<ll> d = dq;
priority_queue<ll, vector<ll>, greater<ll>> pq;
int a = j;
int b = i - j;
int n_cnt = k - i;
// 左から
for (size_t _ = 0; _ < a; _++) {
if (!d.empty()) {
ll v = d.front();
d.pop_front();
pq.push(v);
}
}
// 右から
for (size_t _ = 0; _ < b; _++) {
if (!d.empty()) {
ll v = d.back();
d.pop_back();
pq.push(v);
}
}
// 捨てる
for (size_t _ = 1; _ <= n_cnt; _++) {
auto p = pq;
for (size_t i = 0; i < _; i++) {
if (!p.empty()) {
p.pop();
}
}
ll sum = 0;
while (!p.empty()) {
sum += p.top();
p.pop();
}
ans = max(ans, sum);
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define SIZE 100
using namespace std;
using ll = long long int;
ll bfs(deque<ll> dq, priority_queue<ll, vector<ll>, greater<ll>> q, ll k) {
if (k == 0) {
ll ans = 0;
ll v = q.top();
q.pop();
ans += v;
return ans;
}
ll ans = 0;
// D の左端
if (!dq.empty()) {
deque<ll> n_d = dq;
priority_queue<ll, vector<ll>, greater<ll>> n_q = q;
ll v = n_d.front();
n_d.pop_front();
n_q.push(v);
ans = max(ans, bfs(n_d, n_q, k - 1));
}
// D の右端
if (!dq.empty()) {
deque<ll> n_d = dq;
priority_queue<ll, vector<ll>, greater<ll>> n_q = q;
ll v = n_d.back();
n_d.pop_back();
n_q.push(v);
ans = max(ans, bfs(n_d, n_q, k - 1));
}
// 宝石を左端
if (!q.empty()) {
deque<ll> n_d = dq;
priority_queue<ll, vector<ll>, greater<ll>> n_q = q;
ll v = q.top();
n_q.pop();
n_d.push_front(v);
ans = max(ans, bfs(n_d, n_q, k - 1));
}
// 宝石を右端
if (!q.empty()) {
deque<ll> n_d = dq;
priority_queue<ll, vector<ll>, greater<ll>> n_q = q;
ll v = q.top();
n_q.pop();
n_d.push_back(v);
ans = max(ans, bfs(n_d, n_q, k - 1));
}
return ans;
}
int main() {
ll n, k;
cin >> n >> k;
deque<ll> dq;
for (size_t _ = 0; _ < n; _++) {
ll vi;
cin >> vi;
dq.push_back(vi);
}
ll ans = 0;
for (size_t i = 0; i <= k; i++) {
for (size_t j = 0; j <= i; j++) {
// 宝石を取る
deque<ll> d = dq;
priority_queue<ll, vector<ll>, greater<ll>> pq;
int a = j;
int b = i - j;
int n_cnt = k - i;
// 左から取る
for (size_t _ = 0; _ < a; _++) {
if (!d.empty()) {
ll v = d.front();
d.pop_front();
pq.push(v);
}
}
// 右から取る
for (size_t _ = 0; _ < b; _++) {
if (!d.empty()) {
ll v = d.back();
d.pop_back();
pq.push(v);
}
}
for (size_t _ = 0; _ <= n_cnt; _++) {
// 捨てる
auto p = pq;
for (size_t i = 0; i < _; i++) {
if (!p.empty()) {
p.pop();
}
}
// 合計を計算する
ll sum = 0;
while (!p.empty()) {
sum += p.top();
p.pop();
}
ans = max(ans, sum);
}
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 842,619 | 842,620 | u789199225 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
int main() {
long long N, K;
cin >> N >> K;
deque<long long> D;
rep(i, N) {
long long V;
cin >> V;
D.push_back(V);
}
long long ans = 0;
for (long long l = 0; l < min(N, K); l++) {
for (long long r = 0; r < min(N, K); r++) {
if (l + r > K)
continue;
deque<long long> d = D;
priority_queue<long long, vector<long long>, greater<long long>> dust;
rep(i, l) {
if (d.size() == 0)
break;
dust.push(d.front());
d.pop_front();
}
rep(i, r) {
if (d.size() == 0)
break;
dust.push(d.back());
d.pop_back();
}
rep(i, K - (l + r)) {
if (dust.size() == 0)
break;
if (dust.top() < 0)
dust.pop();
}
long long cost = 0;
while (dust.size()) {
cost += dust.top();
dust.pop();
}
// cout << l << ", " << r << ":" << cost << endl;
ans = max(cost, ans);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
int main() {
long long N, K;
cin >> N >> K;
deque<long long> D;
rep(i, N) {
long long V;
cin >> V;
D.push_back(V);
}
long long ans = 0;
for (long long l = 0; l < min(N, K) + 1; l++) {
for (long long r = 0; r < min(N, K) + 1; r++) {
if (l + r > K)
continue;
deque<long long> d = D;
priority_queue<long long, vector<long long>, greater<long long>> dust;
rep(i, l) {
if (d.size() == 0)
break;
dust.push(d.front());
d.pop_front();
}
rep(i, r) {
if (d.size() == 0)
break;
dust.push(d.back());
d.pop_back();
}
rep(i, K - (l + r)) {
if (dust.size() == 0)
break;
if (dust.top() < 0)
dust.pop();
}
long long cost = 0;
while (dust.size()) {
cost += dust.top();
dust.pop();
}
// cout << l << ", " << r << ":" << cost << endl;
ans = max(cost, ans);
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 842,621 | 842,622 | u063131621 | cpp |
p03032 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
Graph<int> dp(vi &arr) {
int n = arr.size();
Graph<int> ret(n + 1, vi(n + 1, 0));
vi sum(n + 1);
sum[0] = 0;
rep(i, n) sum[i + 1] = sum[i] + arr[i];
repeq(i, n) {
vi take(i);
rep(j, i) take[j] = arr[j];
sort(ALL(take));
int value = sum[i];
rep(j, i) {
ret[i][j] = value;
value -= take[j];
}
}
return ret;
}
void solve() {
int n, k;
cin >> n >> k;
vi arr(n);
cin >> arr;
auto left = dp(arr);
reverse(ALL(arr));
auto right = dp(arr);
int ans = 0;
repeq(li, n) {
repeq(ri, n) {
if (li + ri > n)
continue;
rep(lj, li) {
rep(rj, ri) {
if (li + ri + lj + rj > k)
continue;
chmax(ans, left[li][lj] + right[ri][rj]);
}
}
}
}
cout << ans << endl;
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
Graph<int> dp(vi &arr) {
int n = arr.size();
Graph<int> ret(n + 1, vi(n + 1, 0));
vi sum(n + 1);
sum[0] = 0;
rep(i, n) sum[i + 1] = sum[i] + arr[i];
repeq(i, n) {
vi take(i);
rep(j, i) take[j] = arr[j];
sort(ALL(take));
int value = sum[i];
rep(j, i) {
ret[i][j] = value;
value -= take[j];
}
}
return ret;
}
void solve() {
int n, k;
cin >> n >> k;
vi arr(n);
cin >> arr;
auto left = dp(arr);
reverse(ALL(arr));
auto right = dp(arr);
int ans = 0;
repeq(li, n) {
repeq(ri, n) {
if (li + ri > n)
continue;
repeq(lj, li) {
repeq(rj, ri) {
if (li + ri + lj + rj > k)
continue;
chmax(ans, left[li][lj] + right[ri][rj]);
}
}
}
}
cout << ans << endl;
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| [
"identifier.change"
] | 842,625 | 842,626 | u104057163 | cpp |
p03032 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
Graph<int> dp(vi &arr) {
int n = arr.size();
Graph<int> ret(n + 1, vi(n + 1, 0));
vi sum(n + 1);
sum[0] = 0;
rep(i, n) sum[i + 1] = sum[i] + arr[i];
repeq(i, n) {
vi take(i);
rep(j, i) take[j] = arr[i];
sort(ALL(take));
int value = sum[i];
rep(j, i) {
ret[i][j] = value;
value -= take[j];
}
}
return ret;
}
void solve() {
int n, k;
cin >> n >> k;
vi arr(n);
cin >> arr;
auto left = dp(arr);
reverse(ALL(arr));
auto right = dp(arr);
int ans = 0;
repeq(li, n) {
repeq(ri, n) {
if (li + ri > n)
continue;
rep(lj, li) {
rep(rj, ri) {
if (li + ri + lj + rj > k)
continue;
chmax(ans, left[li][lj] + right[ri][rj]);
}
}
}
}
cout << ans << endl;
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
Graph<int> dp(vi &arr) {
int n = arr.size();
Graph<int> ret(n + 1, vi(n + 1, 0));
vi sum(n + 1);
sum[0] = 0;
rep(i, n) sum[i + 1] = sum[i] + arr[i];
repeq(i, n) {
vi take(i);
rep(j, i) take[j] = arr[j];
sort(ALL(take));
int value = sum[i];
rep(j, i) {
ret[i][j] = value;
value -= take[j];
}
}
return ret;
}
void solve() {
int n, k;
cin >> n >> k;
vi arr(n);
cin >> arr;
auto left = dp(arr);
reverse(ALL(arr));
auto right = dp(arr);
int ans = 0;
repeq(li, n) {
repeq(ri, n) {
if (li + ri > n)
continue;
repeq(lj, li) {
repeq(rj, ri) {
if (li + ri + lj + rj > k)
continue;
chmax(ans, left[li][lj] + right[ri][rj]);
}
}
}
}
cout << ans << endl;
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 842,627 | 842,626 | u104057163 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...) 42
#endif
using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
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 (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> T gcd(T &a, T &b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
debug("debug test\n");
int n, k;
cin >> n >> k;
vint v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(a, min(n, k)) {
rep(b, min(n, k) - a) {
vint mi;
ll sum = 0;
rep(i, a) {
sum += v[i];
if (v[i] < 0) {
mi.push_back(v[i]);
}
}
rep(i, b) {
sum += v[n - 1 - i];
if (v[n - 1 - i] < 0) {
mi.push_back(v[n - 1 - i]);
}
}
sort(all(mi));
ll res = 0;
rep(i, min((int)mi.size(), k - a - b)) { res += mi[i]; }
debug("a%d b%d sum%d res%d\n", a, b, sum, res);
chmax(ans, sum - res);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...) 42
#endif
using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
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 (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> T gcd(T &a, T &b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
debug("debug test\n");
int n, k;
cin >> n >> k;
vint v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(a, min(n, k) + 1) {
rep(b, min(n, k) - a + 1) {
vint mi;
ll sum = 0;
rep(i, a) {
sum += v[i];
if (v[i] < 0) {
mi.push_back(v[i]);
}
}
rep(i, b) {
sum += v[n - 1 - i];
if (v[n - 1 - i] < 0) {
mi.push_back(v[n - 1 - i]);
}
}
sort(all(mi));
ll res = 0;
rep(i, min((int)mi.size(), k - a - b)) { res += mi[i]; }
debug("a%d b%d sum%d res%d\n", a, b, sum, res);
chmax(ans, sum - res);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 842,647 | 842,648 | u398437835 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
using P = pair<int, int>;
const int inf = 1e9;
const int MAX = 1e5 + 5;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (n); ++i)
struct edge {
int to;
int cost;
};
using graph = vector<vector<edge>>;
int main() {
int n, k;
cin >> n >> k;
deque<int> dq;
priority_queue<int, vector<int>, greater<int>> pq;
int value;
REP(i, n) {
cin >> value;
dq.push_back(value);
}
int ans = 0;
int execute_num = min(n, k);
for (int i = 0; i <= execute_num; i++) {
for (int j = 0; j <= execute_num - i; j++) {
deque<int> dq_copy = dq;
priority_queue<int, vector<int>, greater<int>> pq;
for (int l = 0; l < i; l++) {
pq.push(dq_copy.front());
dq_copy.pop_front();
}
for (int l = 0; l < j; l++) {
pq.push(dq_copy.back());
dq_copy.pop_back();
}
for (int l = 0; l < k - i - j; l++) {
if (!pq.empty()) {
value = pq.top();
pq.pop();
}
}
int tmp_ans = 0;
while (!pq.empty()) {
tmp_ans += pq.top();
pq.pop();
}
ans = max(ans, tmp_ans);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
using P = pair<int, int>;
const int inf = 1e9;
const int MAX = 1e5 + 5;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (n); ++i)
struct edge {
int to;
int cost;
};
using graph = vector<vector<edge>>;
int main() {
int n, k;
cin >> n >> k;
deque<int> dq;
priority_queue<int, vector<int>, greater<int>> pq;
int value;
REP(i, n) {
cin >> value;
dq.push_back(value);
}
int ans = 0;
int execute_num = min(n, k);
for (int i = 0; i <= execute_num; i++) {
for (int j = 0; j <= execute_num - i; j++) {
deque<int> dq_copy = dq;
priority_queue<int, vector<int>, greater<int>> pq;
for (int l = 0; l < i; l++) {
pq.push(dq_copy.front());
dq_copy.pop_front();
}
for (int l = 0; l < j; l++) {
pq.push(dq_copy.back());
dq_copy.pop_back();
}
for (int l = 0; l < k - i - j; l++) {
if (!pq.empty()) {
value = pq.top();
if (value < 0)
pq.pop();
}
}
int tmp_ans = 0;
while (!pq.empty()) {
tmp_ans += pq.top();
pq.pop();
}
ans = max(ans, tmp_ans);
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.add"
] | 842,656 | 842,657 | u142577570 | cpp |
p03032 | #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<long long 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};
int dy[] = {0, 1, 0, -1};
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;
}
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;
}
int N, K;
deque<ll> D;
void input() {
fast_io();
#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;
for (int i = 0; i < N; i++) {
ll v;
cin >> v;
D.push_back(v);
}
}
int solve() {
ll ans = 0;
for (int _left = 0; _left < K; _left++) {
for (int _right = 0; _right < K; _right++) {
if (_left + _right > N)
continue;
if (_left + _right > K)
continue;
deque<ll> X = D;
priority_queue<ll, std::vector<ll>, std::greater<ll>> pque;
for (int i = 0; i < _left; i++) {
// if(X.empty()) break;
ll l = X.front();
pque.push(l);
X.pop_front();
}
for (int i = 0; i < _right; i++) {
// if(X.empty()) break;
ll r = X.back();
pque.push(r);
X.pop_back();
}
int _back = K - (_left + _right);
while (_back > 0 && !pque.empty()) {
if (pque.top() < 0)
pque.pop();
else
break;
_back--;
}
ll tmp = 0LL;
while (!pque.empty()) {
tmp += pque.top();
pque.pop();
}
chmax(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
int main() {
input();
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<long long 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};
int dy[] = {0, 1, 0, -1};
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;
}
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;
}
int N, K;
deque<ll> D;
void input() {
fast_io();
#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;
for (int i = 0; i < N; i++) {
ll v;
cin >> v;
D.push_back(v);
}
}
int solve() {
ll ans = 0;
for (int _left = 0; _left <= K; _left++) {
for (int _right = 0; _right <= K; _right++) {
if (_left + _right > N)
continue;
if (_left + _right > K)
continue;
deque<ll> X = D;
priority_queue<ll, std::vector<ll>, std::greater<ll>> pque;
for (int i = 0; i < _left; i++) {
// if(X.empty()) break;
ll l = X.front();
pque.push(l);
X.pop_front();
}
for (int i = 0; i < _right; i++) {
// if(X.empty()) break;
ll r = X.back();
pque.push(r);
X.pop_back();
}
int _back = K - (_left + _right);
while (_back > 0 && !pque.empty()) {
if (pque.top() < 0)
pque.pop();
else
break;
_back--;
}
ll tmp = 0LL;
while (!pque.empty()) {
tmp += pque.top();
pque.pop();
}
chmax(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
int main() {
input();
solve();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,668 | 842,669 | u858670323 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
int main() {
int N, K;
cin >> N >> K;
vector<ll> V(N, 0);
rep(i, N) cin >> V[i];
ll ans = 0;
for (int l = 0; l < K; ++l) {
for (int r = 0; r <= (K - l); ++r) {
if (l + r > N)
break;
int d = K - l - r;
ll now = 0;
vector<ll> s;
for (int i = 0; i < l; ++i) {
now += V[i];
s.push_back(V[i]);
}
for (int i = (N - r); i < N; ++i) {
now += V[i];
s.push_back(V[i]);
}
sort(all(s));
for (int i = 0; i < min(d, (int)s.size()); ++i) {
if (s[i] < 0)
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
int main() {
int N, K;
cin >> N >> K;
vector<ll> V(N, 0);
rep(i, N) cin >> V[i];
ll ans = 0;
for (int l = 0; l <= K; ++l) {
for (int r = 0; r <= (K - l); ++r) {
if (l + r > N)
break;
int d = K - l - r;
ll now = 0;
vector<ll> s;
for (int i = 0; i < l; ++i) {
now += V[i];
s.push_back(V[i]);
}
for (int i = (N - r); i < N; ++i) {
now += V[i];
s.push_back(V[i]);
}
sort(all(s));
for (int i = 0; i < min(d, (int)s.size()); ++i) {
if (s[i] < 0)
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,672 | 842,673 | u964763428 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
int main() {
int N, K;
cin >> N >> K;
vector<ll> V(N, 0);
rep(i, N) cin >> V[i];
ll ans = 0;
for (int l = 0; l < K; ++l) {
for (int r = 0; r < (K - l); ++r) {
if (l + r > N)
break;
int d = K - l - r;
ll now = 0;
vector<ll> s;
for (int i = 0; i < l; ++i) {
now += V[i];
s.push_back(V[i]);
}
for (int i = (N - r); i < N; ++i) {
now += V[i];
s.push_back(V[i]);
}
sort(all(s));
for (int i = 0; i < min(d, (int)s.size()); ++i) {
if (s[i] < 0)
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
int main() {
int N, K;
cin >> N >> K;
vector<ll> V(N, 0);
rep(i, N) cin >> V[i];
ll ans = 0;
for (int l = 0; l <= K; ++l) {
for (int r = 0; r <= (K - l); ++r) {
if (l + r > N)
break;
int d = K - l - r;
ll now = 0;
vector<ll> s;
for (int i = 0; i < l; ++i) {
now += V[i];
s.push_back(V[i]);
}
for (int i = (N - r); i < N; ++i) {
now += V[i];
s.push_back(V[i]);
}
sort(all(s));
for (int i = 0; i < min(d, (int)s.size()); ++i) {
if (s[i] < 0)
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,674 | 842,673 | u964763428 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int res = 0;
/*操作を全探索*/
for (int l = 0; l < min(n, k); l++) {
for (int r = 0; l + r < min(n, k); r++) {
vector<int> h;
for (int i = 0; i < l; i++)
h.emplace_back(v[i]);
for (int i = 0; i < r; i++)
h.emplace_back(v[n - i - 1]);
sort(h.begin(), h.end());
int tmp = accumulate(h.begin(), h.end(), 0);
for (int i = 0; i < min(k - l - r, (int)h.size()); i++) {
if (h[i] < 0)
tmp -= h[i];
}
res = max(res, tmp);
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int res = 0;
/*操作を全探索*/
for (int l = 0; l <= min(n, k); l++) {
for (int r = 0; l + r <= min(n, k); r++) {
vector<int> h;
for (int i = 0; i < l; i++)
h.emplace_back(v[i]);
for (int i = 0; i < r; i++)
h.emplace_back(v[n - i - 1]);
sort(h.begin(), h.end());
int tmp = accumulate(h.begin(), h.end(), 0);
for (int i = 0; i < min(k - l - r, (int)h.size()); i++) {
if (h[i] < 0)
tmp -= h[i];
}
res = max(res, tmp);
}
}
cout << res << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,675 | 842,676 | u108540384 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
int res = 0;
for (int l = 0; l < K; l++) {
for (int r = 0; r < K; r++) {
if (l + r > min(K, N))
continue;
int m = K - (l + r);
priority_queue<int, vector<int>, greater<int>> que;
for (int i = 0; i < l; i++) {
que.push(V[i]);
}
for (int i = 0; i < r; i++) {
que.push(V[N - i - 1]);
}
for (int i = 0; i < m; i++) {
if (!que.empty() && que.top() < 0)
que.pop();
}
int sum = 0;
while (!que.empty()) {
sum += que.top();
que.pop();
}
res = max(res, sum);
}
}
cout << res << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
int res = 0;
for (int l = 0; l < K + 1; l++) {
for (int r = 0; r < K + 1; r++) {
if (l + r > min(K, N))
continue;
int m = K - (l + r);
priority_queue<int, vector<int>, greater<int>> que;
for (int i = 0; i < l; i++) {
que.push(V[i]);
}
for (int i = 0; i < r; i++) {
que.push(V[N - i - 1]);
}
for (int i = 0; i < m; i++) {
if (!que.empty() && que.top() < 0)
que.pop();
}
int sum = 0;
while (!que.empty()) {
sum += que.top();
que.pop();
}
res = max(res, sum);
}
}
cout << res << '\n';
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 842,677 | 842,678 | u782098901 | cpp |
p03032 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 1e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll N, K;
ll v[55];
ll mem[111][55][55];
ll rec(ll c, ll l, ll r) {
if (mem[c][l][r] != -1)
return mem[c][l][r];
if (l > r)
return 0;
if (c >= K)
return 0;
ll res = 0;
chmax(res, v[l] + rec(c + 1, l + 1, r)); // A
chmax(res, v[r] + rec(c + 1, l, r - 1)); // B
chmax(res, rec(c + 2, l + 1, r)); // A+C
chmax(res, rec(c + 2, l, r - 1)); // B+D
return mem[c][l][r] = res;
}
int main(void) {
cin >> N >> K;
memset(mem, -1, sizeof(mem));
for (ll i = 0; i < N; i++)
cin >> v[i];
pt(rec(0, 0, N));
}
| #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 1e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll N, K;
ll v[55];
ll mem[111][55][55];
ll rec(ll c, ll l, ll r) {
if (mem[c][l][r] != -1)
return mem[c][l][r];
if (l > r)
return 0;
if (c >= K)
return 0;
ll res = 0;
chmax(res, v[l] + rec(c + 1, l + 1, r)); // A
chmax(res, v[r] + rec(c + 1, l, r - 1)); // B
chmax(res, rec(c + 2, l + 1, r)); // A+C
chmax(res, rec(c + 2, l, r - 1)); // B+D
return mem[c][l][r] = res;
}
int main(void) {
cin >> N >> K;
memset(mem, -1, sizeof(mem));
for (ll i = 0; i < N; i++)
cin >> v[i];
pt(rec(0, 0, N - 1));
}
| [
"expression.operation.binary.add"
] | 842,679 | 842,680 | u768152935 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
#define DEBUG(x) cout << ">> " << #x << ": " << x << endl;
#define _ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define f first
#define s second
const int MOD = 1000000007;
typedef long long ll;
typedef long double ld;
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main() {
_ int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
for (int i = 0; i < min(n, k); i++) {
for (int a = 0; a <= i; a++) {
int b = i - a;
int sum = 0;
priority_queue<int> neg;
for (int ok = 0; ok < a; ok++) {
sum += v[ok];
if (v[ok] < 0)
neg.push(-v[ok]);
}
for (int ok = 0; ok < b; ok++) {
sum += v[v.size() - ok - 1];
if (v[v.size() - ok - 1] < 0)
neg.push(-v[v.size() - ok - 1]);
}
for (int rest = k - a - b; rest > 0; rest--) {
if (neg.empty())
break;
sum += neg.top();
neg.pop();
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
#define DEBUG(x) cout << ">> " << #x << ": " << x << endl;
#define _ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define f first
#define s second
const int MOD = 1000000007;
typedef long long ll;
typedef long double ld;
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main() {
_ int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
for (int i = 0; i <= min(n, k); i++) {
for (int a = 0; a <= i; a++) {
int b = i - a;
int sum = 0;
priority_queue<int> neg;
for (int ok = 0; ok < a; ok++) {
sum += v[ok];
if (v[ok] < 0)
neg.push(-v[ok]);
}
for (int ok = 0; ok < b; ok++) {
sum += v[v.size() - ok - 1];
if (v[v.size() - ok - 1] < 0)
neg.push(-v[v.size() - ok - 1]);
}
for (int rest = k - a - b; rest > 0; rest--) {
if (neg.empty())
break;
sum += neg.top();
neg.pop();
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,684 | 842,685 | u376415869 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
#define DEBUG(x) cout << ">> " << #x << ": " << x << endl;
#define _ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define f first
#define s second
const int MOD = 1000000007;
typedef long long ll;
typedef long double ld;
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main() {
_ int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
for (int i = 0; i < min(n, k); i++) {
for (int a = 0; a <= i; a++) {
int b = i - a;
int sum = 0;
priority_queue<int> neg;
for (int ok = 0; ok < a; ok++) {
sum += v[ok];
if (v[ok] < 0)
neg.push(-v[ok]);
}
for (int ok = 0; ok < b; ok++) {
sum += v[v.size() - ok - 1];
if (v.size() - ok - 1 < 0)
neg.push(-v[v.size() - ok - 1]);
}
for (int rest = k - a - b; rest > 0; rest--) {
if (neg.empty())
break;
sum += neg.top();
neg.pop();
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
#define DEBUG(x) cout << ">> " << #x << ": " << x << endl;
#define _ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define f first
#define s second
const int MOD = 1000000007;
typedef long long ll;
typedef long double ld;
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main() {
_ int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
for (int i = 0; i <= min(n, k); i++) {
for (int a = 0; a <= i; a++) {
int b = i - a;
int sum = 0;
priority_queue<int> neg;
for (int ok = 0; ok < a; ok++) {
sum += v[ok];
if (v[ok] < 0)
neg.push(-v[ok]);
}
for (int ok = 0; ok < b; ok++) {
sum += v[v.size() - ok - 1];
if (v[v.size() - ok - 1] < 0)
neg.push(-v[v.size() - ok - 1]);
}
for (int rest = k - a - b; rest > 0; rest--) {
if (neg.empty())
break;
sum += neg.top();
neg.pop();
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 842,686 | 842,685 | u376415869 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for (ll i = 0; i < n; i++)
//#define DEBUG(fmt, ...)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
ll f(ll left, ll right, ll back, vector<ll> &array) {
priority_queue<ll, vector<ll>, greater<ll>> q;
ll total = 0;
for (ll i = 0; i < left; i++) {
q.push(array[i]);
total += array[i];
}
for (ll i = 0; i < right; i++) {
q.push(array[array.size() - i - 1]);
total += array[array.size() - i - 1];
}
for (ll i = 0; i < back; i++) {
ll v = q.top();
total -= v;
q.pop();
}
// DEBUG("left:%lld, right:%lld, back:%lld, total:%lld", left ,right, back,
// total);
return total;
}
int main() {
std::cout << std::fixed << std::setprecision(10);
ll N;
ll K;
cin >> N >> K;
vector<ll> array(N, 0);
REP(i, N) { cin >> array[i]; }
ll ans = -INF;
for (ll left = 0; left <= K && left <= N; left++) {
for (ll right = 0; right <= K - left && right <= N; right++) {
for (ll back = 0; back <= (left + right) && (back + left + right) <= K;
back++) {
ll total = f(left, right, back, array);
ans = max(ans, total);
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for (ll i = 0; i < n; i++)
//#define DEBUG(fmt, ...)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
ll f(ll left, ll right, ll back, vector<ll> &array) {
priority_queue<ll, vector<ll>, greater<ll>> q;
ll total = 0;
for (ll i = 0; i < left; i++) {
q.push(array[i]);
total += array[i];
}
for (ll i = 0; i < right; i++) {
q.push(array[array.size() - i - 1]);
total += array[array.size() - i - 1];
}
for (ll i = 0; i < back; i++) {
ll v = q.top();
total -= v;
q.pop();
}
// DEBUG("left:%lld, right:%lld, back:%lld, total:%lld", left ,right, back,
// total);
return total;
}
int main() {
std::cout << std::fixed << std::setprecision(10);
ll N;
ll K;
cin >> N >> K;
vector<ll> array(N, 0);
REP(i, N) { cin >> array[i]; }
ll ans = -INF;
for (ll left = 0; left <= K && left <= N; left++) {
for (ll right = 0; right <= K - left && (left + right) <= N; right++) {
for (ll back = 0; back <= (left + right) && (back + left + right) <= K;
back++) {
ll total = f(left, right, back, array);
ans = max(ans, total);
}
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 842,690 | 842,691 | u014854522 | cpp |
p03032 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll ans = 0ll;
for (int l = 0; l < k; ++l) {
for (int r = 0; r < k - l; ++r) {
if (l + r > n)
continue;
int d = max(0, k - l - r);
ll now = 0ll;
vector<ll> tmp;
for (int i = 0; i < l; ++i) {
now += a[i];
tmp.push_back(a[i]);
}
for (int i = n - r; i < n; ++i) {
now += a[i];
tmp.push_back(a[i]);
}
sort(tmp.begin(), tmp.end());
for (int i = 0; i < d; ++i) {
if (i >= tmp.size())
break;
if (tmp[i] > 0)
break;
now -= tmp[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll ans = 0ll;
for (int l = 0; l <= k; ++l) {
for (int r = 0; r <= k - l; ++r) {
if (l + r > n)
continue;
int d = max(0, k - l - r);
ll now = 0ll;
vector<ll> tmp;
for (int i = 0; i < l; ++i) {
now += a[i];
tmp.push_back(a[i]);
}
for (int i = n - r; i < n; ++i) {
now += a[i];
tmp.push_back(a[i]);
}
sort(tmp.begin(), tmp.end());
for (int i = 0; i < d; ++i) {
if (i >= tmp.size())
break;
if (tmp[i] > 0)
break;
now -= tmp[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,694 | 842,695 | u102602414 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K, ans = 0;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int l = 0; l < K; l++) {
for (int r = 0; r < K - l; r++) {
if ((l + r) > N)
continue;
int d = K - l - r;
int now = 0;
vector<int> s;
for (int i = 0; i < l; i++) {
now += a[i];
s.push_back(a[i]);
}
for (int i = N - r; i < N; i++) {
now += a[i];
s.push_back(a[i]);
}
sort(s.begin(), s.end());
for (int i = 0; i < d; i++) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
else
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K, ans = 0;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if ((l + r) > N)
continue;
int d = K - l - r;
int now = 0;
vector<int> s;
for (int i = 0; i < l; i++) {
now += a[i];
s.push_back(a[i]);
}
for (int i = N - r; i < N; i++) {
now += a[i];
s.push_back(a[i]);
}
sort(s.begin(), s.end());
for (int i = 0; i < d; i++) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
else
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,707 | 842,708 | u168774513 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K, ans = 0;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int l = 0; l < K; l++) {
for (int r = 0; r < K - l; r++) {
if ((l + r) > N)
continue;
int d = K - l - r;
int now = 0;
vector<int> s;
for (int i = 0; i < l; i++) {
now += a[i];
s.push_back(a[i]);
}
for (int i = N - r; i < N; i++) {
now += a[i];
s.push_back(a[i]);
}
sort(s.begin(), s.end());
for (int i = 0; i < d; i++) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
else
now += -s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K, ans = 0;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if ((l + r) > N)
continue;
int d = K - l - r;
int now = 0;
vector<int> s;
for (int i = 0; i < l; i++) {
now += a[i];
s.push_back(a[i]);
}
for (int i = N - r; i < N; i++) {
now += a[i];
s.push_back(a[i]);
}
sort(s.begin(), s.end());
for (int i = 0; i < d; i++) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
else
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.change",
"expression.operation.unary.arithmetic.remove"
] | 842,710 | 842,708 | u168774513 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e11;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int mn = min(n, k);
ll ans = -1LL * INF;
for (int i = 0; i <= mn; ++i) {
for (int j = 0; j <= mn; ++j) {
ll val = 0;
int cnt = mn - i - j;
vector<ll> a;
rep(l, i) a.push_back(v[l]);
rep(l, j) a.push_back(v[n - 1 - l]);
for (auto al : a)
val += al;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; ++l)
val -= a[l];
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e11;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int mn = min(n, k);
ll ans = -1LL * INF;
for (int i = 0; i <= mn; ++i) {
for (int j = 0; i + j <= mn; ++j) {
ll val = 0;
int cnt = k - i - j;
vector<ll> a;
rep(l, i) a.push_back(v[l]);
rep(l, j) a.push_back(v[n - 1 - l]);
for (auto al : a)
val += al;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; ++l)
val -= a[l];
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 842,713 | 842,714 | u620269708 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e11;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int mn = min(n, k);
ll ans = -1LL * INF;
for (int i = 0; i <= mn; ++i) {
for (int j = 0; j <= mn; ++j) {
ll val = 0;
int cnt = k - i - j;
vector<ll> a;
rep(l, i) a.push_back(v[l]);
rep(l, j) a.push_back(v[n - 1 - l]);
for (auto al : a)
val += al;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; ++l)
val -= a[l];
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e11;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int mn = min(n, k);
ll ans = -1LL * INF;
for (int i = 0; i <= mn; ++i) {
for (int j = 0; i + j <= mn; ++j) {
ll val = 0;
int cnt = k - i - j;
vector<ll> a;
rep(l, i) a.push_back(v[l]);
rep(l, j) a.push_back(v[n - 1 - l]);
for (auto al : a)
val += al;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; ++l)
val -= a[l];
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 842,715 | 842,714 | u620269708 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e11;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int mn = min(n, k);
ll ans = -INF;
for (int i = 0; i <= mn; ++i) {
for (int j = 0; j <= mn; ++j) {
ll val = 0;
int cnt = k - i - j;
vector<ll> a;
rep(l, i) a.push_back(v[l]);
rep(l, j) a.push_back(v[n - 1 - l]);
for (auto al : a)
val += al;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; ++l)
val -= a[l];
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e11;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int mn = min(n, k);
ll ans = -1LL * INF;
for (int i = 0; i <= mn; ++i) {
for (int j = 0; i + j <= mn; ++j) {
ll val = 0;
int cnt = k - i - j;
vector<ll> a;
rep(l, i) a.push_back(v[l]);
rep(l, j) a.push_back(v[n - 1 - l]);
for (auto al : a)
val += al;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; ++l)
val -= a[l];
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 842,716 | 842,714 | u620269708 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e11;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int mn = min(n, k);
ll ans = -INF;
for (int i = 0; i <= mn; ++i) {
for (int j = 0; j <= mn; ++j) {
ll val = 0;
int cnt = k - i - j;
vector<ll> a;
rep(l, i) a.push_back(v[l]);
rep(l, j) a.push_back(v[n - 1 - l]);
for (ll al : a)
val += al;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; ++l)
val -= a[l];
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e11;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int mn = min(n, k);
ll ans = -1LL * INF;
for (int i = 0; i <= mn; ++i) {
for (int j = 0; i + j <= mn; ++j) {
ll val = 0;
int cnt = k - i - j;
vector<ll> a;
rep(l, i) a.push_back(v[l]);
rep(l, j) a.push_back(v[n - 1 - l]);
for (auto al : a)
val += al;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; ++l)
val -= a[l];
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 842,717 | 842,714 | u620269708 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using min_pqueue = priority_queue<ll, vector<ll>, greater<ll>>;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> v(N + 1);
for (ll i = 1; i <= N; i++) {
cin >> v[i];
}
ll min_val = -1e8;
vector<vector<vector<ll>>> dp(
N + 2, vector<vector<ll>>(N + 2, vector<ll>(K + 1, min_val)));
vector<vector<vector<min_pqueue>>> q(
N + 2, vector<vector<min_pqueue>>(N + 2, vector<min_pqueue>(K + 1)));
dp[1][N][K] = 0;
for (ll i = 1; i <= N + 1; i++) {
for (ll j = N; 0 <= j; j--) {
for (ll k = K; 1 <= k; k--) {
// cout << i << " " << j << " " << k << endl;
if (i <= N && 1 < k && i <= j &&
dp[i + 1][j][k - 1] < dp[i][j][k] + v[i]) {
dp[i + 1][j][k - 1] = dp[i][j][k] + v[i];
q[i + 1][j][k - 1] = q[i][j][k];
q[i + 1][j][k - 1].push(v[i]);
}
if (0 < j && 1 < k && i <= j &&
dp[i][j - 1][k - 1] < dp[i][j][k] + v[j]) {
dp[i][j - 1][k - 1] = dp[i][j][k] + v[j];
q[i][j - 1][k - 1] = q[i][j][k];
q[i][j - 1][k - 1].push(v[j]);
}
if (!q[i][j][k].empty() &&
dp[i][j][k - 1] < dp[i][j][k] - q[i][j][k].top()) {
dp[i][j][k - 1] = dp[i][j][k] - q[i][j][k].top();
q[i][j][k - 1] = q[i][j][k];
q[i][j][k - 1].pop();
}
if (dp[i][j][k - 1] < dp[i][j][k]) {
dp[i][j][k - 1] = dp[i][j][k];
q[i][j][k - 1] = q[i][j][k];
}
}
}
}
ll ans = min_val;
for (ll i = 0; i <= N + 1; i++) {
for (ll j = 0; j <= N + 1; j++) {
ans = max(ans, dp[i][j][0]);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using min_pqueue = priority_queue<ll, vector<ll>, greater<ll>>;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> v(N + 1);
for (ll i = 1; i <= N; i++) {
cin >> v[i];
}
ll min_val = -1e8;
vector<vector<vector<ll>>> dp(
N + 2, vector<vector<ll>>(N + 2, vector<ll>(K + 1, min_val)));
vector<vector<vector<min_pqueue>>> q(
N + 2, vector<vector<min_pqueue>>(N + 2, vector<min_pqueue>(K + 1)));
dp[1][N][K] = 0;
for (ll i = 1; i <= N + 1; i++) {
for (ll j = N; 0 <= j; j--) {
for (ll k = K; 1 <= k; k--) {
if (i <= N && 1 <= k && i <= j &&
dp[i + 1][j][k - 1] < dp[i][j][k] + v[i]) {
dp[i + 1][j][k - 1] = dp[i][j][k] + v[i];
q[i + 1][j][k - 1] = q[i][j][k];
q[i + 1][j][k - 1].push(v[i]);
}
if (0 < j && 1 <= k && i <= j &&
dp[i][j - 1][k - 1] < dp[i][j][k] + v[j]) {
dp[i][j - 1][k - 1] = dp[i][j][k] + v[j];
q[i][j - 1][k - 1] = q[i][j][k];
q[i][j - 1][k - 1].push(v[j]);
}
if (!q[i][j][k].empty() &&
dp[i][j][k - 1] < dp[i][j][k] - q[i][j][k].top()) {
dp[i][j][k - 1] = dp[i][j][k] - q[i][j][k].top();
q[i][j][k - 1] = q[i][j][k];
q[i][j][k - 1].pop();
}
if (dp[i][j][k - 1] < dp[i][j][k]) {
dp[i][j][k - 1] = dp[i][j][k];
q[i][j][k - 1] = q[i][j][k];
}
}
}
}
ll ans = min_val;
for (ll i = 0; i <= N + 1; i++) {
for (ll j = 0; j <= N + 1; j++) {
ans = max(ans, dp[i][j][0]);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,720 | 842,721 | u235107623 | cpp |
p03032 | #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 ALL(v) v.begin(), v.end()
#define MAX(a, b, c) max(max(a, b), c)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
REP(i, n) cin >> v[i];
int abmin = min(n, k);
ll ans = 0;
REP(a, abmin) {
REP(b, abmin - a) {
vector<int> hand;
REP(i, a) hand.push_back(v[i]);
for (int i = n - 1; i >= n - b; i--)
hand.push_back(v[i]);
if (hand.size() == 0)
continue;
sort(ALL(hand));
int pos = 0;
int dis = k - (a + b);
REP(i, dis) {
if (hand[pos] >= 0)
break;
pos++;
}
ll sum = 0;
FOR(i, pos, hand.size()) sum += (ll)hand[i];
ans = max(ans, sum);
}
}
cout << ans << '\n';
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 ALL(v) v.begin(), v.end()
#define MAX(a, b, c) max(max(a, b), c)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
REP(i, n) cin >> v[i];
int abmin = min(n, k);
ll ans = 0;
REP(a, abmin + 1) {
REP(b, abmin + 1 - a) {
vector<int> hand;
REP(i, a) hand.push_back(v[i]);
for (int i = n - 1; i >= n - b; i--)
hand.push_back(v[i]);
if (hand.size() == 0)
continue;
sort(ALL(hand));
int pos = 0;
int dis = k - (a + b);
REP(i, dis) {
if (hand[pos] >= 0)
break;
pos++;
}
ll sum = 0;
FOR(i, pos, hand.size()) sum += (ll)hand[i];
ans = max(ans, sum);
}
}
cout << ans << '\n';
return 0;
}
| [
"expression.operation.binary.add"
] | 842,722 | 842,723 | u283907492 | cpp |
p03032 | //#include <stdio.h>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
ll N, K;
vector<ll> V;
void solve() {
cin >> N >> K;
vector<ll> V(N);
for (ll i = 0; i < N; i++) {
cin >> V.at(i);
}
ll maxCount = 0;
ll minNK = min(N, K);
for (ll i = 0; i < minNK; i++) {
ll lcount = 0;
vector<ll> MINUS;
// 左から i個とる
// 合計を計算
for (ll l = 0; l < i; l++) {
lcount += V.at(l);
if (V.at(l) < 0) {
MINUS.push_back(V.at(l));
}
}
for (ll j = 0; j < minNK - i + 1; j++) {
ll rcount = 0;
// 右からj個とる
// 合計を計算
vector<ll> RMINUS(MINUS.size());
copy(MINUS.begin(), MINUS.end(), RMINUS.begin());
for (ll r = 0; r < j; r++) {
rcount += V.at(N - r - 1);
if (V.at(N - r - 1) < 0) {
RMINUS.push_back(V.at(N - r - 1));
}
}
sort(RMINUS.begin(), RMINUS.end());
ll num = RMINUS.size();
ll allcount = rcount + lcount;
for (ll m = 0; m < num && m < K - (j + i); m++) {
allcount -= RMINUS.at(m);
}
maxCount = max(allcount, maxCount);
}
}
cout << maxCount << endl;
return;
}
int main() {
solve();
return 0;
}
| //#include <stdio.h>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
ll N, K;
vector<ll> V;
void solve() {
cin >> N >> K;
vector<ll> V(N);
for (ll i = 0; i < N; i++) {
cin >> V.at(i);
}
ll maxCount = 0;
ll minNK = min(N, K);
for (ll i = 0; i <= minNK; i++) {
ll lcount = 0;
vector<ll> MINUS;
// 左から i個とる
// 合計を計算
for (ll l = 0; l < i; l++) {
lcount += V.at(l);
if (V.at(l) < 0) {
MINUS.push_back(V.at(l));
}
}
for (ll j = 0; j <= minNK - i; j++) {
ll rcount = 0;
// 右からj個とる
// 合計を計算
vector<ll> RMINUS(MINUS.size());
copy(MINUS.begin(), MINUS.end(), RMINUS.begin());
for (ll r = 0; r < j; r++) {
rcount += V.at(N - r - 1);
if (V.at(N - r - 1) < 0) {
RMINUS.push_back(V.at(N - r - 1));
}
}
sort(RMINUS.begin(), RMINUS.end());
ll num = RMINUS.size();
ll allcount = rcount + lcount;
for (ll m = 0; m < num && m < K - (j + i); m++) {
allcount -= RMINUS.at(m);
}
maxCount = max(allcount, maxCount);
}
}
std::cout << maxCount << endl;
return;
}
int main() {
solve();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 842,736 | 842,737 | u941251324 | cpp |
p03032 | //#include <stdio.h>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
ll N, K;
vector<ll> V;
void solve() {
cin >> N >> K;
vector<ll> V(N);
for (ll i = 0; i < N; i++) {
cin >> V.at(i);
}
ll maxCount = 0;
ll minNK = min(N, K);
for (ll i = 0; i < minNK; i++) {
ll lcount = 0;
vector<ll> MINUS;
// 左から i個とる
// 合計を計算
for (ll l = 0; l < i; l++) {
lcount += V.at(l);
if (V.at(l) < 0) {
MINUS.push_back(V.at(l));
}
}
for (ll j = 0; j < minNK - i; j++) {
ll rcount = 0;
// 右からj個とる
// 合計を計算
vector<ll> RMINUS(MINUS.size());
copy(MINUS.begin(), MINUS.end(), RMINUS.begin());
for (ll r = 0; r < j; r++) {
rcount += V.at(N - r - 1);
if (V.at(N - r - 1) < 0) {
RMINUS.push_back(V.at(N - r - 1));
}
}
sort(RMINUS.begin(), RMINUS.end());
ll num = RMINUS.size();
ll allcount = rcount + lcount;
for (ll m = 0; m < num && m < K - (j + i); m++) {
allcount -= RMINUS.at(m);
}
maxCount = max(allcount, maxCount);
}
}
cout << maxCount << endl;
return;
}
int main() {
solve();
return 0;
}
| //#include <stdio.h>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
ll N, K;
vector<ll> V;
void solve() {
cin >> N >> K;
vector<ll> V(N);
for (ll i = 0; i < N; i++) {
cin >> V.at(i);
}
ll maxCount = 0;
ll minNK = min(N, K);
for (ll i = 0; i <= minNK; i++) {
ll lcount = 0;
vector<ll> MINUS;
// 左から i個とる
// 合計を計算
for (ll l = 0; l < i; l++) {
lcount += V.at(l);
if (V.at(l) < 0) {
MINUS.push_back(V.at(l));
}
}
for (ll j = 0; j <= minNK - i; j++) {
ll rcount = 0;
// 右からj個とる
// 合計を計算
vector<ll> RMINUS(MINUS.size());
copy(MINUS.begin(), MINUS.end(), RMINUS.begin());
for (ll r = 0; r < j; r++) {
rcount += V.at(N - r - 1);
if (V.at(N - r - 1) < 0) {
RMINUS.push_back(V.at(N - r - 1));
}
}
sort(RMINUS.begin(), RMINUS.end());
ll num = RMINUS.size();
ll allcount = rcount + lcount;
for (ll m = 0; m < num && m < K - (j + i); m++) {
allcount -= RMINUS.at(m);
}
maxCount = max(allcount, maxCount);
}
}
std::cout << maxCount << endl;
return;
}
int main() {
solve();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,738 | 842,737 | u941251324 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define outve(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl
#define outmat(v) \
for (auto i : v) { \
for (auto j : i) \
cout << j << " "; \
cout << endl; \
}
#define in(n, v) \
for (int i = 0; i < (n); i++) { \
cin >> v[i]; \
}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T> using ve = vector<T>;
template <typename T> using pq2 = priority_queue<T>;
template <typename T> using pq1 = priority_queue<T, vector<T>, greater<T>>;
int main() {
int N, K;
cin >> N >> K;
vi V(N);
in(N, V);
int ans = 0;
rep(i, K) rep(j, K) rep(l, K) {
if (i + j > N)
continue;
if (i + j + l > K)
continue;
int an = 0;
pq1<int> pq;
rep(n, i) an += V[n], pq.push(V[n]);
rep(n, j) an += V[N - 1 - n], pq.push(V[N - 1 - n]);
rep(n, l) {
if (pq.empty())
break;
if (pq.top() >= 0)
break;
an -= pq.top();
pq.pop();
}
ans = max(ans, an);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define outve(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl
#define outmat(v) \
for (auto i : v) { \
for (auto j : i) \
cout << j << " "; \
cout << endl; \
}
#define in(n, v) \
for (int i = 0; i < (n); i++) { \
cin >> v[i]; \
}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T> using ve = vector<T>;
template <typename T> using pq2 = priority_queue<T>;
template <typename T> using pq1 = priority_queue<T, vector<T>, greater<T>>;
int main() {
int N, K;
cin >> N >> K;
vi V(N);
in(N, V);
int ans = 0;
rep(i, K + 1) rep(j, K + 1) rep(l, K + 1) {
if (i + j > N)
continue;
if (i + j + l > K)
continue;
int an = 0;
pq1<int> pq;
rep(n, i) an += V[n], pq.push(V[n]);
rep(n, j) an += V[N - 1 - n], pq.push(V[N - 1 - n]);
rep(n, l) {
if (pq.empty())
break;
if (pq.top() >= 0)
break;
an -= pq.top();
pq.pop();
}
ans = max(ans, an);
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 842,743 | 842,744 | u668191971 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define cout(n) cout << fixed << setprecision(n)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
vector<ll> v, vr;
ll n, k;
ll calc_max(ll cl, ll cr) {
if (cl + cr > n) {
return 0;
}
vector<ll> j;
j.reserve(cl + cr);
if (cl) {
j.insert(j.end(), v.begin(), v.begin() + cl);
}
if (cr) {
j.insert(j.end(), vr.begin(), vr.begin() + cr);
}
sort(all(j));
rep(i, min(k - cl - cr, cl + cr)) {
if (j[0] >= 0) {
break;
}
j.erase(j.begin());
}
return accumulate(all(j), 0);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
rep(i, n) {
ll tmp;
cin >> tmp;
v.push_back(tmp);
}
vr.reserve(n);
vr = v;
reverse(all(vr));
// ll cl; // 左から宝石を取る回数
// ll cr; // 右から宝石を取る回数
// ll cd; // 宝石を戻す回数
// cl+cr+cd <= kとなるなかでの最大値を求める
ll ans = 0;
rep(cl, min(n + 1, k)) {
rep(cr, min(n + 1 - cl, k - cl)) { chmax(ans, calc_max(cl, cr)); }
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define cout(n) cout << fixed << setprecision(n)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
vector<ll> v, vr;
ll n, k;
ll calc_max(ll cl, ll cr) {
if (cl + cr > n) {
return 0;
}
vector<ll> j;
j.reserve(cl + cr);
if (cl) {
j.insert(j.end(), v.begin(), v.begin() + cl);
}
if (cr) {
j.insert(j.end(), vr.begin(), vr.begin() + cr);
}
sort(all(j));
rep(i, min(k - cl - cr, cl + cr)) {
if (j[0] >= 0) {
break;
}
j.erase(j.begin());
}
return accumulate(all(j), 0);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
rep(i, n) {
ll tmp;
cin >> tmp;
v.push_back(tmp);
}
vr.reserve(n);
vr = v;
reverse(all(vr));
// ll cl; // 左から宝石を取る回数
// ll cr; // 右から宝石を取る回数
// ll cd; // 宝石を戻す回数
// cl+cr+cd <= kとなるなかでの最大値を求める
ll ans = 0;
rep(cl, min(n + 1, k + 1)) {
rep(cr, min(n + 1 - cl, k + 1 - cl)) { chmax(ans, calc_max(cl, cr)); }
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 842,745 | 842,746 | u324825702 | cpp |
p03032 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) { cin >> v[i]; }
ll ans = 0;
for (int i = 0; i < min(k, n); ++i) {
for (int j = 0; i + j <= min(k, n); ++j) {
vector<ll> value(n, 0);
int cur = 0;
ll sum = 0;
for (int l = 0; l < i; ++l) {
value[cur] = v[l];
cur++;
}
for (int l = 0; l < j; l++) {
value[cur] = v[n - l - 1];
cur++;
}
cur = 0;
if (i + j < k) {
sort(value.begin(), value.end());
for (int l = i + j; l < k; ++l) {
if (value[cur] >= 0)
break;
value[cur] = 0;
cur++;
}
}
rep(l, n) sum += value[l];
ans = max(ans, sum);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) { cin >> v[i]; }
ll ans = 0;
for (int i = 0; i <= min(k, n); ++i) {
for (int j = 0; i + j <= min(k, n); ++j) {
vector<ll> value(n, 0);
int cur = 0;
ll sum = 0;
for (int l = 0; l < i; ++l) {
value[cur] = v[l];
cur++;
}
for (int l = 0; l < j; l++) {
value[cur] = v[n - l - 1];
cur++;
}
cur = 0;
if (i + j < k) {
sort(value.begin(), value.end());
for (int l = i + j; l < k; ++l) {
if (value[cur] >= 0)
break;
value[cur] = 0;
cur++;
}
}
rep(l, n) sum += value[l];
ans = max(ans, sum);
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,756 | 842,757 | u239409893 | cpp |
p03032 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) { cin >> v[i]; }
ll ans = 0;
for (int i = 0; i < min(k, n); ++i) {
for (int j = 0; i + j <= min(k, n); ++j) {
vector<ll> value(n, 0);
int cur = 0;
ll sum = 0;
for (int l = 0; l < i; ++l) {
value[cur] = v[l];
cur++;
}
for (int l = 0; l < j; l++) {
value[cur] = v[n - l - 1];
cur++;
}
cur = 0;
if (i + j < k) {
sort(value.begin(), value.end());
for (int l = i + j; l < min(n, k); ++l) {
if (value[cur] >= 0)
break;
value[cur] = 0;
cur++;
}
}
rep(l, n) sum += value[l];
ans = max(ans, sum);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) { cin >> v[i]; }
ll ans = 0;
for (int i = 0; i <= min(k, n); ++i) {
for (int j = 0; i + j <= min(k, n); ++j) {
vector<ll> value(n, 0);
int cur = 0;
ll sum = 0;
for (int l = 0; l < i; ++l) {
value[cur] = v[l];
cur++;
}
for (int l = 0; l < j; l++) {
value[cur] = v[n - l - 1];
cur++;
}
cur = 0;
if (i + j < k) {
sort(value.begin(), value.end());
for (int l = i + j; l < k; ++l) {
if (value[cur] >= 0)
break;
value[cur] = 0;
cur++;
}
}
rep(l, n) sum += value[l];
ans = max(ans, sum);
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 842,758 | 842,757 | u239409893 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
vector<ll> sl(n + 1);
rep(i, n) sl[i + 1] = sl[i] + v[i];
reverse(all(v));
vector<int> rv(n);
rep(i, n) rv[i] = v[i];
reverse(all(v));
vector<ll> sr(n + 1);
rep(i, n) sr[i + 1] = sr[i] + rv[i];
ll ans = 0;
rep(l, k) rep(r, k - l + 1) {
if (l + r > n)
continue;
int ret = k - l - r;
vector<int> hand;
rep(i, l) hand.push_back(v[i]);
rep(i, r) hand.push_back(rv[i]);
sort(all(hand));
ll now = sl[l] + sr[r];
rep(i, ret) {
if (i >= hand.size())
break;
if (hand[i] > 0)
break;
now -= hand[i];
}
ans = max(ans, now);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
vector<ll> sl(n + 1);
rep(i, n) sl[i + 1] = sl[i] + v[i];
reverse(all(v));
vector<int> rv(n);
rep(i, n) rv[i] = v[i];
reverse(all(v));
vector<ll> sr(n + 1);
rep(i, n) sr[i + 1] = sr[i] + rv[i];
ll ans = 0;
rep(l, k + 1) rep(r, k - l + 1) {
if (l + r > n)
continue;
int ret = k - l - r;
vector<int> hand;
rep(i, l) hand.push_back(v[i]);
rep(i, r) hand.push_back(rv[i]);
sort(all(hand));
ll now = sl[l] + sr[r];
rep(i, ret) {
if (i >= hand.size())
break;
if (hand[i] > 0)
break;
now -= hand[i];
}
ans = max(ans, now);
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 842,763 | 842,764 | u846820729 | cpp |
p03032 |
#include <algorithm>
#include <functional>
#include <iomanip> //! for setprecision(10)
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dump(c) \
{ \
for (auto it = c.begin(); it != c.end(); ++it) \
if (it == c.begin()) \
cout << *it; \
else \
cout << ' ' << *it; \
cout << endl; \
}
#define dumpMap(m) \
{ \
for (auto it : m) \
cout << it.first << "=>" << it.second << ' '; \
}
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N, K;
cin >> N >> K;
vector<int> V(N);
rep(i, N) cin >> V[i];
int ans = 0;
vector<int> neg;
for (int a = 0; a <= N; ++a) {
for (int b = 0; b <= N && a + b <= K; ++b) {
neg.clear();
int tmp = 0;
rep(i, a) {
tmp += V[i];
if (V[i] < 0) {
neg.push_back(V[i]);
}
}
rep(i, b) {
tmp += V[N - i - 1];
if (V[N - i - 1] < 0) {
neg.push_back(V[N - i - 1]);
}
}
if (!neg.empty() && a + b < K) {
sort(neg.begin(), neg.end());
rep(i, min((int)neg.size(), K - a - b)) { tmp -= neg[i]; }
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iomanip> //! for setprecision(10)
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dump(c) \
{ \
for (auto it = c.begin(); it != c.end(); ++it) \
if (it == c.begin()) \
cout << *it; \
else \
cout << ' ' << *it; \
cout << endl; \
}
#define dumpMap(m) \
{ \
for (auto it : m) \
cout << it.first << "=>" << it.second << ' '; \
}
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N, K;
cin >> N >> K;
vector<int> V(N);
rep(i, N) cin >> V[i];
int ans = 0;
vector<int> neg;
for (int a = 0; a <= N; ++a) {
for (int b = 0; a + b <= N && a + b <= K; ++b) {
neg.clear();
int tmp = 0;
rep(i, a) {
tmp += V[i];
if (V[i] < 0) {
neg.push_back(V[i]);
}
}
rep(i, b) {
tmp += V[N - i - 1];
if (V[N - i - 1] < 0) {
neg.push_back(V[N - i - 1]);
}
}
if (!neg.empty() && a + b < K) {
sort(neg.begin(), neg.end());
rep(i, min((int)neg.size(), K - a - b)) { tmp -= neg[i]; }
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 842,769 | 842,770 | u851470173 | cpp |
p03032 |
#include <algorithm>
#include <functional>
#include <iomanip> //! for setprecision(10)
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dump(c) \
{ \
for (auto it = c.begin(); it != c.end(); ++it) \
if (it == c.begin()) \
cout << *it; \
else \
cout << ' ' << *it; \
cout << endl; \
}
#define dumpMap(m) \
{ \
for (auto it : m) \
cout << it.first << "=>" << it.second << ' '; \
}
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N, K;
cin >> N >> K;
vector<int> V(N);
rep(i, N) cin >> V[i];
int ans = 0;
vector<int> neg;
for (int a = 0; a < N; ++a) {
for (int b = 0; b < N && a + b <= K; ++b) {
neg.clear();
int tmp = 0;
rep(i, a) {
tmp += V[i];
if (V[i] < 0) {
neg.push_back(V[i]);
}
}
rep(i, b) {
tmp += V[N - i - 1];
if (V[N - i - 1] < 0) {
neg.push_back(V[N - i - 1]);
}
}
if (!neg.empty() && a + b < K) {
sort(neg.begin(), neg.end());
rep(i, min((int)neg.size(), K - a - b)) { tmp -= neg[i]; }
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iomanip> //! for setprecision(10)
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dump(c) \
{ \
for (auto it = c.begin(); it != c.end(); ++it) \
if (it == c.begin()) \
cout << *it; \
else \
cout << ' ' << *it; \
cout << endl; \
}
#define dumpMap(m) \
{ \
for (auto it : m) \
cout << it.first << "=>" << it.second << ' '; \
}
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N, K;
cin >> N >> K;
vector<int> V(N);
rep(i, N) cin >> V[i];
int ans = 0;
vector<int> neg;
for (int a = 0; a <= N; ++a) {
for (int b = 0; a + b <= N && a + b <= K; ++b) {
neg.clear();
int tmp = 0;
rep(i, a) {
tmp += V[i];
if (V[i] < 0) {
neg.push_back(V[i]);
}
}
rep(i, b) {
tmp += V[N - i - 1];
if (V[N - i - 1] < 0) {
neg.push_back(V[N - i - 1]);
}
}
if (!neg.empty() && a + b < K) {
sort(neg.begin(), neg.end());
rep(i, min((int)neg.size(), K - a - b)) { tmp -= neg[i]; }
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,771 | 842,770 | u851470173 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
ll ans = 0;
priority_queue<int, vector<int>, greater<int>> queue;
for (int r = 0; r < MIN(n, k); r++) {
for (int l = 0; r + l < MIN(n, k); l++) {
while (!queue.empty())
queue.pop();
ll sum = 0;
REP(i, r) {
sum += v[i];
queue.push(v[i]);
}
REP(i, l) {
sum += v[n - 1 - i];
queue.push(v[n - 1 - i]);
}
for (int i = 0; i < k - r - l; i++) {
if (queue.empty())
break;
if (queue.top() < 0) {
sum -= queue.top();
queue.pop();
} else {
// cout << r << ' ' << l << ' ' << i << endl;
break;
}
}
if (sum > ans)
ans = sum;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
ll ans = 0;
priority_queue<int, vector<int>, greater<int>> queue;
for (int r = 0; r <= MIN(n, k); r++) {
for (int l = 0; r + l <= MIN(n, k); l++) {
while (!queue.empty())
queue.pop();
ll sum = 0;
REP(i, r) {
sum += v[i];
queue.push(v[i]);
}
REP(i, l) {
sum += v[n - 1 - i];
queue.push(v[n - 1 - i]);
}
for (int i = 0; i < k - r - l; i++) {
if (queue.empty())
break;
if (queue.top() < 0) {
sum -= queue.top();
queue.pop();
} else {
// cout << r << ' ' << l << ' ' << i << endl;
break;
}
}
if (sum > ans)
ans = sum;
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,774 | 842,775 | u997368585 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define ffrvs(ii, nn, mm) for (int ii = nn; ii >= mm; ii--)
#define srt(vvv) sort(vvv.begin(), vvv.end())
#define srtrvs(vvv) reverse(vvv.begin(), vvv.end())
#define Graph vector<vector<int>>
i64 inf = 1000000007;
i64 giant = 4000000000000000037;
using namespace std;
//メモリ置き場
int n, k;
vector<int> deq;
// inputします
void input() {
cin >> n >> k;
deq.resize(n);
ff(i, 0, n) { cin >> deq[i]; }
}
//ライブラリ置き場
// main
int main() {
input();
i64 ans = -giant;
ff(i, 0, n) {
ff(j, 0, n - i - 1) {
int rem = k - i - j;
if (rem < 0)
break;
vector<int> took;
i64 sum = 0;
ff(x, 0, i) {
took.push_back(deq[x]);
sum += deq[x];
}
ff(x, 0, j) {
took.push_back(deq[n - 1 - x]);
sum += deq[n - 1 - x];
}
ff(x, 0, took.size()) {
// cout << took[x] << " ";
}
// cout << endl;
srt(took);
int siz = took.size();
ff(x, 0, min(rem, siz)) {
if (took[x] > 0)
break;
// cout << took[x] << " ";
sum -= took[x];
}
// cout <<endl<< "sum is " << sum << endl;
ans = max(ans, sum);
// cout << "current biggest sum is " << ans << endl << endl;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define ffrvs(ii, nn, mm) for (int ii = nn; ii >= mm; ii--)
#define srt(vvv) sort(vvv.begin(), vvv.end())
#define srtrvs(vvv) reverse(vvv.begin(), vvv.end())
#define Graph vector<vector<int>>
i64 inf = 1000000007;
i64 giant = 4000000000000000037;
using namespace std;
//メモリ置き場
int n, k;
vector<int> deq;
// inputします
void input() {
cin >> n >> k;
deq.resize(n);
ff(i, 0, n) { cin >> deq[i]; }
}
//ライブラリ置き場
// main
int main() {
input();
i64 ans = -giant;
ff(i, 0, n + 1) {
ff(j, 0, n - i + 1) {
int rem = k - i - j;
if (rem < 0)
break;
vector<int> took;
i64 sum = 0;
ff(x, 0, i) {
took.push_back(deq[x]);
sum += deq[x];
}
ff(x, 0, j) {
took.push_back(deq[n - 1 - x]);
sum += deq[n - 1 - x];
}
ff(x, 0, took.size()) {
// cout << took[x] << " ";
}
// cout << endl;
srt(took);
int siz = took.size();
ff(x, 0, min(rem, siz)) {
if (took[x] > 0)
break;
// cout << took[x] << " ";
sum -= took[x];
}
// cout <<endl<< "sum is " << sum << endl;
ans = max(ans, sum);
// cout << "current biggest sum is " << ans << endl << endl;
}
}
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 842,776 | 842,777 | u771541325 | cpp |
p03032 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, end) for (int i = begin; i > end; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
const int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
int N, K;
int V[200];
int main() {
cin >> N >> K;
rep(i, 0, N) { cin >> V[i]; }
ll ans = -1;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K); b++) {
if (a + b > N) {
break;
}
priority_queue<int, vector<int>, greater<int>> have;
for (int i = 0; i < a; i++) {
have.push(V[i]);
}
for (int i = 0; i < b; i++) {
have.push(V[N - 1 - i]);
}
ll sum = 0;
for (int i = 0; i < K - a - b; i++) {
if (have.empty()) {
break;
}
if (have.top() >= 0) {
break;
}
have.pop();
}
while (!have.empty()) {
sum += have.top();
have.pop();
}
ans = max(ans, sum);
}
}
printf("%lld", ans);
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, end) for (int i = begin; i > end; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
const int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
int N, K;
int V[200];
int main() {
cin >> N >> K;
rep(i, 0, N) { cin >> V[i]; }
ll ans = -1;
for (int a = 0; a <= min(N, K); a++) {
for (int b = 0; b <= min(N, K); b++) {
if (a + b > min(N, K)) {
break;
}
priority_queue<int, vector<int>, greater<int>> have;
for (int i = 0; i < a; i++) {
have.push(V[i]);
}
for (int i = 0; i < b; i++) {
have.push(V[N - 1 - i]);
}
ll sum = 0;
for (int i = 0; i < K - a - b; i++) {
if (have.empty()) {
break;
}
if (have.top() >= 0) {
break;
}
have.pop();
}
while (!have.empty()) {
sum += have.top();
have.pop();
}
ans = max(ans, sum);
}
}
printf("%lld", ans);
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 842,784 | 842,785 | u372177994 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = n - 1; i >= a; --i)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) ((int)x.size())
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
const ll linf = 1e18;
const int inf = 1001001001;
const ll mod = 1e9 + 7; // 998244353 = (119<<23)+1
// head
const int nax = 55;
int n, k;
ll s[nax], jew[nax];
;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
rep(i, 0, n) cin >> s[i];
ll m = 0;
rep(i, 0, min(n, k) + 1) {
rep(j, 0, min(n, k) - i + 1) {
ll t = 0;
int ind = 0;
rep(l, 0, i) {
jew[ind] = s[l];
t += jew[ind];
ind++;
// cout<<jew[ind-1]<<' ';
}
rep(l, n - j, n) {
jew[ind] = s[l];
t += jew[ind];
ind++;
// cout<<jew[ind-1]<<' ';
}
// cout<<'\n';
sort(jew, jew + ind);
// rep(l,0,ind) cout<<jew[l]<<' ';
// cout<<'\n';
// auto it=lower_bound(jew,jew+ind,0);
for (int l = 0; l < (k - i - j); l++) {
if (jew[l] >= 0)
break;
t -= jew[l];
}
m = max(m, t);
// cout<<t<<'\n';
}
}
cout << m;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = n - 1; i >= a; --i)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) ((int)x.size())
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
const ll linf = 1e18;
const int inf = 1001001001;
const ll mod = 1e9 + 7; // 998244353 = (119<<23)+1
// head
const int nax = 55;
int n, k;
ll s[nax], jew[nax];
;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
rep(i, 0, n) cin >> s[i];
ll m = 0;
rep(i, 0, min(n, k) + 1) {
rep(j, 0, min(n, k) - i + 1) {
ll t = 0;
int ind = 0;
rep(l, 0, i) {
jew[ind] = s[l];
t += jew[ind];
ind++;
// cout<<jew[ind-1]<<' ';
}
rep(l, n - j, n) {
jew[ind] = s[l];
t += jew[ind];
ind++;
// cout<<jew[ind-1]<<' ';
}
// cout<<'\n';
sort(jew, jew + ind);
// rep(l,0,ind) cout<<jew[l]<<' ';
// cout<<'\n';
// auto it=lower_bound(jew,jew+ind,0);
for (int l = 0; l < (k - i - j) && l < ind; l++) {
if (jew[l] >= 0)
break;
t -= jew[l];
}
m = max(m, t);
// cout<<t<<'\n';
}
}
cout << m;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 842,786 | 842,787 | u837233010 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin, end) \
for (ll i = end - 1; begin <= i; i--) // repeat reverse
#endif
class ABC128D {
public:
ABC128D() {
cin >> n >> k;
k++;
v.resize(n);
rep(i, 0, n) cin >> v[i];
copy(all(v), back_inserter(vr));
reverse(all(vr));
}
void Run(void) {
ll best = 0;
ll solve = 0;
rep(li, 0, k) {
rep(ri, 0, k - li) {
rep(di, 0, k - li - ri) {
solve = Solve(li, ri, di);
if (best < solve)
best = solve;
}
}
}
cout << best;
}
private:
ll Solve(ll lmax, ll rmax, ll dmax) {
ll sum = 0;
vector<ll> ans(n);
lmax = (n < lmax) ? n : lmax;
rep(i, 0, lmax) ans.push_back(v[i]);
rmax = (n < rmax) ? n : rmax;
rep(i, 0, rmax) ans.push_back(vr[i]);
sum = accumulate(all(ans), 0);
sort(all(ans));
dmax = (ans.size() < dmax) ? ans.size() : dmax;
rep(i, 0, dmax) {
if (ans[i] < 0)
sum -= ans[i];
}
return sum;
}
ll n;
ll k;
vector<ll> v;
vector<ll> vr;
};
int main(void) {
ABC128D abc128d;
abc128d.Run();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begin, end) \
for (ll i = end - 1; begin <= i; i--) // repeat reverse
#endif
class ABC128D {
public:
ABC128D() {
cin >> n >> k;
k++;
v.resize(n);
rep(i, 0, n) cin >> v[i];
copy(all(v), back_inserter(vr));
reverse(all(vr));
}
void Run(void) {
ll best = 0;
ll solve = 0;
rep(li, 0, k) {
rep(ri, 0, k - li) {
rep(di, 0, k - li - ri) {
solve = Solve(li, ri, di);
if (best < solve)
best = solve;
}
}
}
cout << best;
}
private:
ll Solve(ll lmax, ll rmax, ll dmax) {
ll sum = 0;
vector<ll> ans(n);
lmax = (n < lmax) ? n : lmax;
rep(i, 0, lmax) ans.push_back(v[i]);
rmax = (n - lmax < rmax) ? n - lmax : rmax;
rep(i, 0, rmax) ans.push_back(vr[i]);
sum = accumulate(all(ans), 0);
sort(all(ans));
dmax = (ans.size() < dmax) ? ans.size() : dmax;
rep(i, 0, dmax) {
if (ans[i] < 0)
sum -= ans[i];
}
return sum;
}
ll n;
ll k;
vector<ll> v;
vector<ll> vr;
};
int main(void) {
ABC128D abc128d;
abc128d.Run();
return 0;
} | [
"assignment.change"
] | 842,788 | 842,789 | u153390822 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = 0;
for (int l = 0; l < k; l++) {
for (int r = 0; r < k - l; r++) {
if (l + r > n)
break;
int waste = k - l - r;
int now = 0;
vector<int> s;
for (int i = 0; i < l; i++) {
now += v[i];
s.push_back(v[i]);
}
for (int i = n - r; i < n; i++) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
for (int i = 0; i < waste; i++) {
if (i >= s.size())
break;
if (s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = 0;
for (int l = 0; l <= k; l++) {
for (int r = 0; r <= k - l; r++) {
if (l + r > n)
break;
int waste = k - l - r;
int now = 0;
vector<int> s;
for (int i = 0; i < l; i++) {
now += v[i];
s.push_back(v[i]);
}
for (int i = n - r; i < n; i++) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
for (int i = 0; i < waste; i++) {
if (i >= s.size())
break;
if (s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,796 | 842,797 | u950046716 | cpp |
p03032 | #define DEBUG 0
/**
* File : D2.cpp
* Author : Kazune Takahashi
* Created : 2019-5-27 00:19:34
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
#include <complex>
#include <functional>
#include <iomanip> // << fixed << setprecision(xxx)
#include <iostream>
#include <map> // if (M.find(key) != M.end()) { }
#include <queue>
#include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));
#include <set>
#include <stack>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <tuple>
#include <vector>
// start = std::chrono::system_clock::now();
// double elapsed =
// std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};
// const int C = 1e6+10;
// const ll M = 1000000007;
int N, K;
int a[100];
int ans = 0;
int main() {
cin >> N >> K;
for (auto i = 0; i < N; i++) {
cin >> a[i];
}
for (auto l = 0; l < K; l++) {
for (auto r = 0; r < K - l; r++) {
if (l + r > N) {
continue;
}
int now = 0;
int d = K - l - r;
vector<int> V;
for (auto i = 0; i < l; i++) {
now += a[i];
V.push_back(a[i]);
}
for (auto i = N - r; i < N; i++) {
now += a[i];
V.push_back(a[i]);
}
sort(V.begin(), V.end());
for (auto i = 0; i < d; i++) {
if (i >= (int)V.size()) {
break;
}
if (V[i] >= 0) {
break;
}
now -= V[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
} | #define DEBUG 0
/**
* File : D2.cpp
* Author : Kazune Takahashi
* Created : 2019-5-27 00:19:34
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
#include <complex>
#include <functional>
#include <iomanip> // << fixed << setprecision(xxx)
#include <iostream>
#include <map> // if (M.find(key) != M.end()) { }
#include <queue>
#include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));
#include <set>
#include <stack>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <tuple>
#include <vector>
// start = std::chrono::system_clock::now();
// double elapsed =
// std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};
// const int C = 1e6+10;
// const ll M = 1000000007;
int N, K;
int a[100];
int ans = 0;
int main() {
cin >> N >> K;
for (auto i = 0; i < N; i++) {
cin >> a[i];
}
for (auto l = 0; l <= K; l++) {
for (auto r = 0; r <= K - l; r++) {
if (l + r > N) {
continue;
}
int now = 0;
int d = K - l - r;
vector<int> V;
for (auto i = 0; i < l; i++) {
now += a[i];
V.push_back(a[i]);
}
for (auto i = N - r; i < N; i++) {
now += a[i];
V.push_back(a[i]);
}
sort(V.begin(), V.end());
for (auto i = 0; i < d; i++) {
if (i >= (int)V.size()) {
break;
}
if (V[i] >= 0) {
break;
}
now -= V[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,801 | 842,802 | u521272340 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
int ans = 0;
for (int i = 0; i < K; i++) {
for (int j = 0; j < K - i; j++) {
if (i + j > N)
continue;
vector<long long> S;
int res = 0;
for (int k = 0; k < i; k++) {
res += V[k];
S.push_back(V[k]);
}
for (int l = 0; l < j; l++) {
res += V[N - l - 1];
S.push_back(V[N - l - 1]);
}
sort(S.begin(), S.end());
for (int k = 0; k < (K - i - j); k++) {
if (k >= S.size())
break;
if (S[k] > 0)
break;
res -= S[k];
}
ans = max(ans, res);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
int ans = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K - i; j++) {
if (i + j > N)
continue;
vector<long long> S;
int res = 0;
for (int k = 0; k < i; k++) {
res += V[k];
S.push_back(V[k]);
}
for (int l = 0; l < j; l++) {
res += V[N - l - 1];
S.push_back(V[N - l - 1]);
}
sort(S.begin(), S.end());
for (int k = 0; k < (K - i - j); k++) {
if (k >= S.size())
break;
if (S[k] > 0)
break;
res -= S[k];
}
ans = max(ans, res);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,803 | 842,804 | u084069244 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
int ans = 0;
for (int i = 0; i < K; i++) {
for (int j = 0; j < K - i; j++) {
if (i + j > N)
continue;
vector<long long> S;
int res = 0;
for (int k = 0; k < i; k++) {
res += V[k];
S.push_back(V[k]);
}
for (int l = 0; l < j; l++) {
res += V[N - l - 1];
S.push_back(V[N - l - 1]);
}
sort(S.begin(), S.end());
for (int k = 0; k < (K - i - j); k++) {
if (k >= S.size())
break;
if (S[k] > 0)
break;
res -= S[k];
}
ans = max(ans, res);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
int ans = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K - i; j++) {
if (i + j > N)
continue;
vector<long long> S;
int res = 0;
for (int k = 0; k < i; k++) {
res += V[k];
S.push_back(V[k]);
}
for (int l = 0; l < j; l++) {
res += V[N - l - 1];
S.push_back(V[N - l - 1]);
}
sort(S.begin(), S.end());
for (int k = 0; k < (K - i - j); k++) {
if (k >= S.size())
break;
if (S[k] > 0)
break;
res -= S[k];
}
ans = max(ans, res);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 842,805 | 842,804 | u084069244 | cpp |
p03032 | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T> void debug(T value) { std::cerr << value; }
template <typename T, typename... Ts> void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T &value, Ts &...args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T> void write_to_cout(const T &value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T &value, const Ts &...args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(int, n, k);
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
for (int l = 0; l <= min(k, n); ++l) {
for (int r = 0; r + l <= min(k, n); ++r) {
set<int> s;
rep(i, l) s.insert(v[i]);
rep(i, r) s.insert(v[n - 1 - i]);
rep(i, k - (l + r)) {
if (!s.empty() && *s.begin() < 0)
s.erase(s.begin());
}
ans = max(ans, accumulate(all(s), 0));
}
}
out(ans);
}
| #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T> void debug(T value) { std::cerr << value; }
template <typename T, typename... Ts> void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T &value, Ts &...args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T> void write_to_cout(const T &value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T &value, const Ts &...args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(int, n, k);
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
for (int l = 0; l <= min(k, n); ++l) {
for (int r = 0; r + l <= min(k, n); ++r) {
multiset<int> s;
rep(i, l) s.insert(v[i]);
rep(i, r) s.insert(v[n - 1 - i]);
rep(i, k - (l + r)) {
if (!s.empty() && *s.begin() < 0)
s.erase(s.begin());
}
ans = max(ans, accumulate(all(s), 0));
}
}
out(ans);
}
| [
"variable_declaration.type.change"
] | 842,812 | 842,813 | u505122009 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= N; l++) {
for (int r = 0; r <= N - l; r++) {
if (l + r > N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 842,816 | 842,817 | u455366471 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= N; l++) {
for (int r = 0; r <= N; r++) {
if (l + r > N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 842,818 | 842,817 | u455366471 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K; r++) {
if (l + r > N + 1)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 842,819 | 842,817 | u455366471 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K; r++) {
if (l + r >= N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,820 | 842,817 | u455366471 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K; r++) {
if (l + r > N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
ll ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N)
continue;
// 戻せる回数
int d = K - (l + r);
vector<ll> calc;
ll tmp = 0;
// 左からとる
// cout << "pat1 l " << l << " r: " << r << " " << tmp << endl;
// [0, l)
for (int k = 0; k < l; k++) {
calc.push_back(v[k]);
tmp += v[k];
}
// 右からとる
// cout << "pat2 l " << l << " r: " << r << " " << tmp << endl;
// [N - r, N)
for (int k = 0; k < r; k++) {
calc.push_back(v[N - 1 - k]);
tmp += v[N - 1 - k];
}
sort(calc.begin(), calc.end());
// cout << "pat3 l " << l << " r: " << r << " " << tmp << endl;
// 戻す
for (int k = 0; k < min(d, (int)calc.size()); k++) {
if (calc[k] > 0)
break;
tmp -= calc[k];
}
// cout << "l " << l << " r: " << r << " " << tmp << endl;
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change"
] | 842,821 | 842,817 | u455366471 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
#include "string"
int n, k;
int dp[55][55][101], a[55];
int solve(int l, int r, int cnt) {
if (cnt > k)
return -inf;
if (cnt == k or l > r)
return 0;
int &tmp = dp[l][r][cnt];
if (tmp != -1)
return tmp;
tmp = 0;
tmp = max(tmp, solve(l + 1, r, cnt + 1) + a[l]);
tmp = max(tmp, solve(l, r - 1, cnt + 1) + a[r]);
if (a[l] < 0)
tmp = max(tmp, solve(l + 1, r, cnt + 2));
if (a[r] < 0)
tmp = max(tmp, solve(l, r - 1, cnt + 2));
return tmp;
}
int32_t main() {
int t = 1;
cin >> t;
while (t--) {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof dp);
int ans = solve(0, n - 1, 0);
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
#include "string"
int n, k;
int dp[55][55][101], a[55];
int solve(int l, int r, int cnt) {
if (cnt > k)
return -inf;
if (cnt == k or l > r)
return 0;
int &tmp = dp[l][r][cnt];
if (tmp != -1)
return tmp;
tmp = 0;
tmp = max(tmp, solve(l + 1, r, cnt + 1) + a[l]);
tmp = max(tmp, solve(l, r - 1, cnt + 1) + a[r]);
if (a[l] < 0)
tmp = max(tmp, solve(l + 1, r, cnt + 2));
if (a[r] < 0)
tmp = max(tmp, solve(l, r - 1, cnt + 2));
return tmp;
}
int32_t main() {
int t = 1;
// cin>>t;
while (t--) {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof dp);
int ans = solve(0, n - 1, 0);
cout << ans << endl;
}
} | [] | 842,824 | 842,825 | u371555975 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
#include "string"
int n, k;
int dp[55][55][101], a[55];
int solve(int l, int r, int cnt) {
if (cnt > k)
return -inf;
if (cnt == k or l > r)
return 0;
int &tmp = dp[l][r][cnt];
if (tmp != -1)
return tmp;
tmp = 0;
tmp = max(tmp, solve(l + 1, r, cnt + 1) + a[l]);
tmp = max(tmp, solve(l, r - 1, cnt + 1) + a[r]);
if (a[l] < 0)
tmp = max(tmp, solve(l + 1, r - 1, cnt + 2));
if (a[r] < 0)
tmp = max(tmp, solve(l, r + 1, cnt + 2));
return tmp;
}
int32_t main() {
int t = 1;
// cin>>t;
while (t--) {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof dp);
int ans = solve(0, n - 1, 0);
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
#include "string"
int n, k;
int dp[55][55][101], a[55];
int solve(int l, int r, int cnt) {
if (cnt > k)
return -inf;
if (cnt == k or l > r)
return 0;
int &tmp = dp[l][r][cnt];
if (tmp != -1)
return tmp;
tmp = 0;
tmp = max(tmp, solve(l + 1, r, cnt + 1) + a[l]);
tmp = max(tmp, solve(l, r - 1, cnt + 1) + a[r]);
if (a[l] < 0)
tmp = max(tmp, solve(l + 1, r, cnt + 2));
if (a[r] < 0)
tmp = max(tmp, solve(l, r - 1, cnt + 2));
return tmp;
}
int32_t main() {
int t = 1;
// cin>>t;
while (t--) {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof dp);
int ans = solve(0, n - 1, 0);
cout << ans << endl;
}
} | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 842,826 | 842,825 | u371555975 | cpp |
p03032 |
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#define ll long long
using namespace std;
ll dp[51][51][101];
int arr[51];
ll solve(int cura, int curb, int rem) {
if (rem <= 0 || cura > curb)
return 0;
if (dp[cura][curb][rem] != -1)
return dp[cura][curb][rem];
ll x = solve(cura, curb, rem - 1);
x = max(x, max(solve(cura + 1, curb, rem - 1) + arr[cura],
solve(cura + 1, curb, rem - 2)));
x = max(x, max(solve(cura, curb - 1, rem - 1) + arr[curb],
solve(cura, curb - 1, rem - 1)));
return dp[cura][curb][rem] = x;
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
cout << solve(0, n - 1, k);
return 0;
} |
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#define ll long long
using namespace std;
ll dp[51][51][101];
int arr[51];
ll solve(int cura, int curb, int rem) {
if (rem <= 0 || cura > curb)
return 0;
if (dp[cura][curb][rem] != -1)
return dp[cura][curb][rem];
ll x = solve(cura, curb, rem - 1);
x = max(x, max(solve(cura + 1, curb, rem - 1) + arr[cura],
solve(cura + 1, curb, rem - 2)));
x = max(x, max(solve(cura, curb - 1, rem - 1) + arr[curb],
solve(cura, curb - 1, rem - 2)));
return dp[cura][curb][rem] = x;
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
cout << solve(0, n - 1, k);
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 842,834 | 842,835 | u526308352 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int64_t ans = 0;
for (int i = 0; i <= N; i++)
for (int j = 0; j <= N - i; j++) {
if (K < i + j)
continue;
else {
set<int> S;
int64_t a = 0;
for (int k = 0; k < i; k++) {
S.insert(A.at(k));
a += A.at(k);
}
for (int l = 1; l <= j; l++) {
S.insert(A.at(N - l));
a += A.at(N - l);
}
int b = 0;
for (auto x : S) {
if (K - i - j - b <= b)
break;
else {
if (x <= 0)
a -= x;
b++;
}
}
if (ans <= a)
ans = a;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int64_t ans = 0;
for (int i = 0; i <= N; i++)
for (int j = 0; j <= N - i; j++) {
if (K < i + j)
continue;
else {
set<int> S;
int64_t a = 0;
for (int k = 0; k < i; k++) {
S.insert(A.at(k));
a += A.at(k);
}
for (int l = 1; l <= j; l++) {
S.insert(A.at(N - l));
a += A.at(N - l);
}
int b = 0;
for (auto x : S) {
if (K - i - j - b <= 0)
break;
else {
if (x <= 0)
a -= x;
b++;
}
}
if (ans <= a)
ans = a;
}
}
cout << ans << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 842,836 | 842,837 | u101018317 | cpp |
p03032 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) { \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) { \
for (int j = 0; j < v[i].size(); j++) { \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>; // クラスカル法とかで、{cost, {from,
// to}}的に使う。
const ll INF = 1001001001001001001;
const double pi = acos(-1);
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
//左からi個取り出す
//右からj個取り出す
ll ans = 0;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (i + j > k) {
break;
}
ll tmp = 0;
priority_queue<int, vector<int>, greater<int>> que;
for (int l = 0; l < i; l++) {
tmp += v[l];
que.push(v[l]);
}
for (int l = 0; l < j; l++) {
tmp += v[n - 1 - l];
que.push(v[n - 1 - l]);
}
for (int l = 0; l < k - i - j; l++) {
if (que.empty()) {
break;
}
int x = que.top();
if (x >= 0) {
break;
}
que.pop();
tmp -= x;
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) { \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) { \
for (int j = 0; j < v[i].size(); j++) { \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>; // クラスカル法とかで、{cost, {from,
// to}}的に使う。
const ll INF = 1001001001001001001;
const double pi = acos(-1);
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
//左からi個取り出す
//右からj個取り出す
ll ans = 0;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (i + j > k || i + j > n) {
break;
}
ll tmp = 0;
priority_queue<int, vector<int>, greater<int>> que;
for (int l = 0; l < i; l++) {
tmp += v[l];
que.push(v[l]);
}
for (int l = 0; l < j; l++) {
tmp += v[n - 1 - l];
que.push(v[n - 1 - l]);
}
for (int l = 0; l < k - i - j; l++) {
if (que.empty()) {
break;
}
int x = que.top();
if (x >= 0) {
break;
}
que.pop();
tmp -= x;
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 842,848 | 842,849 | u275934251 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
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;
}
typedef long long ll;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
rep(i, N) cin >> v[i];
int ans = 0;
rep(l, K) {
rep(r, K - l) {
if (l + r > N)
continue;
int d = K - l - r;
int sum = 0;
vector<int> s;
rep(i, l) {
sum += v[i];
s.push_back(v[i]);
}
rep(i, r) {
sum += v[N - i - 1];
s.push_back(v[N - i - 1]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size())
break;
if (s[i] > 0)
break;
sum -= s[i];
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
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;
}
typedef long long ll;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
rep(i, N) cin >> v[i];
int ans = 0;
rep(l, K + 1) {
rep(r, K - l + 1) {
if (l + r > N)
continue;
int d = K - l - r;
int sum = 0;
vector<int> s;
rep(i, l) {
sum += v[i];
s.push_back(v[i]);
}
rep(i, r) {
sum += v[N - i - 1];
s.push_back(v[N - i - 1]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
sum -= s[i];
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,854 | 842,855 | u628332144 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
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;
}
typedef long long ll;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
rep(i, N) cin >> v[i];
int ans = 0;
rep(l, K) {
rep(r, K - l) {
if (l + r > N)
break;
int d = K - l - r;
int sum = 0;
vector<int> s;
rep(i, l) {
sum += v[i];
s.push_back(v[i]);
}
rep(i, r) {
sum += v[N - i - 1];
s.push_back(v[N - i - 1]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
sum -= s[i];
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
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;
}
typedef long long ll;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
rep(i, N) cin >> v[i];
int ans = 0;
rep(l, K + 1) {
rep(r, K - l + 1) {
if (l + r > N)
continue;
int d = K - l - r;
int sum = 0;
vector<int> s;
rep(i, l) {
sum += v[i];
s.push_back(v[i]);
}
rep(i, r) {
sum += v[N - i - 1];
s.push_back(v[N - i - 1]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size())
break;
if (s[i] >= 0)
break;
sum -= s[i];
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 842,856 | 842,855 | u628332144 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T> void print_vec(vector<T> v) {
for (T i : v)
cout << i << " ";
cout << endl;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(l, k + 1) {
rep(r, k - l) {
if (l + r > n)
break;
int d = k - l - r;
ll now = 0;
vector<int> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
for (int i = n - r; i < n; i++) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size())
break;
if (s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T> void print_vec(vector<T> v) {
for (T i : v)
cout << i << " ";
cout << endl;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(l, k + 1) {
rep(r, k - l + 1) {
if (l + r > n)
break;
int d = k - l - r;
ll now = 0;
vector<int> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
for (int i = n - r; i < n; i++) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size())
break;
if (s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 842,863 | 842,864 | u894496005 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T> void print_vec(vector<T> v) {
for (T i : v)
cout << i << " ";
cout << endl;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(l, k) {
rep(r, k - l) {
if (l + r > n)
break;
int d = k - l - r;
ll now = 0;
vector<int> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
for (int i = n - r; i < n; i++) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size())
break;
if (s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T> void print_vec(vector<T> v) {
for (T i : v)
cout << i << " ";
cout << endl;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(l, k + 1) {
rep(r, k - l + 1) {
if (l + r > n)
break;
int d = k - l - r;
ll now = 0;
vector<int> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
for (int i = n - r; i < n; i++) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size())
break;
if (s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 842,865 | 842,864 | u894496005 | cpp |
p03032 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define P pair<ll, ll>
#define fs first
#define sc second
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
ll min(int a, ll b) { return min((ll)a, b); }
ll min(ll a, int b) { return min(a, (ll)b); }
template <class S> void print(vector<S> &v) {
for (ll i = 0; i < (ll)v.size(); i++) {
cerr << v[i] << ' ';
}
cerr << endl;
}
template <class S> void print(vector<vector<S>> &v) {
for (ll i = 0; i < (ll)v.size(); i++) {
for (ll j = 0; j < (ll)v[i].size(); j++) {
cerr << v[i][j] << ' ';
}
cerr << endl;
}
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int m = min(n, k);
ll ans = 0;
rep(a, m + 1) {
rep(b, m + 1) {
if (a + b > n)
continue;
ll res = 0;
priority_queue<ll> q;
rep(i, a) {
ll tmp = v[i];
res += tmp;
if (tmp < 0)
q.push(-tmp);
}
rep(i, b) {
ll tmp = v[n - i - 1];
res += tmp;
if (tmp < 0)
q.push(-tmp);
}
Rep(k - a - b) {
if (q.empty())
break;
res += q.top();
q.pop();
}
ans = max(ans, res);
}
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define P pair<ll, ll>
#define fs first
#define sc second
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
ll min(int a, ll b) { return min((ll)a, b); }
ll min(ll a, int b) { return min(a, (ll)b); }
template <class S> void print(vector<S> &v) {
for (ll i = 0; i < (ll)v.size(); i++) {
cerr << v[i] << ' ';
}
cerr << endl;
}
template <class S> void print(vector<vector<S>> &v) {
for (ll i = 0; i < (ll)v.size(); i++) {
for (ll j = 0; j < (ll)v[i].size(); j++) {
cerr << v[i][j] << ' ';
}
cerr << endl;
}
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int m = min(n, k);
ll ans = 0;
rep(a, m + 1) {
rep(b, m + 1) {
if (a + b > n || a + b > k)
continue;
ll res = 0;
priority_queue<ll> q;
rep(i, a) {
ll tmp = v[i];
res += tmp;
if (tmp < 0)
q.push(-tmp);
}
rep(i, b) {
ll tmp = v[n - i - 1];
res += tmp;
if (tmp < 0)
q.push(-tmp);
}
Rep(k - a - b) {
if (q.empty())
break;
res += q.top();
q.pop();
}
ans = max(ans, res);
}
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 842,870 | 842,871 | u466335531 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using pint = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
int main() {
int n, k;
cin >> n >> k;
vll v(n);
rep(i, n) cin >> v[i];
ll ans = -1ll * 1e11;
int mn = min(n, k);
for (int i = 0; i < mn; i++) {
for (int j = 0; j + i < mn; j++) {
vll a;
int cnt = k - i - j;
ll tans = 0;
for (int l = 0; l < i; l++)
a.push_back(v[l]);
for (int l = 0; l < j; l++)
a.push_back(v[n - 1 - l]);
for (auto at : a)
tans += at;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; l++)
tans -= a[l];
ans = max(ans, tans);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using pint = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
int main() {
int n, k;
cin >> n >> k;
vll v(n);
rep(i, n) cin >> v[i];
ll ans = -1LL * 1e11;
int mn = min(n, k);
for (int i = 0; i <= mn; i++) {
for (int j = 0; j + i <= mn; j++) {
vll a;
int cnt = k - i - j;
ll tans = 0;
for (int l = 0; l < i; l++)
a.push_back(v[l]);
for (int l = 0; l < j; l++)
a.push_back(v[n - 1 - l]);
for (auto at : a)
tans += at;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; l++)
tans -= a[l];
ans = max(ans, tans);
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 842,873 | 842,874 | u825601908 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using pint = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
int main() {
int n, k;
cin >> n >> k;
vll v(n);
rep(i, n) v[i];
ll ans = -1ll * 1e11;
int mn = min(n, k);
for (int i = 0; i < mn; i++) {
for (int j = 0; j + i < mn; j++) {
vll a;
int cnt = k - i - j;
ll tans = 0;
for (int l = 0; l < i; l++)
a.push_back(v[l]);
for (int l = 0; l < j; l++)
a.push_back(v[n - 1 - l]);
for (auto at : a)
tans += at;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; l++)
tans -= a[l];
ans = max(ans, tans);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using pint = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
int main() {
int n, k;
cin >> n >> k;
vll v(n);
rep(i, n) cin >> v[i];
ll ans = -1LL * 1e11;
int mn = min(n, k);
for (int i = 0; i <= mn; i++) {
for (int j = 0; j + i <= mn; j++) {
vll a;
int cnt = k - i - j;
ll tans = 0;
for (int l = 0; l < i; l++)
a.push_back(v[l]);
for (int l = 0; l < j; l++)
a.push_back(v[n - 1 - l]);
for (auto at : a)
tans += at;
sort(a.begin(), a.end());
for (int l = 0; l < cnt && l < a.size() && a[l] < 0; l++)
tans -= a[l];
ans = max(ans, tans);
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 842,875 | 842,874 | u825601908 | cpp |
p03032 | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef long double Ld;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
int R = min(n, k);
for (int a = 0; a <= R; a++) {
for (int b = 0; b <= R; b++) {
int c = k - a - b;
if (c < 0) {
continue;
}
int val = 0;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < a; i++) {
if (v[i] < 0) {
pq.push(v[i]);
} else {
val += v[i];
}
}
for (int i = 0; i < b; i++) {
if (v[n - i - 1] < 0) {
pq.push(v[n - i - 1]);
} else {
val += v[n - i - 1];
}
}
for (int i = 0; i < c; i++) {
if (!pq.empty()) {
pq.pop();
} else {
break;
}
}
while (!pq.empty()) {
val += pq.top();
pq.pop();
}
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef long double Ld;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
int R = min(n, k);
for (int a = 0; a <= R; a++) {
for (int b = 0; b <= R; b++) {
int c = k - a - b;
if (R < a + b) {
continue;
}
int val = 0;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < a; i++) {
if (v[i] < 0) {
pq.push(v[i]);
} else {
val += v[i];
}
}
for (int i = 0; i < b; i++) {
if (v[n - i - 1] < 0) {
pq.push(v[n - i - 1]);
} else {
val += v[n - i - 1];
}
}
for (int i = 0; i < c; i++) {
if (!pq.empty()) {
pq.pop();
} else {
break;
}
}
while (!pq.empty()) {
val += pq.top();
pq.pop();
}
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change"
] | 842,876 | 842,877 | u261538386 | cpp |
p03032 | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef long double Ld;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
int R = min(n, k);
for (int a = 0; a <= R; a++) {
for (int b = 0; b <= R; b++) {
int c = R - a - b;
if (c < 0) {
continue;
}
int val = 0;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < a; i++) {
if (v[i] < 0) {
pq.push(v[i]);
} else {
val += v[i];
}
}
for (int i = 0; i < b; i++) {
if (v[n - i - 1] < 0) {
pq.push(v[n - i - 1]);
} else {
val += v[n - i - 1];
}
}
for (int i = 0; i < c; i++) {
if (!pq.empty()) {
pq.pop();
} else {
break;
}
}
while (!pq.empty()) {
val += pq.top();
pq.pop();
}
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef long double Ld;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
int R = min(n, k);
for (int a = 0; a <= R; a++) {
for (int b = 0; b <= R; b++) {
int c = k - a - b;
if (R < a + b) {
continue;
}
int val = 0;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < a; i++) {
if (v[i] < 0) {
pq.push(v[i]);
} else {
val += v[i];
}
}
for (int i = 0; i < b; i++) {
if (v[n - i - 1] < 0) {
pq.push(v[n - i - 1]);
} else {
val += v[n - i - 1];
}
}
for (int i = 0; i < c; i++) {
if (!pq.empty()) {
pq.pop();
} else {
break;
}
}
while (!pq.empty()) {
val += pq.top();
pq.pop();
}
ans = max(ans, val);
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change"
] | 842,878 | 842,877 | u261538386 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long;
using P = pair<ll, ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
ll n, k;
cin >> n >> k;
vi v(n);
rep(i, n) cin >> v.at(i);
ll num = min(n, k);
vi vals;
rep(i, num) {
rep(j, num - i) {
ll val = 0;
vi items;
ll rest = k - i - j;
rep(t, i) items.push_back(v.at(t));
rep(t, j) items.push_back(v.at(n - 1 - t));
sort(items.begin(), items.end());
rep(l, items.size()) val += items.at(l);
rep(l, rest) {
if (l >= items.size())
break;
if (items.at(l) < 0)
val -= items.at(l);
}
vals.push_back(val);
cerr << "i:" << i << " j:" << j << " val:" << val << endl;
}
}
sort(vals.begin(), vals.end(), greater<>());
cout << vals.at(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long;
using P = pair<ll, ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
ll n, k;
cin >> n >> k;
vi v(n);
rep(i, n) cin >> v.at(i);
ll num = min(n, k);
vi vals;
rep(i, num + 1) {
rep(j, num + 1 - i) {
ll val = 0;
vi items;
ll rest = k - i - j;
rep(t, i) items.push_back(v.at(t));
rep(t, j) items.push_back(v.at(n - 1 - t));
sort(items.begin(), items.end());
rep(l, items.size()) val += items.at(l);
rep(l, rest) {
if (l >= items.size())
break;
if (items.at(l) < 0)
val -= items.at(l);
}
vals.push_back(val);
cerr << "i:" << i << " j:" << j << " val:" << val << endl;
}
}
sort(vals.begin(), vals.end(), greater<>());
cout << vals.at(0) << endl;
} | [
"expression.operation.binary.add"
] | 842,882 | 842,883 | u702462808 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.