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 <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
using Graph = vector<vector<ll>>;
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;
}
// 0 false, 1 true
// string to int : -48
// a to A : -32
// ceil(a) 1.2->2.0
// c++17 g++ -std=c++17 a.cpp
int main() {
std::cout << std::fixed << std::setprecision(15);
ll n, K;
cin >> n >> K;
deque<ll> deq;
rep(i, n) {
ll v;
cin >> v;
deq.push_back(v);
}
ll ans = 0;
for (ll i = 0; i <= K; i++) {
for (ll j = 0; j < K - i; j++) {
deque<ll> que = deq;
priority_queue<int, vector<int>, greater<int>> pq;
for (ll k = 0; k < i; k++) {
if (!que.empty()) {
pq.push(que.front());
que.pop_front();
} else {
break;
}
}
for (ll k = 0; k < j; k++) {
if (!que.empty()) {
pq.push(que.back());
que.pop_back();
} else {
break;
}
}
// discard
for (ll k = 0; k < K - i - j; k++) {
if (!pq.empty()) {
ll now = pq.top();
if (now < 0) {
pq.pop();
} else {
break;
}
}
}
// calc
ll tmp = 0;
while (!pq.empty()) {
tmp += pq.top();
pq.pop();
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
using Graph = vector<vector<ll>>;
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;
}
// 0 false, 1 true
// string to int : -48
// a to A : -32
// ceil(a) 1.2->2.0
// c++17 g++ -std=c++17 a.cpp
int main() {
std::cout << std::fixed << std::setprecision(15);
ll n, K;
cin >> n >> K;
deque<ll> deq;
rep(i, n) {
ll v;
cin >> v;
deq.push_back(v);
}
ll ans = 0;
for (ll i = 0; i <= K; i++) {
for (ll j = 0; j <= K - i; j++) {
deque<ll> que = deq;
priority_queue<int, vector<int>, greater<int>> pq;
for (ll k = 0; k < i; k++) {
if (!que.empty()) {
pq.push(que.front());
que.pop_front();
} else {
break;
}
}
for (ll k = 0; k < j; k++) {
if (!que.empty()) {
pq.push(que.back());
que.pop_back();
} else {
break;
}
}
// discard
for (ll k = 0; k < K - i - j; k++) {
if (!pq.empty()) {
ll now = pq.top();
if (now < 0) {
pq.pop();
} else {
break;
}
}
}
// calc
ll tmp = 0;
while (!pq.empty()) {
tmp += pq.top();
pq.pop();
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,897 | 842,898 | u799939777 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const ll INF = 1e18;
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << endl;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
vector<ll> V(n);
rep(i, n) cin >> V[i];
ll ans = -INF;
for (int l = 0; l < min(n, k); l++) {
for (int r = 0; r < min(n, k); r++) {
if (l + r > n || l + r > k)
continue;
vector<ll> v;
ll rec = 0;
rep(i, l) v.pb(V[i]);
rep(i, r) v.pb(V[n - 1 - i]);
sort(all(v));
rep(i, sz(v)) rec += v[i];
rep(i, min(sz(v), k - l - r)) {
if (v[i] < 0)
rec -= v[i];
}
chmax(ans, rec);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const ll INF = 1e18;
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << endl;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
vector<ll> V(n);
rep(i, n) cin >> V[i];
ll ans = -INF;
for (int l = 0; l <= min(n, k); l++) {
for (int r = 0; r <= min(n, k); r++) {
if (l + r > n || l + r > k)
continue;
vector<ll> v;
ll rec = 0;
rep(i, l) v.pb(V[i]);
rep(i, r) v.pb(V[n - 1 - i]);
sort(all(v));
rep(i, sz(v)) rec += v[i];
rep(i, min(sz(v), k - l - r)) {
if (v[i] < 0)
rec -= v[i];
}
chmax(ans, rec);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,906 | 842,907 | u406237526 | cpp |
p03032 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lb(c, x) distance(c.begin(), lower_bound(all(c), x))
#define ub(c, x) distance(c.begin(), upper_bound(all(c), x))
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) { cin >> v[i]; }
ll ans = 0;
for (ll l = 0; l < k; l++) {
for (ll r = 0; r < k - l; r++) {
if (r + l > n)
break;
ll d = k - l - r;
ll now = 0;
vector<ll> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
rep(i, r) {
now += v[n - 1 - i];
s.push_back(v[n - 1 - i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= l + r)
break;
if (s[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lb(c, x) distance(c.begin(), lower_bound(all(c), x))
#define ub(c, x) distance(c.begin(), upper_bound(all(c), x))
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) { cin >> v[i]; }
ll ans = 0;
for (ll l = 0; l <= k; l++) {
for (ll r = 0; r <= k - l; r++) {
if (r + l > n)
break;
ll d = k - l - r;
ll now = 0;
vector<ll> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
rep(i, r) {
now += v[n - 1 - i];
s.push_back(v[n - 1 - i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= l + r)
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,921 | 842,922 | u882039496 | cpp |
p03032 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lb(c, x) distance(c.begin(), lower_bound(all(c), x))
#define ub(c, x) distance(c.begin(), upper_bound(all(c), x))
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) { cin >> v[i]; }
ll ans = 0;
for (ll l = 0; l < k; l++) {
for (ll r = 0; r < k - l; r++) {
if (r + l > n)
break;
ll d = k - l - r;
ll now = 0;
vector<ll> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
rep(i, r) {
now += v[n - 1 - i];
s.push_back(v[n - 1 - i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= l + r)
break;
if (v[i] > 0)
break;
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lb(c, x) distance(c.begin(), lower_bound(all(c), x))
#define ub(c, x) distance(c.begin(), upper_bound(all(c), x))
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) { cin >> v[i]; }
ll ans = 0;
for (ll l = 0; l <= k; l++) {
for (ll r = 0; r <= k - l; r++) {
if (r + l > n)
break;
ll d = k - l - r;
ll now = 0;
vector<ll> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
rep(i, r) {
now += v[n - 1 - i];
s.push_back(v[n - 1 - i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= l + r)
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",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 842,923 | 842,922 | u882039496 | 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())
#define pb push_back
#define eb emplace_back
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll MOD = 1000000007, MOD2 = 998244353;
int main() {
int N, K;
cin >> N >> K;
vector<ll> V(N);
vector<P> gomi(N);
rep(i, N) {
cin >> V.at(i);
gomi.at(i).first = V.at(i);
gomi.at(i).second = i;
}
sort(gomi.begin(), gomi.end()); //捨てるべきやつ
vector<ll> lsum(N + 1), rsum(N + 1); //左右からi個の和
rep(i, N) {
lsum.at(i + 1) = lsum.at(i) + V.at(i);
rsum.at(i + 1) = rsum.at(i) + V.at(N - i - 1);
}
ll ans = 0;
rep(cat, K) { // cat個とってK-cat個捨てる
ll now = 0;
int rel = K - cat;
if (cat >= N) {
now = lsum.at(N);
rep(i, min(rel, N)) {
if (gomi.at(i).first < 0) {
now -= gomi.at(i).first;
}
}
chmax(ans, now);
} else {
ll nownow = 0;
rep(left, cat + 1) { //左からleft個、右からcat-left個
nownow = lsum.at(left) + rsum.at(cat - left);
int count = 0;
rep(i, N) {
if (gomi.at(i).second < left ||
gomi.at(i).second > N - 1 - cat + left) {
if (count < rel && gomi.at(i).first < 0) {
nownow -= gomi.at(i).first;
count++;
}
}
}
// chmax(now,nownow);
chmax(ans, nownow);
}
// chmax(ans,now);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll MOD = 1000000007, MOD2 = 998244353;
int main() {
int N, K;
cin >> N >> K;
vector<ll> V(N);
vector<P> gomi(N);
rep(i, N) {
cin >> V.at(i);
gomi.at(i).first = V.at(i);
gomi.at(i).second = i;
}
sort(gomi.begin(), gomi.end()); //捨てるべきやつ
vector<ll> lsum(N + 1), rsum(N + 1); //左右からi個の和
rep(i, N) {
lsum.at(i + 1) = lsum.at(i) + V.at(i);
rsum.at(i + 1) = rsum.at(i) + V.at(N - i - 1);
}
ll ans = 0;
rep(cat, K + 1) { // cat個とってK-cat個捨てる
ll now = 0;
int rel = K - cat;
if (cat >= N) {
now = lsum.at(N);
rep(i, min(rel, N)) {
if (gomi.at(i).first < 0) {
now -= gomi.at(i).first;
}
}
chmax(ans, now);
} else {
ll nownow = 0;
rep(left, cat + 1) { //左からleft個、右からcat-left個
nownow = lsum.at(left) + rsum.at(cat - left);
int count = 0;
rep(i, N) {
if (gomi.at(i).second < left ||
gomi.at(i).second > N - 1 - cat + left) {
if (count < rel && gomi.at(i).first < 0) {
nownow -= gomi.at(i).first;
count++;
}
}
}
// chmax(now,nownow);
chmax(ans, nownow);
}
// chmax(ans,now);
}
}
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 842,934 | 842,935 | u387221709 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<int, vector<int>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int r = min(n, k);
ll ans = 0;
rep(i, r) {
rep(j, r) {
if (i + j > r)
continue;
int t = max(0, k - (i + j));
priority_queue<ll> pq;
ll sum = 0;
rep(a, i) {
ll nv = v[a];
sum += nv;
if (nv < 0)
pq.push(-nv);
}
for (int a = 0; a < j; a++) {
ll nv = v[n - 1 - a];
sum += nv;
if (nv < 0)
pq.push(-nv);
}
rep(a, t) {
if (pq.empty())
break;
ll nv = pq.top();
pq.pop();
sum += nv;
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<int, vector<int>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int r = min(n, k);
ll ans = 0;
rep(i, r + 1) {
rep(j, r + 1) {
if (i + j > r)
continue;
int t = max(0, k - (i + j));
priority_queue<ll> pq;
ll sum = 0;
rep(a, i) {
ll nv = v[a];
sum += nv;
if (nv < 0)
pq.push(-nv);
}
for (int a = 0; a < j; a++) {
ll nv = v[n - 1 - a];
sum += nv;
if (nv < 0)
pq.push(-nv);
}
rep(a, t) {
if (pq.empty())
break;
ll nv = pq.top();
pq.pop();
sum += nv;
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 842,942 | 842,943 | u213868052 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<int, vector<int>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int r = min(n, k);
ll ans = 0;
rep(i, r) {
rep(j, r) {
if (i + j >= r)
continue;
int t = max(0, k - (i + j));
priority_queue<ll> pq;
ll sum = 0;
rep(a, i) {
ll nv = v[a];
sum += nv;
if (nv < 0)
pq.push(-nv);
}
for (int a = 0; a < j; a++) {
ll nv = v[n - 1 - a];
sum += nv;
if (nv < 0)
pq.push(-nv);
}
rep(a, t) {
if (pq.empty())
break;
ll nv = pq.top();
pq.pop();
sum += nv;
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<int, vector<int>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
int r = min(n, k);
ll ans = 0;
rep(i, r + 1) {
rep(j, r + 1) {
if (i + j > r)
continue;
int t = max(0, k - (i + j));
priority_queue<ll> pq;
ll sum = 0;
rep(a, i) {
ll nv = v[a];
sum += nv;
if (nv < 0)
pq.push(-nv);
}
for (int a = 0; a < j; a++) {
ll nv = v[n - 1 - a];
sum += nv;
if (nv < 0)
pq.push(-nv);
}
rep(a, t) {
if (pq.empty())
break;
ll nv = pq.top();
pq.pop();
sum += nv;
}
ans = max(ans, sum);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,944 | 842,943 | u213868052 | cpp |
p03032 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
cout << "------------------------------------\n";
rep(i, n) cout << i << " " << vec.at(i) << "\n";
cout << "------------------------------------\n";
}
void pr2d(vector<vector<ll>> vec) { // for debug
ll h = vec.size();
ll w = vec.at(0).size();
cout << "------------------------------------\n";
rep(i, h) {
rep(j, w) { cout << vec.at(i).at(j) << " "; }
cout << "\n";
}
cout << "------------------------------------\n";
}
int main() {
ll n, kk;
cin >> n >> kk;
vector<ll> v(n);
rep(i, n) cin >> v.at(i);
vector<vector<vector<ll>>> tbl(51,
vector<vector<ll>>(51, vector<ll>(51, -LINF)));
for (int i = 0; i <= n; i++) { // i個宝石を取る 1ループ目
for (int l = 0; l <= i; l++) { //左からl個取り、 2ループ目
ll r = i - l; //右からr=i-l取ることを考える
vector<ll> juery(0);
ll juerysum = 0;
for (int k = 0; k < l; k++) {
juery.push_back(v.at(k));
juerysum += v.at(k);
}
for (int k = n - 1; k >= n - r; k--) {
juery.push_back(v.at(k));
juerysum += v.at(k);
}
sort(juery.begin(), juery.end());
tbl.at(0).at(i).at(l) = juerysum;
for (int j = 1; j <= i; j++) { // j個返却することを考える
tbl.at(j).at(i).at(l) = tbl.at(j - 1).at(i).at(l) - juery.at(j - 1);
}
}
}
ll ans = 0;
for (int z = 0; z <= kk; z++) {
rep(i, 51) {
rep(j, 51) {
rep(k, 51) {
if (i + j == kk)
ans = max(ans, tbl[i][j][k]);
}
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
cout << "------------------------------------\n";
rep(i, n) cout << i << " " << vec.at(i) << "\n";
cout << "------------------------------------\n";
}
void pr2d(vector<vector<ll>> vec) { // for debug
ll h = vec.size();
ll w = vec.at(0).size();
cout << "------------------------------------\n";
rep(i, h) {
rep(j, w) { cout << vec.at(i).at(j) << " "; }
cout << "\n";
}
cout << "------------------------------------\n";
}
int main() {
ll n, kk;
cin >> n >> kk;
vector<ll> v(n);
rep(i, n) cin >> v.at(i);
vector<vector<vector<ll>>> tbl(51,
vector<vector<ll>>(51, vector<ll>(51, -LINF)));
for (int i = 0; i <= n; i++) { // i個宝石を取る 1ループ目
for (int l = 0; l <= i; l++) { //左からl個取り、 2ループ目
ll r = i - l; //右からr=i-l取ることを考える
vector<ll> juery(0);
ll juerysum = 0;
for (int k = 0; k < l; k++) {
juery.push_back(v.at(k));
juerysum += v.at(k);
}
for (int k = n - 1; k >= n - r; k--) {
juery.push_back(v.at(k));
juerysum += v.at(k);
}
sort(juery.begin(), juery.end());
tbl.at(0).at(i).at(l) = juerysum;
for (int j = 1; j <= i; j++) { // j個返却することを考える
tbl.at(j).at(i).at(l) = tbl.at(j - 1).at(i).at(l) - juery.at(j - 1);
}
}
}
ll ans = 0;
for (int z = 0; z <= kk; z++) {
rep(i, 51) {
rep(j, 51) {
rep(k, 51) {
if (i + j == z)
ans = max(ans, tbl[i][j][k]);
}
}
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 842,945 | 842,946 | u628597699 | cpp |
p03032 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N, K;
cin >> N >> K;
vector<int> V;
rep(i, N) {
int v;
cin >> v;
V.push_back(v);
}
long long ans = 0;
rep(i, N + 1) {
rep(j, N - i + 1) {
if (K > i + j) {
rep(k, K - i - j + 1) {
if (i + j + k != 0) {
// cout << i << " " << j << " " << k << endl;
priority_queue<int, vector<int>, greater<int>> pq;
rep(l, i) pq.push(V[V.size() - l - 1]);
rep(l, j) pq.push(V[l]);
int count = 0;
/*cout << "num" << endl;
cout << pq.size() << endl;
cout << count << endl;*/
while (!pq.empty() && count != k) {
pq.pop();
// cout << "pop" << endl;
++count;
}
/*cout << "num" << endl;*/
long long num = 0;
while (!pq.empty()) {
num += (long long)pq.top();
pq.pop();
}
if (ans < num)
ans = num;
/*cout << num << endl;*/
}
}
}
}
}
cout << ans;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int N, K;
cin >> N >> K;
vector<int> V;
rep(i, N) {
int v;
cin >> v;
V.push_back(v);
}
long long ans = 0;
rep(i, N + 1) {
rep(j, N - i + 1) {
if (K >= i + j) {
rep(k, K - i - j + 1) {
if (i + j + k != 0) {
// cout << i << " " << j << " " << k << endl;
priority_queue<int, vector<int>, greater<int>> pq;
rep(l, i) pq.push(V[V.size() - l - 1]);
rep(l, j) pq.push(V[l]);
int count = 0;
/*cout << "num" << endl;
cout << pq.size() << endl;
cout << count << endl;*/
while (!pq.empty() && count != k) {
pq.pop();
// cout << "pop" << endl;
++count;
}
/*cout << "num" << endl;*/
long long num = 0;
while (!pq.empty()) {
num += (long long)pq.top();
pq.pop();
}
if (ans < num)
ans = num;
/*cout << num << endl;*/
}
}
}
}
}
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,955 | 842,956 | u289578952 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = 1001002003004005006ll;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
int r = min(n, k);
int ans = -inf;
rep(a, r + 1) rep(b, r + 1) {
if (a + b > n)
continue;
int tmp = 0;
priority_queue<int, vector<int>, greater<int>> pq;
rep(i, a) {
tmp += v[i];
pq.push(v[i]);
}
rrep(i, b + 1) {
tmp += v[n - i];
pq.push(v[n - i]);
}
rep(i, k - (a + b)) {
if (pq.empty())
break;
int now = pq.top();
if (now >= 0)
break;
pq.pop();
tmp -= now;
}
maxs(ans, tmp);
}
cout << ans << 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 = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = 1001002003004005006ll;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
int r = min(n, k);
int ans = -inf;
rep(a, r + 1) rep(b, r + 1) {
if (a + b > r)
continue;
int tmp = 0;
priority_queue<int, vector<int>, greater<int>> pq;
rep(i, a) {
tmp += v[i];
pq.push(v[i]);
}
rrep(i, b + 1) {
tmp += v[n - i];
pq.push(v[n - i]);
}
rep(i, k - (a + b)) {
if (pq.empty())
break;
int now = pq.top();
if (now >= 0)
break;
pq.pop();
tmp -= now;
}
maxs(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 842,957 | 842,958 | u274883254 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
int main() {
int n, k;
cin >> n >> k;
vector<ll> V(n, 0);
for (int i = 0; i < n; ++i)
cin >> V.at(i);
ll ans = 0;
for (int left = 0; left < min(n, k); ++left) {
// cout << left << endl;
// 左からleft個取得する
priority_queue<ll, vector<ll>, greater<ll>> ansque;
for (int i = 0; i < left; ++i)
ansque.push(V.at(i));
// cout << "ok" << endl;
for (int right = 0; right + left < min(n, k); ++right) {
// cout << right << endl;
priority_queue<ll, vector<ll>, greater<ll>> rightque;
rightque = ansque;
for (int j = 0; j < right; ++j)
rightque.push(V.at(n - 1 - j));
int gomi = k - (right + left);
for (int j = 0; j < min(right + left, gomi); ++j) {
ll now = rightque.top();
if (now < 0)
rightque.pop();
else
break;
}
ll sum = 0;
while (!rightque.empty()) {
sum += rightque.top();
rightque.pop();
}
chmax(ans, sum);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
int main() {
int n, k;
cin >> n >> k;
vector<ll> V(n, 0);
for (int i = 0; i < n; ++i)
cin >> V.at(i);
ll ans = 0;
for (int left = 0; left <= min(n, k); ++left) {
// cout << left << endl;
// 左からleft個取得する
priority_queue<ll, vector<ll>, greater<ll>> ansque;
for (int i = 0; i < left; ++i)
ansque.push(V.at(i));
// cout << "ok" << endl;
for (int right = 0; right + left <= min(n, k); ++right) {
// cout << right << endl;
priority_queue<ll, vector<ll>, greater<ll>> rightque;
rightque = ansque;
for (int j = 0; j < right; ++j)
rightque.push(V.at(n - 1 - j));
int gomi = k - (right + left);
for (int j = 0; j < min(right + left, gomi); ++j) {
ll now = rightque.top();
if (now < 0)
rightque.pop();
else
break;
}
ll sum = 0;
while (!rightque.empty()) {
sum += rightque.top();
rightque.pop();
}
chmax(ans, sum);
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,959 | 842,960 | u971089878 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int n, k;
vector<long long> V(55, 0);
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> V.at(i);
int limit = min(n, k);
long long vans = 0;
for (int left = 0; left <= limit; ++left) {
priority_queue<long long, vector<long long>, greater<long long>> pque;
for (int i = 0; i < left; ++i) {
pque.push(V.at(i));
}
for (int right = 0; right <= limit; ++right) {
priority_queue<long long, vector<long long>, greater<long long>> ansque;
ansque = pque;
for (int j = 0; j < right; ++j) {
ansque.push(V.at(n - 1 - j));
}
int dust = k - left - right;
long long sum = 0;
int now = 0;
while (!ansque.empty() && now < dust) {
if (ansque.top() < 0) {
ansque.pop();
now++;
} else
break;
}
while (!ansque.empty()) {
sum += ansque.top();
ansque.pop();
}
chmax(vans, sum);
}
}
cout << vans << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int n, k;
vector<long long> V(55, 0);
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> V.at(i);
int limit = min(n, k);
long long vans = 0;
for (int left = 0; left <= limit; ++left) {
priority_queue<long long, vector<long long>, greater<long long>> pque;
for (int i = 0; i < left; ++i) {
pque.push(V.at(i));
}
for (int right = 0; right <= limit - left; ++right) {
priority_queue<long long, vector<long long>, greater<long long>> ansque;
ansque = pque;
for (int j = 0; j < right; ++j) {
ansque.push(V.at(n - 1 - j));
}
int dust = k - left - right;
long long sum = 0;
int now = 0;
while (!ansque.empty() && now < dust) {
if (ansque.top() < 0) {
ansque.pop();
now++;
} else
break;
}
while (!ansque.empty()) {
sum += ansque.top();
ansque.pop();
}
chmax(vans, sum);
}
}
cout << vans << endl;
} | [
"control_flow.loop.for.condition.change"
] | 842,961 | 842,962 | u971089878 | cpp |
p03032 | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
vector<ll> a(n + 1, 0), inva(n + 1, 0);
rep(i, n) a[i + 1] = a[i] + v[i];
auto iv = v;
reverse(iv.begin(), iv.end());
rep(i, n) inva[i + 1] = a[i] + iv[i];
ll res = 0;
for (int i = 0; i <= k; i++) {
for (int j = 0; j <= min(i, n); j++) { //取り出す作業を何回行うか
for (int l = 0; l <= j; l++) { //左から何回取り出すか
ll tmp = 0;
tmp += a[l];
int r = j - l;
tmp += inva[r];
int buf = i - j;
priority_queue<ll, vector<ll>, greater<ll>> que;
rep(x, l) que.push(v[x]);
rep(x, r) que.push(iv[x]);
rep(x, buf) {
if (que.size() == 0)
break;
tmp -= que.top();
que.pop();
}
chmax(res, tmp);
}
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
vector<ll> a(n + 1, 0), inva(n + 1, 0);
rep(i, n) a[i + 1] = a[i] + v[i];
auto iv = v;
reverse(iv.begin(), iv.end());
rep(i, n) inva[i + 1] = inva[i] + iv[i];
ll res = 0;
for (int i = 0; i <= k; i++) {
for (int j = 0; j <= min(i, n); j++) { //取り出す作業を何回行うか
for (int l = 0; l <= j; l++) { //左から何回取り出すか
ll tmp = 0;
tmp += a[l];
int r = j - l;
tmp += inva[r];
int buf = i - j;
priority_queue<ll, vector<ll>, greater<ll>> que;
rep(x, l) que.push(v[x]);
rep(x, r) que.push(iv[x]);
rep(x, buf) {
if (que.size() == 0)
break;
tmp -= que.top();
que.pop();
}
chmax(res, tmp);
}
}
}
cout << res << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 842,979 | 842,980 | u222866518 | cpp |
p03032 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<llint> vllint;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<llint, llint>> vpllint;
#define rep(i, n) for (int i = 0; i < n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << endl; \
else \
cout << "no" << endl;
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define POSSIBLE(ans) \
if (ans) \
cout << "POSSIBLE" << endl; \
else \
cout << "IMPOSSIBLE" << endl;
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
// aとbの最大公約数を求めるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
bool check(pair<pair<string, int>, int> a, pair<pair<string, int>, int> b) {
if (a.first.first == b.first.first) {
return a.first.second > b.first.second;
}
return a.first.first < b.first.first;
}
int main() {
int n, k;
cin >> n >> k;
vllint a(n);
rep(i, n) { cin >> a[i]; }
llint ans = 0;
rep(i, min(k, n)) { //選ぶ個数
rep(j, i + 1) { //左から選ぶ個数
vllint tmp;
rep(l, j) { //左から
tmp.push_back(a[l]);
}
rep(l, i - j) { //右から
tmp.push_back(a[n - 1 - l]);
}
sort(tmp.begin(), tmp.end());
llint cnt = 0;
rep(l, i) { cnt += tmp[l]; }
rep(l, (min(i, k - i))) {
if (tmp[l] < 0) {
cnt -= tmp[l];
}
}
ans = max(cnt, ans);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<llint> vllint;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<llint, llint>> vpllint;
#define rep(i, n) for (int i = 0; i < n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << endl; \
else \
cout << "no" << endl;
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define POSSIBLE(ans) \
if (ans) \
cout << "POSSIBLE" << endl; \
else \
cout << "IMPOSSIBLE" << endl;
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
// aとbの最大公約数を求めるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
bool check(pair<pair<string, int>, int> a, pair<pair<string, int>, int> b) {
if (a.first.first == b.first.first) {
return a.first.second > b.first.second;
}
return a.first.first < b.first.first;
}
int main() {
int n, k;
cin >> n >> k;
vllint a(n);
rep(i, n) { cin >> a[i]; }
llint ans = 0;
rep(i, min(k, n) + 1) { //選ぶ個数
rep(j, i + 1) { //左から選ぶ個数
vllint tmp;
rep(l, j) { //左から
tmp.push_back(a[l]);
}
rep(l, i - j) { //右から
tmp.push_back(a[n - 1 - l]);
}
sort(tmp.begin(), tmp.end());
llint cnt = 0;
rep(l, i) { cnt += tmp[l]; }
rep(l, (min(i, k - i))) {
if (tmp[l] < 0) {
cnt -= tmp[l];
}
}
ans = max(cnt, ans);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 842,983 | 842,984 | u376082984 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define FORV(i, v) for (auto i = v.begin(); i != v.end(); i++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1001001001;
const long long INFLL = LLONG_MAX / 3;
const double eps = (1e-9);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
for (int m = 0; m <= k; m++) { // m: 取り出す回数
for (int x = 0; x <= m; x++) { // x: 左から取り出す回数
vector<ll> a;
rep(i, x) a.push_back(v[i]);
rep(i, m - x) a.push_back(v[n - i - 1]);
sort(ALL(a), greater<ll>());
rep(i, k - m) {
if (!a.empty() && a.back() < 0)
a.pop_back();
else
break;
}
chmax(ans, SUM(a));
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define FORV(i, v) for (auto i = v.begin(); i != v.end(); i++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1001001001;
const long long INFLL = LLONG_MAX / 3;
const double eps = (1e-9);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
for (int m = 0; m <= min(k, n); m++) { // m: 取り出す回数
for (int x = 0; x <= m; x++) { // x: 左から取り出す回数
vector<ll> a;
rep(i, x) a.push_back(v[i]);
rep(i, m - x) a.push_back(v[n - i - 1]);
sort(ALL(a), greater<ll>());
rep(i, k - m) { // 価値が負のものを k-m 回まで捨てる
if (!a.empty() && a.back() < 0)
a.pop_back();
else
break;
}
chmax(ans, SUM(a));
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 842,987 | 842,988 | u733814820 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<int> v;
rep(i, n) { cin >> v[i]; }
rep(l, k + 1) {
rep(r, k - l + 1) {
if (l + r > n) {
continue;
}
int d = k - l - r;
int 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;
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
rep(l, k + 1) {
rep(r, k - l + 1) {
if (l + r > n) {
continue;
}
int d = k - l - r;
int 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;
cout << endl;
return 0;
} | [] | 842,999 | 843,000 | u828388155 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template <class T> using pq = priority_queue<T>;
template <class T> using P = pair<T, T>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define REP(i, k, n) for (int i = (k); i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define output(x, y) cout << fixed << setprecision(y) << x << endl;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
int main() { // 問題文はしっかり読め!!!
int n, m;
cin >> n >> m;
V a(n);
rep(i, n) { cin >> a[i]; }
ll ans = 0;
rep(i, m + 1) { // 何回操作する？
rep(j, min(i, n)) { // 左からどれだけ取り出す？
rep(k, min(i - j, n)) { // 右からどれだけ取り出す？
priority_queue<int, V, greater<int>> pq;
vector<bool> find(n, false);
ll tmp = 0;
int out = i - (k + j);
rep(R, j) {
tmp += a[R];
pq.push(a[R]);
find[R] = true;
}
rep(L, k) {
if (find[n - 1 - L]) {
out += k - L - 1;
break;
}
tmp += a[n - 1 - L];
pq.push(a[n - 1 - L]);
find[n - 1 - L] = true;
}
while (out && !pq.empty() && pq.top() < 0) {
out--;
tmp += abs(pq.top());
pq.pop();
}
chmax(ans, tmp);
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template <class T> using pq = priority_queue<T>;
template <class T> using P = pair<T, T>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define REP(i, k, n) for (int i = (k); i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define output(x, y) cout << fixed << setprecision(y) << x << endl;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
int main() { // 問題文はしっかり読め!!!
int n, m;
cin >> n >> m;
V a(n);
rep(i, n) { cin >> a[i]; }
ll ans = 0;
rep(i, m + 1) { // 何回操作する？
rep(j, min(i, n) + 1) { // 左からどれだけ取り出す？
rep(k, min(i - j, n) + 1) { // 右からどれだけ取り出す？
priority_queue<int, V, greater<int>> pq;
vector<bool> find(n, false);
ll tmp = 0;
int out = i - (k + j);
rep(R, j) {
tmp += a[R];
pq.push(a[R]);
find[R] = true;
}
rep(L, k) {
if (find[n - 1 - L]) {
out += k - L - 1;
break;
}
tmp += a[n - 1 - L];
pq.push(a[n - 1 - L]);
find[n - 1 - L] = true;
}
while (out && !pq.empty() && pq.top() < 0) {
out--;
tmp += abs(pq.top());
pq.pop();
}
chmax(ans, tmp);
}
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 843,016 | 843,017 | u836743234 | cpp |
p03032 | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
int max = 0;
int sum = 0;
vector<int> minus;
for (int i = 0; i <= min(N, K); i++) {
for (int j = 0; j <= min(N - i, K - i); j++) {
sum = 0;
minus.clear();
for (int k = 0; k < i; k++) {
sum += V[k];
if (V[k] < 0) {
minus.push_back(V[k]);
}
}
for (int k = 0; k < j; k++) {
sum += V[(N - 1) - k];
if (V[(N - 1) - k] < 0) {
minus.push_back(V[(N - 1) - k]);
}
}
sort(minus.begin(), minus.end(), greater<int>());
if (minus.size() > 0) {
for (int k = 0; k < K - (i + j) || minus.size() != 0; k++) {
sum -= minus.back();
minus.pop_back();
}
}
if (max < sum)
max = sum;
}
}
cout << max << endl;
} | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
int max = 0;
int sum = 0;
vector<int> minus;
for (int i = 0; i <= min(N, K); i++) {
for (int j = 0; j <= min(N - i, K - i); j++) {
sum = 0;
minus.clear();
for (int k = 0; k < i; k++) {
sum += V[k];
if (V[k] < 0) {
minus.push_back(V[k]);
}
}
for (int k = 0; k < j; k++) {
sum += V[(N - 1) - k];
if (V[(N - 1) - k] < 0) {
minus.push_back(V[(N - 1) - k]);
}
}
sort(minus.begin(), minus.end(), greater<int>());
if (minus.size() > 0) {
for (int k = 0; k < K - (i + j) && minus.size() != 0; k++) {
sum -= minus.back();
minus.pop_back();
}
}
if (max < sum)
max = sum;
}
}
cout << max << endl;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 843,034 | 843,035 | u022890424 | cpp |
p03032 |
// Problem : D - equeue
// Contest : AtCoder - AtCoder Beginner Contest 128
// URL : https://atcoder.jp/contests/abc128/tasks/abc128_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(c, a, b) for (ll c = a; c < b; c++)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define min_heap priority_queue<pll, vector<pll>, greater<pll>>
ll dx4[] = {-1, 1, 0, 0};
ll dy4[] = {0, 0, -1, 1};
ll dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0};
ll dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
bool isvalid(ll x, ll y, ll n, ll m) {
return (x >= 0 and y >= 0 and x < n and y < m);
}
ll isprime[1000];
vector<ll> prime;
void sievetoprime(ll n) {
mem(isprime, true);
for (ll p = 2; p * p <= n; p++) {
if (isprime[p] == true) {
for (ll i = p * p; i <= n; i += p)
isprime[i] = false;
}
}
}
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }
ll v[51];
ll n, k;
ll f(ll a, ll b) {
vector<ll> s;
rep(i, 0, a) s.pb(v[i]);
rep(i, 0, b) s.pb(v[n - i - 1]);
sort(all(s));
ll sum = 0;
for (auto i : s)
sum = sum + i;
for (ll i = 0; i < min(a + b, k - a - b); i++) {
if (s[i] < 0) {
sum -= s[i];
}
}
return sum;
}
void solve() {
cin >> n >> k;
rep(i, 0, n) { cin >> v[i]; }
ll ans = 0;
for (ll a = 0; a <= min(n, k); a++) {
for (ll b = 0; b <= min(n, k); b++) {
if (a + b > n)
continue;
ll x = f(a, b);
ans = max(ans, x);
}
}
cout << ans;
}
int main() {
ll inpoup = 0;
if (inpoup == 1) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
IOS ll t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
} |
// Problem : D - equeue
// Contest : AtCoder - AtCoder Beginner Contest 128
// URL : https://atcoder.jp/contests/abc128/tasks/abc128_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(c, a, b) for (ll c = a; c < b; c++)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define min_heap priority_queue<pll, vector<pll>, greater<pll>>
ll dx4[] = {-1, 1, 0, 0};
ll dy4[] = {0, 0, -1, 1};
ll dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0};
ll dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
bool isvalid(ll x, ll y, ll n, ll m) {
return (x >= 0 and y >= 0 and x < n and y < m);
}
ll isprime[1000];
vector<ll> prime;
void sievetoprime(ll n) {
mem(isprime, true);
for (ll p = 2; p * p <= n; p++) {
if (isprime[p] == true) {
for (ll i = p * p; i <= n; i += p)
isprime[i] = false;
}
}
}
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }
ll v[51];
ll n, k;
ll f(ll a, ll b) {
vector<ll> s;
rep(i, 0, a) s.pb(v[i]);
rep(i, 0, b) s.pb(v[n - i - 1]);
sort(all(s));
ll sum = 0;
for (auto i : s)
sum = sum + i;
for (ll i = 0; i < min(a + b, k - a - b); i++) {
if (s[i] < 0) {
sum -= s[i];
}
}
return sum;
}
void solve() {
cin >> n >> k;
rep(i, 0, n) { cin >> v[i]; }
ll ans = 0;
for (ll a = 0; a <= min(n, k); a++) {
for (ll b = 0; a + b <= min(n, k); b++) {
if (a + b > n)
continue;
ll x = f(a, b);
ans = max(ans, x);
}
}
cout << ans;
}
int main() {
ll inpoup = 0;
if (inpoup == 1) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
IOS ll t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
} | [
"control_flow.loop.for.condition.change"
] | 843,036 | 843,037 | u152447503 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> VI;
typedef vector<bool> VB;
typedef pair<ll, ll> P;
typedef pair<double, double> P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define bitrep(bit, A) for (int bit = A;; bit = (bit - 1) & A)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) (ll)((a).size())
#define c_max(a, b) (((ll)a) > ((ll)b) ? (a) : (b))
#define c_min(a, b) (((ll)a) < ((ll)b) ? (a) : (b))
#define chmax(x, a) x = c_max(x, a)
#define chmin(x, a) x = c_min(x, a)
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define SORT(c) stable_sort(ALL(c))
#define $(x) \
{ cout << #x << " = " << (x) << endl; }
#define fi first
#define se second
#define MAX 100100 // 5
#define MAX2 200100
#define MAX_6 1001001 // 6
#define MAX_7 10010010 // 7
#define SENTINEL 2000000000 // 9
#define NIL -1
#define MOD 1000000007
#define INF 1 << 30
#define INFTY 1000000000000000001LL
#define MAX_INT INT_MAX
#define Endl '\n'
#define greater greater<int>()
VI findAll(string S, string pattern) {
VI P;
ll pos = (ll)S.find(pattern);
while (pos != string::npos) {
P.push_back(pos);
pos = (ll)S.find(pattern, pos + 1);
}
return P;
}
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a * b / GCD(a, b); }
bool is_prime(ll n) {
if (n < 2)
return 0;
for (int i = 2; i * i < n; i++)
if (n % i == 0)
return 0;
return 1;
}
inline void eratosthenes(VB &p) {
rep(i, SZ(p)) p[i] = 1;
p[0] = p[1] = 0;
rep(i, SZ(p) / 2 + 1) {
if (p[i])
for (ll j = i + i; j < SZ(p); j += i)
p[j] = 0;
}
}
inline ll mod_add(ll a, ll b) { return (a + b) % MOD; }
inline ll mod_sub(ll a, ll b) { return (a + MOD - b) % MOD; }
inline ll mod_mul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
inline ll mod_pow(ll x, ll n, ll mod = (ll)MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
inline ll mod_inv(ll x) { return mod_pow(x, MOD - 2); }
inline ll mod_div(ll a, ll b) { return mod_mul(a, mod_inv(b)); }
using Graph = vector<vector<int>>; // int と P
int main() {
int n, k;
cin >> n >> k;
VI V(n);
rep(i, n) cin >> V[i];
ll ans = -INFTY;
for (int i = 0; i < min(n, k); i++) {
for (int j = 0; j + i < min(n, k); j++) {
ll cur = 0;
VI list;
for (int a = 0; a < i; a++) {
list.push_back(V[a]);
cur += V[a];
}
for (int b = 0; b < j; b++) {
list.push_back(V[n - b - 1]);
cur += V[n - b - 1];
}
sort(ALL(list));
for (int index = 0; index < c_min(k - i - j, list.size()); index++) {
if (list[index] < 0)
cur -= list[index];
}
chmax(ans, cur);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> VI;
typedef vector<bool> VB;
typedef pair<ll, ll> P;
typedef pair<double, double> P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define bitrep(bit, A) for (int bit = A;; bit = (bit - 1) & A)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) (ll)((a).size())
#define c_max(a, b) (((ll)a) > ((ll)b) ? (a) : (b))
#define c_min(a, b) (((ll)a) < ((ll)b) ? (a) : (b))
#define chmax(x, a) x = c_max(x, a)
#define chmin(x, a) x = c_min(x, a)
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define SORT(c) stable_sort(ALL(c))
#define $(x) \
{ cout << #x << " = " << (x) << endl; }
#define fi first
#define se second
#define MAX 100100 // 5
#define MAX2 200100
#define MAX_6 1001001 // 6
#define MAX_7 10010010 // 7
#define SENTINEL 2000000000 // 9
#define NIL -1
#define MOD 1000000007
#define INF 1 << 30
#define INFTY 1000000000000000001LL
#define MAX_INT INT_MAX
#define Endl '\n'
#define greater greater<int>()
VI findAll(string S, string pattern) {
VI P;
ll pos = (ll)S.find(pattern);
while (pos != string::npos) {
P.push_back(pos);
pos = (ll)S.find(pattern, pos + 1);
}
return P;
}
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a * b / GCD(a, b); }
bool is_prime(ll n) {
if (n < 2)
return 0;
for (int i = 2; i * i < n; i++)
if (n % i == 0)
return 0;
return 1;
}
inline void eratosthenes(VB &p) {
rep(i, SZ(p)) p[i] = 1;
p[0] = p[1] = 0;
rep(i, SZ(p) / 2 + 1) {
if (p[i])
for (ll j = i + i; j < SZ(p); j += i)
p[j] = 0;
}
}
inline ll mod_add(ll a, ll b) { return (a + b) % MOD; }
inline ll mod_sub(ll a, ll b) { return (a + MOD - b) % MOD; }
inline ll mod_mul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
inline ll mod_pow(ll x, ll n, ll mod = (ll)MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
inline ll mod_inv(ll x) { return mod_pow(x, MOD - 2); }
inline ll mod_div(ll a, ll b) { return mod_mul(a, mod_inv(b)); }
using Graph = vector<vector<int>>; // int と P
int main() {
int n, k;
cin >> n >> k;
VI V(n);
rep(i, n) cin >> V[i];
ll ans = -INFTY;
for (int i = 0; i <= min(n, k); i++) {
for (int j = 0; j + i <= min(n, k); j++) {
ll cur = 0;
VI list;
for (int a = 0; a < i; a++) {
list.push_back(V[a]);
cur += V[a];
}
for (int b = 0; b < j; b++) {
list.push_back(V[n - b - 1]);
cur += V[n - b - 1];
}
sort(ALL(list));
for (int index = 0; index < c_min(k - i - j, list.size()); index++) {
if (list[index] < 0)
cur -= list[index];
}
chmax(ans, cur);
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,042 | 843,043 | u000212387 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
typedef vector<int> VI;
typedef pair<int, int> pii;
const int MD = 1e9 + 7;
typedef vector<ll> VL;
void dbg() { cerr << "\n"; }
template <typename T, typename... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
VL v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(lf, k) rep(rg, k - lf) {
if (lf + rg > n)
continue;
int d = k - lf - rg;
VL sv;
ll su = 0;
rep(i, lf) {
su += v[i];
sv.push_back(v[i]);
}
rep2(i, n - rg, n) {
su += v[i];
sv.push_back(v[i]);
}
sort(all(sv));
rep(i, d) {
if (sz(sv) == 0 || i >= sz(sv))
break;
if (sv[i] > 0)
break;
su -= sv[i];
}
// dbg(lf, rg, su, d,sz(sv));
ans = max(ans, su);
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
typedef vector<int> VI;
typedef pair<int, int> pii;
const int MD = 1e9 + 7;
typedef vector<ll> VL;
void dbg() { cerr << "\n"; }
template <typename T, typename... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
VL v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(lf, k + 1) rep(rg, k - lf + 1) {
if (lf + rg > n)
continue;
int d = k - lf - rg;
VL sv;
ll su = 0;
rep(i, lf) {
su += v[i];
sv.push_back(v[i]);
}
rep2(i, n - rg, n) {
su += v[i];
sv.push_back(v[i]);
}
sort(all(sv));
rep(i, d) {
if (sz(sv) == 0 || i >= sz(sv))
break;
if (sv[i] > 0)
break;
su -= sv[i];
}
// dbg(lf, rg, su, d,sz(sv));
ans = max(ans, su);
}
cout << ans << "\n";
return 0;
}
| [
"expression.operation.binary.add"
] | 843,060 | 843,061 | u714564133 | cpp |
p03032 | /*Whose woods these are I think I know.
His house is in the village though;
He will not see me stopping here
To watch his woods fill up with snow.
My little horse must think it queer
To stop without a farmhouse near
Between the woods and frozen lake
The darkest evening of the year.
He gives his harness bells a shake
To ask if there is some mistake.
The only other sound’s the sweep
Of easy wind and downy flake.
The woods are lovely, dark and deep,
But I have promises to keep,
And miles to go before I sleep,
And miles to go before I sleep.*/
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn = 100010;
lli a[55];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = 0, k = 0;
lli res = 0ll;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i <= min(n, k); ++i)
for (int j = 0; (i + j) <= min(n, k); ++j) {
vector<lli> aux;
lli temp = 0ll;
for (int l = 0; l < i; ++l) {
aux.pb(a[l]);
temp += a[l];
}
for (int l = 0; l < j; ++l) {
aux.pb(a[n - l - 1]);
temp += a[n - l - 1];
}
sort(aux.begin(), aux.end());
for (int l = 0; l < min(k - i - j, (int)aux.size()); ++l)
if (aux[l] < 0)
temp -= a[l];
res = max(res, temp);
}
cout << res << endl;
} | /*Whose woods these are I think I know.
His house is in the village though;
He will not see me stopping here
To watch his woods fill up with snow.
My little horse must think it queer
To stop without a farmhouse near
Between the woods and frozen lake
The darkest evening of the year.
He gives his harness bells a shake
To ask if there is some mistake.
The only other sound’s the sweep
Of easy wind and downy flake.
The woods are lovely, dark and deep,
But I have promises to keep,
And miles to go before I sleep,
And miles to go before I sleep.*/
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn = 100010;
lli a[55];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = 0, k = 0;
lli res = 0ll;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i <= min(n, k); ++i)
for (int j = 0; (i + j) <= min(n, k); ++j) {
vector<lli> aux;
lli temp = 0ll;
for (int l = 0; l < i; ++l) {
aux.pb(a[l]);
temp += a[l];
}
for (int l = 0; l < j; ++l) {
aux.pb(a[n - l - 1]);
temp += a[n - l - 1];
}
sort(aux.begin(), aux.end());
for (int l = 0; l < min(k - i - j, (int)aux.size()); ++l)
if (aux[l] < 0)
temp -= aux[l];
res = max(res, temp);
}
cout << res << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 843,062 | 843,063 | u217942651 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(20);
// combination com(200010);
int n, K;
cin >> n >> K;
VE a(n);
rep(i, n) cin >> a[i];
int ans = 0;
rep(i, 101) {
rep(j, 101) {
if (i + j > n)
continue;
if (i > K || j > K)
continue;
VE tmp;
rep(k, i) { tmp.push_back(a[k]); }
reverse(ALL(a));
rep(k, j) tmp.push_back(a[k]);
reverse(ALL(a));
int now = max(0LL, K - i - j);
sort(ALL(tmp));
int now2 = 0;
rep(k, tmp.size()) now2 += tmp[k];
rep(k, min(sz(tmp), now)) {
if (tmp[k] >= 0)
break;
now2 -= tmp[k];
}
if (chmax(ans, now2)) {
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(20);
// combination com(200010);
int n, K;
cin >> n >> K;
VE a(n);
rep(i, n) cin >> a[i];
int ans = 0;
rep(i, 101) {
rep(j, 101) {
if (i + j > n)
continue;
if (i + j > K)
continue;
VE tmp;
rep(k, i) { tmp.push_back(a[k]); }
reverse(ALL(a));
rep(k, j) tmp.push_back(a[k]);
reverse(ALL(a));
int now = max(0LL, K - i - j);
sort(ALL(tmp));
int now2 = 0;
rep(k, tmp.size()) now2 += tmp[k];
rep(k, min(sz(tmp), now)) {
if (tmp[k] >= 0)
break;
now2 -= tmp[k];
}
if (chmax(ans, now2)) {
}
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 843,064 | 843,065 | u809967037 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll res = 0;
for (ll i = 0; i <= min(k, n); i++) {
for (ll j = 0; i + j <= min(k, n); j++) {
vector<ll> b;
ll cur = 0;
for (ll s = 0; s < i; s++) {
b.push_back(a[s]), cur += a[s];
}
for (ll t = 0; t < j; t++) {
b.push_back(a[n - 1 - t]), cur += a[n - 1 - t];
}
sort(b.begin(), b.end());
for (ll s = 0; s < min(k - i - j, (ll)b.size()); s++) {
if (b[s] < 0)
cur -= b[s];
res = max(res, cur);
}
}
}
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll res = 0;
for (ll i = 0; i <= min(k, n); i++) {
for (ll j = 0; i + j <= min(k, n); j++) {
vector<ll> b;
ll cur = 0;
for (ll s = 0; s < i; s++) {
b.push_back(a[s]), cur += a[s];
}
for (ll t = 0; t < j; t++) {
b.push_back(a[n - 1 - t]), cur += a[n - 1 - t];
}
sort(b.begin(), b.end());
for (ll s = 0; s < min(k - i - j, (ll)b.size()); s++)
if (b[s] < 0)
cur -= b[s];
res = max(res, cur);
}
}
cout << res << endl;
}
| [] | 843,070 | 843,071 | u246343119 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
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 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;
typedef long long ll;
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)
break;
int d = k - l - r;
int 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"
] | 843,095 | 843,096 | u915797797 | cpp |
p03032 | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ans = 0;
for (int a = 0; a < min(n, k); a++) {
for (int b = 0; a + b <= min(n, k); b++) {
vector<ll> w;
ll have = 0;
for (int i = 0; i < a; i++) {
w.push_back(v[i]);
have += v[i];
}
for (int i = 0; i < b; i++) {
w.push_back(v[n - i - 1]);
have += v[n - i - 1];
}
sort(w.begin(), w.end());
for (int i = 0; i < min(k - a - b, (int)w.size()); i++) {
if (w[i] < 0) {
a -= w[i];
}
}
ans = max(ans, have);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ans = 0;
for (int a = 0; a <= min(n, k); a++) {
for (int b = 0; a + b <= min(n, k); b++) {
vector<ll> w;
ll have = 0;
for (int i = 0; i < a; i++) {
w.push_back(v[i]);
have += v[i];
}
for (int i = 0; i < b; i++) {
w.push_back(v[n - i - 1]);
have += v[n - i - 1];
}
sort(w.begin(), w.end());
for (int i = 0; i < min(k - a - b, (int)w.size()); i++) {
if (w[i] < 0) {
have -= w[i];
}
}
ans = max(ans, have);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change"
] | 843,105 | 843,106 | u139300044 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int inf = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
rep(i, min(k, n)) {
int rem = k - i;
rep(le, i + 1) {
int ri = i - le;
vector<int> pick;
rep(j, le) { pick.pb(v[j]); }
rep(j, ri) { pick.pb(v[n - 1 - j]); }
sort(all(pick));
int sum = 0;
for (int j : pick)
sum += j;
int now = 0;
rep(j, rem) {
if (now >= pick.size())
break;
if (pick[now] < 0) {
sum -= pick[now];
now++;
} else
break;
}
chmax(ans, sum);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int inf = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ans = 0;
rep(i, min(k, n) + 1) {
int rem = k - i;
rep(le, i + 1) {
int ri = i - le;
vector<int> pick;
rep(j, le) { pick.pb(v[j]); }
rep(j, ri) { pick.pb(v[n - 1 - j]); }
sort(all(pick));
int sum = 0;
for (int j : pick)
sum += j;
int now = 0;
rep(j, rem) {
if (now >= pick.size())
break;
if (pick[now] < 0) {
sum -= pick[now];
now++;
} else
break;
}
chmax(ans, sum);
}
}
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 843,111 | 843,112 | u853721692 | cpp |
p03032 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, k;
cin >> n >> k;
deque<ll> Que;
rep(i, n) {
ll v;
cin >> v;
Que.push_back(v);
}
ll res = 0;
rep(i, k + 1) {
rep(j, k + 1) {
if (i + j > n)
continue;
deque<ll> que = Que;
vector<ll> jewel;
ll val, sum = 0;
rep(a, i) {
val = que.front();
que.pop_front();
jewel.push_back(val);
sum += val;
}
rep(b, j) {
val = que.back();
que.pop_back();
jewel.push_back(val);
sum += val;
}
sort(all(jewel));
rep(c, min((int)jewel.size(), k - (i + j))) {
ll num = jewel[c];
if (num < 0)
sum -= num;
}
chmax(res, sum);
}
}
cout << res << ln;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, k;
cin >> n >> k;
deque<ll> Que;
rep(i, n) {
ll v;
cin >> v;
Que.push_back(v);
}
ll res = 0;
rep(i, k + 1) {
rep(j, k + 1) {
if (i + j > n || i + j > k)
continue;
deque<ll> que = Que;
vector<ll> jewel;
ll val, sum = 0;
rep(a, i) {
val = que.front();
que.pop_front();
jewel.push_back(val);
sum += val;
}
rep(b, j) {
val = que.back();
que.pop_back();
jewel.push_back(val);
sum += val;
}
sort(all(jewel));
rep(c, min((int)jewel.size(), k - (i + j))) {
ll num = jewel[c];
if (num < 0)
sum -= num;
}
chmax(res, sum);
}
}
cout << res << ln;
}
| [
"control_flow.branch.if.condition.change"
] | 843,115 | 843,116 | u062736195 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> V(N);
rep(i, N) { cin >> V[i]; }
ll res = 0;
rep(a, min(N, K) + 1) {
rep(b, min(N - a, N - a) + 1) {
vector<ll> tmp;
rep(i, a) { tmp.push_back(V[i]); }
rep(i, b) { tmp.push_back(V[N - i]); }
sort(tmp.begin(), tmp.end());
ll cur_sum = std::accumulate(tmp.begin(), tmp.end(), 0);
int r = min(K - (a + b), int(tmp.size()));
rep(i, r) {
if (tmp[i] < 0) {
cur_sum -= tmp[i];
}
}
res = max(res, cur_sum);
}
}
cout << res << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> V(N);
rep(i, N) { cin >> V[i]; }
ll res = 0;
rep(a, min(N, K) + 1) {
rep(b, min(N - a, K - a) + 1) {
vector<ll> tmp;
rep(i, a) { tmp.push_back(V[i]); }
rep(i, b) { tmp.push_back(V[N - i - 1]); }
sort(tmp.begin(), tmp.end());
ll cur_sum = std::accumulate(tmp.begin(), tmp.end(), 0);
int r = min(K - (a + b), int(tmp.size()));
rep(i, r) {
if (tmp[i] < 0) {
cur_sum -= tmp[i];
}
}
res = max(res, cur_sum);
}
}
cout << res << endl;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,119 | 843,120 | u137542041 | cpp |
p03032 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
typedef long long int ll;
typedef vector<int> vecint;
typedef vector<ll> vecll;
typedef vector<double> vecd;
typedef vector<string> vecstr;
typedef vector<char> vecchar;
typedef vector<bool> vecbool;
typedef vector<vector<bool>> vec2bool;
typedef vector<vector<int>> vec2int;
typedef vector<vector<double>> vec2d;
////////////////////////////////////////////////
void init() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
////////////////////////////////////////////////
int main() {
init();
int n, k;
cin >> n >> k;
vecint v(n, 0);
for (auto &e : v)
cin >> e;
int m = min(n, k);
int ans = 0;
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= m; j++) {
if (i + j > n)
break;
priority_queue<int, vector<int>, greater<int>> q;
int tmp = 0;
for (int i2 = 0; i2 < i; i2++) {
q.push(v[i2]);
tmp += v[i2];
}
for (int j2 = 0; j2 < j; j2++) {
q.push(v[n - 1 - j2]);
tmp += v[n - 1 - j2];
}
REP(l, k - i - j) {
if (q.empty() || q.top() >= 0)
break;
tmp -= q.top();
q.pop();
}
ans = max(tmp, ans);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
typedef long long int ll;
typedef vector<int> vecint;
typedef vector<ll> vecll;
typedef vector<double> vecd;
typedef vector<string> vecstr;
typedef vector<char> vecchar;
typedef vector<bool> vecbool;
typedef vector<vector<bool>> vec2bool;
typedef vector<vector<int>> vec2int;
typedef vector<vector<double>> vec2d;
////////////////////////////////////////////////
void init() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
////////////////////////////////////////////////
int main() {
init();
int n, k;
cin >> n >> k;
vecint v(n, 0);
for (auto &e : v)
cin >> e;
int m = min(n, k);
int ans = 0;
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= m; j++) {
if (i + j > n || i + j > k)
break;
priority_queue<int, vector<int>, greater<int>> q;
int tmp = 0;
for (int i2 = 0; i2 < i; i2++) {
q.push(v[i2]);
tmp += v[i2];
}
for (int j2 = 0; j2 < j; j2++) {
q.push(v[n - 1 - j2]);
tmp += v[n - 1 - j2];
}
REP(l, k - i - j) {
if (q.empty() || q.top() >= 0)
break;
tmp -= q.top();
q.pop();
}
ans = max(tmp, ans);
}
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 843,121 | 843,122 | u138062788 | cpp |
p03032 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, k, mx, a[55];
vector<int> vt;
void f(int p) {
int i, s = 0;
if (p < 0)
return;
sort(vt.begin(), vt.end());
for (i = 0; i < vt.size(); i++) {
if (i < p && vt[i] < 0)
continue;
s += vt[i];
}
mx = max(mx, s);
}
int main() {
int i, j, c;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i <= n; i++) {
vt.clear();
for (j = 0; j < i; j++)
vt.push_back(a[j]);
f(k - vt.size());
for (c = 0, j = n - 1; c < n - c; c++, j--) {
vt.push_back(a[j]);
f(k - vt.size());
}
}
cout << mx;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, k, mx, a[55];
vector<int> vt;
void f(int p) {
int i, s = 0;
if (p < 0)
return;
sort(vt.begin(), vt.end());
for (i = 0; i < vt.size(); i++) {
if (i < p && vt[i] < 0)
continue;
s += vt[i];
}
mx = max(mx, s);
}
int main() {
int i, j, c;
cin >> n >> k;
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i <= n; i++) {
vt.clear();
for (j = 0; j < i; j++)
vt.push_back(a[j]);
f(k - vt.size());
for (c = 0, j = n - 1; c < n - i; c++, j--) {
vt.push_back(a[j]);
f(k - vt.size());
}
}
cout << mx;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,133 | 843,134 | u093170535 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K, ans = 0;
cin >> N >> K;
vector<int64_t> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int l = 0; l < K; l++) {
for (int r = 0; r < K - l; r++) {
if (l + r > N)
continue;
int64_t d = K - l - r, n = 0;
vector<int64_t> S;
for (int i = 0; i < l; i++) {
n += V[i];
S.emplace_back(V[i]);
}
for (int i = N - 1; i > (N - 1) - r; i--) {
n += V[i];
S.emplace_back(V[i]);
}
sort(S.begin(), S.end());
for (int i = 0; i < d; i++) {
if (i >= S.size() || S[i] >= 0)
break;
n -= S[i];
}
ans = max(ans, n);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K, ans = 0;
cin >> N >> K;
vector<int64_t> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int l = 0; l <= K; l++) {
for (int r = 0; r <= K - l; r++) {
if (l + r > N)
continue;
int64_t d = K - l - r, n = 0;
vector<int64_t> S;
for (int i = 0; i < l; i++) {
n += V[i];
S.emplace_back(V[i]);
}
for (int i = N - 1; i > (N - 1) - r; i--) {
n += V[i];
S.emplace_back(V[i]);
}
sort(S.begin(), S.end());
for (int i = 0; i < d; i++) {
if (i >= S.size() || S[i] > 0)
break;
n -= S[i];
}
ans = max(ans, n);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 843,135 | 843,136 | u543466827 | cpp |
p03031 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int k[15], s[15][15], p[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
int ans = 0;
for (int i = 0; i < m; i++)
cin >> p[i];
for (int bit = 0; bit < (1 << n); bit++) {
int f = 1;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < k[i]; j++) {
if (bit >> s[i][j] & 1)
cnt++;
}
if (cnt % 2 == p[i])
f = 0;
}
if (f)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int k[15], s[15][15], p[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
int ans = 0;
for (int i = 0; i < m; i++)
cin >> p[i];
for (int bit = 0; bit < (1 << n); bit++) {
int f = 1;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < k[i]; j++) {
if ((bit >> s[i][j]) & 1)
cnt++;
}
if (cnt % 2 != p[i])
f = 0;
}
if (f)
ans++;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 843,139 | 843,140 | u127194462 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int state[15];
int main() {
int N, M;
scanf("%d%d", &N, &M);
memset(s, 0, sizeof(s));
for (int i = 0; i < M; i++) {
int k;
scanf("%d", &k);
for (int j = 0; j < k; j++) {
int x;
scanf("%d", &x);
s[i][x] = 1;
}
}
for (int i = 0; i < M; i++) {
scanf("%d", &p[i]);
}
int ans = 0;
for (int i = 0; i < (1 << N); i++) {
memset(state, 0, sizeof(state));
for (int j = 0; j < N; j++) {
if (i & (1 << j)) {
state[j] = 1;
}
}
bool legit = true;
for (int j = 0; j < M; j++) {
int temp = 0;
for (int k = 0; k < N; k++) {
if (state[k] && s[j][k]) {
temp += s[j][k];
}
}
if (temp % 2 != p[j]) {
legit = false;
break;
}
}
ans += legit;
}
printf("%d", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int state[15];
int main() {
int N, M;
scanf("%d%d", &N, &M);
memset(s, 0, sizeof(s));
for (int i = 0; i < M; i++) {
int k;
scanf("%d", &k);
for (int j = 0; j < k; j++) {
int x;
scanf("%d", &x);
s[i][x - 1] = 1;
}
}
for (int i = 0; i < M; i++) {
scanf("%d", &p[i]);
}
int ans = 0;
for (int i = 0; i < (1 << N); i++) {
memset(state, 0, sizeof(state));
for (int j = 0; j < N; j++) {
if (i & (1 << j)) {
state[j] = 1;
}
}
bool legit = true;
for (int j = 0; j < M; j++) {
int temp = 0;
for (int k = 0; k < N; k++) {
if (state[k] && s[j][k]) {
temp += s[j][k];
}
}
if (temp % 2 != p[j]) {
legit = false;
break;
}
}
ans += legit;
}
printf("%d", ans);
return 0;
}
| [
"assignment.change"
] | 843,141 | 843,142 | u113883426 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> a[11];
int p[11];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int y;
cin >> y;
a[i].push_back(y);
}
}
for (int i = 0; i < k; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < (1 << n); i++) {
bool f = false;
for (int j = 0; j < k; j++) {
int cnt = 0;
for (int o = 0; o < a[j].size(); o++) {
if (i & (1 << (a[j][o] - 1))) {
cnt++;
}
}
cnt %= 2;
if (cnt != p[j]) {
f = true;
break;
}
}
if (!f)
ans++;
}
cout << ans << '\n';
}
// 335
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> a[11];
int p[11];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int y;
cin >> y;
a[i].push_back(y);
}
}
for (int i = 0; i < k; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i < (1 << n); i++) {
bool f = false;
for (int j = 0; j < k; j++) {
int cnt = 0;
for (int o = 0; o < a[j].size(); o++) {
if (i & (1 << (a[j][o] - 1))) {
cnt++;
}
}
cnt %= 2;
if (cnt != p[j]) {
f = true;
break;
}
}
if (!f)
ans++;
}
cout << ans << '\n';
}
// 11111
// 1 번 : 2 2 번 : 2 3
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,143 | 843,144 | u064087840 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> a[11];
int p[11];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
for (int i = 0; i < x; i++) {
int y;
cin >> y;
a[i].push_back(y);
}
}
for (int i = 0; i < k; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < (1 << n); i++) {
bool f = false;
for (int j = 0; j < k; j++) {
int cnt = 0;
for (int o = 0; o < a[j].size(); o++) {
if (i & (1 << (a[j][o] - 1))) {
cnt++;
}
}
cnt %= 2;
if (cnt != p[j]) {
f = true;
break;
}
}
if (!f)
ans++;
}
cout << ans << '\n';
}
// 335
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> a[11];
int p[11];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int y;
cin >> y;
a[i].push_back(y);
}
}
for (int i = 0; i < k; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i < (1 << n); i++) {
bool f = false;
for (int j = 0; j < k; j++) {
int cnt = 0;
for (int o = 0; o < a[j].size(); o++) {
if (i & (1 << (a[j][o] - 1))) {
cnt++;
}
}
cnt %= 2;
if (cnt != p[j]) {
f = true;
break;
}
}
if (!f)
ans++;
}
cout << ans << '\n';
}
// 11111
// 1 번 : 2 2 번 : 2 3
| [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 843,145 | 843,144 | u064087840 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
// 左づめでの10進数xをdigits桁のN進数vectorにしてを返す
vector<int> baseNumber(int N, int digits, int x) {
vector<int> ret(digits, 0);
// 商
int quotient = x;
int counter = 0;
while (quotient > 0) {
// 余り
int remainder = quotient % N;
quotient /= N;
ret[counter] = remainder;
counter++;
}
return ret;
};
// n-1までのN進数を上記のbaseNumberで返したvectorのvector
vector<vector<int>> baseNumbers(int n, int N, int digits) {
vector<vector<int>> ret(n, vector<int>(digits));
for (int i = 0; i < n; i++) {
ret[i] = baseNumber(N, digits, i);
}
return ret;
};
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m, vector<int>(10));
vector<int> p(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
vector<vector<int>> dfs = baseNumbers((int)pow(2, n), 2, n);
int ans = 0;
for (int i = 0; i < dfs.size(); i++) {
vector<int> bn = dfs[i];
bool flag = true;
for (int j = 0; j < m; j++) {
int ons = 0;
for (int l = 0; l < k[j]; l++) {
if (bn[s[j][l] - 1] == 1)
ons++;
}
if (!(ons > 0 && ons % 2 == p[j])) {
flag = false;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
};
| #include <bits/stdc++.h>
using namespace std;
// 左づめでの10進数xをdigits桁のN進数vectorにしてを返す
vector<int> baseNumber(int N, int digits, int x) {
vector<int> ret(digits, 0);
// 商
int quotient = x;
int counter = 0;
while (quotient > 0) {
// 余り
int remainder = quotient % N;
quotient /= N;
ret[counter] = remainder;
counter++;
}
return ret;
};
// n-1までのN進数を上記のbaseNumberで返したvectorのvector
vector<vector<int>> baseNumbers(int n, int N, int digits) {
vector<vector<int>> ret(n, vector<int>(digits));
for (int i = 0; i < n; i++) {
ret[i] = baseNumber(N, digits, i);
}
return ret;
};
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m, vector<int>(10));
vector<int> p(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
vector<vector<int>> dfs = baseNumbers((int)pow(2, n), 2, n);
int ans = 0;
for (int i = 0; i < dfs.size(); i++) {
vector<int> bn = dfs[i];
bool flag = true;
for (int j = 0; j < m; j++) {
int ons = 0;
for (int l = 0; l < k[j]; l++) {
if (bn[s[j][l] - 1] == 1)
ons++;
}
if (!(ons % 2 == p[j])) {
flag = false;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
};
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 843,155 | 843,156 | u987594251 | cpp |
p03031 | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int N, M;
cin >> N >> M;
int k[10], s[10][10], p[10];
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i++)
cin >> p[i];
long long ans = 0;
for (int x = 0; x < (1 << N); x++) {
vector<int> S(N, 0);
for (int i = 0; i < N; i++) {
if (x & (1 << i))
S[i] = 1;
}
int ok = 0;
for (int i = 0; i < M; i++) {
int cnt = 0;
for (int j = 0; j < k[i]; j++) {
if (S[s[i][j] - 1] == 1)
cnt++;
}
if (cnt != 0 && cnt % 2 == p[i])
ok++;
}
if (ok == M) {
ans++;
}
}
cout << ans << endl;
}
| #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int N, M;
cin >> N >> M;
int k[10], s[10][10], p[10];
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < M; i++)
cin >> p[i];
long long ans = 0;
for (int x = 0; x < (1 << N); x++) {
vector<int> S(N, 0);
for (int i = 0; i < N; i++) {
if (x & (1 << i))
S[i] = 1;
}
int ok = 0;
for (int i = 0; i < M; i++) {
int cnt = 0;
for (int j = 0; j < k[i]; j++) {
if (S[s[i][j] - 1] == 1)
cnt++;
}
if (cnt % 2 == p[i])
ok++;
}
if (ok == M) {
ans++;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 843,172 | 843,173 | u403848488 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx2,avx,fma")
#define ll long long int
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define make_pair
#define rep(i, l, r) for (i = l; i < r; i++)
#define ld long double
#define ff first
#define ss second
#define pii pair<int, int>
#define pi 3.1415926535897932384626433832
int main() {
io;
int i, j, n, m, k, a, l;
cin >> n >> m;
vector<vector<int>> v(n);
vector<int> cnt;
vector<int> p(m);
rep(i, 0, m) {
cin >> k;
rep(j, 0, k) {
cin >> a;
v[a - 1].pb(j);
}
}
rep(i, 0, m) cin >> p[i];
a = 1 << n;
int cn = 0;
rep(i, 0, a) {
cnt.resize(m, 0);
rep(j, 0, n) if (i & (1 << j)) rep(l, 0, v[j].size()) cnt[v[j][l]]++;
k = 0;
rep(j, 0, m) if (cnt[j] % 2 == p[j]) k++;
if (k == m)
cn++;
cnt.clear();
}
cout << cn;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx2,avx,fma")
#define ll long long int
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define make_pair
#define rep(i, l, r) for (i = l; i < r; i++)
#define ld long double
#define ff first
#define ss second
#define pii pair<int, int>
#define pi 3.1415926535897932384626433832
int main() {
io;
int i, j, n, m, k, a, l;
cin >> n >> m;
vector<vector<int>> v(n);
vector<int> cnt;
vector<int> p(m);
rep(i, 0, m) {
cin >> k;
rep(j, 0, k) {
cin >> a;
v[a - 1].pb(i);
}
}
rep(i, 0, m) cin >> p[i];
a = 1 << n;
int cn = 0;
rep(i, 0, a) {
cnt.resize(m, 0);
rep(j, 0, n) if (i & (1 << j)) rep(l, 0, v[j].size()) cnt[v[j][l]]++;
k = 0;
rep(j, 0, m) if (cnt[j] % 2 == p[j]) k++;
if (k == m)
cn++;
cnt.clear();
}
cout << cn;
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 843,176 | 843,177 | u445107674 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, M, i, j;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
rep(j, M) {
int k;
cin >> k;
s[j].resize(k);
rep(i, k) {
cin >> s[j][i];
--s[j][i];
}
}
rep(j, M) { cin >> p[j]; }
int c = 0;
int ans = 0;
rep(i, (1 << N)) {
bool ok = true;
rep(j, M) {
for (int id : s[j]) {
if ((i >> id) & 1)
c++;
}
c = c % 2;
if (c != p[j])
ok = false;
}
if (ok)
++ans;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, M, i, j;
cin >> N >> M;
vector<vector<int>> s(M);
vector<int> p(M);
rep(j, M) {
int k;
cin >> k;
s[j].resize(k);
rep(i, k) {
cin >> s[j][i];
--s[j][i];
}
}
rep(j, M) { cin >> p[j]; }
int c = 0;
int ans = 0;
rep(i, (1 << N)) {
bool ok = true;
rep(j, M) {
c = 0;
for (int id : s[j]) {
if ((i >> id) & 1)
c++;
}
c = c % 2;
if (c != p[j])
ok = false;
}
if (ok)
++ans;
}
cout << ans << endl;
return 0;
} | [
"assignment.add"
] | 843,178 | 843,179 | u243122218 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int z[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
while (a--) {
int b;
cin >> b;
s[i][b] = 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
cin >> p[i];
for (int i = 1; i < (1 << n); i++) {
memset(z, 0, sizeof(z));
for (int j = 0; j < n; j++) {
if ((1 << j) & i)
z[j + 1] = 1;
}
int q = 0;
for (int j = 1; j <= m; j++) {
int pp = 0;
for (int k = 1; k <= n; k++)
if (s[j][k] && z[k])
pp++;
if (pp % 2 != p[j])
q = 1;
}
if (!q)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int z[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
while (a--) {
int b;
cin >> b;
s[i][b] = 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
cin >> p[i];
for (int i = 0; i < (1 << n); i++) {
memset(z, 0, sizeof(z));
for (int j = 0; j < n; j++) {
if ((1 << j) & i)
z[j + 1] = 1;
}
int q = 0;
for (int j = 1; j <= m; j++) {
int pp = 0;
for (int k = 1; k <= n; k++)
if (s[j][k] && z[k])
pp++;
if (pp % 2 != p[j])
q = 1;
}
if (!q)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,186 | 843,187 | u114362525 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int s[12][12];
int p[12];
int z[12];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
while (a--) {
int b;
cin >> b;
s[i][b] = 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
cin >> p[i];
for (int i = 1; i < (1 << n); i++) {
memset(z, 0, sizeof(z));
for (int j = 0; j < n; j++) {
if ((1 << j) & i)
z[j + 1] = 1;
}
/* for(int j=1;j<=n;j++)
cout<<z[j]<<" ";
cout<<endl;*/
int q = 0;
for (int j = 1; j <= m; j++) {
int pp = 0;
for (int k = 1; k <= n; k++)
if (s[j][k] && z[k])
pp++;
if (pp % 2 != p[j])
q = 1;
}
if (!q)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int s[15][15];
int p[15];
int z[15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
while (a--) {
int b;
cin >> b;
s[i][b] = 1;
}
}
int ans = 0;
for (int i = 1; i <= m; i++)
cin >> p[i];
for (int i = 0; i < (1 << n); i++) {
memset(z, 0, sizeof(z));
for (int j = 0; j < n; j++) {
if ((1 << j) & i)
z[j + 1] = 1;
}
int q = 0;
for (int j = 1; j <= m; j++) {
int pp = 0;
for (int k = 1; k <= n; k++)
if (s[j][k] && z[k])
pp++;
if (pp % 2 != p[j])
q = 1;
}
if (!q)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,188 | 843,187 | u114362525 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/**
2 2
2 1 2
1 2
0 1
*/
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> f(m); // bulb -> vector<int> (the lights id)
// cout<<"n:"<<n<<" m:"<<m<<endl;
for (int i = 0; i < m; ++i) {
// cout<<"read line:"<<i + 1<<" all("<<m<<")"<<endl;
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int l;
cin >> l;
f[i].push_back(l);
}
}
vector<int> p(m);
// cout<<"read p."<<endl;
for (int i = 0; i < m; ++i) {
cin >> p[i];
// cout<<"read:"<<p[i]<<" ";
}
int ans = 0;
for (int i = 0; i < (1 << n); ++i) {
// cout<<"the case:"<<i<<endl;
bool ok = true;
for (int j = 0; j < m; ++j) {
// cout<<"the bulb:"<<j<<endl;
int cp = 0;
for (auto &bi : f[j]) {
cp += ((i >> bi) & 1);
}
if ((cp % 2) != p[j]) {
ok = false;
break;
}
}
if (ok)
++ans;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/**
2 2
2 1 2
1 2
0 1
*/
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> f(m); // bulb -> vector<int> (the lights id)
// cout<<"n:"<<n<<" m:"<<m<<endl;
for (int i = 0; i < m; ++i) {
// cout<<"read line:"<<i + 1<<" all("<<m<<")"<<endl;
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int l;
cin >> l;
f[i].push_back(l);
}
}
vector<int> p(m);
// cout<<"read p."<<endl;
for (int i = 0; i < m; ++i) {
cin >> p[i];
// cout<<"read:"<<p[i]<<" ";
}
int ans = 0;
for (int i = 0; i < (1 << n); ++i) {
// cout<<"the case:"<<i<<endl;
bool ok = true;
for (int j = 0; j < m; ++j) {
// cout<<"the bulb:"<<j<<endl;
int cp = 0;
for (auto &bi : f[j]) {
cp += ((i >> (bi - 1)) & 1);
}
if ((cp % 2) != p[j]) {
ok = false;
break;
}
}
if (ok)
++ans;
}
cout << ans << endl;
return 0;
}
| [] | 843,189 | 843,190 | u655810450 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<int, pi> trp;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
ll _abs(ll x) { return (x > 0 ? x : -x); }
ll ans;
int n, m, k, x, p[11];
vector<int> s[12];
void solve(int i, vector<bool> v) {
if (i == n) {
int c = 0;
bool ok = 1;
// for(bool b : v ) cout<<b<<" ";
// cout<<endl;
for (int i = 0; i < m; i++) {
for (int j : s[i]) {
if (v[j])
c++;
}
if (c % 2 != p[i])
ok = 0;
}
if (ok)
ans++;
return;
}
v.pb(0);
solve(i + 1, v);
v.pop_back();
v.pb(1);
solve(i + 1, v);
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> x;
x--;
s[i].pb(x);
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
solve(0, {});
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<int, pi> trp;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
ll _abs(ll x) { return (x > 0 ? x : -x); }
ll ans;
int n, m, k, x, p[11];
vector<int> s[12];
void solve(int i, vector<bool> v) {
if (i == n) {
int c = 0;
bool ok = 1;
// for(bool b : v ) cout<<b<<" ";
// cout<<endl;
for (int i = 0; i < m; i++) {
c = 0;
for (int j : s[i]) {
if (v[j])
c++;
}
if (c % 2 != p[i])
ok = 0;
}
if (ok)
ans++;
return;
}
v.pb(0);
solve(i + 1, v);
v.pop_back();
v.pb(1);
solve(i + 1, v);
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> x;
x--;
s[i].pb(x);
}
}
for (int i = 0; i < m; i++) {
cin >> p[i];
}
solve(0, {});
cout << ans << endl;
}
| [
"assignment.add"
] | 843,191 | 843,192 | u179395482 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; ++i)
cin >> p[i];
int ans = 0;
for (int i = 0; i < (1 << N); ++i) {
bool ok = true;
for (int j = 0; j < M; ++j) {
int c = 0;
for (int id : vec[j]) {
if ((i >> id) & 1) {
++c;
}
}
c %= 2;
if (c != p[j]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
cout << ans << "/n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; ++i)
cin >> p[i];
int ans = 0;
for (int i = 0; i < (1 << N); ++i) {
bool ok = true;
for (int j = 0; j < M; ++j) {
int c = 0;
for (int id : vec[j]) {
if ((i >> id) & 1) {
++c;
}
}
c %= 2;
if (c != p[j]) {
ok = false;
}
}
if (ok) {
ans++;
}
}
cout << ans << "\n";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 843,193 | 843,194 | u595786324 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int k[15];
int s[15][15];
int p[15];
bool use[15];
int cnt = 0;
void dfs(int x, int y, int z) {
if (x == z) {
bool ok = true;
for (int i = 0; i < m; i++) {
int ans = 0;
for (int j = 0; j < k[i]; j++) {
if (use[s[i][j] - 1]) {
ans++;
}
}
int ans2 = ans % 2;
if (ans2 != p[i])
ok = false;
}
if (ok) {
cnt++;
}
return;
}
if (y == n)
return;
dfs(x, y + 1, z);
use[y] = true;
dfs(x + 1, y + 1, z);
use[y] = false;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
for (int i = 1; i <= n; i++) {
memset(use, false, sizeof(use));
dfs(0, 0, i);
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, m;
int k[15];
int s[15][15];
int p[15];
bool use[15];
int cnt = 0;
void dfs(int x, int y, int z) {
if (x == z) {
bool ok = true;
for (int i = 0; i < m; i++) {
int ans = 0;
for (int j = 0; j < k[i]; j++) {
if (use[s[i][j] - 1]) {
ans++;
}
}
int ans2 = ans % 2;
if (ans2 != p[i])
ok = false;
}
if (ok) {
cnt++;
}
return;
}
if (y == n)
return;
dfs(x, y + 1, z);
use[y] = true;
dfs(x + 1, y + 1, z);
use[y] = false;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
for (int i = 0; i <= n; i++) {
memset(use, false, sizeof(use));
dfs(0, 0, i);
}
cout << cnt << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,212 | 843,213 | u426657245 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
// all_ofを使ってみたかったver
int n, m;
vector<int> s[10];
int p[10];
int on[10] = {0};
int dfs(int i) {
// cerr << i << ' ' << n << '\n';
if (i == n) {
int idx[n];
iota(idx, idx + n, 0);
bool yes = all_of(idx, idx + n, [&](int j) {
int sum = 0;
for (auto sjk : s[j])
sum += on[sjk];
return sum % 2 == p[j];
});
return (int)yes;
} else {
int a, b;
on[i] = 0;
a = dfs(i + 1);
on[i] = 1;
b = dfs(i + 1);
return a + b;
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int sij;
cin >> sij;
s[i].push_back(sij - 1);
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
cout << dfs(0) << '\n';
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
// all_ofを使ってみたかったver
int n, m;
vector<int> s[10];
int p[10];
int on[10] = {0};
int dfs(int i) {
// cerr << i << ' ' << n << '\n';
if (i == n) {
int idx[m];
iota(idx, idx + m, 0);
bool yes = all_of(idx, idx + m, [&](int j) {
int sum = 0;
for (auto sjk : s[j])
sum += on[sjk];
return sum % 2 == p[j];
});
return (int)yes;
} else {
int a, b;
on[i] = 0;
a = dfs(i + 1);
on[i] = 1;
b = dfs(i + 1);
return a + b;
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int sij;
cin >> sij;
s[i].push_back(sij - 1);
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
cout << dfs(0) << '\n';
return 0;
}
| [
"identifier.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,214 | 843,215 | u956758464 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s[m];
for (int i = 0; i < m; i++) {
s[i] = 0;
}
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int l;
cin >> l;
s[i] += (1 << (n - l));
}
}
int p[m];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i <= (1 << n); i++) {
bool f = true;
for (int j = 0; j < m; j++) {
int andb = s[j] & i;
int cnt = 0;
for (int k = 0; k < n; k++) {
if ((andb)&1) {
cnt++;
}
andb = andb >> 1;
}
if (cnt % 2 != p[j]) {
f = false;
break;
}
}
if (f) {
ans++;
}
}
cout << ans << "\n";
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s[m];
for (int i = 0; i < m; i++) {
s[i] = 0;
}
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int l;
cin >> l;
s[i] += (1 << (n - l));
}
}
int p[m];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < (1 << n); i++) {
bool f = true;
for (int j = 0; j < m; j++) {
int andb = s[j] & i;
int cnt = 0;
for (int k = 0; k < n; k++) {
if ((andb)&1) {
cnt++;
}
andb = andb >> 1;
}
if (cnt % 2 != p[j]) {
f = false;
break;
}
}
if (f) {
ans++;
}
}
cout << ans << "\n";
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,223 | 843,224 | u445619807 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k, tmp, result;
cin >> n >> m;
vector<vector<int>> v;
vector<int> s;
rep(i, m) {
cin >> k;
vector<int> _v;
rep(i, k) {
cin >> tmp;
_v.emplace_back(tmp);
}
v.emplace_back(_v);
}
for (int i = 0; i < m; ++i) {
cin >> tmp;
s.emplace_back(tmp);
}
for (int i = 0; i < (1 << n); ++i) {
int flag = 0;
rep(j, v.size()) {
int num = 0;
rep(k, v[j].size()) {
rep(l, n) {
if (i & (1 << l)) {
if (l + 1 == v[j][k])
++num;
}
}
}
if (num % 2 == s[j])
++flag;
}
if (flag == m)
++result;
}
cout << result << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k, tmp, result = 0;
cin >> n >> m;
vector<vector<int>> v;
vector<int> s;
rep(i, m) {
cin >> k;
vector<int> _v;
rep(i, k) {
cin >> tmp;
_v.emplace_back(tmp);
}
v.emplace_back(_v);
}
for (int i = 0; i < m; ++i) {
cin >> tmp;
s.emplace_back(tmp);
}
for (int i = 0; i < (1 << n); ++i) {
int flag = 0;
rep(j, v.size()) {
int num = 0;
rep(k, v[j].size()) {
rep(l, n) {
if (i & (1 << l)) {
if (l + 1 == v[j][k])
++num;
}
}
}
if (num % 2 == s[j])
++flag;
}
if (flag == m)
++result;
}
cout << result << endl;
} | [
"variable_declaration.value.change"
] | 843,225 | 843,226 | u354075848 | cpp |
p03031 | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
typedef long long ll;
const int MAXN = 10;
int bulb[MAXN][MAXN];
int main() {
for (int i = 0; i < MAXN; i++) {
for (int j = 0; j < MAXN; j++) {
bulb[i][j] = 0;
}
}
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
x--;
bulb[i][x] = 1;
}
}
int p[MAXN];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int res = 0;
for (int mask = 1; mask < (1 << n); mask++) {
vector<int> state;
for (int j = 0; j < n; j++) {
if (mask & (1 << j)) {
state.push_back(j);
}
}
debug() << imie(state);
int ans = 0;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int c : state) {
if (bulb[i][c]) {
cnt++;
}
}
if (cnt % 2 == p[i])
ans++;
}
if (ans == m)
res++;
}
cout << res << endl;
return 0;
}
| #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
typedef long long ll;
const int MAXN = 10;
int bulb[MAXN][MAXN];
int main() {
for (int i = 0; i < MAXN; i++) {
for (int j = 0; j < MAXN; j++) {
bulb[i][j] = 0;
}
}
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
x--;
bulb[i][x] = 1;
}
}
int p[MAXN];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int res = 0;
for (int mask = 0; mask < (1 << n); mask++) {
vector<int> state;
for (int j = 0; j < n; j++) {
if (mask & (1 << j)) {
state.push_back(j);
}
}
debug() << imie(state);
int ans = 0;
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int c : state) {
if (bulb[i][c]) {
cnt++;
}
}
if (cnt % 2 == p[i])
ans++;
}
if (ans == m)
res++;
}
cout << res << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 843,229 | 843,230 | u101513772 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define VSORT(v) sort(v.begin(), v.end())
#define SORT(v, n) sort(v, v + n)
#define VREV(v) reverse(v.begin(), v.end())
#define REV(v, n) reverse(v, v + n)
#define vi vector<int>
#define pf push_front
#define pb push_back
template <class T, size_t N> size_t countof(const T (&array)[N]) { return N; }
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
void print() { cout << "\n"; }
template <class Head, class... Tail> void print(Head &&h, Tail &&...t) {
if (sizeof...(t) == 0)
cout << h;
else
cout << h << ' ';
print(move(t)...);
}
void mprint(auto *matrix, auto N) {
REP(i, N) cout << matrix << (i != N - 1 ? ' ' : '\n');
return;
}
const double EPS = 1e-9;
const int INF = 2e+9;
const ll INFL = 9e+18;
const long MOD = 1e+9 + 7;
#define PI 3.14159265258979
#define P pair<int, int>
#define Pll pair<ll, ll>
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
inline int in() {
int x;
cin >> x;
return x;
}
struct UnionFind {
vector<int> par; //データiが属する親の番号
vector<int> sizes; //根ノードiの木に含まれるデータの数
// 最初は全てのデータiがグループiに存在するものとして初期化
UnionFind(int n) : par(n), sizes(n, 1) { REP(i, n) par[i] = i; }
// 根を張り替えながら再帰的に根ノードを探す
int find(int x) {
if (x == par[x])
return x;
return par[x] = find(par[x]);
}
// 2つのデータx, yが属する木をマージする
void unite(int x, int y) {
// データの根ノードを得る
x = find(x);
y = find(y);
// 既に同じ木に属しているならマージしない
if (x == y)
return;
// xの木がyの木より大きくなるようにする
if (sizes[x] < sizes[y])
swap(x, y);
// xがyの親になるように連結する
par[y] = x;
sizes[x] += sizes[y];
sizes[y] = 0; // sizes[y]は無意味な値となるため
}
// 2つのデータx, yが属する木が同じならtrueを返す
bool same(int x, int y) { return find(x) == find(y); }
// データxが含まれる木の大きさを返す
int size(int x) { return sizes[find(x)]; }
};
int gcd(int n, int m) {
if (m > n)
return gcd(m, n);
if (m == 0)
return n;
else
return gcd(m, n % m);
}
int main(void) {
int N, M, k, s, p[10];
set<int> S[10];
cin >> N >> M;
REP(i, N) {
cin >> k;
REP(j, k) {
cin >> s;
S[i].insert(s);
}
}
REP(i, M) cin >> p[i];
int result = 0, count = 0;
bool flug = false;
REP(i, pow(2, N)) {
flug = true;
stringstream ss;
ss << static_cast<std::bitset<12>>(i);
string tem = ss.str();
reverse(tem.begin(), tem.end());
;
REP(j, M) {
count = 0;
REP(r, N)
if (tem[r] == '1' && S[j].count(r + 1) == 1)
count++;
if (count == 0 || count % 2 != p[j]) {
flug = false;
break;
}
}
if (flug)
result++;
}
print(result);
return 0;
}
| #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define VSORT(v) sort(v.begin(), v.end())
#define SORT(v, n) sort(v, v + n)
#define VREV(v) reverse(v.begin(), v.end())
#define REV(v, n) reverse(v, v + n)
#define vi vector<int>
#define pf push_front
#define pb push_back
template <class T, size_t N> size_t countof(const T (&array)[N]) { return N; }
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
void print() { cout << "\n"; }
template <class Head, class... Tail> void print(Head &&h, Tail &&...t) {
if (sizeof...(t) == 0)
cout << h;
else
cout << h << ' ';
print(move(t)...);
}
void mprint(auto *matrix, auto N) {
REP(i, N) cout << matrix << (i != N - 1 ? ' ' : '\n');
return;
}
const double EPS = 1e-9;
const int INF = 2e+9;
const ll INFL = 9e+18;
const long MOD = 1e+9 + 7;
#define PI 3.14159265258979
#define P pair<int, int>
#define Pll pair<ll, ll>
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
inline int in() {
int x;
cin >> x;
return x;
}
struct UnionFind {
vector<int> par; //データiが属する親の番号
vector<int> sizes; //根ノードiの木に含まれるデータの数
// 最初は全てのデータiがグループiに存在するものとして初期化
UnionFind(int n) : par(n), sizes(n, 1) { REP(i, n) par[i] = i; }
// 根を張り替えながら再帰的に根ノードを探す
int find(int x) {
if (x == par[x])
return x;
return par[x] = find(par[x]);
}
// 2つのデータx, yが属する木をマージする
void unite(int x, int y) {
// データの根ノードを得る
x = find(x);
y = find(y);
// 既に同じ木に属しているならマージしない
if (x == y)
return;
// xの木がyの木より大きくなるようにする
if (sizes[x] < sizes[y])
swap(x, y);
// xがyの親になるように連結する
par[y] = x;
sizes[x] += sizes[y];
sizes[y] = 0; // sizes[y]は無意味な値となるため
}
// 2つのデータx, yが属する木が同じならtrueを返す
bool same(int x, int y) { return find(x) == find(y); }
// データxが含まれる木の大きさを返す
int size(int x) { return sizes[find(x)]; }
};
int gcd(int n, int m) {
if (m > n)
return gcd(m, n);
if (m == 0)
return n;
else
return gcd(m, n % m);
}
int main(void) {
int N, M, k, s, p[10];
set<int> S[10];
cin >> N >> M;
REP(i, M) {
cin >> k;
REP(j, k) {
cin >> s;
S[i].insert(s);
}
}
REP(i, M) cin >> p[i];
int result = 0, count = 0;
bool flug = false;
REP(i, pow(2, N)) {
flug = true;
stringstream ss;
ss << static_cast<std::bitset<12>>(i);
string tem = ss.str();
reverse(tem.begin(), tem.end());
;
REP(j, M) {
count = 0;
REP(r, N)
if (tem[r] == '1' && S[j].count(r + 1) == 1)
count++;
if (count % 2 != p[j]) {
flug = false;
break;
}
}
if (flug)
result++;
}
print(result);
return 0;
}
| [
"expression.operation.binary.remove"
] | 843,231 | 843,232 | u196432341 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define VSORT(v) sort(v.begin(), v.end())
#define SORT(v, n) sort(v, v + n)
#define VREV(v) reverse(v.begin(), v.end())
#define REV(v, n) reverse(v, v + n)
#define vi vector<int>
#define pf push_front
#define pb push_back
template <class T, size_t N> size_t countof(const T (&array)[N]) { return N; }
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
void print() { cout << "\n"; }
template <class Head, class... Tail> void print(Head &&h, Tail &&...t) {
if (sizeof...(t) == 0)
cout << h;
else
cout << h << ' ';
print(move(t)...);
}
void mprint(auto *matrix, auto N) {
REP(i, N) cout << matrix << (i != N - 1 ? ' ' : '\n');
return;
}
const double EPS = 1e-9;
const int INF = 2e+9;
const ll INFL = 9e+18;
const long MOD = 1e+9 + 7;
#define PI 3.14159265258979
#define P pair<int, int>
#define Pll pair<ll, ll>
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
inline int in() {
int x;
cin >> x;
return x;
}
struct UnionFind {
vector<int> par; //データiが属する親の番号
vector<int> sizes; //根ノードiの木に含まれるデータの数
// 最初は全てのデータiがグループiに存在するものとして初期化
UnionFind(int n) : par(n), sizes(n, 1) { REP(i, n) par[i] = i; }
// 根を張り替えながら再帰的に根ノードを探す
int find(int x) {
if (x == par[x])
return x;
return par[x] = find(par[x]);
}
// 2つのデータx, yが属する木をマージする
void unite(int x, int y) {
// データの根ノードを得る
x = find(x);
y = find(y);
// 既に同じ木に属しているならマージしない
if (x == y)
return;
// xの木がyの木より大きくなるようにする
if (sizes[x] < sizes[y])
swap(x, y);
// xがyの親になるように連結する
par[y] = x;
sizes[x] += sizes[y];
sizes[y] = 0; // sizes[y]は無意味な値となるため
}
// 2つのデータx, yが属する木が同じならtrueを返す
bool same(int x, int y) { return find(x) == find(y); }
// データxが含まれる木の大きさを返す
int size(int x) { return sizes[find(x)]; }
};
int gcd(int n, int m) {
if (m > n)
return gcd(m, n);
if (m == 0)
return n;
else
return gcd(m, n % m);
}
int main(void) {
int N, M, k, s, p[10];
set<int> S[10];
cin >> N >> M;
REP(i, N) {
cin >> k;
REP(j, k) {
cin >> s;
S[i].insert(s);
}
}
REP(i, M) cin >> p[i];
int result = 0, count = 0;
bool flug = false;
REP(i, pow(2, N)) {
flug = true;
stringstream ss;
ss << static_cast<std::bitset<12>>(i);
string tem = ss.str();
reverse(tem.begin(), tem.end());
;
REP(j, M) {
count = 0;
REP(r, N)
if (tem[r] == '1' && S[j].count(r + 1) == 1)
count++;
if (count == 0 || count % 2 != p[j]) {
flug = false;
break;
}
}
if (flug)
result++;
}
print(result);
return 0;
}
| #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define VSORT(v) sort(v.begin(), v.end())
#define SORT(v, n) sort(v, v + n)
#define VREV(v) reverse(v.begin(), v.end())
#define REV(v, n) reverse(v, v + n)
#define vi vector<int>
#define pf push_front
#define pb push_back
template <class T, size_t N> size_t countof(const T (&array)[N]) { return N; }
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
void print() { cout << "\n"; }
template <class Head, class... Tail> void print(Head &&h, Tail &&...t) {
if (sizeof...(t) == 0)
cout << h;
else
cout << h << ' ';
print(move(t)...);
}
void mprint(auto *matrix, auto N) {
REP(i, N) cout << matrix << (i != N - 1 ? ' ' : '\n');
return;
}
const double EPS = 1e-9;
const int INF = 2e+9;
const ll INFL = 9e+18;
const long MOD = 1e+9 + 7;
#define PI 3.14159265258979
#define P pair<int, int>
#define Pll pair<ll, ll>
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
inline int in() {
int x;
cin >> x;
return x;
}
struct UnionFind {
vector<int> par; //データiが属する親の番号
vector<int> sizes; //根ノードiの木に含まれるデータの数
// 最初は全てのデータiがグループiに存在するものとして初期化
UnionFind(int n) : par(n), sizes(n, 1) { REP(i, n) par[i] = i; }
// 根を張り替えながら再帰的に根ノードを探す
int find(int x) {
if (x == par[x])
return x;
return par[x] = find(par[x]);
}
// 2つのデータx, yが属する木をマージする
void unite(int x, int y) {
// データの根ノードを得る
x = find(x);
y = find(y);
// 既に同じ木に属しているならマージしない
if (x == y)
return;
// xの木がyの木より大きくなるようにする
if (sizes[x] < sizes[y])
swap(x, y);
// xがyの親になるように連結する
par[y] = x;
sizes[x] += sizes[y];
sizes[y] = 0; // sizes[y]は無意味な値となるため
}
// 2つのデータx, yが属する木が同じならtrueを返す
bool same(int x, int y) { return find(x) == find(y); }
// データxが含まれる木の大きさを返す
int size(int x) { return sizes[find(x)]; }
};
int gcd(int n, int m) {
if (m > n)
return gcd(m, n);
if (m == 0)
return n;
else
return gcd(m, n % m);
}
int main(void) {
int N, M, k, s, p[10];
set<int> S[10];
cin >> N >> M;
REP(i, M) {
cin >> k;
REP(j, k) {
cin >> s;
S[i].insert(s);
}
}
REP(i, M) cin >> p[i];
int result = 0, count = 0;
bool flug = false;
REP(i, pow(2, N)) {
flug = true;
stringstream ss;
ss << static_cast<std::bitset<12>>(i);
string tem = ss.str();
reverse(tem.begin(), tem.end());
;
REP(j, M) {
count = 0;
REP(r, N)
if (tem[r] == '1' && S[j].count(r + 1) == 1)
count++;
if (count % 2 != p[j]) {
flug = false;
break;
}
}
if (flug)
result++;
}
print(result);
return 0;
}
| [
"expression.operation.binary.remove"
] | 843,233 | 843,232 | u196432341 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define VSORT(v) sort(v.begin(), v.end())
#define SORT(v, n) sort(v, v + n)
#define VREV(v) reverse(v.begin(), v.end())
#define REV(v, n) reverse(v, v + n)
#define vi vector<int>
#define pf push_front
#define pb push_back
template <class T, size_t N> size_t countof(const T (&array)[N]) { return N; }
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
void print() { cout << "\n"; }
template <class Head, class... Tail> void print(Head &&h, Tail &&...t) {
if (sizeof...(t) == 0)
cout << h;
else
cout << h << ' ';
print(move(t)...);
}
void mprint(auto *matrix, auto N) {
REP(i, N) cout << matrix << (i != N - 1 ? ' ' : '\n');
return;
}
const double EPS = 1e-9;
const int INF = 2e+9;
const ll INFL = 9e+18;
const long MOD = 1e+9 + 7;
#define PI 3.14159265258979
#define P pair<int, int>
#define Pll pair<ll, ll>
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
inline int in() {
int x;
cin >> x;
return x;
}
struct UnionFind {
vector<int> par; //データiが属する親の番号
vector<int> sizes; //根ノードiの木に含まれるデータの数
// 最初は全てのデータiがグループiに存在するものとして初期化
UnionFind(int n) : par(n), sizes(n, 1) { REP(i, n) par[i] = i; }
// 根を張り替えながら再帰的に根ノードを探す
int find(int x) {
if (x == par[x])
return x;
return par[x] = find(par[x]);
}
// 2つのデータx, yが属する木をマージする
void unite(int x, int y) {
// データの根ノードを得る
x = find(x);
y = find(y);
// 既に同じ木に属しているならマージしない
if (x == y)
return;
// xの木がyの木より大きくなるようにする
if (sizes[x] < sizes[y])
swap(x, y);
// xがyの親になるように連結する
par[y] = x;
sizes[x] += sizes[y];
sizes[y] = 0; // sizes[y]は無意味な値となるため
}
// 2つのデータx, yが属する木が同じならtrueを返す
bool same(int x, int y) { return find(x) == find(y); }
// データxが含まれる木の大きさを返す
int size(int x) { return sizes[find(x)]; }
};
int gcd(int n, int m) {
if (m > n)
return gcd(m, n);
if (m == 0)
return n;
else
return gcd(m, n % m);
}
int main(void) {
int N, M, k, s, p[10];
set<int> S[10];
cin >> N >> M;
REP(i, N) {
cin >> k;
REP(j, k) {
cin >> s;
S[i].insert(s);
}
}
REP(i, M) cin >> p[i];
int result = 0, count = 0;
bool flug = false;
REP(i, pow(2, N)) {
flug = true;
stringstream ss;
ss << static_cast<std::bitset<12>>(i);
string tem = ss.str();
reverse(tem.begin(), tem.end());
;
REP(j, M) {
count = 0;
REP(r, N)
if (tem[r] == '1' && S[j].count(r + 1) == 1)
count++;
if (count % 2 != p[j]) {
flug = false;
break;
}
}
if (flug)
result++;
}
print(result);
return 0;
}
| #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define VSORT(v) sort(v.begin(), v.end())
#define SORT(v, n) sort(v, v + n)
#define VREV(v) reverse(v.begin(), v.end())
#define REV(v, n) reverse(v, v + n)
#define vi vector<int>
#define pf push_front
#define pb push_back
template <class T, size_t N> size_t countof(const T (&array)[N]) { return N; }
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
void print() { cout << "\n"; }
template <class Head, class... Tail> void print(Head &&h, Tail &&...t) {
if (sizeof...(t) == 0)
cout << h;
else
cout << h << ' ';
print(move(t)...);
}
void mprint(auto *matrix, auto N) {
REP(i, N) cout << matrix << (i != N - 1 ? ' ' : '\n');
return;
}
const double EPS = 1e-9;
const int INF = 2e+9;
const ll INFL = 9e+18;
const long MOD = 1e+9 + 7;
#define PI 3.14159265258979
#define P pair<int, int>
#define Pll pair<ll, ll>
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
inline int in() {
int x;
cin >> x;
return x;
}
struct UnionFind {
vector<int> par; //データiが属する親の番号
vector<int> sizes; //根ノードiの木に含まれるデータの数
// 最初は全てのデータiがグループiに存在するものとして初期化
UnionFind(int n) : par(n), sizes(n, 1) { REP(i, n) par[i] = i; }
// 根を張り替えながら再帰的に根ノードを探す
int find(int x) {
if (x == par[x])
return x;
return par[x] = find(par[x]);
}
// 2つのデータx, yが属する木をマージする
void unite(int x, int y) {
// データの根ノードを得る
x = find(x);
y = find(y);
// 既に同じ木に属しているならマージしない
if (x == y)
return;
// xの木がyの木より大きくなるようにする
if (sizes[x] < sizes[y])
swap(x, y);
// xがyの親になるように連結する
par[y] = x;
sizes[x] += sizes[y];
sizes[y] = 0; // sizes[y]は無意味な値となるため
}
// 2つのデータx, yが属する木が同じならtrueを返す
bool same(int x, int y) { return find(x) == find(y); }
// データxが含まれる木の大きさを返す
int size(int x) { return sizes[find(x)]; }
};
int gcd(int n, int m) {
if (m > n)
return gcd(m, n);
if (m == 0)
return n;
else
return gcd(m, n % m);
}
int main(void) {
int N, M, k, s, p[10];
set<int> S[10];
cin >> N >> M;
REP(i, M) {
cin >> k;
REP(j, k) {
cin >> s;
S[i].insert(s);
}
}
REP(i, M) cin >> p[i];
int result = 0, count = 0;
bool flug = false;
REP(i, pow(2, N)) {
flug = true;
stringstream ss;
ss << static_cast<std::bitset<12>>(i);
string tem = ss.str();
reverse(tem.begin(), tem.end());
;
REP(j, M) {
count = 0;
REP(r, N)
if (tem[r] == '1' && S[j].count(r + 1) == 1)
count++;
if (count % 2 != p[j]) {
flug = false;
break;
}
}
if (flug)
result++;
}
print(result);
return 0;
}
| [] | 843,234 | 843,232 | u196432341 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using INT64 = long long;
int main(void) {
IOS int n, m;
cin >> n >> m;
vector<int> p(m);
vector<bitset<11>> d;
for (int i = 0; i < m; i++) {
bitset<11> bs(0);
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
bs.set(s - 1);
}
// cerr << bs << endl;
d.push_back(bs);
}
for (int i = 0; i < m; i++)
cin >> p[i];
unsigned int sw = 1 << (n);
int ans = 0;
for (unsigned int i = 1; i < sw; i++) {
bitset<11> ssw(i);
cerr << ssw << endl;
bool flag = true;
for (int j = 0; j < m; j++) {
bitset<11> sk = d[j];
// cerr << sk << endl;
sk &= ssw;
int count = sk.count();
// cerr << count << endl;
if (count % 2 != p[j]) {
flag = false;
break;
}
if (!flag)
break;
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using INT64 = long long;
int main(void) {
IOS int n, m;
cin >> n >> m;
vector<int> p(m);
vector<bitset<10>> d;
for (int i = 0; i < m; i++) {
bitset<10> bs(0);
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
bs.set(s - 1);
}
// cerr << bs << endl;
d.push_back(bs);
}
for (int i = 0; i < m; i++)
cin >> p[i];
unsigned int sw = 1 << (n);
int ans = 0;
for (unsigned int i = 0; i < sw; i++) {
bitset<10> ssw(i);
cerr << ssw << endl;
bool flag = true;
for (int j = 0; j < m; j++) {
bitset<10> sk = d[j];
// cerr << sk << endl;
sk &= ssw;
int count = sk.count();
// cerr << count << endl;
if (count % 2 != p[j]) {
flag = false;
break;
}
if (!flag)
break;
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,262 | 843,263 | u330661451 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using INT64 = long long;
int main(void) {
IOS int n, m;
cin >> n >> m;
vector<int> p(m);
vector<bitset<10>> d;
for (int i = 0; i < m; i++) {
bitset<10> bs(0);
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
bs.set(s - 1);
}
// cerr << bs << endl;
d.push_back(bs);
}
for (int i = 0; i < m; i++)
cin >> p[i];
unsigned int sw = 1 << (n);
int ans = 0;
for (unsigned int i = 1; i < sw; i++) {
bitset<10> ssw(i);
cerr << ssw << endl;
bool flag = true;
for (int j = 0; j < m; j++) {
bitset<10> sk = d[j];
// cerr << sk << endl;
sk &= ssw;
int count = sk.count();
// cerr << count << endl;
if (count % 2 != p[j]) {
flag = false;
break;
}
if (!flag)
break;
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using INT64 = long long;
int main(void) {
IOS int n, m;
cin >> n >> m;
vector<int> p(m);
vector<bitset<10>> d;
for (int i = 0; i < m; i++) {
bitset<10> bs(0);
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
bs.set(s - 1);
}
// cerr << bs << endl;
d.push_back(bs);
}
for (int i = 0; i < m; i++)
cin >> p[i];
unsigned int sw = 1 << (n);
int ans = 0;
for (unsigned int i = 0; i < sw; i++) {
bitset<10> ssw(i);
cerr << ssw << endl;
bool flag = true;
for (int j = 0; j < m; j++) {
bitset<10> sk = d[j];
// cerr << sk << endl;
sk &= ssw;
int count = sk.count();
// cerr << count << endl;
if (count % 2 != p[j]) {
flag = false;
break;
}
if (!flag)
break;
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,264 | 843,263 | u330661451 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for (int i = 1; i < M; ++i) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < (1 << N); ++i) {
bool flg = true;
for (int m = 0; m < M; ++m) {
int cnt = 0;
for (auto sw : s[m]) {
if ((i >> sw) & 1)
++cnt;
}
if (cnt % 2 != p[m])
flg = false;
}
if (flg)
++ans;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; ++i) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < (1 << N); ++i) {
bool flg = true;
for (int m = 0; m < M; ++m) {
int cnt = 0;
for (auto sw : s[m]) {
if ((i >> sw) & 1)
++cnt;
}
if (cnt % 2 != p[m])
flg = false;
}
if (flg)
++ans;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 843,265 | 843,266 | u067267922 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for (int i = 1; i <= M; ++i) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < (1 << N); ++i) {
bool flg = true;
for (int m = 0; m < M; ++m) {
int cnt = 0;
for (auto sw : s[m]) {
if ((i >> sw) & 1)
++cnt;
}
if (cnt % 2 != p[m])
flg = false;
}
if (flg)
++ans;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
s[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> s[i][j];
--s[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; ++i) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < (1 << N); ++i) {
bool flg = true;
for (int m = 0; m < M; ++m) {
int cnt = 0;
for (auto sw : s[m]) {
if ((i >> sw) & 1)
++cnt;
}
if (cnt % 2 != p[m])
flg = false;
}
if (flg)
++ans;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,267 | 843,266 | u067267922 | cpp |
p03031 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout << a < ' ' << b << ' ' << c << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define repre(i, a, b) for (int i = a; i <= b; i++)
#define pi pair<int, int>
#define pii pair<int, pi>
#define mp map<int, int>
#define ump unordered_map<int, int>
#define st set<int>
#define mst multiset<int>
#define pq priority_queue
#define mpq priority_queue<int, vector<int>, greater<int>>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
orderedSet;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
orderedMSet;
//*p.find_by_order(index) return value at index
// p.order_of_key(key) return index
int power(int x, int n) {
if (n == 0)
return 1;
int temp = power(x, n / 2);
if (n % 2 == 0)
return temp * temp;
return x * temp * temp;
}
int32_t main() {
fastio int n, m;
cin >> n >> m;
vector<int> v[10];
int num = power(2, n);
int p[m];
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int a;
cin >> a;
v[i].pb(a);
}
}
rep(i, m) cin >> p[i];
int ans = 0;
for (int i = 0; i <= num; i++) {
int flag = 0;
for (int j = 0; j < m; j++) {
int c = 0;
for (int p = 0; p < v[j].size(); p++) {
int temp = v[j][p];
temp--;
if ((1 << temp) & i)
c++;
}
c = c % 2;
if (c == p[j])
continue;
else {
flag = 1;
break;
}
}
if (flag == 0)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout << a < ' ' << b << ' ' << c << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define repre(i, a, b) for (int i = a; i <= b; i++)
#define pi pair<int, int>
#define pii pair<int, pi>
#define mp map<int, int>
#define ump unordered_map<int, int>
#define st set<int>
#define mst multiset<int>
#define pq priority_queue
#define mpq priority_queue<int, vector<int>, greater<int>>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
orderedSet;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
orderedMSet;
//*p.find_by_order(index) return value at index
// p.order_of_key(key) return index
int power(int x, int n) {
if (n == 0)
return 1;
int temp = power(x, n / 2);
if (n % 2 == 0)
return temp * temp;
return x * temp * temp;
}
int32_t main() {
fastio int n, m;
cin >> n >> m;
vector<int> v[10];
int num = power(2, n);
int p[m];
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int a;
cin >> a;
v[i].pb(a);
}
}
rep(i, m) cin >> p[i];
int ans = 0;
for (int i = 0; i < num; i++) {
int flag = 0;
for (int j = 0; j < m; j++) {
int c = 0;
for (int p = 0; p < v[j].size(); p++) {
int temp = v[j][p];
temp--;
if ((1 << temp) & i)
c++;
}
c = c % 2;
if (c == p[j])
continue;
else {
flag = 1;
break;
}
}
if (flag == 0)
ans++;
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,270 | 843,271 | u754112329 | cpp |
p03032 | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int n, K;
cin >> n >> K;
vector<int> V(n);
for (int i = 0; i < n; i++) {
cin >> V[i];
}
LL largest = 0;
for (int i = 0; i <= min(K, n); i++) {
for (int j = 0; j < min(K, n) - i; j++) {
vector<int> nums;
for (int k = 0; k < i; k++) {
nums.pb(V[k]);
}
for (int k = n - 1; k >= n - j; k--) {
nums.pb(V[k]);
}
sort(nums.begin(), nums.end());
// cout << "wyswietlenie vectora nums: " << endl;
// for(auto it : nums){
// cout << it << " ";
//}
// cout << endl;
LL suma = 0;
for (int k = 0; k < (i + j); k++) {
if (nums[k] > 0 || k > (K - (i + j) - 1)) {
suma += (LL)nums[k];
}
}
largest = max(largest, suma);
// cout << "current largest: " << largest << endl;
}
}
cout << largest << endl;
return 0;
}
| /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int n, K;
cin >> n >> K;
vector<int> V(n);
for (int i = 0; i < n; i++) {
cin >> V[i];
}
LL largest = 0;
for (int i = 0; i <= min(K, n); i++) {
for (int j = 0; j <= min(K, n) - i; j++) {
vector<int> nums;
for (int k = 0; k < i; k++) {
nums.pb(V[k]);
}
for (int k = n - 1; k >= n - j; k--) {
nums.pb(V[k]);
}
sort(nums.begin(), nums.end());
// cout << "wyswietlenie vectora nums: " << endl;
// for(auto it : nums){
// cout << it << " ";
//}
// cout << endl;
LL suma = 0;
for (int k = 0; k < (i + j); k++) {
if (nums[k] > 0 || k > (K - (i + j) - 1)) {
suma += (LL)nums[k];
}
}
largest = max(largest, suma);
// cout << "current largest: " << largest << endl;
}
}
cout << largest << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,276 | 843,277 | u506295831 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define Pair pair<string, int>;
const int INF = 1E9;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
lint largest = 0;
for (int i = 0; i <= min(K, N); ++i) {
for (int j = 0; j <= min(K - i, N); ++j) {
vector<int> nums;
for (int k = 0; k < i; ++k) {
nums.push_back(V[k]);
}
for (int k = N - 1; k >= N - j; --k) {
nums.push_back(V[k]);
}
sort(nums.begin(), nums.end());
lint sum = 0;
for (int k = 0; k < (i + j); ++k) {
if (nums[k] > 0 || k > (K - (i + j) - 1)) {
sum += (lint)nums[k];
}
}
largest = max(largest, sum);
}
}
cout << largest << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define Pair pair<string, int>;
const int INF = 1E9;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
lint largest = 0;
for (int i = 0; i <= min(K, N); ++i) {
for (int j = 0; j <= min(K, N) - i; ++j) {
vector<int> nums;
for (int k = 0; k < i; ++k) {
nums.push_back(V[k]);
}
for (int k = N - 1; k >= N - j; --k) {
nums.push_back(V[k]);
}
sort(nums.begin(), nums.end());
lint sum = 0;
for (int k = 0; k < (i + j); ++k) {
if (nums[k] > 0 || k > (K - (i + j) - 1)) {
sum += (lint)nums[k];
}
}
largest = max(largest, sum);
}
}
cout << largest << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 843,282 | 843,283 | u432456012 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
ll maxv = 0;
for (int i = 0; i <= N && i <= K; i++) {
for (int j = 0; j <= N && j <= (K - i); j++) {
vector<ll> tmp;
//左
for (int l = 0; l < i; l++)
tmp.emplace_back(v[l]);
//右
for (int r = 0; r < j; r++)
tmp.emplace_back(v[N - r - 1]);
//判定
int cnt = K - tmp.size();
for (int t = 0; t < cnt; t++) {
ll minv = 0;
int idx = -1;
for (int s = 0; s < tmp.size(); s++) {
if (tmp[s] < 0 && minv > tmp[s]) {
minv = tmp[s];
idx = s;
}
}
if (idx != -1)
tmp[idx] = 0;
}
//更新
ll a = 0;
for (int p = 0; p < tmp.size(); p++)
a += tmp[p];
maxv = max(maxv, a);
}
}
cout << maxv << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
ll maxv = 0;
for (int i = 0; i <= N && i <= K; i++) {
for (int j = 0; j <= (N - i) && j <= (K - i); j++) {
vector<ll> tmp;
//左
for (int l = 0; l < i; l++)
tmp.emplace_back(v[l]);
//右
for (int r = 0; r < j; r++)
tmp.emplace_back(v[N - r - 1]);
//判定
int cnt = K - tmp.size();
for (int t = 0; t < cnt; t++) {
ll minv = 0;
int idx = -1;
for (int s = 0; s < tmp.size(); s++) {
if (tmp[s] < 0 && minv > tmp[s]) {
minv = tmp[s];
idx = s;
}
}
if (idx != -1)
tmp[idx] = 0;
}
//更新
ll a = 0;
for (int p = 0; p < tmp.size(); p++)
a += tmp[p];
maxv = max(maxv, a);
}
}
cout << maxv << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 843,297 | 843,298 | u523303964 | cpp |
p03032 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define INF bit(60)
#define pb push_back
#define mod 1000000007
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;
}
using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
int qp(int a, ll b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mod;
a = 1ll * a * a % mod;
} while (b >>= 1);
return ans;
}
int qp(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define FACSIZE 2002
ll invfac[FACSIZE];
ll fac[FACSIZE];
ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
void make_fact(ll);
void make_invfact(ll);
int main(void) {
ll n, kk;
cin >> n >> kk;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
for (ll k = 0; k <= kk; k++) {
// cout << "k:"<< k << endl;
priority_queue<ll, vector<ll>, greater<ll>> pq;
for (ll j = 0; j <= k; j++) {
if (j >= n) {
for (ll idx = 0; idx < n; idx++)
pq.push(v[idx]);
ll dispose = (k - j);
for (ll j = 0; j < dispose && !pq.empty(); j++)
pq.pop();
ll tmp_sum = 0;
while (!pq.empty()) {
auto q = pq.top();
pq.pop();
// cout << q << " ";
tmp_sum += q;
}
// cout << endl;
chmax(ans, tmp_sum);
} else {
for (ll l = 0; l < j; l++) {
ll r = j - l;
for (ll cnt = 0; cnt < l; cnt++)
pq.push(v[cnt]);
for (ll cnt = n - 1; cnt >= (n - r); cnt--)
pq.push(v[cnt]);
ll dispose = (k - j);
for (ll j = 0; j < dispose && !pq.empty(); j++)
pq.pop();
ll tmp_sum = 0;
while (!pq.empty()) {
auto q = pq.top();
pq.pop();
// cout << q << " ";
tmp_sum += q;
}
// cout << endl;
chmax(ans, tmp_sum);
}
}
}
}
cout << ans << endl;
return 0;
}
ll mod_pow(ll x, ll r) {
if (r == 0)
return 1;
else if (r == 1)
return x % mod;
else if (r % 2 == 0) {
ll t = mod_pow(x, r / 2) % mod;
return t * t % mod;
} else {
ll t = mod_pow(x, r / 2) % mod;
ll k = t * t % mod;
return k * x % mod;
}
}
ll mod_add(ll a, ll b) { return (a + b) % mod; }
ll mod_mul(ll a, ll b) { return (a * b) % mod; }
ll mod_div(ll a, ll b) { return mod_mul(a, mod_pow(b, mod - 2)); }
void make_fact(ll n) {
fac[0] = 1;
rep(i, n) { fac[i + 1] = mod_mul(fac[i], i + 1); }
}
void make_invfact(ll n) {
invfac[n] = mod_pow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--) {
invfac[i] = mod_mul(invfac[i + 1], i + 1);
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define INF bit(60)
#define pb push_back
#define mod 1000000007
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;
}
using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
int qp(int a, ll b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mod;
a = 1ll * a * a % mod;
} while (b >>= 1);
return ans;
}
int qp(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define FACSIZE 2002
ll invfac[FACSIZE];
ll fac[FACSIZE];
ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
void make_fact(ll);
void make_invfact(ll);
int main(void) {
ll n, kk;
cin >> n >> kk;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
for (ll k = 0; k <= kk; k++) {
// cerr << "k:"<< k << endl;
priority_queue<ll, vector<ll>, greater<ll>> pq;
for (ll j = 0; j <= k; j++) {
if (j >= n) {
for (ll idx = 0; idx < n; idx++)
pq.push(v[idx]);
ll dispose = (k - j);
for (ll j = 0; j < dispose && !pq.empty(); j++)
pq.pop();
ll tmp_sum = 0;
while (!pq.empty()) {
auto q = pq.top();
pq.pop();
// cerr << q << " ";
tmp_sum += q;
}
// cerr << endl;
chmax(ans, tmp_sum);
} else {
for (ll l = 0; l <= j; l++) {
ll r = j - l;
for (ll cnt = 0; cnt < l; cnt++)
pq.push(v[cnt]);
for (ll cnt = n - 1; cnt >= (n - r); cnt--)
pq.push(v[cnt]);
ll dispose = (k - j);
for (ll j = 0; j < dispose && !pq.empty(); j++)
pq.pop();
ll tmp_sum = 0;
while (!pq.empty()) {
auto q = pq.top();
pq.pop();
// cerr << q << " ";
tmp_sum += q;
}
// cerr << endl;
chmax(ans, tmp_sum);
}
}
}
}
cout << ans << endl;
return 0;
}
ll mod_pow(ll x, ll r) {
if (r == 0)
return 1;
else if (r == 1)
return x % mod;
else if (r % 2 == 0) {
ll t = mod_pow(x, r / 2) % mod;
return t * t % mod;
} else {
ll t = mod_pow(x, r / 2) % mod;
ll k = t * t % mod;
return k * x % mod;
}
}
ll mod_add(ll a, ll b) { return (a + b) % mod; }
ll mod_mul(ll a, ll b) { return (a * b) % mod; }
ll mod_div(ll a, ll b) { return mod_mul(a, mod_pow(b, mod - 2)); }
void make_fact(ll n) {
fac[0] = 1;
rep(i, n) { fac[i + 1] = mod_mul(fac[i], i + 1); }
}
void make_invfact(ll n) {
invfac[n] = mod_pow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--) {
invfac[i] = mod_mul(invfac[i + 1], i + 1);
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 843,317 | 843,318 | u297007413 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using namespace std;
typedef long long lint;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<lint> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
lint ans = 0;
for (int i = 0; i <= min(K, N); i++) {
lint sum = 0;
for (int j = 0; j <= i; j++) {
sum = 0;
vector<lint> minus;
for (int k = 0; k < j; k++) {
sum += V[k];
if (V[k] < 0)
minus.emplace_back(V[k]);
}
for (int k = 1; k < i - j; k++) {
sum += V[N - K];
if (V[N - k] < 0)
minus.emplace_back(V[N - k]);
}
sort(minus.begin(), minus.end());
for (int l = 0; l < min((int)minus.size(), K - i); l++)
sum -= minus[l];
ans = max(ans, sum);
}
}
cout << ans << "\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using namespace std;
typedef long long lint;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<lint> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
lint ans = 0;
for (int i = 0; i <= min(K, N); i++) {
lint sum = 0;
for (int j = 0; j <= i; j++) {
sum = 0;
vector<lint> minus;
for (int k = 0; k < j; k++) {
sum += V[k];
if (V[k] < 0)
minus.emplace_back(V[k]);
}
for (int k = 1; k <= i - j; k++) {
sum += V[N - k];
if (V[N - k] < 0)
minus.emplace_back(V[N - k]);
}
sort(minus.begin(), minus.end());
for (int l = 0; l < min((int)minus.size(), K - i); l++)
sum -= minus[l];
ans = max(ans, sum);
}
}
cout << ans << "\n";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 843,319 | 843,320 | u532573979 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define all(x) x.begin(), x.end()
struct revran {
const i64 b, e;
struct iter {
i64 i;
constexpr iter(const i64 i) noexcept : i(i) {}
void operator++() noexcept { --i; }
constexpr i64 operator*() const noexcept { return i; }
constexpr bool operator!=(const iter x) const noexcept { return i != x.i; }
};
constexpr revran(const i64 e) noexcept : b(0), e(e) {}
constexpr revran(const i64 b, const i64 e) noexcept : b(b), e(e) {}
constexpr iter begin() const noexcept { return iter(e - 1); }
constexpr iter end() const noexcept { return iter(b - 1); }
};
struct ran {
const i64 b, e;
struct iter {
i64 i;
constexpr iter(const i64 i) noexcept : i(i) {}
void operator++() noexcept { ++i; }
constexpr i64 operator*() const noexcept { return i; }
constexpr bool operator!=(const iter x) const noexcept { return i != x.i; }
};
constexpr ran(const i64 e) noexcept : b(0), e(e) {}
constexpr ran(const i64 b, const i64 e) noexcept : b(b), e(e) {}
constexpr iter begin() const noexcept { return iter(b); }
constexpr iter end() const noexcept { return iter(e); }
constexpr revran rev() const noexcept { return revran(b, e); }
};
constexpr ran rn0(const i64 e) noexcept { return ran(e); }
constexpr ran rn0(const i64 b, const i64 e) noexcept { return ran(b, e); }
constexpr ran rn1(const i64 e) noexcept { return ran(1, e + 1); }
constexpr ran rn1(const i64 b, const i64 e) noexcept { return ran(b, e + 1); }
int main() {
i64 n, k;
cin >> n >> k;
vector<i64> V(n);
for (int i : ran(n))
cin >> V[i];
vector<vector<i64>> le(51, vector<i64>(101, -1e9));
le[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
le[i][j] = le[i - 1][j - 1] + V[i - 1];
le[i][j] = max(le[i][j], le[i][j - 1]);
if (j - 2 >= 0) {
le[i][j] = max(le[i][j], le[i - 1][j - 2]);
}
}
}
vector<vector<i64>> ri(52, vector<i64>(101, -1e9));
ri[n + 1][0] = 0;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= k; j++) {
ri[i][j] = ri[i + 1][j - 1] + V[i - 1];
ri[i][j] = max(ri[i][j], le[i][j - 1]);
if (j - 2 >= 0) {
ri[i][j] = max(ri[i][j], le[i + 1][j - 2]);
}
}
}
i64 ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
le[i][j] = max(le[i - 1][j], le[i][j]);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
ri[i][j] = max(ri[i + 1][j], ri[i][j]);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
ans = max(ans, le[i - 1][j] + ri[i][k - j]);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define all(x) x.begin(), x.end()
struct revran {
const i64 b, e;
struct iter {
i64 i;
constexpr iter(const i64 i) noexcept : i(i) {}
void operator++() noexcept { --i; }
constexpr i64 operator*() const noexcept { return i; }
constexpr bool operator!=(const iter x) const noexcept { return i != x.i; }
};
constexpr revran(const i64 e) noexcept : b(0), e(e) {}
constexpr revran(const i64 b, const i64 e) noexcept : b(b), e(e) {}
constexpr iter begin() const noexcept { return iter(e - 1); }
constexpr iter end() const noexcept { return iter(b - 1); }
};
struct ran {
const i64 b, e;
struct iter {
i64 i;
constexpr iter(const i64 i) noexcept : i(i) {}
void operator++() noexcept { ++i; }
constexpr i64 operator*() const noexcept { return i; }
constexpr bool operator!=(const iter x) const noexcept { return i != x.i; }
};
constexpr ran(const i64 e) noexcept : b(0), e(e) {}
constexpr ran(const i64 b, const i64 e) noexcept : b(b), e(e) {}
constexpr iter begin() const noexcept { return iter(b); }
constexpr iter end() const noexcept { return iter(e); }
constexpr revran rev() const noexcept { return revran(b, e); }
};
constexpr ran rn0(const i64 e) noexcept { return ran(e); }
constexpr ran rn0(const i64 b, const i64 e) noexcept { return ran(b, e); }
constexpr ran rn1(const i64 e) noexcept { return ran(1, e + 1); }
constexpr ran rn1(const i64 b, const i64 e) noexcept { return ran(b, e + 1); }
int main() {
i64 n, k;
cin >> n >> k;
vector<i64> V(n);
for (int i : ran(n))
cin >> V[i];
vector<vector<i64>> le(51, vector<i64>(101, -1e9));
le[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
le[i][j] = le[i - 1][j - 1] + V[i - 1];
le[i][j] = max(le[i][j], le[i][j - 1]);
if (j - 2 >= 0) {
le[i][j] = max(le[i][j], le[i - 1][j - 2]);
}
}
}
vector<vector<i64>> ri(52, vector<i64>(101, -1e9));
ri[n + 1][0] = 0;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= k; j++) {
ri[i][j] = ri[i + 1][j - 1] + V[i - 1];
ri[i][j] = max(ri[i][j], ri[i][j - 1]);
if (j - 2 >= 0) {
ri[i][j] = max(ri[i][j], ri[i + 1][j - 2]);
}
}
}
i64 ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
le[i][j] = max(le[i - 1][j], le[i][j]);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
ri[i][j] = max(ri[i + 1][j], ri[i][j]);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= k; j++) {
ans = max(ans, le[i - 1][j] + ri[i][k - j]);
}
}
cout << ans << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 843,325 | 843,326 | u852585808 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define int long long
main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int r = min(n, k);
int record = 0;
for (int i = 0; i <= r; i++) {
for (int j = n - 1; j >= 0; j--) {
int ab = i + (n - j - 1);
if (ab <= r) {
set<int> s;
int sum = 0;
for (int l = 0; l < n; l++) {
if (l < i or l > j) {
if (v[l] < 0) {
s.insert(v[l]);
}
sum += v[l];
}
}
for (int l = 0; l <= r - ab and !s.empty(); l++) {
sum -= *s.begin();
s.erase(s.begin());
}
record = max(record, sum);
}
}
}
cout << record << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define int long long
main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int r = min(n, k);
int record = 0;
for (int i = 0; i <= r; i++) {
for (int j = n - 1; j != -1; j--) {
int ab = i + (n - j - 1);
if (ab <= r) {
multiset<int> s;
int sum = 0;
for (int l = 0; l < n; l++) {
if (l < i or l > j) {
if (v[l] < 0) {
s.insert(v[l]);
}
sum += v[l];
}
}
for (int l = 0; l < k - ab and !s.empty(); l++) {
sum -= *s.begin();
s.erase(s.begin());
}
record = max(record, sum);
}
}
}
cout << record << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"variable_declaration.type.change"
] | 843,331 | 843,330 | u889817605 | cpp |
p03032 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define N_MAX 51
int N, K;
int V[N_MAX];
int sim(int l, int r) {
if (l + r > N || l + r > K) {
return -1;
}
vector<int> table;
for (int i = 0; i < l; i++) {
table.push_back(V[i]);
}
for (int i = N - 1; i >= N - r; i--) {
table.push_back(V[i]);
}
sort(table.begin(), table.end());
int remain = K - (l + r);
int sum = 0;
for (int i = 0; i < table.size(); i++) {
if (table[i] < 0 && remain > 0) {
remain--;
continue;
}
sum += table[i];
}
return sum;
}
void solv() {
scanf("%d%d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%d", V + i);
}
int ret = 0;
for (int left = 0; left < K; left++) {
for (int right = 0; right < K; right++) {
ret = max(ret, sim(left, right));
}
}
printf("%d", ret);
return;
}
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
solv();
// finalize
if (NULL != fin)
fclose(fin);
if (NULL != fout)
fclose(fout);
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define N_MAX 51
int N, K;
int V[N_MAX];
int sim(int l, int r) {
if (l + r > N || l + r > K) {
return -1;
}
vector<int> table;
for (int i = 0; i < l; i++) {
table.push_back(V[i]);
}
for (int i = N - 1; i >= N - r; i--) {
table.push_back(V[i]);
}
sort(table.begin(), table.end());
int remain = K - (l + r);
int sum = 0;
for (int i = 0; i < table.size(); i++) {
if (table[i] < 0 && remain > 0) {
remain--;
continue;
}
sum += table[i];
}
return sum;
}
void solv() {
scanf("%d%d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%d", V + i);
}
int ret = 0;
for (int left = 0; left <= K; left++) {
for (int right = 0; right <= K; right++) {
ret = max(ret, sim(left, right));
}
}
printf("%d", ret);
return;
}
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
solv();
// finalize
if (NULL != fin)
fclose(fin);
if (NULL != fout)
fclose(fout);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,343 | 843,344 | u103357948 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
long long maxSumV = -9223372036854775808;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
for (int i = 0; i < min(N, K); ++i) {
for (int j = 0; j < min(N, K) - i; ++j) {
// method of get jewelry
vector<long long> listV;
for (int k = 0; k < i; ++k) {
listV.push_back(V[k]);
}
for (int k = 0; k < j; ++k) {
listV.push_back(V[V.size() - k - 1]);
}
// method of throw away
sort(listV.rbegin(), listV.rend());
int throwCount = K - i - j;
for (int k = 0; k < throwCount; ++k) {
if (0 < listV.size() && listV[listV.size() - 1] < 0) {
listV.pop_back();
} else {
break;
}
}
long long sumV = 0;
for (int k = 0; k < listV.size(); ++k) {
sumV += listV[k];
}
maxSumV = max(sumV, maxSumV);
}
}
cout << maxSumV << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
long long maxSumV = -9223372036854775807;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
for (int i = 0; i <= min(N, K); ++i) {
for (int j = 0; j <= min(N, K) - i; ++j) {
// method of get jewelry
vector<long long> listV;
for (int k = 0; k < i; ++k) {
listV.push_back(V[k]);
}
for (int k = 0; k < j; ++k) {
listV.push_back(V[V.size() - k - 1]);
}
// method of throw away
sort(listV.rbegin(), listV.rend());
int throwCount = K - i - j;
for (int k = 0; k < throwCount; ++k) {
if (0 < listV.size() && listV[listV.size() - 1] < 0) {
listV.pop_back();
} else {
break;
}
}
long long sumV = 0;
for (int k = 0; k < listV.size(); ++k) {
sumV += listV[k];
}
maxSumV = max(sumV, maxSumV);
}
}
cout << maxSumV << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,347 | 843,348 | u055685044 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll N, K, ans = 0;
void Main() {
cin >> N >> K;
vector<ll> queue(N);
For(i, 0, N) cin >> queue.at(i);
For(i, 0, min(N, K)) {
For(j, 0, i + 1) {
vector<ll> get;
For(k, 0, j) { get.push_back(queue.at(k)); }
For(k, 0, i - j) { get.push_back(queue.at(N - 1 - k)); }
sort(ALL(get));
ll cnt = 0;
for (auto x : get)
cnt += x;
For(k, 0, min(K - i, i)) {
if (get.at(k) < 0) {
cnt -= get.at(k);
}
}
ans = max(cnt, ans);
}
}
cout << ans << endl;
}
int main() {
Main();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll N, K, ans = 0;
void Main() {
cin >> N >> K;
vector<ll> queue(N);
For(i, 0, N) cin >> queue.at(i);
For(i, 0, min(N, K) + 1) {
For(j, 0, i + 1) {
vector<ll> get;
For(k, 0, j) { get.push_back(queue.at(k)); }
For(k, 0, i - j) { get.push_back(queue.at(N - 1 - k)); }
sort(ALL(get));
ll cnt = 0;
for (auto x : get)
cnt += x;
For(k, 0, min(K - i, i)) {
if (get.at(k) < 0) {
cnt -= get.at(k);
}
}
ans = max(cnt, ans);
}
}
cout << ans << endl;
}
int main() {
Main();
return 0;
} | [
"expression.operation.binary.add"
] | 843,357 | 843,356 | u813174766 | cpp |
p03032 | //#include "pch.h"
//#include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define MIN(a, b) ((a) < (b) ? a : b)
#define MAX(a, b) ((a) > (b) ? a : b)
#define CeilN(x, n) (((((DWORD)(x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ \
*/
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define ArrayEnd(a) (&(a)[ArrayLength(a)])
#define ArrayLast(a) (&(a)[ArrayLength(a) - 1])
#define MAX_BYTE (255)
#define MIN_BYTE (0)
#define MAX_WORD (65535)
#define MIN_WORD (0)
#define MAX_SWORD (32767)
#define MIN_SWORD (-32768)
#define MAX_DWORD (0xFFFFFFFF)
#define MIN_DWORD (0)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitClrV(Val, Bit) ((Val) &= (~(Bit)))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define BitInvV(Val, Bit) ((Val) ^= (Bit))
#define BitTstVVal(Val, Bit) (BitTstV((Val), (Bit)) == (Bit))
typedef short SWORD;
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned short WORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef pair<int, int> P;
#define N_MAX (10)
#define K_MAX (10)
#define M_MAX (1000)
#define H_MAX (1000)
#define W_MAX (1000)
/*-----------------------------------------------------------------------------
ライブラリ
-------------------------------------------------------------------------------*/
#if 0
// 3次元
vector<vector<vector<SDWORD>>> XXX(AAA, vector<vector<SDWORD>>(BBBB, vector<SDWORD>(CCC, -1)));
#endif
#if 0
// 降順ソート
sort(getValue.rbegin(), getValue.rend());
#endif
#if 0
// 2分探索
auto position = lower_bound(getValue.begin(), getValue.end(), 0); // 0以上の要素位置を探す
int idx_lower = distance(getValue.begin(), position); // 0以上の要素インデックス
int eraseNum = MIN(idx_lower, delCnt); // 要素位置が個数になる
if (0 < eraseNum) {
getValue.erase(getValue.begin(), getValue.begin() + eraseNum);
}
#endif
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
int main() {
// 入力
int N, K;
static SDWORD value[50];
cin >> N >> K;
REP(i, N) cin >> value[i];
SQWORD ret = 0;
int getMax = MIN(N, K);
for (int leftCnt = 0; leftCnt < getMax; leftCnt++) {
for (int rightCnt = 0; rightCnt < getMax - leftCnt; rightCnt++) {
// 左右から詰める
vector<SDWORD> getValue;
REP(i, leftCnt) getValue.push_back(value[i]);
REP(i, rightCnt) getValue.push_back(value[N - 1 - i]);
// ０未満のちっちゃいのを削る
sort(getValue.rbegin(), getValue.rend());
int delCnt = K - (leftCnt + rightCnt);
while (delCnt && !getValue.empty()) {
if (getValue.back() < 0) {
getValue.pop_back(), delCnt--;
} else {
break;
}
}
// 合計値
SQWORD maxOne = 0;
for (auto &x : getValue)
maxOne += x;
ret = MAX(ret, maxOne);
}
}
cout << ret;
cout << endl;
}
| //#include "pch.h"
//#include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define MIN(a, b) ((a) < (b) ? a : b)
#define MAX(a, b) ((a) > (b) ? a : b)
#define CeilN(x, n) (((((DWORD)(x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ \
*/
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define ArrayEnd(a) (&(a)[ArrayLength(a)])
#define ArrayLast(a) (&(a)[ArrayLength(a) - 1])
#define MAX_BYTE (255)
#define MIN_BYTE (0)
#define MAX_WORD (65535)
#define MIN_WORD (0)
#define MAX_SWORD (32767)
#define MIN_SWORD (-32768)
#define MAX_DWORD (0xFFFFFFFF)
#define MIN_DWORD (0)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitClrV(Val, Bit) ((Val) &= (~(Bit)))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define BitInvV(Val, Bit) ((Val) ^= (Bit))
#define BitTstVVal(Val, Bit) (BitTstV((Val), (Bit)) == (Bit))
typedef short SWORD;
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned short WORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef pair<int, int> P;
#define N_MAX (10)
#define K_MAX (10)
#define M_MAX (1000)
#define H_MAX (1000)
#define W_MAX (1000)
/*-----------------------------------------------------------------------------
ライブラリ
-------------------------------------------------------------------------------*/
#if 0
// 3次元
vector<vector<vector<SDWORD>>> XXX(AAA, vector<vector<SDWORD>>(BBBB, vector<SDWORD>(CCC, -1)));
#endif
#if 0
// 降順ソート
sort(getValue.rbegin(), getValue.rend());
#endif
#if 0
// 2分探索
auto position = lower_bound(getValue.begin(), getValue.end(), 0); // 0以上の要素位置を探す
int idx_lower = distance(getValue.begin(), position); // 0以上の要素インデックス
int eraseNum = MIN(idx_lower, delCnt); // 要素位置が個数になる
if (0 < eraseNum) {
getValue.erase(getValue.begin(), getValue.begin() + eraseNum);
}
#endif
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
int main() {
// 入力
int N, K;
SDWORD value[50];
cin >> N >> K;
REP(i, N) cin >> value[i];
SQWORD ret = 0;
int getMax = MIN(N, K);
for (int leftCnt = 0; leftCnt <= getMax; leftCnt++) {
for (int rightCnt = 0; rightCnt <= getMax - leftCnt; rightCnt++) {
// 左右から詰める
vector<SDWORD> getValue;
REP(i, leftCnt) getValue.push_back(value[i]);
REP(i, rightCnt) getValue.push_back(value[N - 1 - i]);
// ０未満のちっちゃいのを削る
sort(getValue.rbegin(), getValue.rend());
int delCnt = K - (leftCnt + rightCnt);
while (delCnt && !getValue.empty()) {
if (getValue.back() < 0) {
getValue.pop_back(), delCnt--;
} else {
break;
}
}
// 合計値
SQWORD maxOne = 0;
for (auto &x : getValue)
maxOne += x;
ret = MAX(ret, maxOne);
}
}
cout << ret;
cout << endl;
}
| [
"variable_declaration.specifier.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,373 | 843,374 | u796408111 | cpp |
p03032 | //#include "pch.h"
//#include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define MIN(a, b) ((a) < (b) ? a : b)
#define MAX(a, b) ((a) > (b) ? a : b)
#define CeilN(x, n) (((((DWORD)(x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ \
*/
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define ArrayEnd(a) (&(a)[ArrayLength(a)])
#define ArrayLast(a) (&(a)[ArrayLength(a) - 1])
#define MAX_BYTE (255)
#define MIN_BYTE (0)
#define MAX_WORD (65535)
#define MIN_WORD (0)
#define MAX_SWORD (32767)
#define MIN_SWORD (-32768)
#define MAX_DWORD (0xFFFFFFFF)
#define MIN_DWORD (0)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitClrV(Val, Bit) ((Val) &= (~(Bit)))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define BitInvV(Val, Bit) ((Val) ^= (Bit))
#define BitTstVVal(Val, Bit) (BitTstV((Val), (Bit)) == (Bit))
typedef short SWORD;
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned short WORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef pair<int, int> P;
#define N_MAX (10)
#define K_MAX (10)
#define M_MAX (1000)
#define H_MAX (1000)
#define W_MAX (1000)
/*-----------------------------------------------------------------------------
ライブラリ
-------------------------------------------------------------------------------*/
#if 0
// 3次元
vector<vector<vector<SDWORD>>> XXX(AAA, vector<vector<SDWORD>>(BBBB, vector<SDWORD>(CCC, -1)));
#endif
#if 0
// 降順ソート
sort(getValue.rbegin(), getValue.rend());
#endif
#if 0
// 2分探索
auto position = lower_bound(getValue.begin(), getValue.end(), 0); // 0以上の要素位置を探す
int idx_lower = distance(getValue.begin(), position); // 0以上の要素インデックス
int eraseNum = MIN(idx_lower, delCnt); // 要素位置が個数になる
if (0 < eraseNum) {
getValue.erase(getValue.begin(), getValue.begin() + eraseNum);
}
#endif
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
int main() {
// 入力
int N, K;
SDWORD value[100];
cin >> N >> K;
REP(i, N) cin >> value[i];
SQWORD ret = 0;
int getMax = MIN(N, K);
for (int leftCnt = 0; leftCnt < getMax; leftCnt++) {
for (int rightCnt = 0; rightCnt < getMax - leftCnt; rightCnt++) {
// 左右から詰める
vector<SDWORD> getValue;
REP(i, leftCnt) getValue.push_back(value[i]);
REP(i, rightCnt) getValue.push_back(value[N - 1 - i]);
// ０未満のちっちゃいのを削る
sort(getValue.rbegin(), getValue.rend());
int delCnt = K - (leftCnt + rightCnt);
while (delCnt && !getValue.empty()) {
if (getValue.back() < 0) {
getValue.pop_back(), delCnt--;
} else {
break;
}
}
// 合計値
SQWORD maxOne = 0;
for (auto &x : getValue)
maxOne += x;
ret = MAX(ret, maxOne);
}
}
cout << ret;
cout << endl;
}
| //#include "pch.h"
//#include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define MIN(a, b) ((a) < (b) ? a : b)
#define MAX(a, b) ((a) > (b) ? a : b)
#define CeilN(x, n) (((((DWORD)(x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ \
*/
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define ArrayEnd(a) (&(a)[ArrayLength(a)])
#define ArrayLast(a) (&(a)[ArrayLength(a) - 1])
#define MAX_BYTE (255)
#define MIN_BYTE (0)
#define MAX_WORD (65535)
#define MIN_WORD (0)
#define MAX_SWORD (32767)
#define MIN_SWORD (-32768)
#define MAX_DWORD (0xFFFFFFFF)
#define MIN_DWORD (0)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitClrV(Val, Bit) ((Val) &= (~(Bit)))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define BitInvV(Val, Bit) ((Val) ^= (Bit))
#define BitTstVVal(Val, Bit) (BitTstV((Val), (Bit)) == (Bit))
typedef short SWORD;
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned short WORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef pair<int, int> P;
#define N_MAX (10)
#define K_MAX (10)
#define M_MAX (1000)
#define H_MAX (1000)
#define W_MAX (1000)
/*-----------------------------------------------------------------------------
ライブラリ
-------------------------------------------------------------------------------*/
#if 0
// 3次元
vector<vector<vector<SDWORD>>> XXX(AAA, vector<vector<SDWORD>>(BBBB, vector<SDWORD>(CCC, -1)));
#endif
#if 0
// 降順ソート
sort(getValue.rbegin(), getValue.rend());
#endif
#if 0
// 2分探索
auto position = lower_bound(getValue.begin(), getValue.end(), 0); // 0以上の要素位置を探す
int idx_lower = distance(getValue.begin(), position); // 0以上の要素インデックス
int eraseNum = MIN(idx_lower, delCnt); // 要素位置が個数になる
if (0 < eraseNum) {
getValue.erase(getValue.begin(), getValue.begin() + eraseNum);
}
#endif
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
int main() {
// 入力
int N, K;
SDWORD value[50];
cin >> N >> K;
REP(i, N) cin >> value[i];
SQWORD ret = 0;
int getMax = MIN(N, K);
for (int leftCnt = 0; leftCnt <= getMax; leftCnt++) {
for (int rightCnt = 0; rightCnt <= getMax - leftCnt; rightCnt++) {
// 左右から詰める
vector<SDWORD> getValue;
REP(i, leftCnt) getValue.push_back(value[i]);
REP(i, rightCnt) getValue.push_back(value[N - 1 - i]);
// ０未満のちっちゃいのを削る
sort(getValue.rbegin(), getValue.rend());
int delCnt = K - (leftCnt + rightCnt);
while (delCnt && !getValue.empty()) {
if (getValue.back() < 0) {
getValue.pop_back(), delCnt--;
} else {
break;
}
}
// 合計値
SQWORD maxOne = 0;
for (auto &x : getValue)
maxOne += x;
ret = MAX(ret, maxOne);
}
}
cout << ret;
cout << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,375 | 843,374 | u796408111 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(V) V.begin(), V.end()
using i64 = int_fast64_t;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<i64> V(N);
rep(i, N) cin >> V[i];
i64 ans = 0;
for (int left = 0; left < min(K, N); left++) {
for (int right = 0; right + left < min(K, N); right++) {
priority_queue<i64> que;
i64 MAX = 0;
for (int i = 0; i < left; i++) {
MAX += V[i];
que.push(-V[i]);
}
for (int i = N - 1; i >= N - right; i--) {
MAX += V[i];
que.push(-V[i]);
}
int k = K - (left + right);
while (k && !que.empty()) {
if (que.top() < 0)
break;
MAX += que.top();
que.pop();
k--;
}
ans = max(ans, MAX);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(V) V.begin(), V.end()
using i64 = int_fast64_t;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<i64> V(N);
rep(i, N) cin >> V[i];
i64 ans = 0;
for (int left = 0; left <= min(K, N); left++) {
for (int right = 0; right + left <= min(K, N); right++) {
priority_queue<i64> que;
i64 MAX = 0;
for (int i = 0; i < left; i++) {
MAX += V[i];
que.push(-V[i]);
}
for (int i = N - 1; i >= N - right; i--) {
MAX += V[i];
que.push(-V[i]);
}
int k = K - (left + right);
while (k && !que.empty()) {
if (que.top() < 0)
break;
MAX += que.top();
que.pop();
k--;
}
ans = max(ans, MAX);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,376 | 843,377 | u031178961 | cpp |
p03032 | #include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
int N, K;
//アクセスできるのは最大左右からK個
//途中のものを1個戻すたびにアクセスできる個数は2個減る
//いったん取ったら戻す必要があるのは負のもののみ
// Kまでの数字で、Dの左端と右端をシーケンシャルに見る
//全部取り、マイナスが最大のものから残った回数だけ
//戻していく 結果の値が答え
int main() {
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
int res = -INF;
// k...何個取り出すか
for (int k = 0; k < min(N, K); k++) {
// i...左から何個取り出すか
for (int i = 0; i <= k; i++) {
int tmp = 0;
priority_queue<int, vector<int>, greater<int>> que;
for (int j = 0; j < i; j++) {
if (V[j] < 0)
que.push(V[j]);
tmp += V[j];
}
for (int j = N - 1; j > N - 1 - (k - i); j--) {
if (V[j] < 0)
que.push(V[j]);
tmp += V[j];
}
for (int j = 0; j < K - k; j++) {
if (!que.empty()) {
tmp -= que.top();
que.pop();
}
}
chmax(res, tmp);
}
}
cout << res << endl;
}
| #include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
int N, K;
//アクセスできるのは最大左右からK個
//途中のものを1個戻すたびにアクセスできる個数は2個減る
//いったん取ったら戻す必要があるのは負のもののみ
// Kまでの数字で、Dの左端と右端をシーケンシャルに見る
//全部取り、マイナスが最大のものから残った回数だけ
//戻していく 結果の値が答え
int main() {
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
int res = -INF;
// k...何個取り出すか
for (int k = 0; k <= min(N, K); k++) {
// i...左から何個取り出すか
for (int i = 0; i <= k; i++) {
int tmp = 0;
priority_queue<int, vector<int>, greater<int>> que;
for (int j = 0; j < i; j++) {
if (V[j] < 0)
que.push(V[j]);
tmp += V[j];
}
for (int j = N - 1; j > N - 1 - (k - i); j--) {
if (V[j] < 0)
que.push(V[j]);
tmp += V[j];
}
for (int j = 0; j < K - k; j++) {
if (!que.empty()) {
tmp -= que.top();
que.pop();
}
}
chmax(res, tmp);
}
}
cout << res << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,384 | 843,385 | u026537738 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, n) for (int i = (s); i >= (n); (i)--)
#define all(a) (a).begin(), (a).end()
#define reall(a) (a).rbegin(), (a).rend()
#define pb emplace_back
#define pf push_front
#define MIN(a, b) a = min((a), (b))
#define MAX(a, b) a = max((a), (b))
#define SIZE(v) (int)v.size()
const double pi = acos(-1.0);
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef deque<ll> dll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vll v(n);
rep(i, n) cin >> v[i];
ll r = min(n, k);
rep(p, r) {
for (int q = 0; p + q <= r; ++q) {
ll cur = 0;
vll x;
rep(i, p) x.pb(v[i]), cur += v[i];
// cout<<cur<<endl;
rep(i, q) x.pb(v[n - 1 - i]), cur += v[n - 1 - i];
// cout<<cur<<endl;
sort(all(x));
// for(auto z:x)cout<<z<<" ";
// puts("");
rep(i, min((ll)x.size(), k - p - q)) if (x[i] < 0) cur -= x[i];
ans = max(ans, cur);
// cout<<"p:q:ans -> "<<p<<" "<<q<<" "<<cur<<endl;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, n) for (int i = (s); i >= (n); (i)--)
#define all(a) (a).begin(), (a).end()
#define reall(a) (a).rbegin(), (a).rend()
#define pb emplace_back
#define pf push_front
#define MIN(a, b) a = min((a), (b))
#define MAX(a, b) a = max((a), (b))
#define SIZE(v) (int)v.size()
const double pi = acos(-1.0);
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef deque<ll> dll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vll v(n);
rep(i, n) cin >> v[i];
ll r = min(n, k);
rep(p, r + 1) {
for (int q = 0; p + q <= r; ++q) {
ll cur = 0;
vll x;
rep(i, p) x.pb(v[i]), cur += v[i];
// cout<<cur<<endl;
rep(i, q) x.pb(v[n - 1 - i]), cur += v[n - 1 - i];
// cout<<cur<<endl;
sort(all(x));
// for(auto z:x)cout<<z<<" ";
// puts("");
rep(i, min((ll)x.size(), k - p - q)) if (x[i] < 0) cur -= x[i];
ans = max(ans, cur);
// cout<<"p:q:ans -> "<<p<<" "<<q<<" "<<cur<<endl;
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.add"
] | 843,386 | 843,387 | u373958718 | cpp |
p03032 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb() {
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r) {
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
long long ans = 0;
for (int num_pop = 0; num_pop <= k; num_pop++) {
for (int num_pop_from_right = 0; num_pop_from_right <= num_pop;
num_pop_from_right++) {
std::vector<int> copied_a = a;
std::priority_queue<int, std::vector<int>, std::greater<int>> q;
for (int i = 0; i < num_pop_from_right && a.size(); i++) {
q.push(copied_a.back());
copied_a.pop_back();
}
std::reverse(copied_a.begin(), copied_a.end());
for (int i = 0; i < num_pop - num_pop_from_right && a.size(); i++) {
q.push(copied_a.back());
copied_a.pop_back();
}
for (int i = 0; i < k - num_pop && q.size() && q.top() < 0; i++) {
q.pop();
}
long long sum = 0;
while (q.size()) {
sum += q.top();
q.pop();
}
ans = std::max(ans, sum);
}
}
std::cout << ans << std::endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb() {
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r) {
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
long long ans = 0;
for (int num_pop = 0; num_pop <= k; num_pop++) {
for (int num_pop_from_right = 0; num_pop_from_right <= num_pop;
num_pop_from_right++) {
std::vector<int> copied_a = a;
std::priority_queue<int, std::vector<int>, std::greater<int>> q;
for (int i = 0; i < num_pop_from_right && copied_a.size(); i++) {
q.push(copied_a.back());
copied_a.pop_back();
}
std::reverse(copied_a.begin(), copied_a.end());
for (int i = 0; i < num_pop - num_pop_from_right && copied_a.size();
i++) {
q.push(copied_a.back());
copied_a.pop_back();
}
for (int i = 0; i < k - num_pop && q.size() && q.top() < 0; i++) {
q.pop();
}
long long sum = 0;
while (q.size()) {
sum += q.top();
q.pop();
}
ans = std::max(ans, sum);
}
}
std::cout << ans << std::endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,388 | 843,389 | u083910207 | cpp |
p03032 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
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 - l; r++) {
if (l + r > n)
continue;
int d = k - l - r;
int now = 0;
vector<int> s;
rep(i, l) {
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;
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;
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 - l; r++) {
if (l + r > n)
continue;
int d = k - l - r;
int now = 0;
vector<int> s;
rep(i, l) {
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;
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"
] | 843,398 | 843,399 | u506858457 | cpp |
p03032 | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.h> //数学関数と数学定数を利用する
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
int gcd(int a, int b) { //ユークリッドの互除法
if (a < b)
gcd(b, a); // aの方がbよりでかいのが前提
if (b == 0)
return a; // aをbで割り切れたらreturn
else
gcd(b, a % b);
}
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)
continue;
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];
}
chmax(ans, now);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.h> //数学関数と数学定数を利用する
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
int gcd(int a, int b) { //ユークリッドの互除法
if (a < b)
gcd(b, a); // aの方がbよりでかいのが前提
if (b == 0)
return a; // aをbで割り切れたらreturn
else
gcd(b, a % b);
}
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)
continue;
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];
}
chmax(ans, now);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 843,408 | 843,409 | u014967455 | cpp |
p03032 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define N 55
using namespace std;
typedef long long ll;
ll n, k, mx, v[N];
vector<ll> a;
void f(int p) {
ll i, s = 0;
if (p < 0)
return;
sort(a.begin(), a.end());
for (i = 0; i < a.size(); i++) {
if (i < p && a[i] < 0)
continue;
s += a[i];
}
mx = max(mx, s);
}
int main() {
ll i, j;
cin >> n >> k;
for (i = 1; i <= n; i++)
scanf("%lld", &v[i]);
for (i = 0; i < n; i++) {
a.clear();
for (j = 1; j <= i; j++)
a.push_back(v[j]);
f(k - a.size());
for (j = n; j >= i; j--) {
a.push_back(v[j]);
f(k - a.size());
}
}
cout << mx << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define N 55
using namespace std;
typedef long long ll;
ll n, k, mx, v[N];
vector<ll> a;
void f(int p) {
ll i, s = 0;
if (p < 0)
return;
sort(a.begin(), a.end());
for (i = 0; i < a.size(); i++) {
if (i < p && a[i] < 0)
continue;
s += a[i];
}
mx = max(mx, s);
}
int main() {
ll i, j;
cin >> n >> k;
for (i = 1; i <= n; i++)
scanf("%lld", &v[i]);
for (i = 0; i < n; i++) {
a.clear();
for (j = 1; j <= i; j++)
a.push_back(v[j]);
f(k - a.size());
for (j = n; j > i; j--) {
a.push_back(v[j]);
f(k - a.size());
}
}
cout << mx << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,410 | 843,411 | u230265105 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD 1000000007
#define INF 1000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
ll ans = 0;
cin >> N >> K;
deque<ll> V(N);
rep(i, N) cin >> V[i];
multiset<ll> h;
deque<ll> dq;
ll num = min(N, K);
ll sum;
ans = -1;
rep(a, num) rep(b, num - a) {
h.clear();
dq = V;
rep(i, a) {
h.insert(*dq.begin());
dq.pop_front();
}
rep(i, b) {
h.insert(*dq.rbegin());
dq.pop_back();
}
rep(i, K - a - b) {
if (h.size() > 0 && *h.begin() < 0) {
h.erase(h.begin());
}
}
sum = 0;
auto itr = h.begin();
rep(i, h.size()) { sum += *(itr++); }
if (sum > ans) {
ans = sum;
}
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD 1000000007
#define INF 1000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
ll ans = 0;
cin >> N >> K;
deque<ll> V(N);
rep(i, N) cin >> V[i];
multiset<ll> h;
deque<ll> dq;
ll num = min(N, K);
ll sum;
ans = -1;
rep(a, num + 1) rep(b, num + 1 - a) {
h.clear();
dq = V;
rep(i, a) {
h.insert(*dq.begin());
dq.pop_front();
}
rep(i, b) {
h.insert(*dq.rbegin());
dq.pop_back();
}
rep(i, K - a - b) {
if (h.size() > 0 && *h.begin() < 0) {
h.erase(h.begin());
}
}
sum = 0;
auto itr = h.begin();
rep(i, h.size()) { sum += *(itr++); }
if (sum > ans) {
ans = sum;
}
}
cout << ans << "\n";
return 0;
} | [
"expression.operation.binary.add"
] | 843,415 | 843,416 | u145179061 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
vector<bool> prime;
#define all(x) (x).begin(), (x).end()
#define PRI(n) cout << n << endl;
#define PRI2(n, m) cout << n << " " << m << " " << endl;
#define REP(i, n) for (int i = 0; i < (ll)n; ++i)
#define REPbit(bit, n) for (int bit = 0; bit < (int)(1 << n); ++bit)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
void Era(int x) {
prime.resize(x + 1, 1);
prime[0] = 0;
prime[1] = 0;
FOR(i, 2, x) {
if (prime[i]) {
for (int j = 2 * i; j <= x; j += i) {
prime[j] = 0;
}
}
}
}
bool isPrime(ll x) {
if (x == 0)
return 0;
if (x == 1)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
FOR(i, 3, sqrt(x) + 1) {
if (x % i == 0)
return 0;
}
return 1;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll gcd = GCD(a, b);
return a / gcd * b;
}
ll nCr(ll n, ll r) {
vector<ll> C(r + 1);
C[0] = 1;
FOR(i, 1, n)
for (ll j = min(i, r); j < 1; --j)
C[j] = (C[j] + C[j - 1]);
return C[r];
}
template <class T> class SegTree {
int n;
vector<T> data;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def;
if (a <= l && r <= b)
return data[k];
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
return operation(c1, c2);
}
}
public:
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
T query(int a, int b) { return _query(a, b, 0, 0, n); }
T operator[](int i) { return data[i + n - 1]; }
};
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<int> sz;
UnionFind(int N) {
for (int i = 0; i < N; ++i) {
par.push_back(i);
rank.push_back(0);
sz.push_back(-1);
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y])
par[x] = y;
else {
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
int root(int x) {
if (sz[x] < 0)
return x;
else
return sz[x] = root(sz[x]);
}
bool isSame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (sz[x] > sz[y])
swap(x, y); // merge technique
sz[x] += sz[y];
sz[y] = x;
return true;
}
int size(int x) { return -sz[root(x)]; }
};
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
void Bellman_short(int s) {
REP(i, V) d[i] = 1LL << 50;
d[s] = 0;
REP(i, V) REP(i, E) {
edge e = ES[i];
if (d[e.from] != 1LL << 50 && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
}
}
}
bool Bellman_negLoop(int s) {
REP(i, V) d[i] = 1LL << 50;
d[s] = 0;
REP(i, V) REP(j, E) {
edge e = ES[j];
if (d[e.from] != 1LL << 50 && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
if (i == V - 1)
return true;
}
}
return false;
}
void dijkstra(int s) {
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> Q;
fill(d, d + V, LLONG_MAX);
fill(prev_path, prev_path + V, -1);
d[s] = 0;
Q.push(P(0, s));
while (!Q.empty()) {
P p = Q.top();
Q.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (edge e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
Q.push(P(d[e.to], e.to));
prev_path[e.to] = v;
}
}
}
}
vector<ll> getPath(int t) {
vector<ll> path;
for (; t != -1; t = prev_path[t]) {
path.push_back(t);
}
reverse(all(path));
return path;
}
//
// int A[100001];
//
// bool dfs(ll x, int a) {
// A[x] = a;
// for (edge e : G[x]) {
// if (e.cost % 2 == 0) {
// if (A[e.to] == -a)return false;
// if (A[e.to] == 0 && !dfs(e.to, a))return false;
// } else {
// if (A[e.to] == a)return false;
// if (A[e.to] == 0 && !dfs(e.to, -a))return false;
// }
// }
// return true;
//}
ll N, K;
int main() {
cin >> N >> K;
vector<int> V(N);
REP(i, N) cin >> V[i];
ll ans = 0;
REP(i, K) {
REP(j, min(K, N) - i) {
priority_queue<int, vector<int>, greater<>> q;
ll sum = 0;
REP(n, i) q.push(V[n]), sum += V[n];
REP(m, j) q.push(V[N - 1 - m]), sum += V[N - 1 - m];
REP(k, K - i - j) if (!q.empty() && q.top() < 0) sum -= q.top(), q.pop();
ans = max(ans, sum);
}
}
PRI(ans)
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
vector<bool> prime;
#define all(x) (x).begin(), (x).end()
#define PRI(n) cout << n << endl;
#define PRI2(n, m) cout << n << " " << m << " " << endl;
#define REP(i, n) for (int i = 0; i < (ll)n; ++i)
#define REPbit(bit, n) for (int bit = 0; bit < (int)(1 << n); ++bit)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
void Era(int x) {
prime.resize(x + 1, 1);
prime[0] = 0;
prime[1] = 0;
FOR(i, 2, x) {
if (prime[i]) {
for (int j = 2 * i; j <= x; j += i) {
prime[j] = 0;
}
}
}
}
bool isPrime(ll x) {
if (x == 0)
return 0;
if (x == 1)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
FOR(i, 3, sqrt(x) + 1) {
if (x % i == 0)
return 0;
}
return 1;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll gcd = GCD(a, b);
return a / gcd * b;
}
ll nCr(ll n, ll r) {
vector<ll> C(r + 1);
C[0] = 1;
FOR(i, 1, n) for (ll j = min(i, r); j < 1; --j) C[j] = (C[j] + C[j - 1]);
return C[r];
}
template <class T> class SegTree {
int n;
vector<T> data;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def;
if (a <= l && r <= b)
return data[k];
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
return operation(c1, c2);
}
}
public:
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
T query(int a, int b) { return _query(a, b, 0, 0, n); }
T operator[](int i) { return data[i + n - 1]; }
};
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<int> sz;
UnionFind(int N) {
for (int i = 0; i < N; ++i) {
par.push_back(i);
rank.push_back(0);
sz.push_back(-1);
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y])
par[x] = y;
else {
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
int root(int x) {
if (sz[x] < 0)
return x;
else
return sz[x] = root(sz[x]);
}
bool isSame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (sz[x] > sz[y])
swap(x, y); // merge technique
sz[x] += sz[y];
sz[y] = x;
return true;
}
int size(int x) { return -sz[root(x)]; }
};
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
void Bellman_short(int s) {
REP(i, V) d[i] = 1LL << 50;
d[s] = 0;
REP(i, V)
REP(i, E) {
edge e = ES[i];
if (d[e.from] != 1LL << 50 && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
}
}
}
bool Bellman_negLoop(int s) {
REP(i, V) d[i] = 1LL << 50;
d[s] = 0;
REP(i, V)
REP(j, E) {
edge e = ES[j];
if (d[e.from] != 1LL << 50 && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
if (i == V - 1)
return true;
}
}
return false;
}
void dijkstra(int s) {
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> Q;
fill(d, d + V, LLONG_MAX);
fill(prev_path, prev_path + V, -1);
d[s] = 0;
Q.push(P(0, s));
while (!Q.empty()) {
P p = Q.top();
Q.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (edge e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
Q.push(P(d[e.to], e.to));
prev_path[e.to] = v;
}
}
}
}
vector<ll> getPath(int t) {
vector<ll> path;
for (; t != -1; t = prev_path[t]) {
path.push_back(t);
}
reverse(all(path));
return path;
}
//
// int A[100001];
//
// bool dfs(ll x, int a) {
// A[x] = a;
// for (edge e : G[x]) {
// if (e.cost % 2 == 0) {
// if (A[e.to] == -a)return false;
// if (A[e.to] == 0 && !dfs(e.to, a))return false;
// } else {
// if (A[e.to] == a)return false;
// if (A[e.to] == 0 && !dfs(e.to, -a))return false;
// }
// }
// return true;
//}
ll N, K;
int main() {
cin >> N >> K;
vector<int> V(N);
REP(i, N) cin >> V[i];
ll ans = 0;
REP(i, K + 1) {
REP(j, min(K, N) - i + 1) {
priority_queue<int, vector<int>, greater<>> q;
ll sum = 0;
REP(n, i) q.push(V[n]), sum += V[n];
REP(m, j) q.push(V[N - 1 - m]), sum += V[N - 1 - m];
REP(k, K - i - j) if (!q.empty() && q.top() < 0) sum -= q.top(), q.pop();
ans = max(ans, sum);
}
}
PRI(ans)
return 0;
} | [
"expression.operation.binary.add"
] | 843,417 | 843,418 | u181806820 | 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 Asum = 0;
priority_queue<int> q;
priority_queue<int> s;
for (int i = 0; i < k + 1; i++) {
if (i != 0 && i < N + 1) {
Asum += v.at(i - 1);
if (v.at(i - 1) < 0) {
int t = 0 - v.at(i - 1);
q.push(t);
}
}
int Bsum = 0;
priority_queue<int> r = q;
for (int j = 0; j < k - i + 1; j++) {
if (j != 0 && j < N + 1) {
if (v.at(N - j) < 0) {
int s = 0 - v.at(N - j);
r.push(s);
}
Bsum += v.at(N - j);
}
int sum = i + j;
int sute = k - sum;
int ABsum = Asum + Bsum;
priority_queue<int> t = r;
if (sute > 0 && t.size() > 0) {
while (sute > 0 && t.size() > 0) {
ABsum += t.top();
t.pop();
sute--;
}
}
if (ABsum < 0) {
ABsum = 0;
}
s.push(ABsum);
}
}
cout << s.top() << 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 Asum = 0;
priority_queue<int> q;
priority_queue<int> s;
for (int i = 0; i < k + 1; i++) {
if (i != 0 && i < N + 1) {
Asum += v.at(i - 1);
if (v.at(i - 1) < 0) {
int t = 0 - v.at(i - 1);
q.push(t);
}
}
int Bsum = 0;
priority_queue<int> r = q;
for (int j = 0; j < k - i + 1; j++) {
if (j != 0 && j < N + 1 - i) {
if (v.at(N - j) < 0) {
int s = 0 - v.at(N - j);
r.push(s);
}
Bsum += v.at(N - j);
}
int sum = i + j;
int sute = k - sum;
int ABsum = Asum + Bsum;
priority_queue<int> t = r;
if (sute > 0 && t.size() > 0) {
while (sute > 0 && t.size() > 0) {
ABsum += t.top();
t.pop();
sute--;
}
}
if (ABsum < 0) {
ABsum = 0;
}
s.push(ABsum);
}
}
cout << s.top() << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 843,423 | 843,424 | u985686845 | cpp |
p03032 | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
typedef long long ll;
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 i = 0; i < min(n, k); i++) {
for (int j = 0; j + i < min(n, k); j++) {
vector<int> ans;
for (int c = 0; c < i; c++) {
ans.push_back(v[c]);
}
for (int c = 0; c < j; c++) {
ans.push_back(v[n - c - 1]);
}
sort(ans.begin(), ans.end());
int remain = k - (i + j);
int sum = 0;
for (int c = 0; c < (int)ans.size(); c++) {
if (ans[c] < 0) {
if (remain) {
remain--;
} else
sum += ans[c];
} else
sum += ans[c];
}
res = max(res, sum);
}
}
cout << res << endl;
return 0;
}
| #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
typedef long long ll;
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 i = 0; i <= min(n, k); i++) {
for (int j = 0; j + i <= min(n, k); j++) {
vector<int> ans;
for (int c = 0; c < i; c++) {
ans.push_back(v[c]);
}
for (int c = 0; c < j; c++) {
ans.push_back(v[n - c - 1]);
}
sort(ans.begin(), ans.end());
int remain = k - (i + j);
int sum = 0;
for (int c = 0; c < (int)ans.size(); c++) {
if (ans[c] < 0) {
if (remain) {
remain--;
} else
sum += ans[c];
} else
sum += ans[c];
}
res = max(res, sum);
}
}
cout << res << endl;
return 0;
}
| [
"expression.operator.compare.change"
] | 843,429 | 843,430 | u101513772 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)
#define print(a) cout << a << endl;
#define printarray(a, len) rep(ii, 0, len) cout << a[ii] << " ";
int main() {
ll n, k, ans = 0;
cin >> n >> k;
ll v[51];
rep(i, 0, n) cin >> v[i];
// 何個取り出すか
for (ll t = k; t > 0; t--) {
// そのうち左からいくつ取り出すか
rep(i, 0, t + 1) {
ll result = 0;
priority_queue<ll, vector<ll>, greater<ll>> q;
// 左から取り出す
rep(l, 0, i) {
q.push(v[l]);
result += v[l];
}
// 右から取り出す
rep(r, 0, t - i) {
q.push(v[n - 1 - r]);
result += v[n - 1 - r];
}
// 戻す
rep(b, 0, min(t, k - t)) {
if (q.top() < 0) {
result -= q.top();
q.pop();
}
}
ans = max(ans, result);
// cout << t << " " << i << " " << result << endl;
}
}
print(ans);
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)
#define print(a) cout << a << endl;
#define printarray(a, len) rep(ii, 0, len) cout << a[ii] << " ";
int main() {
ll n, k, ans = 0;
cin >> n >> k;
ll v[51];
rep(i, 0, n) cin >> v[i];
// 何個取り出すか
for (ll t = min(k, n); t > 0; t--) {
// そのうち左からいくつ取り出すか
rep(i, 0, t + 1) {
ll result = 0;
priority_queue<ll, vector<ll>, greater<ll>> q;
// 左から取り出す
rep(l, 0, i) {
q.push(v[l]);
result += v[l];
}
// 右から取り出す
rep(r, 0, t - i) {
q.push(v[n - 1 - r]);
result += v[n - 1 - r];
}
// 戻す
rep(b, 0, min(t, k - t)) {
if (q.top() < 0) {
result -= q.top();
q.pop();
}
}
ans = max(ans, result);
// cout << t << " " << i << " " << result << endl;
}
}
print(ans);
return 0;
} | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.add"
] | 843,437 | 843,438 | u656995812 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC128D() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; ++i)
cin >> V[i];
int maxSum = 0;
for (int i = 0; i <= K; ++i) {
vector<int> X;
for (int j = 0; j <= i; ++j) {
X.assign(V.begin(), V.begin() + j);
X.insert(X.end(), V.rbegin(), V.rbegin() + (i - j));
sort(X.begin(), X.end());
int m = distance(X.begin(), lower_bound(X.begin(), X.end(), 0));
int k = min(i, K - i);
m = min(k, m);
int sum = accumulate(X.begin() + m, X.end(), 0);
maxSum = max(sum, maxSum);
}
}
cout << maxSum << endl;
}
int main() {
ABC128D();
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC128D() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; ++i)
cin >> V[i];
int maxSum = 0;
for (int i = 0; i <= min(N, K); ++i) {
vector<int> X;
for (int j = 0; j <= i; ++j) {
X.assign(V.begin(), V.begin() + j);
X.insert(X.end(), V.rbegin(), V.rbegin() + (i - j));
sort(X.begin(), X.end());
int m = distance(X.begin(), lower_bound(X.begin(), X.end(), 0));
int k = min(i, K - i);
m = min(k, m);
int sum = accumulate(X.begin() + m, X.end(), 0);
maxSum = max(sum, maxSum);
}
}
cout << maxSum << endl;
}
int main() {
ABC128D();
return 0;
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 843,445 | 843,446 | u227117171 | cpp |
p03032 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort(ALL(x))
#define CLR(a) memset((a), 0, sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const double PI = acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
__attribute__((constructor)) void initial() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
signed main() {
int n, k;
cin >> n >> k;
VI v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(a, min(n, k) + 1) {
rep(b, min(n, k) - a + 1) {
vector<ll> c;
ll cnt = 0;
rep(i, a) c.PB(v[i]), cnt += v[i];
rep(i, b) c.PB(v[n - i - 1]), cnt += v[n - i - 1];
sort(ALL(c));
rep(i, min(k - a - b, (int)c.size())) {
if (v[i] < 0)
cnt -= c[i];
}
ans = max(ans, cnt);
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort(ALL(x))
#define CLR(a) memset((a), 0, sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const double PI = acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
__attribute__((constructor)) void initial() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
signed main() {
int n, k;
cin >> n >> k;
VI v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(a, min(n, k) + 1) {
rep(b, min(n, k) - a + 1) {
vector<ll> c;
ll cnt = 0;
rep(i, a) c.PB(v[i]), cnt += v[i];
rep(i, b) c.PB(v[n - i - 1]), cnt += v[n - i - 1];
sort(ALL(c));
rep(i, min(k - a - b, (int)c.size())) {
if (c[i] < 0)
cnt -= c[i];
}
ans = max(ans, cnt);
}
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 843,450 | 843,451 | u050698451 | cpp |
p03032 | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x * y / gcd(x, y); }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << endl; }
signed main() {
int n, k;
cin >> n >> k;
deque<int> v;
vector<int> S(n + 1, 0);
rep(i, n) {
int a;
cin >> a;
v.push_back(a);
}
int ans = -LLONG_MAX;
rep(i, min(n + 1, k)) { // i個の宝石を取る
rep(j, i + 1) { //左からj個、右からi-j個取る
multiset<int> juwel;
int cost = 0;
rep(l, j) {
juwel.insert(v[l]);
cost += v[l];
}
rep(l, i - j) {
juwel.insert(v[n - l - 1]);
cost += v[n - l - 1];
}
itr(l, juwel) { //最大k-i個の宝石を詰める
if (*l >= 0 || distance(juwel.begin(), l) >= k - i)
break;
cost -= *l;
}
ans = max(ans, cost);
}
}
cout << ans << endl;
}
| #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x * y / gcd(x, y); }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << endl; }
signed main() {
int n, k;
cin >> n >> k;
deque<int> v;
vector<int> S(n + 1, 0);
rep(i, n) {
int a;
cin >> a;
v.push_back(a);
}
int ans = -LLONG_MAX;
rep(i, min(n + 1, k + 1)) { // i個の宝石を取る
rep(j, i + 1) { //左からj個、右からi-j個取る
multiset<int> juwel;
int cost = 0;
rep(l, j) {
juwel.insert(v[l]);
cost += v[l];
}
rep(l, i - j) {
juwel.insert(v[n - l - 1]);
cost += v[n - l - 1];
}
itr(l, juwel) { //最大k-i個の宝石を詰める
if (*l >= 0 || distance(juwel.begin(), l) >= k - i)
break;
cost -= *l;
}
ans = max(ans, cost);
}
}
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 843,460 | 843,461 | u203033720 | cpp |
p03032 | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x * y / gcd(x, y); }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << endl; }
signed main() {
int n, k;
cin >> n >> k;
deque<int> v;
vector<int> S(n + 1, 0);
rep(i, n) {
int a;
cin >> a;
v.push_back(a);
}
int ans = -LLONG_MAX;
rep(i, min(n, k)) { // i個の宝石を取る
rep(j, i + 1) { //左からj個、右からi-j個取る
multiset<int> juwel;
int cost = 0;
rep(l, j) {
juwel.insert(v[l]);
cost += v[l];
}
rep(l, i - j) {
juwel.insert(v[n - l - 1]);
cost += v[n - l - 1];
}
itr(l, juwel) { //最大k-i個の宝石を詰める
if (*l >= 0 || distance(juwel.begin(), l) >= k - i)
break;
cost -= *l;
}
ans = max(ans, cost);
}
}
cout << ans << endl;
} | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x * y / gcd(x, y); }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << endl; }
signed main() {
int n, k;
cin >> n >> k;
deque<int> v;
vector<int> S(n + 1, 0);
rep(i, n) {
int a;
cin >> a;
v.push_back(a);
}
int ans = -LLONG_MAX;
rep(i, min(n + 1, k + 1)) { // i個の宝石を取る
rep(j, i + 1) { //左からj個、右からi-j個取る
multiset<int> juwel;
int cost = 0;
rep(l, j) {
juwel.insert(v[l]);
cost += v[l];
}
rep(l, i - j) {
juwel.insert(v[n - l - 1]);
cost += v[n - l - 1];
}
itr(l, juwel) { //最大k-i個の宝石を詰める
if (*l >= 0 || distance(juwel.begin(), l) >= k - i)
break;
cost -= *l;
}
ans = max(ans, cost);
}
}
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 843,462 | 843,461 | u203033720 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define all(v) (v).begin(), v.end()
#define fi first
#define se second
const ll inf = (1e18);
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
map<char, int> mp;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
int m = n + 1;
int ma = min(k, m);
ll ans = 0;
for (int i = ma; i >= 1; i--) { // iは区間
for (int j = m - i - 1; j < m; j++) {
ll res = 0;
priority_queue<ll, vector<ll>, greater<ll>> pq;
int l = 0;
while (l != i + 1) {
res += v[(l + j) % m];
pq.push(v[(l + j) % m]);
l++;
}
int times = k - i;
while (times--) {
if (pq.empty())
break;
ll tmp = pq.top();
pq.pop();
if (tmp >= 0)
break;
res -= tmp;
}
ans = max(ans, res);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define all(v) (v).begin(), v.end()
#define fi first
#define se second
const ll inf = (1e18);
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
map<char, int> mp;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
int m = n + 1;
int ma = min(k, n); //取れる区間の最大値
ll ans = 0;
for (int i = ma; i >= 1; i--) { // iは区間
for (int j = m - i - 1; j < m; j++) {
ll res = 0;
priority_queue<ll, vector<ll>, greater<ll>> pq;
int l = 0;
while (l != i + 1) {
res += v[(l + j) % m];
pq.push(v[(l + j) % m]);
l++;
}
int times = k - i;
while (times--) {
if (pq.empty())
break;
ll tmp = pq.top();
pq.pop();
if (tmp >= 0)
break;
res -= tmp;
}
ans = max(ans, res);
}
}
cout << ans << endl;
}
| [
"identifier.change",
"call.arguments.change"
] | 843,481 | 843,482 | u822169805 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define all(v) (v).begin(), v.end()
#define fi first
#define se second
const ll inf = (1e18);
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
map<char, int> mp;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
int m = n + 1;
int ma = min(k, m);
ll ans = 0;
for (int i = ma; i >= 1; i--) { // iは区間
for (int j = m - i - 1; j < m; j++) {
ll res = 0;
priority_queue<ll, vector<ll>, greater<ll>> pq;
int l = 0;
while (l != i + 1) {
res += v[(l + j) % m];
pq.push(v[(l + j) % m]);
l++;
}
int times = k - i;
while (times--) {
if (pq.empty())
break;
ll tmp = pq.top();
pq.pop();
if (tmp >= 0)
break;
res -= tmp;
}
ans = max(ans, res);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define all(v) (v).begin(), v.end()
#define fi first
#define se second
const ll inf = (1e18);
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
map<char, int> mp;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
int m = n + 1;
int ma = min(k, n);
ll ans = 0;
for (int i = ma; i >= 1; i--) { // iは区間
for (int j = m - i - 1; j < m; j++) {
ll res = 0;
priority_queue<ll, vector<ll>, greater<ll>> pq;
int l = 0;
while (l != i + 1) {
res += v[(l + j) % m];
pq.push(v[(l + j) % m]);
l++;
}
int times = k - i;
while (times--) {
if (pq.empty())
break;
ll tmp = pq.top();
pq.pop();
if (tmp >= 0)
break;
res -= tmp;
}
ans = max(ans, res);
}
}
cout << ans << endl;
}
| [
"identifier.change",
"call.arguments.change"
] | 843,481 | 843,483 | u822169805 | cpp |
p03032 | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N, K;
vector<int> V;
int main() {
cin >> N;
cin >> K;
long long ans = 0;
V = vector<int>(N);
vector<int> acc_fw = vector<int>(N + 1, 0);
vector<priority_queue<int>> mns_fw = vector<priority_queue<int>>(N + 1);
vector<int> acc_bc = vector<int>(N + 1, 0);
vector<priority_queue<int>> mns_bc = vector<priority_queue<int>>(N + 1);
{
priority_queue<int> minus_q;
for (int i = 0; i < N; i++) {
cin >> V.at(i);
acc_fw.at(i + 1) = V.at(i);
if (i > 0) {
acc_fw.at(i + 1) += acc_fw.at(i);
}
if (V.at(i) < 0) {
minus_q.push(-V.at(i));
}
mns_fw.at(i + 1) = minus_q;
}
}
{
priority_queue<int> minus_q;
for (int i = N - 1; i >= 0; i--) {
acc_bc.at(i) = V.at(i);
if (i < N - 1) {
acc_bc.at(i) += acc_bc.at(i + 1);
}
if (V.at(i) < 0) {
minus_q.push(-V.at(i));
}
mns_bc.at(i) = minus_q;
}
}
int loop = min(K, N);
for (int k = 1; k <= loop; k++) {
int lest = K - k;
for (int i = 0; i <= k; i++) {
long long tmp = acc_fw.at(i) + acc_bc.at(N + i - k);
priority_queue<int> mf = mns_fw.at(i);
priority_queue<int> mb = mns_bc.at(N + i - k);
for (int j = 0; j < lest && !mf.empty() && !mb.empty(); j++) {
priority_queue<int> *tgt;
if (mf.empty()) {
tgt = &mb;
} else if (mb.empty()) {
tgt = &mf;
} else {
tgt = mf.top() < mb.top() ? &mf : &mb;
}
tmp += tgt->top();
tgt->pop();
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N, K;
vector<int> V;
int main() {
cin >> N;
cin >> K;
long long ans = 0;
V = vector<int>(N);
vector<int> acc_fw = vector<int>(N + 1, 0);
vector<priority_queue<int>> mns_fw = vector<priority_queue<int>>(N + 1);
vector<int> acc_bc = vector<int>(N + 1, 0);
vector<priority_queue<int>> mns_bc = vector<priority_queue<int>>(N + 1);
{
priority_queue<int> minus_q;
for (int i = 0; i < N; i++) {
cin >> V.at(i);
acc_fw.at(i + 1) = V.at(i);
if (i > 0) {
acc_fw.at(i + 1) += acc_fw.at(i);
}
if (V.at(i) < 0) {
minus_q.push(-V.at(i));
}
mns_fw.at(i + 1) = minus_q;
}
}
{
priority_queue<int> minus_q;
for (int i = N - 1; i >= 0; i--) {
acc_bc.at(i) = V.at(i);
if (i < N - 1) {
acc_bc.at(i) += acc_bc.at(i + 1);
}
if (V.at(i) < 0) {
minus_q.push(-V.at(i));
}
mns_bc.at(i) = minus_q;
}
}
int loop = min(K, N);
for (int k = 1; k <= loop; k++) {
int lest = K - k;
for (int i = 0; i <= k; i++) {
long long tmp = acc_fw.at(i) + acc_bc.at(N + i - k);
priority_queue<int> mf = mns_fw.at(i);
priority_queue<int> mb = mns_bc.at(N + i - k);
for (int j = 0; j < lest && !(mf.empty() && mb.empty()); j++) {
priority_queue<int> *tgt;
if (mf.empty()) {
tgt = &mb;
} else if (mb.empty()) {
tgt = &mf;
} else {
tgt = mf.top() < mb.top() ? &mf : &mb;
}
tmp += tgt->top();
tgt->pop();
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.unary.logical.remove",
"call.arguments.change"
] | 843,488 | 843,489 | u647974562 | cpp |
p03032 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <numeric>
using namespace std;
int main(void) {
int N, K;
int V[50] = {};
int takenV[50] = {};
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> V[i];
int res = 0;
for (int i = 0; i < min(N, K); i++) {
for (int j = 0; j < min(N, K) - i; j++) {
fill(takenV, takenV + 49, 0);
memcpy(takenV, V, i * sizeof(int));
memcpy(takenV + i, V + N - j, j * sizeof(int));
sort(takenV, takenV + i + j);
int neg = 0;
for (int l = 0; l < min(i + j, K - i - j); l++) {
if (takenV[l] < 0)
neg += takenV[l];
}
res = max(res, accumulate(takenV, takenV + i + j, 0) - neg);
}
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <cstring>
#include <iostream>
#include <numeric>
using namespace std;
int main(void) {
int N, K;
int V[50] = {};
int takenV[50] = {};
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> V[i];
int res = 0;
for (int i = 0; i <= min(N, K); i++) {
for (int j = 0; j <= min(N, K) - i; j++) {
fill(takenV, takenV + 49, 0);
memcpy(takenV, V, i * sizeof(int));
memcpy(takenV + i, V + N - j, j * sizeof(int));
sort(takenV, takenV + i + j);
int neg = 0;
for (int l = 0; l < min(i + j, K - i - j); l++) {
if (takenV[l] < 0)
neg += takenV[l];
}
res = max(res, accumulate(takenV, takenV + i + j, 0) - neg);
}
}
cout << res << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,491 | 843,492 | u486097563 | 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[i];
int mi = min(n, k);
int ans = 0;
for (int a = 0; a <= mi; ++a) {
for (int b = 0; b <= mi; ++b) {
if (a + b > mi)
break;
int sum = 0;
priority_queue<int, vector<int>, greater<int>> q;
for (int i = 0; i < a; ++i) {
sum += v[i];
q.push(v[i]);
}
for (int j = n - 1; j >= n - j; --j) {
sum += v[j];
q.push(v[j]);
}
ans = max(ans, sum);
int remain = k - (a + b);
while (remain > 0 && !q.empty()) {
int cur = q.top();
if (cur >= 0)
break;
q.pop();
sum += abs(cur);
ans = max(ans, sum);
}
}
}
cout << ans << endl;
return 0;
} | #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[i];
int mi = min(n, k);
int ans = 0;
for (int a = 0; a <= mi; ++a) {
for (int b = 0; b <= mi; ++b) {
if (a + b > mi)
break;
int sum = 0;
priority_queue<int, vector<int>, greater<int>> q;
for (int i = 0; i < a; ++i) {
sum += v[i];
q.push(v[i]);
}
for (int j = n - 1; j >= n - b; --j) {
sum += v[j];
q.push(v[j]);
}
ans = max(ans, sum);
int remain = k - (a + b);
while (remain-- > 0 && !q.empty()) {
int cur = q.top();
if (cur >= 0)
break;
q.pop();
sum += abs(cur);
ans = max(ans, sum);
}
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 843,493 | 843,494 | u559765551 | cpp |
p03032 | #include "stdio.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const long long mod_const = 1e9 + 7;
using MIte = multimap<long, long, greater<long>>::iterator;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, K;
cin >> N >> K;
vector<int> vV(N);
rep(i, N) cin >> vV[i];
vector<int> leftsum(N + 1, 0);
leftsum[0] = 0;
for (int i = 1; i != N + 1; ++i) {
leftsum[i] = leftsum[i - 1] + vV[i - 1];
}
vector<int> rightsum(N + 1, 0);
rightsum[0] = 0;
for (int i = 1; i != N + 1; ++i) {
rightsum[i] = rightsum[i - 1] + vV[N - i];
}
int maxsum = 0;
for (int i = 0; i != min(K, N + 1); ++i) {
vector<int> vObtain;
if (i != 0) {
rep(a, i) vObtain.push_back(vV[a]);
}
for (int j = 0; j != min(K - i, N - i); ++j) {
vector<int> vObtain2;
if (j != 0) {
rep(b, j) vObtain2.push_back(vV[N - b - 1]);
}
vObtain2.insert(vObtain2.end(), vObtain.begin(), vObtain.end());
sort(vObtain2.begin(), vObtain2.end());
int sum = leftsum[i] + rightsum[j];
int limit = min(K - i - j, i + j);
for (int k = 0; k < limit; ++k) {
if (vObtain2[k] < 0) {
sum -= vObtain2[k];
}
}
if (sum > maxsum) {
maxsum = sum;
}
}
}
cout << maxsum << endl;
return 0;
} | #include "stdio.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const long long mod_const = 1e9 + 7;
using MIte = multimap<long, long, greater<long>>::iterator;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, K;
cin >> N >> K;
vector<int> vV(N);
rep(i, N) cin >> vV[i];
vector<int> leftsum(N + 1, 0);
leftsum[0] = 0;
for (int i = 1; i != N + 1; ++i) {
leftsum[i] = leftsum[i - 1] + vV[i - 1];
}
vector<int> rightsum(N + 1, 0);
rightsum[0] = 0;
for (int i = 1; i != N + 1; ++i) {
rightsum[i] = rightsum[i - 1] + vV[N - i];
}
int maxsum = 0;
for (int i = 0; i != min(K + 1, N + 1); ++i) {
vector<int> vObtain;
if (i != 0) {
rep(a, i) vObtain.push_back(vV[a]);
}
for (int j = 0; j != min(K - i + 1, N - i + 1); ++j) {
vector<int> vObtain2;
if (j != 0) {
rep(b, j) vObtain2.push_back(vV[N - b - 1]);
}
vObtain2.insert(vObtain2.end(), vObtain.begin(), vObtain.end());
sort(vObtain2.begin(), vObtain2.end());
int sum = leftsum[i] + rightsum[j];
int limit = min(K - i - j, i + j);
for (int k = 0; k < limit; ++k) {
if (vObtain2[k] < 0) {
sum -= vObtain2[k];
}
}
if (sum > maxsum) {
maxsum = sum;
}
}
}
cout << maxsum << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 843,505 | 843,506 | u468440945 | cpp |
p03032 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 998244353;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
template <typename T> void print_vec(vector<T> a) {
int n = a.size();
REP(i, n) {
cout >> a[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
ll power(ll base, ll exponent) {
if (exponent % 2) {
return power(base, exponent - 1) * base % mod;
} else if (exponent) {
ll root_ans = power(base, exponent / 2);
return root_ans * root_ans % mod;
} else {
return 1;
}
}
ll inverse(ll x) { return power(x, mod - 2); }
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
ll r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
template <typename T> ll sum(T begin, T end) {
return accumulate(begin, end, 0ll);
}
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
int bsearch(const vector<ll> &a, ll x) {
int lft = 0;
int rgt = a.size();
while (rgt - lft > 1) {
int mid = (lft + rgt) / 2;
if (a[mid] < x) {
lft = mid;
} else {
rgt = mid;
}
}
return lft;
}
signed main() {
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> v(n);
REP(i, n) cin >> v[i];
ll ans = 0;
REP(l, k) {
REP(r, k - l) {
if (l + r > n)
continue;
vector<ll> a;
REP(i, l) { a.push_back(v[i]); }
REP(i, r) { a.push_back(v[n - 1 - i]); }
sort(all(a));
ll score = sum(all(a));
REP(i, min(k - r - l, r + l)) {
if (a[i] >= 0)
break;
score -= a[i];
}
ans = max(ans, score);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 998244353;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
template <typename T> void print_vec(vector<T> a) {
int n = a.size();
REP(i, n) {
cout >> a[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
ll power(ll base, ll exponent) {
if (exponent % 2) {
return power(base, exponent - 1) * base % mod;
} else if (exponent) {
ll root_ans = power(base, exponent / 2);
return root_ans * root_ans % mod;
} else {
return 1;
}
}
ll inverse(ll x) { return power(x, mod - 2); }
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
ll r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
template <typename T> ll sum(T begin, T end) {
return accumulate(begin, end, 0ll);
}
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
int bsearch(const vector<ll> &a, ll x) {
int lft = 0;
int rgt = a.size();
while (rgt - lft > 1) {
int mid = (lft + rgt) / 2;
if (a[mid] < x) {
lft = mid;
} else {
rgt = mid;
}
}
return lft;
}
signed main() {
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> v(n);
REP(i, n) cin >> v[i];
ll ans = 0;
REP(l, k + 1) {
REP(r, k - l + 1) {
if (l + r > n)
continue;
vector<ll> a;
REP(i, l) { a.push_back(v[i]); }
REP(i, r) { a.push_back(v[n - 1 - i]); }
sort(all(a));
ll score = sum(all(a));
REP(i, min(k - r - l, r + l)) {
if (a[i] >= 0)
break;
score -= a[i];
}
ans = max(ans, score);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 843,522 | 843,523 | u702582248 | cpp |
p03032 | #include <bits/stdc++.h>
#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)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)*/
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹) */
///////////////////////////////////////////////
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
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 % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int ans = 0;
int N, K;
cin >> N >> K;
vector<int> A;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.PB(a);
}
for (int a = 0; a < K; a++) {
for (int b = 0; b < K; b++) {
for (int c = 0; c < K; c++) {
int n_ans = 0;
priority_queue<int, vector<int>, greater<int>> que;
if (a + b + c > K) {
continue;
}
if (a + b > N) {
continue;
}
if (a + b < c) {
continue;
}
for (int i = 0; i < a; i++) {
que.push(A[i]);
n_ans += A[i];
}
for (int i = 0; i < b; i++) {
que.push(A[N - 1 - i]);
n_ans += A[N - 1 - i];
}
for (int i = 0; i < c; i++) {
n_ans -= que.top();
que.pop();
}
if (n_ans > ans) {
ans = n_ans;
}
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#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)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)*/
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹) */
///////////////////////////////////////////////
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
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 % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int ans = 0;
int N, K;
cin >> N >> K;
vector<int> A;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.PB(a);
}
for (int a = 0; a <= K; a++) {
for (int b = 0; b <= K; b++) {
for (int c = 0; c <= K; c++) {
int n_ans = 0;
priority_queue<int, vector<int>, greater<int>> que;
if (a + b + c > K) {
continue;
}
if (a + b > N) {
continue;
}
if (a + b < c) {
continue;
}
for (int i = 0; i < a; i++) {
que.push(A[i]);
n_ans += A[i];
}
for (int i = 0; i < b; i++) {
que.push(A[N - 1 - i]);
n_ans += A[N - 1 - i];
}
for (int i = 0; i < c; i++) {
n_ans -= que.top();
que.pop();
}
if (n_ans > ans) {
ans = n_ans;
}
}
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 843,532 | 843,533 | u532894762 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
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 M = min(K, N); //取れる最大個数
priority_queue<int, vector<int>, greater<int>> fromL;
priority_queue<int, vector<int>, greater<int>> fromR;
ll value = 0;
ll sub = -1000000000;
for (int i = 0; i <= M; i++) {
for (int j = 0; j <= M - i; j++) {
value = 0;
for (int k = 0; k < i; k++) {
fromL.push(V[k]);
value += V[k];
}
for (int k = 0; k < j; k++) {
fromR.push(V[N - k - 1]);
value += V[N - k - 1];
}
for (int k = 0; k < M - (i + j); k++) {
if (!fromL.empty() && !fromR.empty()) { //両方からじゃない
if (fromL.top() >= 0 && fromR.top() >= 0) {
break;
} else if (fromL.top() < fromR.top()) {
value -= fromL.top();
fromL.pop();
} else {
value -= fromR.top();
fromR.pop();
}
} else if (fromL.empty() && fromR.empty()) {
break;
} else if (fromL.empty()) {
if (fromR.empty())
break;
value -= fromR.top();
fromR.pop();
} else {
if (fromL.top() >= 0)
break;
value -= fromL.top();
fromL.pop();
}
}
sub = max(sub, value);
while (!fromL.empty())
fromL.pop();
while (!fromR.empty())
fromR.pop();
}
}
cout << sub << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
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 M = min(K, N); //取れる最大個数
priority_queue<int, vector<int>, greater<int>> fromL;
priority_queue<int, vector<int>, greater<int>> fromR;
ll value = 0;
ll sub = 0;
for (int i = 0; i <= M; i++) {
for (int j = 0; j <= M - i; j++) {
value = 0;
for (int k = 0; k < i; k++) {
fromL.push(V[k]);
value += V[k];
}
for (int k = 0; k < j; k++) {
fromR.push(V[N - k - 1]);
value += V[N - k - 1];
}
for (int k = 0; k < K - (i + j); k++) {
if (!fromL.empty() && !fromR.empty()) { //両方からじゃない
if (fromL.top() >= 0 && fromR.top() >= 0) {
break;
} else if (fromL.top() < fromR.top()) {
value -= fromL.top();
fromL.pop();
} else {
value -= fromR.top();
fromR.pop();
}
} else if (fromL.empty() && fromR.empty()) {
break;
} else if (fromL.empty()) {
if (fromR.empty())
break;
value -= fromR.top();
fromR.pop();
} else {
if (fromL.top() >= 0)
break;
value -= fromL.top();
fromL.pop();
}
}
sub = max(sub, value);
while (!fromL.empty())
fromL.pop();
while (!fromR.empty())
fromR.pop();
}
}
cout << sub << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,557 | 843,558 | u892438699 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
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 M = min(K, N); //取れる最大個数
priority_queue<int, vector<int>, greater<int>> fromL;
priority_queue<int, vector<int>, greater<int>> fromR;
int value = 0;
int sub = -1000000000;
for (int i = 0; i <= M; i++) {
for (int j = 0; j <= M - i; j++) {
value = 0;
for (int k = 0; k < i; k++) {
fromL.push(V[k]);
value += V[k];
}
for (int k = 0; k < j; k++) {
fromR.push(V[N - k - 1]);
value += V[N - k - 1];
}
for (int k = 0; k < M - (i + j); k++) {
if (!fromL.empty() && !fromR.empty()) { //両方からじゃない
if (fromL.top() >= 0 && fromR.top() >= 0) {
break;
} else if (fromL.top() < fromR.top()) {
value -= fromL.top();
fromL.pop();
} else {
value -= fromR.top();
fromR.pop();
}
} else if (fromL.empty() && fromR.empty()) {
break;
} else if (fromL.empty()) {
if (fromR.empty())
break;
value -= fromR.top();
fromR.pop();
} else {
if (fromL.top() >= 0)
break;
value -= fromL.top();
fromL.pop();
}
}
sub = max(sub, value);
while (!fromL.empty())
fromL.pop();
while (!fromR.empty())
fromR.pop();
}
}
cout << sub << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
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 M = min(K, N); //取れる最大個数
priority_queue<int, vector<int>, greater<int>> fromL;
priority_queue<int, vector<int>, greater<int>> fromR;
ll value = 0;
ll sub = 0;
for (int i = 0; i <= M; i++) {
for (int j = 0; j <= M - i; j++) {
value = 0;
for (int k = 0; k < i; k++) {
fromL.push(V[k]);
value += V[k];
}
for (int k = 0; k < j; k++) {
fromR.push(V[N - k - 1]);
value += V[N - k - 1];
}
for (int k = 0; k < K - (i + j); k++) {
if (!fromL.empty() && !fromR.empty()) { //両方からじゃない
if (fromL.top() >= 0 && fromR.top() >= 0) {
break;
} else if (fromL.top() < fromR.top()) {
value -= fromL.top();
fromL.pop();
} else {
value -= fromR.top();
fromR.pop();
}
} else if (fromL.empty() && fromR.empty()) {
break;
} else if (fromL.empty()) {
if (fromR.empty())
break;
value -= fromR.top();
fromR.pop();
} else {
if (fromL.top() >= 0)
break;
value -= fromL.top();
fromL.pop();
}
}
sub = max(sub, value);
while (!fromL.empty())
fromL.pop();
while (!fromR.empty())
fromR.pop();
}
}
cout << sub << endl;
} | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 843,559 | 843,558 | u892438699 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1e10;
for (int ope = 0; ope <= K; ope += 2) {
for (int l = 0; l <= min(N, ope); l++) {
for (int r = 0; r <= min(N, ope); r++) {
if (l + r > min(N, ope)) {
break;
}
int rest = ope - l - r;
if (rest > l + r) {
continue;
}
priority_queue<int> q;
for (int i = 0; i < l; i++) {
q.push(V[i]);
}
for (int i = 0; i < r; i++) {
q.push(V[N - 1 - i]);
}
long long value = 0;
int loop = l + r - rest;
for (int i = 0; i < loop; i++) {
value += q.top();
q.pop();
}
ans = max(ans, value);
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
long long ans = -1e10;
for (int ope = 0; ope <= K; ope++) {
for (int l = 0; l <= min(N, ope); l++) {
for (int r = 0; r <= min(N, ope); r++) {
if (l + r > min(N, ope)) {
break;
}
int rest = ope - l - r;
if (rest > l + r) {
continue;
}
priority_queue<int> q;
for (int i = 0; i < l; i++) {
q.push(V[i]);
}
for (int i = 0; i < r; i++) {
q.push(V[N - 1 - i]);
}
long long value = 0;
int loop = l + r - rest;
for (int i = 0; i < loop; i++) {
value += q.top();
q.pop();
}
ans = max(ans, value);
}
}
}
cout << ans << endl;
return 0;
} | [] | 843,564 | 843,565 | u048945791 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ll cont[55];
f(n) cin >> cont[i];
ll ans = 0;
for (int i = 1; i <= min(k, n); i++) {
int lb = 0, rb = n - i;
while (lb <= i) {
set<ll> st;
for (int j = 0; j < n; j++) {
if (j < lb || j >= rb) {
st.insert(cont[j]);
}
}
int left = k - i;
/*for(auto z:st){
cout<<z<<' ';
}
cout<<left<<endl;*/
while (left && st.size()) {
if (*st.begin() > 0)
break;
st.erase(*st.begin());
left--;
}
ll s = 0;
for (auto z : st) {
s += z;
}
ans = max(s, ans);
rb++, lb++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ll cont[55];
f(n) cin >> cont[i];
ll ans = 0;
for (int i = 1; i <= min(k, n); i++) {
int lb = 0, rb = n - i;
while (lb <= i) {
multiset<ll> st;
for (int j = 0; j < n; j++) {
if (j < lb || j >= rb) {
st.insert(cont[j]);
}
}
int left = k - i;
/*for(auto z:st){
cout<<z<<' ';
}
cout<<left<<endl;*/
while (left && st.size()) {
if (*st.begin() > 0)
break;
st.erase(*st.begin());
left--;
}
ll s = 0;
for (auto z : st) {
s += z;
}
ans = max(s, ans);
rb++, lb++;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 843,570 | 843,571 | u308590217 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
int cont[55];
f(n) cin >> cont[i];
int ans = 0;
for (int i = 1; i <= min(k, n); i++) {
int lb = 0, rb = n - i;
while (lb <= i) {
set<int> st;
for (int j = 0; j < n; j++) {
if (j < lb || j >= rb) {
st.insert(cont[j]);
}
}
int left = k - i;
/*for(auto z:st){
cout<<z<<' ';
}
cout<<left<<endl;*/
while (left && st.size()) {
if (*st.begin() > 0)
break;
st.erase(*st.begin());
left--;
}
int s = 0;
for (auto z : st) {
s += z;
}
ans = max(s, ans);
rb++, lb++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ll cont[55];
f(n) cin >> cont[i];
ll ans = 0;
for (int i = 1; i <= min(k, n); i++) {
int lb = 0, rb = n - i;
while (lb <= i) {
multiset<ll> st;
for (int j = 0; j < n; j++) {
if (j < lb || j >= rb) {
st.insert(cont[j]);
}
}
int left = k - i;
/*for(auto z:st){
cout<<z<<' ';
}
cout<<left<<endl;*/
while (left && st.size()) {
if (*st.begin() > 0)
break;
st.erase(*st.begin());
left--;
}
ll s = 0;
for (auto z : st) {
s += z;
}
ans = max(s, ans);
rb++, lb++;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 843,572 | 843,571 | u308590217 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
int cont[55];
f(n) cin >> cont[i];
int ans = 0;
for (int i = 1; i <= min(k, 50); i++) {
int lb = 0, rb = n - i;
while (lb <= i) {
set<int> st;
for (int j = 0; j < n; j++) {
if (j < lb || j >= rb) {
st.insert(cont[j]);
}
}
int left = k - i;
/*for(auto z:st){
cout<<z<<' ';
}
cout<<left<<endl;*/
while (left && st.size()) {
if (*st.begin() > 0)
break;
st.erase(*st.begin());
left--;
}
int s = 0;
for (auto z : st) {
s += z;
}
ans = max(s, ans);
rb++, lb++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ll cont[55];
f(n) cin >> cont[i];
ll ans = 0;
for (int i = 1; i <= min(k, n); i++) {
int lb = 0, rb = n - i;
while (lb <= i) {
multiset<ll> st;
for (int j = 0; j < n; j++) {
if (j < lb || j >= rb) {
st.insert(cont[j]);
}
}
int left = k - i;
/*for(auto z:st){
cout<<z<<' ';
}
cout<<left<<endl;*/
while (left && st.size()) {
if (*st.begin() > 0)
break;
st.erase(*st.begin());
left--;
}
ll s = 0;
for (auto z : st) {
s += z;
}
ans = max(s, ans);
rb++, lb++;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 843,573 | 843,571 | u308590217 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.