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 |
|---|---|---|---|---|---|---|---|
p03062 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int num_neg = 0;
long sum = 0, min_abs = A[0];
bool is_exist_zero = false;
for (int i = 0; i < N; i++) {
if (A[i] < 0)
num_neg++;
else if (A[i] == 0)
is_exist_zero = true;
min_abs = min(min_abs, abs(A[i]));
sum += abs(A[i]);
}
if (is_exist_zero)
cout << sum << endl;
else {
if (num_neg % 2 == 0)
cout << sum << endl;
else
cout << sum - 2 * min_abs << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int num_neg = 0;
long sum = 0, min_abs = abs(A[0]);
bool is_exist_zero = false;
for (int i = 0; i < N; i++) {
if (A[i] < 0)
num_neg++;
else if (A[i] == 0)
is_exist_zero = true;
min_abs = min(min_abs, abs(A[i]));
sum += abs(A[i]);
}
if (is_exist_zero)
cout << sum << endl;
else {
if (num_neg % 2 == 0)
cout << sum << endl;
else
cout << sum - 2 * min_abs << endl;
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 876,210 | 876,211 | u785644520 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, i, mcount = 0, sum = 0, m = 1000000000;
cin >> N;
vector<int> A = vector<int>(N);
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
mcount++;
A[i] = -A[i];
}
sum += A[i];
m = min(m, A[i]);
}
if (mcount % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - m << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, i, mcount = 0, sum = 0, m = 1000000000;
cin >> N;
vector<int> A = vector<int>(N);
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
mcount++;
A[i] = -A[i];
}
sum += A[i];
m = min(m, A[i]);
}
// printf("sum = %lld\n", sum);
// printf("m = %lld\n", m);
if (mcount % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - 2 * m << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 876,217 | 876,218 | u208608367 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll N, ans, mini = 1e9, A, cnt;
bool ck = false;
int main() {
cin >> N;
rep(i, N) {
cin >> A;
if (!A)
ck = true;
else if (A < 0)
cnt++;
ans += abs(A);
if (A)
mini = min(mini, A);
}
if (cnt % 2 == 0 || ck) {
out(ans);
} else {
out(ans - mini * 2);
}
}
| #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll N, ans, mini = 1e9, A, cnt;
bool ck = false;
int main() {
cin >> N;
rep(i, N) {
cin >> A;
if (!A)
ck = true;
else if (A < 0)
cnt++;
ans += abs(A);
if (A)
mini = min(mini, abs(A));
}
if (cnt % 2 == 0 || ck) {
out(ans);
} else {
out(ans - mini * 2);
}
}
| [
"call.add",
"call.arguments.change"
] | 876,226 | 876,227 | u190907730 | cpp |
p03062 | #include <iostream>
using namespace std;
const int N(1e5 + 9);
int n, m, ans;
int a[N], f[N][2];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
f[1][0] = a[1];
f[1][1] = -a[1];
for (int i = 2; i <= n; i++) {
f[i][0] = max(f[i - 1][0] + a[i], f[i - 1][1] - a[i]);
f[i][1] = max(f[i - 1][0] - a[i], f[i - 1][1] + a[i]);
}
cout << f[n][0] << endl;
return 0;
} | #include <iostream>
using namespace std;
const int N(1e5 + 9);
int n, m;
long long ans;
long long a[N], f[N][2];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
f[1][0] = a[1];
f[1][1] = -a[1];
for (int i = 2; i <= n; i++) {
f[i][0] = max(f[i - 1][0] + a[i], f[i - 1][1] - a[i]);
f[i][1] = max(f[i - 1][0] - a[i], f[i - 1][1] + a[i]);
}
cout << f[n][0] << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,230 | 876,231 | u565904667 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N, a[100000] = {}, mini = 1000000001, count = 0, sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0)
count++;
mini = min(mini, abs(a[i]));
}
if (count % 2)
cout << sum - 2 * mini;
else
cout << sum;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long int N, a[100000] = {}, mini = 1000000001, count = 0, sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0)
count++;
mini = min(mini, abs(a[i]));
}
if (count % 2)
cout << sum - 2 * mini;
else
cout << sum;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 876,232 | 876,233 | u444349080 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0;
cin >> n;
long long a[n], m = 1e9 + 8;
long long int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
c++;
m = min(m, abs(a[i]));
s += abs(a[i]);
}
if (c % 2 == 1) {
cout << s - m;
} else {
cout << s;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0;
cin >> n;
long long a[n], m = 1e9 + 8;
long long int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
c++;
m = min(m, abs(a[i]));
s += abs(a[i]);
}
if (c % 2 == 1) {
cout << s - 2 * m;
} else {
cout << s;
}
return 0;
} | [
"expression.operation.binary.add"
] | 876,248 | 876,249 | u442799617 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0;
cin >> n;
int a[n], m = 1e9 + 8;
long long int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
c++;
m = min(m, abs(a[i]));
s += abs(a[i]);
}
if (c % 2 == 1) {
cout << s - m;
} else {
cout << s;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0;
cin >> n;
long long a[n], m = 1e9 + 8;
long long int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
c++;
m = min(m, abs(a[i]));
s += abs(a[i]);
}
if (c % 2 == 1) {
cout << s - 2 * m;
} else {
cout << s;
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,250 | 876,249 | u442799617 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int N = 2e5 + 10, inf = 1e9;
int main() {
long long N, zero = 0, plus = 0, minus = 0, ans = 0, mini = 1e9, tmp;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
zero++;
} else if (A[i] > 0) {
plus++;
} else {
minus++;
}
tmp = abs(A[i]);
mini = min(mini, tmp);
}
// cout << mini << endl;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
ans -= A[i];
} else {
ans += A[i];
}
}
if (zero > 0) {
cout << ans << endl;
} else {
if (minus % 2 == 1) {
ans -= mini;
}
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int N = 2e5 + 10, inf = 1e9;
int main() {
long long N, zero = 0, plus = 0, minus = 0, ans = 0, mini = 1e9, tmp;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
zero++;
} else if (A[i] > 0) {
plus++;
} else {
minus++;
}
tmp = abs(A[i]);
mini = min(mini, tmp);
}
// cout << minus << endl;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
ans -= A[i];
} else {
ans += A[i];
}
}
if (zero > 0) {
cout << ans << endl;
} else {
if (minus % 2 == 1) {
// cout << "OK" << endl;
ans -= mini * 2;
}
cout << ans << endl;
}
return 0;
}
| [
"assignment.change"
] | 876,253 | 876,254 | u379951749 | cpp |
p03062 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans = 0, n;
cin >> n;
ll a[n];
ll m = MAX;
ll k = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (m > abs(a[i])) {
k = i;
m = abs(a[i]);
}
}
for (int i = 0; i < k; i++) {
ans += abs(a[i]);
if (a[i] < 0)
a[i + 1] *= -1;
}
for (int i = k + 1; i < n; i++) {
ans += abs(a[i]);
if (a[i] < 0)
a[i - 1] *= -1;
}
ans += a[k];
dbg {
if (true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans = 0, n;
cin >> n;
ll a[n];
ll m = MAX;
ll k = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (m > abs(a[i])) {
k = i;
m = abs(a[i]);
}
}
for (int i = 0; i < k; i++) {
ans += abs(a[i]);
if (a[i] < 0)
a[i + 1] *= -1;
}
for (int i = n - 1; i > k; i--) {
ans += abs(a[i]);
if (a[i] < 0)
a[i - 1] *= -1;
}
ans += a[k];
dbg {
if (true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 876,257 | 876,258 | u828752458 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, ans = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 0) {
count += 1;
}
}
if (count % 2 == 0) {
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
a[i] = (-1) * a[i];
}
ans += a[i];
}
} else {
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
a[i] = (-1) * a[i];
}
ans += a[i];
}
sort(a.begin(), a.end());
ans -= 2 * a[0];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n, count = 0, ans = 0;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 0) {
count += 1;
}
}
if (count % 2 == 0) {
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
a[i] = (-1) * a[i];
}
ans += a[i];
}
} else {
ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
a[i] = (-1) * a[i];
}
ans += a[i];
}
sort(a.begin(), a.end());
ans -= 2 * a[0];
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"assignment.add"
] | 876,263 | 876,264 | u422725381 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
ab[i] = -1 * a[i];
result += -1 * a[i];
} else {
ab[i] = a[i];
result += a[i];
}
}
if (count % 2 == 0) {
cout << result << endl;
} else {
result -= (*min_element(ab.begin(), ab.end())) * (1);
cout << result << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
ab[i] = -1 * a[i];
result += -1 * a[i];
} else {
ab[i] = a[i];
result += a[i];
}
}
if (count % 2 == 0) {
cout << result << endl;
} else {
result -= (*min_element(ab.begin(), ab.end())) * (2);
cout << result << endl;
}
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 876,276 | 876,277 | u311517735 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
ab[i] = -1 * a[i];
result += -1 * a[i];
} else {
ab[i] = -a[i];
result += a[i];
}
}
if (count % 2 == 0) {
cout << result << endl;
} else {
result -= (*min_element(ab.begin(), ab.end())) * (1);
cout << result << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
ab[i] = -1 * a[i];
result += -1 * a[i];
} else {
ab[i] = a[i];
result += a[i];
}
}
if (count % 2 == 0) {
cout << result << endl;
} else {
result -= (*min_element(ab.begin(), ab.end())) * (2);
cout << result << endl;
}
return 0;
}
| [
"expression.operation.unary.arithmetic.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 876,278 | 876,277 | u311517735 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
ab[i] = -1 * a[i];
result += -1 * a[i];
} else {
ab[i] = -a[i];
result += a[i];
}
}
if (count % 2 == 0) {
cout << result << endl;
} else {
result -= (*min_element(ab.begin(), ab.end())) * (2);
cout << result << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
ab[i] = -1 * a[i];
result += -1 * a[i];
} else {
ab[i] = a[i];
result += a[i];
}
}
if (count % 2 == 0) {
cout << result << endl;
} else {
result -= (*min_element(ab.begin(), ab.end())) * (2);
cout << result << endl;
}
return 0;
}
| [
"expression.operation.unary.arithmetic.remove"
] | 876,279 | 876,277 | u311517735 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c, d, e, k, l, m, n, o = 0, p = -1, q, x, y, z, max1 = 0, ans = 0,
min1 = 1000000000;
string s, t, u;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
ans += max(a[i], a[i] * p);
if (a[i] < 0) {
o++;
}
min1 = min(min1, max(a[i], a[i] * p));
}
if (o % 2 == 1) {
ans -= min1;
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c, d, e, k, l, m, n, o = 0, p = -1, q, x, y, z, max1 = 0, ans = 0,
min1 = 1000000000;
string s, t, u;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
ans += max(a[i], a[i] * p);
if (a[i] < 0) {
o++;
}
min1 = min(min1, max(a[i], a[i] * p));
}
if (o % 2 == 1) {
ans -= min1 * 2;
}
cout << ans << endl;
}
| [
"assignment.change"
] | 876,280 | 876,281 | u953532675 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c, d, e, k, l, m, n, o = 0, p = -1, q, x, y, z, max1 = 0, ans = 0,
min1 = 1000000000;
string s, t, u;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
ans += max(a[i], a[i] * p);
if (a[i] < 0) {
o++;
}
min1 = min(min1, max(a[i], a[i] * p));
}
if (o % 2 != n % 2) {
ans -= min1;
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c, d, e, k, l, m, n, o = 0, p = -1, q, x, y, z, max1 = 0, ans = 0,
min1 = 1000000000;
string s, t, u;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
ans += max(a[i], a[i] * p);
if (a[i] < 0) {
o++;
}
min1 = min(min1, max(a[i], a[i] * p));
}
if (o % 2 == 1) {
ans -= min1 * 2;
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 876,282 | 876,281 | u953532675 | cpp |
p03062 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], v[n], f = 0, sum = 0, min = (int)1e9;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
f += 1;
v[i] = (a[i] > 0 ? -a[i] : a[i]);
sum += v[i];
if (v[i] < min)
min = v[i];
}
cout << sum - (f % 2 ? 2 * min : 0) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], v[n], f = 0, sum = 0, min = (int)1e9;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
f += 1;
v[i] = (a[i] > 0 ? a[i] : -a[i]);
sum += v[i];
if (v[i] < min)
min = v[i];
}
cout << sum - (f % 2 ? 2 * min : 0) << endl;
return 0;
} | [
"expression.operation.unary.arithmetic.remove",
"expression.operation.unary.add"
] | 876,303 | 876,304 | u084335038 | cpp |
p03062 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], v[n], f = 0, sum = 0, min = (int)1e9;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
f += 1;
v[i] = (a[i] > 0 ? -a[i] : a[i]);
sum += v[i];
if (v[i] < min)
min = v[i];
}
cout << sum - (f % 2 ? 2 * min : 0) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], v[n], f = 0, sum = 0, min = (int)1e9;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
f += 1;
v[i] = (a[i] > 0 ? a[i] : -a[i]);
sum += v[i];
if (v[i] < min)
min = v[i];
}
cout << sum - (f % 2 ? 2 * min : 0) << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.unary.arithmetic.remove",
"expression.operation.unary.add"
] | 876,305 | 876,304 | u084335038 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int cnt = 0;
long long sum = 0;
unsigned long long absmin = 99999999999;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
cnt++;
if (abs(A[i]) < absmin)
absmin = A[i];
sum += abs(A[i]);
}
if (cnt % 2)
cout << sum - 2 * absmin << endl;
else
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int cnt = 0;
long long sum = 0;
long long absmin = 99999999999;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
cnt++;
if (abs(A[i]) < absmin)
absmin = abs(A[i]);
sum += abs(A[i]);
}
if (cnt % 2)
cout << sum - 2 * absmin << endl;
else
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.narrow.change",
"call.add",
"call.arguments.change"
] | 876,312 | 876,313 | u577599930 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
int i, j, c = 0, m = 0, ans = 0;
vector<int> v, w;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
v.push_back(j);
w.push_back(abs(j));
if (j < 0)
m++;
}
sort(w.begin(), w.end());
for (i = 0; i < n; i++) {
ans = ans + w[i];
}
cout << (m % 2 == 0 ? ans : ans - 2 * w[0]) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
long long int n;
long long int i, j, c = 0, m = 0, ans = 0;
vector<long long int> v, w;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
v.push_back(j);
w.push_back(abs(j));
if (j < 0)
m++;
}
sort(w.begin(), w.end());
for (i = 0; i < n; i++) {
ans = ans + w[i];
}
cout << (m % 2 == 0 ? ans : ans - 2 * w[0]) << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 876,314 | 876,315 | u060467857 | cpp |
p03062 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
long tmp;
vector<long> A;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.push_back(tmp);
}
sort(A.begin(), A.end());
// 要素数が奇数か偶数か
int L = A.size();
//偶数
if (L % 2 == 0) {
// cout << accumulate(A.begin(),A.end(), 0) << endl;
for (int i = 0; i < N - 1; i = i + 2) {
if (A[i] + A[i + 1] < 0) {
A[i] = -A[i];
A[i + 1] = -A[i + 1];
}
}
}
// 奇数
else if (L % 2 == 1) {
// cout << accumulate(A.begin(),A.end(), 0) << endl;
for (int i = 0; i < N - 1; i = i + 2) {
if (A[i] + A[i + 1] < 0) {
A[i] = -A[i];
A[i + 1] = -A[i + 1];
}
}
}
long ans = accumulate(A.begin(), A.end(), 0);
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
long tmp;
vector<long> A;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.push_back(tmp);
}
sort(A.begin(), A.end());
// 要素数が奇数か偶数か
int L = A.size();
//偶数
if (L % 2 == 0) {
// cout << accumulate(A.begin(),A.end(), 0) << endl;
for (int i = 0; i < N - 1; i = i + 2) {
if (A[i] + A[i + 1] < 0) {
A[i] = -A[i];
A[i + 1] = -A[i + 1];
}
}
}
// 奇数
else if (L % 2 == 1) {
// cout << accumulate(A.begin(),A.end(), 0) << endl;
for (int i = 0; i < N - 1; i = i + 2) {
if (A[i] + A[i + 1] < 0) {
A[i] = -A[i];
A[i + 1] = -A[i + 1];
}
}
}
long ans = accumulate(A.begin(), A.end(), 0LL);
cout << ans << endl;
return 0;
}
| [
"literal.number.type.widen.change"
] | 876,318 | 876,319 | u021111120 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n, A[200000], ans = 0, a, b = 1e9, x = 0;
cin >> n;
rep(i, n) {
cin >> A[i], a = abs(A[i]), ans += a, b = min(a, b);
if (A[i] < 0)
x++;
}
if (x % 2 == 0)
cout << ans;
else
cout << ans - a * 2;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n, A[200000], ans = 0, a, b = 1e9, x = 0;
cin >> n;
rep(i, n) {
cin >> A[i], a = abs(A[i]), ans += a, b = min(a, b);
if (A[i] < 0)
x++;
}
if (x % 2 == 0)
cout << ans;
else
cout << ans - b * 2;
} | [
"identifier.change",
"io.output.change"
] | 876,322 | 876,323 | u441296840 | cpp |
p03062 | #include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main(void) {
int n;
cin >> n;
long long x, p = 0, m = 0, min = LLONG_MAX, sum = 0;
bool haszero = false;
rep(i, n) {
cin >> x;
sum += abs(x);
if (x == 0)
haszero = true;
if (!haszero) {
if (min > x)
min = x;
if (x > 0)
p++;
else
m++;
}
}
if (haszero || m % 2 == 0)
cout << sum;
else
cout << sum - 2 * min;
return 0;
} | #include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main(void) {
int n;
cin >> n;
long long x, p = 0, m = 0, min = LLONG_MAX, sum = 0;
bool haszero = false;
rep(i, n) {
cin >> x;
sum += abs(x);
if (x == 0)
haszero = true;
if (!haszero) {
if (min > abs(x))
min = abs(x);
if (x > 0)
p++;
else
m++;
}
}
if (haszero || m % 2 == 0)
cout << sum;
else
cout << sum - 2 * min;
return 0;
} | [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 876,324 | 876,325 | u130128796 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[111111];
long long int ans = 0;
long long int cnt = 0;
long long int p = 1 << 120;
cin >> n;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0)
cnt++;
p = min(p, abs(a[i]));
}
if (cnt % 2 == 1)
ans -= 2 * p;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[111111];
long long int ans = 0;
long long int cnt = 0;
long long int p = 1 << 30;
cin >> n;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0)
cnt++;
p = min(p, abs(a[i]));
}
// cout << cnt << " " << ans << " " << p << endl;
if (cnt % 2 == 1)
ans -= 2 * p;
cout << ans << endl;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 876,328 | 876,329 | u915069855 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long int sum = 0;
bool b = true;
cin >> n;
vector<long long int> num(n);
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
num[i] = a;
}
for (int i = 0; i < n - 1; i++) {
if (num[i] < 0) {
num[i] = num[i] * -1;
num[i + 1] = num[i + 1] * -1;
}
}
if (num[n - 1] < 0) {
b = false;
}
for (int i = 0; i < n; i++) {
num[i] = abs(num[i]);
}
sort(num.begin(), num.end());
if (b) {
for (int i = 1; i < n; i++) {
sum = sum + num[i];
}
cout << sum - num[0];
} else {
for (int i = 0; i < n; i++) {
sum = sum + num[i];
}
cout << sum;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long int sum = 0;
bool b = false;
cin >> n;
vector<long long int> num(n);
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
num[i] = a;
}
for (int i = 0; i < n - 1; i++) {
if (num[i] < 0) {
num[i] = num[i] * -1;
num[i + 1] = num[i + 1] * -1;
}
}
if (num[n - 1] < 0) {
b = true;
}
for (int i = 0; i < n; i++) {
num[i] = abs(num[i]);
}
sort(num.begin(), num.end());
if (b) {
for (int i = 1; i < n; i++) {
sum = sum + num[i];
}
cout << sum - num[0];
} else {
for (int i = 0; i < n; i++) {
sum = sum + num[i];
}
cout << sum;
}
} | [
"misc.opposites",
"variable_declaration.value.change",
"assignment.value.change"
] | 876,330 | 876,331 | u906095123 | cpp |
p03062 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum = sum + abs(A[i]);
}
long MIN = 10000000000;
int count = 0;
for (int i = 0; i < N; i++) {
MIN = min(MIN, abs(A[i]));
if (A[i] < 0) {
count = count + 1;
}
}
if (count % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - MIN * 2 << endl;
}
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long sum = 0;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum = sum + abs(A[i]);
}
long MIN = 10000000000;
int count = 0;
for (int i = 0; i < N; i++) {
MIN = min(MIN, abs(A[i]));
if (A[i] < 0) {
count = count + 1;
}
}
if (count % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - MIN * 2 << endl;
}
} | [
"variable_declaration.type.primitive.change"
] | 876,337 | 876,338 | u673474826 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n, i, odd = 0;
ll tmp, a[100000], sum = 0, min = 1000000001;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
tmp = a[i] * -1;
odd++;
} else {
tmp = a[i];
}
sum += tmp;
if (min > tmp) {
min = tmp;
}
}
if (odd % 2 == 1)
cout << sum - min << endl;
else
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n, i, odd = 0;
ll tmp, a[100000], sum = 0, min = 1000000001;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
tmp = a[i] * -1;
odd++;
} else {
tmp = a[i];
}
sum += tmp;
if (min > tmp) {
min = tmp;
}
}
if (odd % 2 == 1)
cout << sum - min - min << endl;
else
cout << sum << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 876,345 | 876,346 | u516922881 | cpp |
p03062 | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
long double a[100001], c, n, z, x, mini = 999999999999;
long long s;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0)
s++;
mini = min(mini, abs(a[i]));
}
if (s % 2 != 0) {
x = 0;
for (int i = 1; i <= n; i++)
x += abs(a[i]);
cout << x - mini << endl;
} else {
x = 0;
for (int i = 1; i <= n; i++)
x += abs(a[i]);
cout << x << endl;
}
}
| #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
long long a[100001], c, n, z, x, mini = 999999999999;
long long s;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0)
s++;
mini = min(mini, abs(a[i]));
}
if (s % 2 != 0) {
x = 0;
for (int i = 1; i <= n; i++)
x += abs(a[i]);
cout << x - (2 * mini) << endl;
} else {
x = 0;
for (int i = 1; i <= n; i++)
x += abs(a[i]);
cout << x << endl;
}
}
| [
"variable_declaration.type.primitive.change"
] | 876,351 | 876,352 | u079802746 | cpp |
p03062 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define MAX_N (300005)
#define INF (1LL << 60)
#define EPS (1e-7)
#define DEBUG(x) cerr << #x << ":" << x << endl;
#define DEBUGVC(x) \
cerr << #x << ": "; \
for (auto p : (x)) \
cerr << p << " "; \
cerr << endl;
#define DEBUGVCP(x) \
for (auto p : (x)) \
cerr << #x << ": " << p.first << ", " << p.second << endl;
#define DEBUG2(x, y) \
cerr << #x << " : " << x << ", " << #y << " : " << y << endl;
#define DEBUG3(x, y, z) \
cerr << #x << " : " << x << ", " << #y << " : " << y << ", " << #z << " : " \
<< z << endl;
const int MOD = (int)1e9 + 7;
int gcd(int a, int b) {
// cout << a <<" "<< b << endl;
if (b == 0)
return a;
return gcd(b, a % b);
}
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int cntm = 0, sum = 0, mn = A[0];
for (int i = 0; i < N; i++) {
if (A[i] <= 0)
cntm++;
sum += abs(A[i]);
mn = min(mn, abs(A[i]));
}
if (cntm % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - 2 * mn << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define MAX_N (300005)
#define INF (1LL << 60)
#define EPS (1e-7)
#define DEBUG(x) cerr << #x << ":" << x << endl;
#define DEBUGVC(x) \
cerr << #x << ": "; \
for (auto p : (x)) \
cerr << p << " "; \
cerr << endl;
#define DEBUGVCP(x) \
for (auto p : (x)) \
cerr << #x << ": " << p.first << ", " << p.second << endl;
#define DEBUG2(x, y) \
cerr << #x << " : " << x << ", " << #y << " : " << y << endl;
#define DEBUG3(x, y, z) \
cerr << #x << " : " << x << ", " << #y << " : " << y << ", " << #z << " : " \
<< z << endl;
const int MOD = (int)1e9 + 7;
int gcd(int a, int b) {
// cout << a <<" "<< b << endl;
if (b == 0)
return a;
return gcd(b, a % b);
}
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int cntm = 0, sum = 0, mn = abs(A[0]);
for (int i = 0; i < N; i++) {
if (A[i] <= 0)
cntm++;
sum += abs(A[i]);
mn = min(mn, abs(A[i]));
}
// DEBUG3(cntm, sum, mn);
if (cntm % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - 2 * mn << endl;
}
} | [
"call.add",
"call.arguments.change"
] | 876,353 | 876,354 | u672541593 | cpp |
p03062 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
long int mn = 10000000000;
vector<long int> A;
for (int i = 0; i < N; ++i) {
long int a;
cin >> a;
if (a < 0)
count++;
if (mn > a)
mn = a;
A.push_back(abs(a));
}
long int ans = 0;
for (int i = 0; i < N; ++i) {
ans += A[i];
}
if (count % 2 == 1)
ans -= mn * 2;
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
long int mn = 10000000000;
vector<long int> A;
for (int i = 0; i < N; ++i) {
long int a;
cin >> a;
if (a < 0)
count++;
if (mn > abs(a))
mn = abs(a);
A.push_back(abs(a));
}
long int ans = 0;
for (int i = 0; i < N; ++i) {
ans += A[i];
}
if (count % 2 == 1)
ans -= mn * 2;
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 876,364 | 876,365 | u041282550 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
using namespace std;
int n;
const int maxn = 1e5 + 5;
typedef long long int ll;
ll a[maxn];
__int128 aa[maxn];
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) aa[i] = a[i];
int tot = 0;
rep(i, 1, n) if (aa[i] < 0) tot++;
__int128 ans = 0;
rep(i, 1, n) ans += abs(aa[i]);
if (tot & 1) {
__int128 ma = 0x7f7f7f7f7f7f7f7fll;
rep(i, 1, n) ma = min(ma, abs(aa[i]));
rep(i, 1, n) if (aa[i] == ma) {
ans -= 2 * abs(aa[i]);
break;
}
}
cout << ll(ans) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
using namespace std;
int n;
const int maxn = 1e5 + 5;
typedef long long int ll;
ll a[maxn];
__int128 aa[maxn];
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) aa[i] = a[i];
int tot = 0;
rep(i, 1, n) if (aa[i] < 0) tot++;
__int128 ans = 0;
rep(i, 1, n) ans += abs(aa[i]);
if (tot & 1) {
__int128 ma = 0x7f7f7f7f7f7f7f7fll;
rep(i, 1, n) ma = min(ma, abs(aa[i]));
rep(i, 1, n) if (abs(aa[i]) == ma) {
ans -= 2 * abs(aa[i]);
break;
}
}
cout << ll(ans) << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.add"
] | 876,368 | 876,369 | u149000153 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
using namespace std;
int n;
const int maxn = 1e5 + 5;
typedef long long int ll;
ll a[maxn];
__int128 aa[maxn];
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) aa[i] = a[i];
int tot = 0;
rep(i, 1, n) if (aa[i] < 0) tot++;
__int128 ans = 0;
rep(i, 1, n) ans += abs(aa[i]);
if (tot & 1) {
__int128 ma = 0x7f7f7f7f7f7f7f7fll;
rep(i, 1, n) ma = min(ma, abs(aa[i]));
rep(i, 1, n) if (aa[i] == ma) {
ans -= 2 * aa[i];
break;
}
}
cout << ll(ans) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
using namespace std;
int n;
const int maxn = 1e5 + 5;
typedef long long int ll;
ll a[maxn];
__int128 aa[maxn];
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) aa[i] = a[i];
int tot = 0;
rep(i, 1, n) if (aa[i] < 0) tot++;
__int128 ans = 0;
rep(i, 1, n) ans += abs(aa[i]);
if (tot & 1) {
__int128 ma = 0x7f7f7f7f7f7f7f7fll;
rep(i, 1, n) ma = min(ma, abs(aa[i]));
rep(i, 1, n) if (abs(aa[i]) == ma) {
ans -= 2 * abs(aa[i]);
break;
}
}
cout << ll(ans) << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 876,370 | 876,369 | u149000153 | cpp |
p03062 | /*input
11
-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000
-1000000000 1000000000 -1000000000 1000000000
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
int const mod = 1e9 + 7;
int power(int x, int y, int mod = 2e18) {
int ans = 1;
x %= mod;
while (y) {
if (y & 1)
ans = (x * ans) % mod;
x = (x * x) % mod;
y >>= 1;
}
return ans;
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int a[100010];
signed main() {
IOS;
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
if (a[i] < 0) {
bool f = 0;
for (int j = i + 1; j < n; j++) {
if (a[j] < 0) {
f = 1;
a[j] *= -1;
a[i] *= -1;
i = j;
break;
}
}
if (f == 1)
continue;
else {
int ind = i;
int ap = -a[i];
for (int j = i - 1; j >= 0; j--) {
if (a[j] < ap) {
ap = min(ap, a[j]);
ind = j;
}
}
for (int j = i + 1; j < n; j++) {
if (a[j] < ap) {
ap = min(ap, a[j]);
ind = j;
}
}
if (ind != i) {
a[ind] *= -1;
a[i] *= -1;
i = n;
break;
} else {
i = n;
break;
}
}
}
}
int sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | /*input
3
-6 -2 -5
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
int const mod = 1e9 + 7;
int power(int x, int y, int mod = 2e18) {
int ans = 1;
x %= mod;
while (y) {
if (y & 1)
ans = (x * ans) % mod;
x = (x * x) % mod;
y >>= 1;
}
return ans;
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int a[100010];
signed main() {
IOS;
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
bool f = 0;
for (int j = i + 1; j < n; j++) {
if (a[j] < 0) {
f = 1;
a[j] *= -1;
a[i] *= -1;
i = j;
break;
}
}
if (f == 1)
continue;
else {
int ind = i;
int ap = -a[i];
for (int j = i - 1; j >= 0; j--) {
if (a[j] < ap) {
ap = min(ap, a[j]);
ind = j;
}
}
for (int j = i + 1; j < n; j++) {
if (a[j] < ap) {
ap = min(ap, a[j]);
ind = j;
}
}
if (ind != i) {
a[ind] *= -1;
a[i] *= -1;
i = n;
break;
} else {
i = n;
break;
}
}
}
}
int sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 876,377 | 876,378 | u367694521 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
std::cin >> n;
vector<int> a((int)n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int sum = 0;
int minVal = 0;
int count = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 0) {
++count;
a[i] *= -1;
}
sum += a[i];
if (i == 0)
minVal = a[i];
else
minVal = min(a[i], minVal);
}
int ans = 0;
if (count % 2 == 0) {
ans = sum;
} else {
ans = sum - 2 * minVal;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
std::cin >> n;
vector<ll> a((int)n);
for (int i = 0; i < n; ++i)
cin >> a[i];
ll sum = 0;
ll minVal = 0;
ll count = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 0) {
++count;
a[i] *= -1;
}
sum += a[i];
if (i == 0)
minVal = a[i];
else
minVal = min(a[i], minVal);
}
ll ans = 0;
if (count % 2 == 0) {
ans = sum;
} else {
ans = sum - 2 * minVal;
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 876,387 | 876,388 | u728134648 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long *A = new long[N];
long sum = 0;
bool oddflag = false;
long m = 1000000005;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] > 0) {
sum += A[i];
} else {
oddflag = !oddflag;
sum -= A[i];
}
m = min(m, abs(m));
}
if (oddflag) {
sum -= m * 2;
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long *A = new long[N];
long sum = 0;
bool oddflag = false;
long m = 1000000005;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] > 0) {
sum += A[i];
} else {
oddflag = !oddflag;
sum -= A[i];
}
m = min(m, abs(A[i]));
}
if (oddflag) {
sum -= m * 2;
}
cout << sum << endl;
return 0;
} | [
"assignment.value.change",
"call.arguments.change"
] | 876,391 | 876,392 | u793275002 | cpp |
p03062 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
int Aodd = 0;
ll A;
ll Amin = 1000000000;
ll ans;
// input
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
if (A < 0) {
Aodd++;
A *= -1;
}
if (Amin > A) {
Amin = A;
}
ans += A;
}
if (Aodd % 2 == 0) {
cout << ans << endl;
} else {
cout << ans - (2 * Amin) << endl;
}
return 0;
}
| #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
int Aodd = 0;
ll A;
ll Amin = 1000000000;
ll ans = 0;
// input
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
if (A < 0) {
Aodd++;
A *= -1;
}
if (Amin > A) {
Amin = A;
}
ans += A;
}
if (Aodd % 2 == 0) {
cout << ans << endl;
} else {
cout << ans - (2 * Amin) << endl;
}
return 0;
}
| [
"variable_declaration.value.change"
] | 876,406 | 876,407 | u332258971 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
vector<ll> A;
void solve() {
ll res = 0, cnt = 0;
bool zero = false;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
cnt++;
}
if (A[i] == 0) {
zero = true;
}
}
for (int i = 0; i < N; i++) {
res += abs(A[i]);
}
if (cnt % 2 == 1 || !zero) {
{
ll Amin = 10000000000;
for (int i = 0; i < N; i++) {
Amin = min(Amin, abs(A[i]));
}
res -= 2 * Amin;
}
}
cout << res << "\n";
return;
}
int main() {
cin >> N;
A.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
vector<ll> A;
void solve() {
ll res = 0, cnt = 0;
bool zero = false;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
cnt++;
}
if (A[i] == 0) {
zero = true;
}
}
for (int i = 0; i < N; i++) {
res += abs(A[i]);
}
if (!(cnt % 2 == 0 || zero)) {
{
ll Amin = 10000000000;
for (int i = 0; i < N; i++) {
Amin = min(Amin, abs(A[i]));
}
res -= 2 * Amin;
}
}
cout << res << "\n";
return;
}
int main() {
cin >> N;
A.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
solve();
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"expression.operation.unary.logical.remove"
] | 876,413 | 876,414 | u319242216 | cpp |
p03062 | #include "bits/stdc++.h"
using namespace std;
int main() {
long long cnt = 0;
bool flag = false;
long long MIN = pow(10, 9);
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
cnt++;
MIN = min(MIN, abs(A[i]));
} else if (A[i] > 0) {
MIN = min(MIN, A[i]);
} else if (A[i] == 0)
flag = true;
}
long long sum = 0;
for (int i = 0; i < N; i++)
sum += abs(A[i]);
if (cnt % 2 == 0)
cout << sum << endl;
else {
if (flag)
cout << sum << endl;
else
cout << sum - MIN << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
long long cnt = 0;
bool flag = false;
long long MIN = pow(10, 9);
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
cnt++;
MIN = min(MIN, abs(A[i]));
} else if (A[i] > 0) {
MIN = min(MIN, A[i]);
} else if (A[i] == 0)
flag = true;
}
long long sum = 0;
for (int i = 0; i < N; i++)
sum += abs(A[i]);
if (cnt % 2 == 0)
cout << sum << endl;
else {
if (flag)
cout << sum << endl;
else
cout << sum - 2 * MIN << endl;
}
} | [
"expression.operation.binary.add"
] | 876,415 | 876,416 | u365956698 | cpp |
p03062 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned ui;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, int> d_i;
typedef pair<double, double> d_d;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
#ifdef DEBUG
#define dprintf printf
#define dputs puts
#define dout(x) cout << #x " = " << (x) << endl
#define darray(x, n) \
{ \
int i; \
rep(i, n) cout << #x "[" << i << "] = " << *((x) + i) << endl; \
}
#define dloop(i, s, g) for (int(i) = (s); (i) < (g); (i)++)
#define drep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define dstop() scanf("%*c")
#else
#define dprintf (1) ? 0 : printf
#define dputs (1) ? 0 : puts
#define dout(x)
#define darray(x, n)
#define dloop(i, s, g) \
if (int i = 0) { \
} else
#define drep(i, n) \
if (int i = 0) { \
} else
#define dstop()
#endif
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define loop(i, s, g) for ((i) = (s); (i) < (g); (i)++)
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define in(T, ...) \
T __VA_ARGS__; \
impl(__VA_ARGS__)
#define array(T, id, n) \
T id[(n)]; \
for (int i = 0; i < (n); i++) \
cin >> id[i]
#define putv(n) cout << (n) << endl
//#define int long long
#ifndef int
#define INF __INT32_MAX__
#else
#define INF __INT64_MAX__
#endif
void impl(){};
template <typename T, typename... TS> void impl(T &head, TS &...tail) {
cin >> head;
impl(tail...);
}
signed main(void) {
in(int, n);
unsigned long long a[112345] = {};
long long b[112345] = {};
long long m = 1123456789;
int minInd = -1;
int count = 0;
int i;
rep(i, n) {
in(long long, x);
if (x < 0) {
x = abs(x);
count++;
}
b[i] = x;
if (x < m) {
m = x;
minInd = i;
}
a[i + 1] = a[i] + x;
dout(m);
}
if (count % 2 == 1) {
dputs("ひいたよ");
dout(a[n]);
a[n] -= b[minInd];
}
putv(a[n]);
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned ui;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, int> d_i;
typedef pair<double, double> d_d;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
#ifdef DEBUG
#define dprintf printf
#define dputs puts
#define dout(x) cout << #x " = " << (x) << endl
#define darray(x, n) \
{ \
int i; \
rep(i, n) cout << #x "[" << i << "] = " << *((x) + i) << endl; \
}
#define dloop(i, s, g) for (int(i) = (s); (i) < (g); (i)++)
#define drep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define dstop() scanf("%*c")
#else
#define dprintf (1) ? 0 : printf
#define dputs (1) ? 0 : puts
#define dout(x)
#define darray(x, n)
#define dloop(i, s, g) \
if (int i = 0) { \
} else
#define drep(i, n) \
if (int i = 0) { \
} else
#define dstop()
#endif
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define loop(i, s, g) for ((i) = (s); (i) < (g); (i)++)
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define in(T, ...) \
T __VA_ARGS__; \
impl(__VA_ARGS__)
#define array(T, id, n) \
T id[(n)]; \
for (int i = 0; i < (n); i++) \
cin >> id[i]
#define putv(n) cout << (n) << endl
//#define int long long
#ifndef int
#define INF __INT32_MAX__
#else
#define INF __INT64_MAX__
#endif
void impl(){};
template <typename T, typename... TS> void impl(T &head, TS &...tail) {
cin >> head;
impl(tail...);
}
signed main(void) {
in(int, n);
unsigned long long a[112345] = {};
long long b[112345] = {};
long long m = 1123456789;
int minInd = -1;
int count = 0;
int i;
rep(i, n) {
in(long long, x);
if (x < 0) {
x = abs(x);
count++;
}
b[i] = x;
if (x < m) {
m = x;
minInd = i;
}
a[i + 1] = a[i] + x;
dout(m);
}
if (count % 2 == 1) {
dputs("ひいたよ");
dout(a[n]);
a[n] -= b[minInd] * 2;
}
putv(a[n]);
return 0;
}
| [
"assignment.change"
] | 876,419 | 876,420 | u132159708 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int num_odd_negative = 0;
int num_even_negative = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
if (i % 2 == 0) {
num_odd_negative += 1;
} else {
num_even_negative += 1;
}
}
}
long int all_abs_sum = 0;
for (int i = 0; i < N; i++) {
all_abs_sum += std::abs(A[i]);
A[i] = std::abs(A[i]);
}
if ((num_even_negative + num_odd_negative) % 2 == 0) {
cout << all_abs_sum << endl;
} else {
cout << int(all_abs_sum - *std::min_element(A.begin(), A.end()) * 2)
<< endl;
}
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int num_odd_negative = 0;
int num_even_negative = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
if (i % 2 == 0) {
num_odd_negative += 1;
} else {
num_even_negative += 1;
}
}
}
long long int all_abs_sum = 0;
for (int i = 0; i < N; i++) {
all_abs_sum += std::abs(A[i]);
A[i] = std::abs(A[i]);
}
if ((num_even_negative + num_odd_negative) % 2 == 0) {
cout << all_abs_sum << endl;
} else {
cout << all_abs_sum - *std::min_element(A.begin(), A.end()) * 2 << endl;
}
} | [
"variable_declaration.type.widen.change",
"call.remove",
"call.arguments.change"
] | 876,425 | 876,426 | u860597287 | cpp |
p03062 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int64_t n;
cin >> n;
vector<int64_t> a(n);
int64_t count_minus = 0;
int64_t min;
int64_t sum = 0;
int64_t res;
for (int64_t i = 0; i < n; ++i) {
if (i == 0)
min = a[i];
cin >> a[i];
if (a[i] < 0) {
++count_minus;
}
int64_t b;
b = a[i];
if (a[i] < 0)
b = -b;
sum += b;
if (i == 0) {
min = b;
} else {
if (min > b)
min = b;
}
}
// cerr << "sum is " << sum << ", min is " << min << endl;;
if ((count_minus % 2) == 1) {
res = sum - min;
} else {
res = sum;
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int64_t n;
cin >> n;
vector<int64_t> a(n);
int64_t count_minus = 0;
int64_t min;
int64_t sum = 0;
int64_t res;
for (int64_t i = 0; i < n; ++i) {
if (i == 0)
min = a[i];
cin >> a[i];
if (a[i] < 0) {
++count_minus;
}
int64_t b;
b = a[i];
if (a[i] < 0)
b = -b;
sum += b;
if (i == 0) {
min = b;
} else {
if (min > b)
min = b;
}
}
// cerr << "sum is " << sum << ", min is " << min << endl;;
if ((count_minus % 2) == 1) {
res = sum - min * 2;
} else {
res = sum;
}
cout << res << endl;
return 0;
}
| [
"assignment.change"
] | 876,427 | 876,428 | u729166490 | cpp |
p03062 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define pq priority_queue
#define mp make_pair
#define cauto const auto &
#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) ((int)(x).size())
#define clr(ar, val) memset(ar, val, sizeof(ar))
typedef long long int64;
typedef long long lint;
typedef long long lli;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> pint;
typedef pair<long, long> plong;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;
const int iinf = 1 << 29;
const long long linf = 1ll << 61;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> ll sized_subset(T &comb) {
T x = comb & -comb, y = x + comb;
return ((comb & ~y) / x) >> 1 | y;
}
ll abso(ll s) { return (s > 0) ? s : -s; }
int main() {
ll s, n, count = 0, ans = 0, mini = 1000000000;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> s;
if (s < 0) {
count++;
}
ans += abso(s);
mini = min(mini, abso(s));
}
if (count % 2 == 1) {
ans -= mini;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define pq priority_queue
#define mp make_pair
#define cauto const auto &
#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) ((int)(x).size())
#define clr(ar, val) memset(ar, val, sizeof(ar))
typedef long long int64;
typedef long long lint;
typedef long long lli;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> pint;
typedef pair<long, long> plong;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;
const int iinf = 1 << 29;
const long long linf = 1ll << 61;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> ll sized_subset(T &comb) {
T x = comb & -comb, y = x + comb;
return ((comb & ~y) / x) >> 1 | y;
}
ll abso(ll s) { return (s > 0) ? s : -s; }
int main() {
ll s, n, count = 0, ans = 0, mini = 1000000000;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> s;
if (s < 0) {
count++;
}
ans += abso(s);
mini = min(mini, abso(s));
}
if (count % 2 == 1) {
ans -= 2 * mini;
}
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 876,431 | 876,432 | u678631835 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
bool k[114514];
ll a;
ll mi = 10000000000;
ll ans = 0;
for (ll i = 0; i < n; i++) {
cin >> a;
if (a >= 0) {
k[i] = true;
} else {
k[i] = false;
}
mi = min(mi, a);
ans += abs(a);
}
for (ll i = 0; i < n - 1; i++) {
if (k[i] == false) {
k[i] = true;
if (k[i + 1] == true)
k[i + 1] = false;
else
k[i + 1] = true;
}
}
if (k[n - 1] == false) {
cout << ans - mi * 2 << endl;
} else {
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
bool k[114514];
ll a;
ll mi = 10000000000;
ll ans = 0;
for (ll i = 0; i < n; i++) {
cin >> a;
if (a >= 0) {
k[i] = true;
} else {
k[i] = false;
}
mi = min(mi, abs(a));
ans += abs(a);
}
for (ll i = 0; i < n - 1; i++) {
if (k[i] == false) {
k[i] = true;
if (k[i + 1] == true)
k[i + 1] = false;
else
k[i + 1] = true;
}
}
if (k[n - 1] == false) {
cout << ans - mi * 2 << endl;
} else {
cout << ans << endl;
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 876,455 | 876,456 | u033620890 | cpp |
p03062 | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
long long int count = 0;
for (int i = 0; i < n - 1; i++) {
if (vec.at(i) < 0) {
count++;
vec.at(i) = vec.at(i) * -1;
}
}
sort(vec.begin(), vec.end());
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += vec.at(i);
}
if (count % 2 == 0) {
cout << ans << endl;
} else {
cout << ans - vec.at(0) * 2 << endl;
}
}
| #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
long long int count = 0;
for (int i = 0; i < n; i++) {
if (vec.at(i) < 0) {
count++;
vec.at(i) = vec.at(i) * -1;
}
}
sort(vec.begin(), vec.end());
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += vec.at(i);
}
if (count % 2 == 0) {
cout << ans << endl;
} else {
cout << ans - vec.at(0) * 2 << endl;
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 876,461 | 876,462 | u132284673 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 100000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
double euclid_distance(double a, double b) { return sqrt(a * a + b * b); }
int gcd(long long int a, long long int b) {
long long int r;
if (a < b) {
int tmp;
tmp = a;
a = b;
b = tmp;
}
while (r != 0) {
r = a % b;
a = b;
b = r;
}
return r;
}
void Integer_factorization(ll factor[], ll n) {
ll a = 2;
bool flag = false;
for (int p = 2; p * p <= n; p++) {
while (n % p == 0) {
n /= p;
factor[p]++;
}
}
if (n != 1)
factor[n]++; // prime num
}
void ys() { cout << "Yes" << endl; }
void yb() { cout << "YES" << endl; }
void ns() { cout << "No" << endl; }
void nb() { cout << "NO" << endl; }
void solve(void) {
ll n;
cin >> n;
ll a[n];
ll count = 0;
rep(i, 0, n) {
cin >> a[i];
if (a[i] < 0)
count++;
}
ll ans = 0;
rep(i, 0, n) ans += abs(a[i]);
if (count % 2 == 0) {
cout << ans << endl;
} else { //絶対値が最小のものを引く
ll m = INF;
rep(i, 0, n) m = min(m, abs(a[i]));
cout << ans - m << endl;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 100000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
double euclid_distance(double a, double b) { return sqrt(a * a + b * b); }
int gcd(long long int a, long long int b) {
long long int r;
if (a < b) {
int tmp;
tmp = a;
a = b;
b = tmp;
}
while (r != 0) {
r = a % b;
a = b;
b = r;
}
return r;
}
void Integer_factorization(ll factor[], ll n) {
ll a = 2;
bool flag = false;
for (int p = 2; p * p <= n; p++) {
while (n % p == 0) {
n /= p;
factor[p]++;
}
}
if (n != 1)
factor[n]++; // prime num
}
void ys() { cout << "Yes" << endl; }
void yb() { cout << "YES" << endl; }
void ns() { cout << "No" << endl; }
void nb() { cout << "NO" << endl; }
void solve(void) {
ll n;
cin >> n;
ll a[n];
ll count = 0;
rep(i, 0, n) {
cin >> a[i];
if (a[i] < 0)
count++;
}
ll ans = 0;
rep(i, 0, n) ans += abs(a[i]);
if (count % 2 == 0) {
cout << ans << endl;
} else { //絶対値が最小のものを引く
ll m = INF;
rep(i, 0, n) m = min(m, abs(a[i]));
cout << ans - 2 * m << endl;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| [
"expression.operation.binary.add"
] | 876,477 | 876,478 | u843974324 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++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;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
ll n;
ll a[100010];
cin >> n;
REP(i, n) cin >> a[i];
ll ans = 0;
REP(i, n) ans += abs(a[i]);
ll min = a[0];
ll cnt = 0;
REP(i, n) {
if (a[i] <= 0)
cnt++;
}
REP(i, n) {
if (abs(a[i]) < min) {
min = abs(a[i]);
}
}
// cerr<<ans<<" "<<min<<endl;
if (cnt % 2 == 0) {
cout << ans << endl;
} else
cout << ans - 2 * min << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++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;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
ll n;
ll a[100010];
cin >> n;
REP(i, n) cin >> a[i];
ll ans = 0;
REP(i, n) ans += abs(a[i]);
ll min = abs(a[0]);
ll cnt = 0;
REP(i, n) {
if (a[i] <= 0)
cnt++;
}
REP(i, n) {
if (abs(a[i]) < min) {
min = abs(a[i]);
}
}
// cerr<<ans<<" "<<min<<endl;
if (cnt % 2 == 0) {
cout << ans << endl;
} else {
// cerr<<min<<endl;
cout << ans - 2 * min << endl;
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 876,481 | 876,482 | u074445770 | cpp |
p03062 | #include <bits/stdc++.h>
#define maxn 500005
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fu(i, l, r) for (int i = (l); i <= (r); i++)
#define fd(i, l, r) for (int i = (l); i >= (r); i--)
#define Set set<int>
using namespace std;
#define Inf 2e8
#define int long long
#define P pair<int, int>
int n, m, a[maxn], b[maxn];
int z[maxn], y[maxn];
int32_t main() {
IOS;
cin >> n;
int sum = 0, fu = 0;
int W = Inf;
fu(i, 1, n) {
cin >> a[i];
if (a[i] < 0)
fu++;
sum += abs(a[i]);
W = min(abs(a[i]), W);
}
if (n == 1) {
cout << abs(a[1]);
return 0;
}
if (fu % 2)
cout << sum - W;
else
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
#define maxn 500005
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fu(i, l, r) for (int i = (l); i <= (r); i++)
#define fd(i, l, r) for (int i = (l); i >= (r); i--)
#define Set set<int>
using namespace std;
#define Inf 2e8
#define int long long
#define P pair<int, int>
int n, m, a[maxn], b[maxn];
int z[maxn], y[maxn];
int32_t main() {
IOS;
cin >> n;
int sum = 0, fu = 0;
int W = Inf;
fu(i, 1, n) {
cin >> a[i];
if (a[i] < 0)
fu++;
sum += abs(a[i]);
W = min(abs(a[i]), W);
}
if (n == 1) {
cout << abs(a[1]);
return 0;
}
if (fu % 2)
cout << sum - 2 * W;
else
cout << sum;
return 0;
}
| [
"expression.operation.binary.add"
] | 876,489 | 876,490 | u020160935 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
bool isminus(long long i) { return i < 0; }
bool absmin(long long i, long long j) { return abs(i) < abs(j); }
long long abssum(vector<long long> &A) {
long long sum = 0LL;
for (long long &i : A) {
sum += abs(i);
}
return sum;
}
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (long long &i : A)
cin >> i;
int minus = count_if(A.begin(), A.end(), isminus);
if (minus % 2 == 0)
cout << abssum(A) << endl;
else {
long long two = 2;
cout << abssum(A) - two * *min_element(A.begin(), A.end(), absmin) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
bool isminus(long long i) { return i < 0; }
bool absmin(long long i, long long j) { return abs(i) < abs(j); }
long long abssum(vector<long long> &A) {
long long sum = 0LL;
for (long long &i : A) {
sum += abs(i);
}
return sum;
}
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (long long &i : A)
cin >> i;
int minus = count_if(A.begin(), A.end(), isminus);
if (minus % 2 == 0)
cout << abssum(A) << endl;
else {
long long two = 2;
cout << abssum(A) - two * abs(*min_element(A.begin(), A.end(), absmin))
<< endl;
}
} | [
"call.add",
"call.arguments.change"
] | 876,491 | 876,492 | u826764011 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
ll mi(ll a, ll b) { return a < b ? a : b; }
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, neg = 0;
ll res = 0, m = 0, tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp < 0LL) {
neg++;
tmp *= (ll)-1LL;
res += tmp;
m = mi(tmp, m);
} else {
res += tmp;
m = mi(tmp, m);
}
}
if (neg & 1)
res -= 2LL * m;
cout << res << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
ll mi(ll a, ll b) { return a < b ? a : b; }
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, neg = 0;
ll res = 0, m = 1E10, tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp < 0LL) {
neg++;
tmp *= (ll)-1LL;
res += tmp;
m = mi(tmp, m);
} else {
res += tmp;
m = mi(tmp, m);
}
}
if (neg & 1)
res -= 2LL * m;
cout << res << "\n";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 876,493 | 876,494 | u696526733 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n;
cin >> n;
vector<ll> v(n);
ll s = 0, count = 0, m = INF;
for (int i = 0; i < n; i++) {
cin >> v[i];
count += (v[i] < 0);
m = min(m, abs(v[i]));
s += abs(v[i]);
}
cout << ((count % 2 == 0) ? s : s - m) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n;
cin >> n;
vector<ll> v(n);
ll s = 0, count = 0, m = INF;
for (int i = 0; i < n; i++) {
cin >> v[i];
count += (v[i] < 0);
m = min(m, abs(v[i]));
s += abs(v[i]);
}
cout << ((count % 2 == 0) ? s : s - m * 2) << endl;
}
| [
"expression.operation.binary.add"
] | 876,501 | 876,502 | u561186440 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], i, k = 0, s = 0;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
if (a[i] < 0) {
a[i] = 0 - a[i];
k++;
}
}
if (k % 2 == 0) {
for (i = 1; i <= n; i++)
s = s + a[i];
} else {
sort(a + 1, a + n + 1);
for (i = 2; i <= n; i++) {
s = s + a[i];
}
s = s - a[1];
}
cout << s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n], i, k = 0, s = 0;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
if (a[i] < 0) {
a[i] = 0 - a[i];
k++;
}
}
if (k % 2 == 0) {
for (i = 1; i <= n; i++)
s = s + a[i];
} else {
sort(a + 1, a + n + 1);
for (i = 2; i <= n; i++) {
s = s + a[i];
}
s = s - a[1];
}
cout << s;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,530 | 876,531 | u311737408 | cpp |
p03062 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; --i)
#define REPC(i, obj) for (auto i : obj)
#define ALL(obj) (obj).begin(), (obj).end()
#define SETP(n) cout << fixed << setprecision(n)
#define VV(T, h, w) vector<vector<T>>(h, vector<T>(w))
#define VVI(T, h, w, i) vector<vector<T>>(h, vector<T>(w, i))
using namespace std;
using ll = long long;
template <typename T = ll> inline T in() {
T ret;
cin >> ret;
return ret;
}
int main() {
ll n = in();
vector<ll> a(n);
ll micn = 0;
REP(i, n) {
ll foo = in();
if (foo < 0)
++micn;
a[i] = foo;
}
sort(ALL(a), [](ll a, ll b) { return abs(a) < abs(b); });
ll sum = 0;
REP(i, n) sum += abs(a[i]);
if (micn % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - a[0] * 2 << endl;
}
} | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; --i)
#define REPC(i, obj) for (auto i : obj)
#define ALL(obj) (obj).begin(), (obj).end()
#define SETP(n) cout << fixed << setprecision(n)
#define VV(T, h, w) vector<vector<T>>(h, vector<T>(w))
#define VVI(T, h, w, i) vector<vector<T>>(h, vector<T>(w, i))
using namespace std;
using ll = long long;
template <typename T = ll> inline T in() {
T ret;
cin >> ret;
return ret;
}
int main() {
ll n = in();
vector<ll> a(n);
ll micn = 0;
REP(i, n) {
ll foo = in();
if (foo < 0)
++micn;
a[i] = foo;
}
sort(ALL(a), [](ll a, ll b) { return abs(a) < abs(b); });
ll sum = 0;
REP(i, n) sum += abs(a[i]);
if (micn % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - abs(a[0]) * 2 << endl;
}
} | [
"call.add",
"call.arguments.change"
] | 876,532 | 876,533 | u388817534 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long MOD = 998244353;
const long long INF = 1LL << 60;
const int inf = pow(10, 9) + 7;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, int B) { return (A + (B - 1)) / B; }
long long divCeil(int A, long long B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, long long B) { return (A + (B - 1)) / B; }
int main() {
int N;
cin >> N;
vector<long long> A(N);
long long sum = 0;
long long minus = 0;
long long min = INF;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
A.at(i) = a;
sum += abs(a);
if (a < 0)
minus++;
chmin(min, abs(a));
}
long long ans;
if (minus % 2 == 0)
ans = sum;
else
ans = sum - min;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long MOD = 998244353;
const long long INF = 1LL << 60;
const int inf = pow(10, 9) + 7;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, int B) { return (A + (B - 1)) / B; }
long long divCeil(int A, long long B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, long long B) { return (A + (B - 1)) / B; }
int main() {
int N;
cin >> N;
vector<long long> A(N);
long long sum = 0;
long long minus = 0;
long long min = INF;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
A.at(i) = a;
sum += abs(a);
if (a < 0)
minus++;
chmin(min, abs(a));
}
long long ans;
if (minus % 2 == 0)
ans = sum;
else
ans = sum - min * 2;
cout << ans << endl;
} | [
"assignment.change"
] | 876,534 | 876,535 | u811472478 | cpp |
p03062 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
ll modpow(ll n, ll k) {
if (k == 1) {
return n;
} else if (k == 0) {
return 1;
} else if (k % 2 == 0) {
ll memo = modpow(n, k / 2) % MOD;
return memo * memo % MOD;
} else {
return n * modpow(n, k - 1) % MOD;
}
}
int main() {
int n;
cin >> n;
ll a[n];
ll minusCount = 0;
ll minNum = INF;
bool zeroIs = false;
REP(i, n) {
cin >> a[i];
if (a[i] < 0)
minusCount++;
minNum = min((ll)INF, (ll)max(a[i], -1 * a[i]));
if (a[i] == 0)
zeroIs = true;
}
ll ans = 0;
REP(i, n) { ans += max(a[i], -1 * a[i]); }
if (zeroIs == false && minusCount % 2 == 1) {
ans -= minNum * 2;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
ll modpow(ll n, ll k) {
if (k == 1) {
return n;
} else if (k == 0) {
return 1;
} else if (k % 2 == 0) {
ll memo = modpow(n, k / 2) % MOD;
return memo * memo % MOD;
} else {
return n * modpow(n, k - 1) % MOD;
}
}
int main() {
int n;
cin >> n;
ll a[n];
ll minusCount = 0;
ll minNum = INF;
bool zeroIs = false;
REP(i, n) {
cin >> a[i];
if (a[i] < 0)
minusCount++;
minNum = min((ll)minNum, (ll)max(a[i], -1 * a[i]));
if (a[i] == 0)
zeroIs = true;
}
ll ans = 0;
REP(i, n) { ans += max(a[i], -1 * a[i]); }
if (zeroIs == false && minusCount % 2 == 1) {
ans -= minNum * 2;
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 876,542 | 876,543 | u118846704 | cpp |
p03062 | #include <bits/stdc++.h>
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i) cout << (i ? "Yes" : "No") << endl
#define yes(i) cout << (i ? "yes" : "no") << endl
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long cnt = 0;
long long ab = 0;
long long mi = 1e9 + 7;
bool f = false;
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
cnt++;
}
if (a[i] == 0) {
f = true;
}
mi = min(mi, abs(a[i]));
ab += abs(a[i]);
}
if (f && cnt % 2 == 0) {
cout << ab << endl;
} else {
cout << ab - mi - mi << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i) cout << (i ? "Yes" : "No") << endl
#define yes(i) cout << (i ? "yes" : "no") << endl
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long cnt = 0;
long long ab = 0;
long long mi = 1e9 + 7;
bool f = false;
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
cnt++;
}
if (a[i] == 0LL) {
f = true;
}
mi = min(mi, abs(a[i]));
ab += abs(a[i]);
}
if (f || cnt % 2 == 0) {
cout << ab << endl;
} else {
cout << ab - mi - mi << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 876,546 | 876,547 | u587366956 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, z = 0;
cin >> n;
long long t = 0, a, mini = 9999999999;
for (i = 0; i < n; i++) {
cin >> a;
if (a == 0) {
z++;
}
if (a < 0) {
a *= -1;
c++;
}
mini = min(a, mini);
t += a;
}
if (a % 2 == 1 && z == 0) {
t += -2 * mini;
}
cout << t;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, z = 0;
cin >> n;
long long t = 0, a, mini = 9999999999;
for (i = 0; i < n; i++) {
cin >> a;
if (a == 0) {
z++;
}
if (a < 0) {
a *= -1;
c++;
}
mini = min(a, mini);
t += a;
}
if (c % 2 == 1 && z == 0) {
t += -2 * mini;
}
cout << t;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 876,550 | 876,551 | u058348416 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, z = 0;
cin >> n;
long long t = 0, a, mini = 9999999999;
for (i = 0; i < n; i++) {
cin >> a;
if (a = 0) {
z++;
}
if (a < 0) {
a *= -1;
c++;
}
mini = min(a, mini);
t += a;
}
if (a % 2 == 1 && z == 0) {
t += -2 * mini;
}
cout << t;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, z = 0;
cin >> n;
long long t = 0, a, mini = 9999999999;
for (i = 0; i < n; i++) {
cin >> a;
if (a == 0) {
z++;
}
if (a < 0) {
a *= -1;
c++;
}
mini = min(a, mini);
t += a;
}
if (c % 2 == 1 && z == 0) {
t += -2 * mini;
}
cout << t;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 876,552 | 876,551 | u058348416 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
int n;
ll x[100100];
int main() {
ll sum = 0, a = 0;
for (int i = 0; i < n; i++) {
scanf("%lld", &x[i]);
if (x[i] < 0)
a++;
x[i] = abs(x[i]);
}
sort(x, x + n);
for (int i = 0; i < n; i++)
sum += x[i];
if (a % 2)
sum -= x[0] * 2;
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
int n;
ll x[100100];
int main() {
cin >> n;
ll sum = 0, a = 0;
for (int i = 0; i < n; i++) {
scanf("%lld", &x[i]);
if (x[i] < 0)
a++;
x[i] = abs(x[i]);
}
sort(x, x + n);
for (int i = 0; i < n; i++)
sum += x[i];
if (a % 2)
sum -= x[0] * 2;
cout << sum;
return 0;
}
| [] | 876,557 | 876,558 | u188000196 | cpp |
p03062 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <omp.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define eps 0.000001
#define LONG_INF 10000000000000
#define GOLD 1.61803398874989484820458
#define seg_size 65536 * 4
#define REP(i, n) for (long long i = 0; i < n; ++i)
unsigned long xor128() {
static unsigned long x = time(NULL), y = 362436069, z = 521288629,
w = 88675123;
unsigned long t = (x ^ (x << 11));
x = y;
y = z;
z = w;
return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
void solve(long long N, std::vector<long long> A) {
long long ans = 0;
long long minnest = 1000000000000;
long long go = 0;
REP(i, N) {
if (A[i] < 0) {
go++;
}
minnest = min(minnest, llabs(A[i]));
ans += llabs(A[i]);
}
if (go % 2 == 1) {
ans -= minnest;
}
cout << ans << endl;
}
// Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <omp.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define eps 0.000001
#define LONG_INF 10000000000000
#define GOLD 1.61803398874989484820458
#define seg_size 65536 * 4
#define REP(i, n) for (long long i = 0; i < n; ++i)
unsigned long xor128() {
static unsigned long x = time(NULL), y = 362436069, z = 521288629,
w = 88675123;
unsigned long t = (x ^ (x << 11));
x = y;
y = z;
z = w;
return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
void solve(long long N, std::vector<long long> A) {
long long ans = 0;
long long minnest = 1000000000000;
long long go = 0;
REP(i, N) {
if (A[i] < 0) {
go++;
}
minnest = min(minnest, llabs(A[i]));
ans += llabs(A[i]);
}
if (go % 2 == 1) {
ans -= 2 * minnest;
}
cout << ans << endl;
}
// Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| [
"assignment.change"
] | 876,559 | 876,560 | u545022164 | cpp |
p03062 | // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
// others
#include <cassert>
#include <ctime>
#include <functional>
#include <limits>
#include <random>
// type alias
using lint = long long;
using ldouble = long double;
template <class T>
using greater_priority_queue =
std::priority_queue<T, std::vector<T>, std::greater<T>>;
/* ----- class ----- */
template <class Cost = int> struct Edge {
int from, to;
Cost cost;
Edge(int from = -1, int to = -1, Cost cost = 1)
: from(from), to(to), cost(cost){};
bool operator<(const Edge<Cost> &e) const { return this->cost < e.cost; }
bool operator>(const Edge<Cost> &e) const { return this->cost > e.cost; }
};
template <class Cost = int> using Edges = std::vector<Edge<Cost>>;
template <class Cost = int> class Graph {
public:
int size;
std::vector<std::vector<Edge<Cost>>> path;
explicit Graph(int N = 0) : size(N), path(size) {}
void span(int from, int to, Cost cost = 1) {
path[from].push_back(Edge<Cost>(from, to, cost));
}
std::vector<Edge<Cost>> &operator[](int v) { return path[v]; }
};
/* ----- Output Functions for Debugging ----- */
template <class T> std::ostream &operator<<(std::ostream &os, std::vector<T> v);
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> v);
template <class L, class R>
std::ostream &operator<<(std::ostream &os, std::pair<L, R> p);
template <class K, class T>
std::ostream &operator<<(std::ostream &os, std::map<K, T> v);
template <class T> std::ostream &operator<<(std::ostream &os, std::stack<T> s);
template <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q);
template <class T>
std::ostream &operator<<(std::ostream &os, std::priority_queue<T> q);
template <class T>
std::ostream &
operator<<(std::ostream &os,
std::priority_queue<T, std::vector<T>, std::greater<T>> q);
template <class T> std::ostream &operator<<(std::ostream &os, Edge<T> e);
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> v) {
os << "{";
for (auto vv : v)
os << vv << ",";
return os << "}";
}
template <class L, class R>
std::ostream &operator<<(std::ostream &os, std::pair<L, R> p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <class K, class T>
std::ostream &operator<<(std::ostream &os, std::map<K, T> v) {
os << "{";
for (auto vv : v)
os << vv << ",";
return os << "}";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::stack<T> s) {
os << "[";
while (!s.empty()) {
os << s.top() << ",";
s.pop();
}
return os << "]";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q) {
os << "[";
while (!q.empty()) {
os << q.front() << ",";
q.pop();
}
return os << "]";
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::priority_queue<T> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
template <class T>
std::ostream &
operator<<(std::ostream &os,
std::priority_queue<T, std::vector<T>, std::greater<T>> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
template <class T> std::ostream &operator<<(std::ostream &os, Edge<T> e) {
return os << "(" << e.from << "->" << e.to << ":" << e.cost << ")";
}
/* ----- Short Functions ----- */
template <class T> inline T sq(T a) { return a * a; }
template <class T> inline T iceil(T n, T d) { return (n + d - 1) / d; }
template <class T> T gcd(T a, T b) {
while (b > 0) {
a %= b;
std::swap(a, b);
}
return a;
}
template <class T, class U> T ipow(T b, U n) {
T ret = 1;
while (n > 0) {
if (n & 1)
ret *= b;
n >>= 1;
b *= b;
}
return ret;
}
// 0-indexed
template <class T, class U> inline T kthbit(T a, U k) { return (a >> k) & 1; }
template <class T, class U> inline T mask(T a, U k) {
return a & ((1 << k) - 1);
}
template <class T> std::map<T, int> compress(std::vector<T> &v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(), v.end()), v.end());
std::map<T, int> rev;
for (int i = 0; i < v.size(); ++i)
rev[v[i]] = i;
return rev;
}
template <class T> T Vec(T v) { return v; }
template <class T, class... Ts> auto Vec(size_t l, Ts... ts) {
return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}
/* ----- Constants ----- */
// const int INF = std::numeric_limits<int>::max() / 3;
// const lint INF = std::numeric_limits<lint>::max() / 3;
// const ldouble PI = acos(-1);
// const ldouble EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));
using namespace std;
int main() {
int N;
cin >> N;
vector<lint> pos, neg;
for (int i = 0; i < N; ++i) {
lint A;
cin >> A;
(A >= 0 ? pos : neg).push_back(A);
}
sort(pos.begin(), pos.end());
sort(neg.rbegin(), neg.rend());
lint ans = accumulate(pos.begin(), pos.end(), 0LL);
while (neg.size() > 1) {
for (int i = 0; i < 2; ++i) {
ans -= neg.back();
neg.pop_back();
}
}
if (neg.empty()) {
cout << ans << endl;
} else if (pos.empty()) {
cout << ans + neg[0] << endl;
} else {
cout << max(ans + neg[0], ans - neg[0] - pos[0]) << endl;
}
return 0;
}
| // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
// others
#include <cassert>
#include <ctime>
#include <functional>
#include <limits>
#include <random>
// type alias
using lint = long long;
using ldouble = long double;
template <class T>
using greater_priority_queue =
std::priority_queue<T, std::vector<T>, std::greater<T>>;
/* ----- class ----- */
template <class Cost = int> struct Edge {
int from, to;
Cost cost;
Edge(int from = -1, int to = -1, Cost cost = 1)
: from(from), to(to), cost(cost){};
bool operator<(const Edge<Cost> &e) const { return this->cost < e.cost; }
bool operator>(const Edge<Cost> &e) const { return this->cost > e.cost; }
};
template <class Cost = int> using Edges = std::vector<Edge<Cost>>;
template <class Cost = int> class Graph {
public:
int size;
std::vector<std::vector<Edge<Cost>>> path;
explicit Graph(int N = 0) : size(N), path(size) {}
void span(int from, int to, Cost cost = 1) {
path[from].push_back(Edge<Cost>(from, to, cost));
}
std::vector<Edge<Cost>> &operator[](int v) { return path[v]; }
};
/* ----- Output Functions for Debugging ----- */
template <class T> std::ostream &operator<<(std::ostream &os, std::vector<T> v);
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> v);
template <class L, class R>
std::ostream &operator<<(std::ostream &os, std::pair<L, R> p);
template <class K, class T>
std::ostream &operator<<(std::ostream &os, std::map<K, T> v);
template <class T> std::ostream &operator<<(std::ostream &os, std::stack<T> s);
template <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q);
template <class T>
std::ostream &operator<<(std::ostream &os, std::priority_queue<T> q);
template <class T>
std::ostream &
operator<<(std::ostream &os,
std::priority_queue<T, std::vector<T>, std::greater<T>> q);
template <class T> std::ostream &operator<<(std::ostream &os, Edge<T> e);
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> v) {
os << "{";
for (auto vv : v)
os << vv << ",";
return os << "}";
}
template <class L, class R>
std::ostream &operator<<(std::ostream &os, std::pair<L, R> p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <class K, class T>
std::ostream &operator<<(std::ostream &os, std::map<K, T> v) {
os << "{";
for (auto vv : v)
os << vv << ",";
return os << "}";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::stack<T> s) {
os << "[";
while (!s.empty()) {
os << s.top() << ",";
s.pop();
}
return os << "]";
}
template <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q) {
os << "[";
while (!q.empty()) {
os << q.front() << ",";
q.pop();
}
return os << "]";
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::priority_queue<T> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
template <class T>
std::ostream &
operator<<(std::ostream &os,
std::priority_queue<T, std::vector<T>, std::greater<T>> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
template <class T> std::ostream &operator<<(std::ostream &os, Edge<T> e) {
return os << "(" << e.from << "->" << e.to << ":" << e.cost << ")";
}
/* ----- Short Functions ----- */
template <class T> inline T sq(T a) { return a * a; }
template <class T> inline T iceil(T n, T d) { return (n + d - 1) / d; }
template <class T> T gcd(T a, T b) {
while (b > 0) {
a %= b;
std::swap(a, b);
}
return a;
}
template <class T, class U> T ipow(T b, U n) {
T ret = 1;
while (n > 0) {
if (n & 1)
ret *= b;
n >>= 1;
b *= b;
}
return ret;
}
// 0-indexed
template <class T, class U> inline T kthbit(T a, U k) { return (a >> k) & 1; }
template <class T, class U> inline T mask(T a, U k) {
return a & ((1 << k) - 1);
}
template <class T> std::map<T, int> compress(std::vector<T> &v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(), v.end()), v.end());
std::map<T, int> rev;
for (int i = 0; i < v.size(); ++i)
rev[v[i]] = i;
return rev;
}
template <class T> T Vec(T v) { return v; }
template <class T, class... Ts> auto Vec(size_t l, Ts... ts) {
return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}
/* ----- Constants ----- */
// const int INF = std::numeric_limits<int>::max() / 3;
// const lint INF = std::numeric_limits<lint>::max() / 3;
// const ldouble PI = acos(-1);
// const ldouble EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));
using namespace std;
int main() {
int N;
cin >> N;
vector<lint> pos, neg;
for (int i = 0; i < N; ++i) {
lint A;
cin >> A;
(A >= 0 ? pos : neg).push_back(A);
}
sort(pos.begin(), pos.end());
sort(neg.rbegin(), neg.rend());
lint ans = accumulate(pos.begin(), pos.end(), 0LL);
while (neg.size() > 1) {
for (int i = 0; i < 2; ++i) {
ans -= neg.back();
neg.pop_back();
}
}
if (neg.empty()) {
cout << ans << endl;
} else if (pos.empty()) {
cout << ans + neg[0] << endl;
} else {
cout << max(ans + neg[0], ans - neg[0] - pos[0] * 2) << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 876,563 | 876,564 | u059727354 | cpp |
p03062 | #include <bits/stdc++.h>
using ll = long long;
int main() {
ll A = 0;
int N;
std::cin >> N;
std::vector<ll> add(N);
for (int i = 0; i < N; i++) {
ll B;
std::cin >> B;
A += A;
add[i] = (-B) - B;
}
std::sort(add.begin(), add.end(), std::greater<ll>());
ll ans = A;
for (int i = 0; i < N - 1; i += 2) {
ll p = add[i] + add[i + 1];
if (p > 0) {
ans += p;
}
}
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
int main() {
ll A = 0;
int N;
std::cin >> N;
std::vector<ll> add(N);
for (int i = 0; i < N; i++) {
ll B;
std::cin >> B;
A += B;
add[i] = (-B) - B;
}
std::sort(add.begin(), add.end(), std::greater<ll>());
ll ans = A;
for (int i = 0; i < N - 1; i += 2) {
ll p = add[i] + add[i + 1];
if (p > 0) {
ans += p;
}
}
std::cout << ans << std::endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 876,574 | 876,575 | u603303736 | cpp |
p03063 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 1e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
int main(void) {
ll N;
cin >> N;
string s;
cin >> s;
ll i;
ll loc = 0, roc = 0;
for (i = 0; i < N; i++) {
if (s[i] == 'o')
roc++;
}
ll ans = roc;
for (i = 0; i < N; i++) {
if (s[i] == 'o') {
loc++;
roc--;
}
chmin(ans, (i + 1 - loc) + roc);
}
pt(ans);
}
| #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 1e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
int main(void) {
ll N;
cin >> N;
string s;
cin >> s;
ll i;
ll loc = 0, roc = 0;
for (i = 0; i < N; i++) {
if (s[i] == '.')
roc++;
}
ll ans = roc;
for (i = 0; i < N; i++) {
if (s[i] == '.') {
loc++;
roc--;
}
chmin(ans, (i + 1 - loc) + roc);
}
pt(ans);
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 876,584 | 876,585 | u768152935 | cpp |
p03063 | #include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define lol long long
#define SUM(n) ((n) + 1) * (n) / 2
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) setprecision(x + 1)
#define abs(x, y) (max(x, y) - min(x, y))
#define all(v) v.begin(), v.end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const int MOD = int(1e9) + 7;
using namespace std;
using pii = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
int ans[200005] = {};
for (int i = n - 1; i > 0; i--) {
if (s[i] == '#') {
ans[i]++;
}
ans[i - 1] += ans[i];
}
int minv = INF, sum = 0;
rep(i, n) {
minv = min(minv, ans[i] + sum);
if (s[i] == '.') {
sum++;
}
}
cout << minv << '\n';
return 0;
}
| #include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define lol long long
#define SUM(n) ((n) + 1) * (n) / 2
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) setprecision(x + 1)
#define abs(x, y) (max(x, y) - min(x, y))
#define all(v) v.begin(), v.end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const int MOD = int(1e9) + 7;
using namespace std;
using pii = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
int ans[200005] = {};
for (int i = n - 1; i > 0; i--) {
if (s[i] == '.') {
ans[i]++;
}
ans[i - 1] += ans[i];
}
int minv = INF, sum = 0;
rep(i, n) {
minv = min(minv, ans[i + 1] + sum);
if (s[i] == '#') {
sum++;
}
}
cout << minv << '\n';
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 876,590 | 876,591 | u623468376 | cpp |
p03063 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int K[n + 1][2];
K[0][0] = 0;
K[0][1] = 0;
for (int i = 0; n > i; i++) {
if (s[i] == '.') {
K[i + 1][0] = K[i][0] + 1;
K[i + 1][1] = K[i][1];
} else {
K[i + 1][1] = K[i][1] + 1;
K[i + 1][0] = K[i][0];
}
}
int ans = n;
for (int i = 0; n > i; i++) {
ans = min(ans, K[i][1] + (K[n][0] - K[i][0]));
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int K[n + 1][2];
K[0][0] = 0;
K[0][1] = 0;
for (int i = 0; n > i; i++) {
if (s[i] == '.') {
K[i + 1][0] = K[i][0] + 1;
K[i + 1][1] = K[i][1];
} else {
K[i + 1][1] = K[i][1] + 1;
K[i + 1][0] = K[i][0];
}
}
int ans = n;
for (int i = 0; n >= i; i++) {
ans = min(ans, K[i][1] + (K[n][0] - K[i][0]));
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 876,596 | 876,597 | u466161487 | cpp |
p03063 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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; }
template <class c>
typename enable_if<sizeof dud<c>(0) != 1, debug &>::type operator<<(c i) {
cerr << boolalpha << i;
return *this;
}
template <class c, int = 0>
typename enable_if<sizeof dud<c>(0) == 1, debug &>::type operator<<(c i) {
return *this << 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 watch(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ((X) > 0 ? (X) : (-(X)))
#define S(X) ((X) * (X))
#define SZ(V) (int)V.size()
#define FORN(i, n) for (int i = 0; i < n; i++)
#define FORAB(i, a, b) for (int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C) ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))
// typedef int LL;
typedef long long int LL;
// typedef __int128 LLL;
typedef long long LLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL> VPL;
typedef vector<PII> VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef long double ld;
const LL MOD = 998244353;
int black[200005], white[200005];
char s[200005];
void solve(int ks) {
int n;
scanf("%d", &n);
scanf("%s", s + 1);
int len = strlen(s + 1);
for (int i = 1; i <= len; i++) {
white[i] = white[i - 1] + (s[i] == '.');
}
for (int i = len; i >= 1; i--) {
black[i] = black[i + 1] + (s[i] == '#');
}
int ans = len;
for (int i = 1; i <= len + 1; i++) {
ans = MIN(ans, white[i - 1] + black[i]);
}
printf("%d\n", ans);
}
int main() {
#ifdef LOCAL
double start_time = clock();
freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
// freopen("out.out", "w", stdout);
#endif
if (0) {
int T;
scanf("%d", &T);
// AIN(T, 1, 25);
for (int ks = 1; ks <= T; ks++) {
solve(ks);
fprintf(stderr, "%d done\n", ks);
}
} else {
solve(0);
}
#ifdef LOCAL
double end_time = clock();
fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);
#endif
return 0;
}
| //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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; }
template <class c>
typename enable_if<sizeof dud<c>(0) != 1, debug &>::type operator<<(c i) {
cerr << boolalpha << i;
return *this;
}
template <class c, int = 0>
typename enable_if<sizeof dud<c>(0) == 1, debug &>::type operator<<(c i) {
return *this << 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 watch(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ((X) > 0 ? (X) : (-(X)))
#define S(X) ((X) * (X))
#define SZ(V) (int)V.size()
#define FORN(i, n) for (int i = 0; i < n; i++)
#define FORAB(i, a, b) for (int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C) ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))
// typedef int LL;
typedef long long int LL;
// typedef __int128 LLL;
typedef long long LLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL> VPL;
typedef vector<PII> VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef long double ld;
const LL MOD = 998244353;
int black[200005], white[200005];
char s[200005];
void solve(int ks) {
int n;
scanf("%d", &n);
scanf("%s", s + 1);
int len = strlen(s + 1);
for (int i = 1; i <= len; i++) {
white[i] = white[i - 1] + (s[i] != '.');
}
for (int i = len; i >= 1; i--) {
black[i] = black[i + 1] + (s[i] != '#');
}
int ans = len;
for (int i = 1; i <= len + 1; i++) {
ans = MIN(ans, white[i - 1] + black[i]);
}
printf("%d\n", ans);
}
int main() {
#ifdef LOCAL
double start_time = clock();
freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
// freopen("out.out", "w", stdout);
#endif
if (0) {
int T;
scanf("%d", &T);
// AIN(T, 1, 25);
for (int ks = 1; ks <= T; ks++) {
solve(ks);
fprintf(stderr, "%d done\n", ks);
}
} else {
solve(0);
}
#ifdef LOCAL
double end_time = clock();
fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);
#endif
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 876,605 | 876,606 | u484505863 | cpp |
p03063 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if (n == 1) {
cout << 0 << endl;
return 0;
}
int sum[212345];
sum[0] = 0;
REP(i, n)
sum[i + 1] = sum[i] + (s[i] == '.');
int sum1[212345];
sum1[n] = 0;
for (int i = n - 1; i >= 0; i--) {
sum1[i] = sum1[i + 1] + (s[i] == '.');
}
int res = INT_MAX;
REP(i, n) {
int tmp = 0;
tmp += sum1[i + 1];
tmp += (i + 1) - sum[i + 1];
res = min(res, tmp);
}
res = min(res, sum[n - 1]);
cout << res << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if (n == 1) {
cout << 0 << endl;
return 0;
}
int sum[212345];
sum[0] = 0;
REP(i, n)
sum[i + 1] = sum[i] + (s[i] == '.');
int sum1[212345];
sum1[n] = 0;
for (int i = n - 1; i >= 0; i--) {
sum1[i] = sum1[i + 1] + (s[i] == '.');
}
int res = INT_MAX;
REP(i, n) {
int tmp = 0;
tmp += sum1[i + 1];
tmp += (i + 1) - sum[i + 1];
res = min(res, tmp);
}
res = min(res, sum[n]);
cout << res << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 876,651 | 876,652 | u423143252 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
int a[200005][2];
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 1; i <= n; ++i) {
a[i][0] = a[i - 1][0];
a[i][1] = a[i - 1][1];
if (s[i - 1] == '.')
a[i][0]++;
else
a[i][1]++;
}
int ans = a[n][0];
for (int i = 1; i <= n; ++i)
ans = min(ans, a[i][0] + a[n][1] - a[i][1]);
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a[200005][2];
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 1; i <= n; ++i) {
a[i][0] = a[i - 1][0];
a[i][1] = a[i - 1][1];
if (s[i - 1] == '.')
a[i][0]++;
else
a[i][1]++;
}
int ans = a[n][0];
for (int i = 1; i <= n; ++i)
ans = min(ans, a[i][1] + a[n][0] - a[i][0]);
cout << ans << '\n';
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 876,653 | 876,654 | u762148180 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#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 rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define puf push_front
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> void remove(T &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
ll ans = INF;
vei t(N + 1, 0);
rep(i, N) {
if (S[i] == '#')
t[i + 1] = t[i] + 1;
else
t[i + 1] = t[i];
}
rep(i, N) {
ll b = t[i];
ll w = (N - i) - (t[N] - t[i]);
ans = min(ans, b + w);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#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 rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define puf push_front
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> void remove(T &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
ll ans = INF;
vel t(N + 1, 0);
rep(i, N) {
if (S[i] == '#')
t[i + 1] = t[i] + 1;
else
t[i + 1] = t[i];
}
rep(i, N + 1) {
ll b = t[i];
ll w = (N - i) - (t[N] - t[i]);
ans = min(ans, b + w);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 876,665 | 876,666 | u263715385 | cpp |
p03063 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, sum = 0, num = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
sum++;
}
if (s[i] == '.' && sum > 0) {
num++;
sum--;
}
}
cout << min(sum, num) << endl;
cin >> n;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, sum = 0, num = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
sum++;
}
if (s[i] == '.' && sum > 0) {
num++;
sum--;
}
}
cout << num << endl;
cin >> n;
} | [
"call.remove",
"call.arguments.change"
] | 876,667 | 876,668 | u986568278 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N;
string s;
int white[222222];
int black[222222];
signed main() {
cin >> N >> s;
// 1を立てる
for (int i = 0; i < N; i++) {
white[i + 1] = s[i] == '.';
black[i + 1] = s[i] == '#';
}
// 累積を取る
for (int i = 0; i <= N; i++) {
black[i + 1] += black[i];
}
for (int i = N; i >= 1; i--) {
white[i - 1] += white[i];
}
int ans = 1e18;
for (int i = 0; i < N; i++) {
int t = black[i] + white[i + 1];
chmin(ans, t);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N;
string s;
int white[222222];
int black[222222];
signed main() {
cin >> N >> s;
// 1を立てる
for (int i = 0; i < N; i++) {
white[i + 1] = s[i] == '.';
black[i + 1] = s[i] == '#';
}
// 累積を取る
for (int i = 0; i <= N; i++) {
black[i + 1] += black[i];
}
for (int i = N; i >= 1; i--) {
white[i - 1] += white[i];
}
int ans = 1e18;
for (int i = 0; i <= N; i++) {
int t = black[i] + white[i + 1];
chmin(ans, t);
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 876,675 | 876,676 | u219873012 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); \
x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int(i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) \
cerr << "(" << #x << ", " << #y << ") = " \
<< "(" << x << ", " << y << ")" << endl;
#define dbg3(x, y, z) \
cerr << "(" << #x << ", " << #y << ", " << #z << ") = " \
<< "(" << x << ", " << y << ", " << z << ")" << endl;
#define dbgB(value, size) cerr << #value << ": " << bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> void print1(T begin, T end) {
while (begin != end) {
cout << (*begin) << " ";
*begin++;
}
cout << endl;
}
template <typename T> void print2(T Array, int height, int width) {
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
cout << " " << Array[i][j];
}
cout << endl;
}
}
void print() { std::cerr << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cerr << head << " ";
print(std::forward<Tail>(tail)...);
}
template <class T> void Add(T &a, const T &b, const T &mod = 1000000007) {
int val = ((a % mod) + (b % mod)) % mod;
if (val < 0) {
val += mod;
}
a = val;
}
template <typename X, typename T> auto vectors(X x, T a) {
return vector<T>(x, a);
}
template <typename X, typename Y, typename Z, typename... Zs>
auto vectors(X x, Y y, Z z, Zs... zs) {
auto cont = vectors(y, z, zs...);
return vector<decltype(cont)>(x, cont);
}
// ------------------------------------------------------------------------------------------
int N;
string s;
int white[222222];
int black[222222];
signed main() {
cin >> N >> s;
rep(i, N) {
white[i] = (s[i] == '.');
black[i] = (s[i] == '#');
}
repp(i, 1, N) { black[i] += black[i - 1]; }
for (int i = N - 2; i >= 0; i--) {
white[i] += white[i + 1];
}
print1(white, white + N + 1);
print1(black, black + N + 1);
int ans = 1e18;
for (int i = 0; i < N; i++) {
int t = black[i] + white[i + 1];
chmin(ans, t);
}
int hoge = count(all(s), '.');
cout << min(ans, hoge) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); \
x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int(i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) \
cerr << "(" << #x << ", " << #y << ") = " \
<< "(" << x << ", " << y << ")" << endl;
#define dbg3(x, y, z) \
cerr << "(" << #x << ", " << #y << ", " << #z << ") = " \
<< "(" << x << ", " << y << ", " << z << ")" << endl;
#define dbgB(value, size) cerr << #value << ": " << bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> void print1(T begin, T end) {
while (begin != end) {
cerr << (*begin) << " ";
*begin++;
}
cerr << endl;
}
template <typename T> void print2(T Array, int height, int width) {
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
cerr << " " << Array[i][j];
}
cerr << endl;
}
}
void print() { std::cerr << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cerr << head << " ";
print(std::forward<Tail>(tail)...);
}
template <class T> void Add(T &a, const T &b, const T &mod = 1000000007) {
int val = ((a % mod) + (b % mod)) % mod;
if (val < 0) {
val += mod;
}
a = val;
}
template <typename X, typename T> auto vectors(X x, T a) {
return vector<T>(x, a);
}
template <typename X, typename Y, typename Z, typename... Zs>
auto vectors(X x, Y y, Z z, Zs... zs) {
auto cont = vectors(y, z, zs...);
return vector<decltype(cont)>(x, cont);
}
// ------------------------------------------------------------------------------------------
int N;
string s;
int white[222222];
int black[222222];
signed main() {
cin >> N >> s;
rep(i, N) {
white[i] = (s[i] == '.');
black[i] = (s[i] == '#');
}
repp(i, 1, N) { black[i] += black[i - 1]; }
for (int i = N - 2; i >= 0; i--) {
white[i] += white[i + 1];
}
print1(white, white + N + 1);
print1(black, black + N + 1);
int ans = 1e18;
for (int i = 0; i < N; i++) {
int t = black[i] + white[i + 1];
chmin(ans, t);
}
int hoge = count(all(s), '.');
cout << min(ans, hoge) << endl;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 876,677 | 876,678 | u219873012 | cpp |
p03063 | #include <iostream>
#include <string>
#include <vector>
typedef long long LL;
constexpr char kBlack = '#';
constexpr char kWhite = '.';
int main() {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
int white = 0;
for (char c : S) {
if (c == kWhite)
++white;
}
int max_cnt = white;
int black = 0;
for (char c : S) {
if (c == kWhite)
--white;
else
++black;
max_cnt = std::max(white + black, max_cnt);
}
std::cout << max_cnt << std::endl;
}
| #include <iostream>
#include <string>
#include <vector>
typedef long long LL;
constexpr char kBlack = '#';
constexpr char kWhite = '.';
int main() {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
int white = 0;
for (char c : S) {
if (c == kWhite)
++white;
}
int min_cnt = white;
int black = 0;
for (char c : S) {
if (c == kWhite)
--white;
else
++black;
min_cnt = std::min(white + black, min_cnt);
}
std::cout << min_cnt << std::endl;
}
| [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"misc.opposites",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 876,679 | 876,680 | u116523315 | cpp |
p03063 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
int white[n] = {};
int black[n] = {};
rep(i, n) {
if (i == 0) {
if (s[i] == '#') {
black[i] = 1;
}
} else {
black[i] = black[i - 1];
if (s[i] == '#') {
black[i]++;
}
}
}
drep(i, n) {
if (i == n - 1) {
if (s[i] == '.') {
white[i] = 1;
}
} else {
white[i] - white[i + 1];
if (s[i] == '.') {
white[i]++;
}
}
}
ans = black[n - 1];
rep(i, n - 1) { ans = min(ans, black[i] + white[i + 1]); }
ans = min(ans, white[0]);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
int white[n] = {};
int black[n] = {};
rep(i, n) {
if (i == 0) {
if (s[i] == '#') {
black[i] = 1;
}
} else {
black[i] = black[i - 1];
if (s[i] == '#') {
black[i]++;
}
}
}
drep(i, n) {
if (i == n - 1) {
if (s[i] == '.') {
white[i] = 1;
}
} else {
white[i] = white[i + 1];
if (s[i] == '.') {
white[i]++;
}
}
}
ans = black[n - 1];
rep(i, n - 1) { ans = min(ans, black[i] + white[i + 1]); }
ans = min(ans, white[0]);
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.change"
] | 876,687 | 876,688 | u791593901 | cpp |
p03063 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int st[200002];
st[0] = 0;
for (int i = 1; i <= N; i++) {
st[i] = st[i - 1];
char c;
cin >> c;
if (c == '#')
st[i]++;
}
int ans = 10000000;
for (int i = 0; i <= N; i++) {
int k = i - st[i] + st[N] - st[i];
if (ans > k)
ans = k;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int st[200002];
st[0] = 0;
for (int i = 1; i <= N; i++) {
st[i] = st[i - 1];
char c;
cin >> c;
if (c == '.')
st[i]++;
}
int ans = 10000000;
for (int i = 0; i <= N; i++) {
int k = i - st[i] + st[N] - st[i];
// cout << k << endl;
if (ans > k)
ans = k;
}
cout << ans << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 876,699 | 876,700 | u058186113 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
bool seen = false;
int n;
int ans = 0;
char c[212123];
int w[212123];
int b[212123];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 0; i < n; i++) {
w[i + 1] = w[i] + (c[i] == '.');
}
for (int i = n; i; i--) {
b[i - 1] = b[i] + (c[i] == '#');
}
ans = n;
for (int i = 0; i <= n; i++) {
ans = min(ans, w[i] + b[i]);
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
bool seen = false;
int n;
int ans = 0;
char c[212123];
int w[212123];
int b[212123];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 0; i < n; i++) {
w[i + 1] = w[i] + (c[i] == '#');
}
for (int i = n; i; i--) {
b[i - 1] = b[i] + (c[i] == '.');
}
ans = n;
for (int i = 0; i <= n; i++) {
// cout << w[i] << ' ' << b[i] << '\n';
ans = min(ans, w[i] + b[i]);
}
cout << ans << '\n';
return 0;
}
| [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 876,707 | 876,708 | u619673623 | cpp |
p03063 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define all(x) (x).begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
bool debug = false;
/*---------------------------------------------------*/
int main() {
int N;
string S;
cin >> N >> S;
vector<int> black(N + 1, 0), white(N + 1, 0);
for (int i = 0; i < N; i++) {
black[i + 1] = black[i];
white[i + 1] = white[i];
if (S[i] == '#')
black[i + 1]++;
else
white[i + 1]++;
}
int ans = INT_MAX;
for (int i = 0; i < N; i++) {
ans = min(ans, black[i] + white[N] - white[i]);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define all(x) (x).begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
bool debug = false;
/*---------------------------------------------------*/
int main() {
int N;
string S;
cin >> N >> S;
vector<int> black(N + 1, 0), white(N + 1, 0);
for (int i = 0; i < N; i++) {
black[i + 1] = black[i];
white[i + 1] = white[i];
if (S[i] == '#')
black[i + 1]++;
else
white[i + 1]++;
}
int ans = INT_MAX;
for (int i = 0; i < N + 1; i++) {
ans = min(ans, black[i] + white[N] - white[i]);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 876,729 | 876,730 | u587248350 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int a = 0, l = 0;
int result = 0;
for (char c : s) {
if (c == '.')
a++;
}
result = a;
for (int i = 0; i < n - 1; i++) {
if (s[i] == '#')
l++;
else
a--;
result = min(result, a + l);
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int a = 0, l = 0;
int result = 0;
for (char c : s) {
if (c == '.')
a++;
}
result = a;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
l++;
else
a--;
result = min(result, a + l);
}
cout << result << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 876,731 | 876,732 | u809458301 | cpp |
p03062 | #include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define all(x) (x).begin(), (x).end()
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define pb push_back
#define fore(i, a) for (auto &i : a)
#define rrep(i, m, n) for (int i = m; i >= n; --i)
#define INF INT_MAX / 2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge {
ll from;
ll to;
ll cost;
};
ll dp[101010][2];
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
dp[0][0] = a[0];
dp[0][1] = -a[0];
rep(i, 0, n) {
dp[i][0] = max(dp[i - 1][0] + a[i], dp[i - 1][1] - a[i]);
dp[i][1] = max(dp[i - 1][0] - a[i], dp[i - 1][1] + a[i]);
}
cout << dp[n - 1][0] << endl;
return 0;
} |
#include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define all(x) (x).begin(), (x).end()
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define pb push_back
#define fore(i, a) for (auto &i : a)
#define rrep(i, m, n) for (int i = m; i >= n; --i)
#define INF INT_MAX / 2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge {
ll from;
ll to;
ll cost;
};
ll dp[101010][2];
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
dp[0][0] = a[0];
dp[0][1] = -a[0];
rep(i, 1, n) {
dp[i][0] = max(dp[i - 1][0] + a[i], dp[i - 1][1] - a[i]);
dp[i][1] = max(dp[i - 1][0] - a[i], dp[i - 1][1] + a[i]);
}
cout << dp[n - 1][0] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 876,761 | 876,762 | u724732842 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int cnt = 0; //負の数が奇数のとき1になる
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
cnt = 1 - cnt;
}
}
long abs_sum = 0;
for (int i = 0; i < N; i++) {
abs_sum = abs_sum + abs(A.at(i));
}
long ans;
if (!cnt) {
ans = abs_sum;
} else { //絶対値のminを知りたい
long abs_min = 10 ^ 9;
for (int i = 0; i < N; i++) {
abs_min = min(abs_min, abs(A.at(i)));
}
ans = abs_sum - 2 * abs_min;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int cnt = 0; //負の数が奇数のとき1になる
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
cnt = 1 - cnt;
}
}
long abs_sum = 0;
for (int i = 0; i < N; i++) {
abs_sum = abs_sum + abs(A.at(i));
}
long ans;
if (!cnt) {
ans = abs_sum;
} else { //絶対値のminを知りたい
long abs_min = pow(10, 9);
for (int i = 0; i < N; i++) {
abs_min = min(abs_min, abs(A.at(i)));
}
ans = abs_sum - 2 * abs_min;
}
cout << ans << endl;
} | [
"call.add",
"expression.operation.binary.change",
"call.arguments.change"
] | 876,763 | 876,764 | u824310141 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int cnt = 0; //負の数が奇数のとき1になる
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
cnt = 1 - cnt;
}
}
long abs_sum = 0;
for (int i = 0; i < N; i++) {
abs_sum = abs_sum + abs(A.at(i));
}
long ans;
if (!cnt) {
ans = abs_sum;
} else { //絶対値のminを知りたい
int abs_min = 10 ^ 9;
for (int i = 0; i < N; i++) {
abs_min = min(abs_min, abs(A.at(i)));
}
ans = abs_sum - 2 * abs_min;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int cnt = 0; //負の数が奇数のとき1になる
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
cnt = 1 - cnt;
}
}
long abs_sum = 0;
for (int i = 0; i < N; i++) {
abs_sum = abs_sum + abs(A.at(i));
}
long ans;
if (!cnt) {
ans = abs_sum;
} else { //絶対値のminを知りたい
long abs_min = pow(10, 9);
for (int i = 0; i < N; i++) {
abs_min = min(abs_min, abs(A.at(i)));
}
ans = abs_sum - 2 * abs_min;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"call.add",
"expression.operation.binary.change",
"call.arguments.change"
] | 876,765 | 876,764 | u824310141 | cpp |
p03062 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, tmp = 0;
cin >> N;
vector<long> A(N);
long sum = 0;
for (long &i : A) {
cin >> i;
if (i < 0)
++tmp;
sum += labs(i);
}
if (tmp % 2) {
sort(A.begin(), A.end(),
[](long &a, long &b) -> bool { return labs(a) < labs(b); });
cout << sum - 2 * A[0];
} else
cout << sum;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, tmp = 0;
cin >> N;
vector<long> A(N);
long sum = 0;
for (long &i : A) {
cin >> i;
if (i < 0)
++tmp;
sum += labs(i);
}
if (tmp % 2) {
sort(A.begin(), A.end(),
[](long &a, long &b) -> bool { return labs(a) < labs(b); });
cout << sum - 2 * labs(A[0]);
} else
cout << sum;
} | [
"call.add",
"call.arguments.change"
] | 876,766 | 876,767 | u102795616 | cpp |
p03062 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
//#define pp pair<pii,pii>
const int hell = 1000000007;
int power(int a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
int t = power(a, b / 2);
t %= hell;
t *= t;
t %= hell;
if (b % 2)
return (t * a) % hell;
else
return t;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b - a % b, a % b);
}
int digitsum(int x) {
while (x > 9) {
int ans = 0;
while (x != 0) {
ans += x % 10;
x /= 10;
}
x = ans;
}
return x;
}
int pw(int a, int b) {
int x = a;
rep(i, 1, b) { a = a * x; }
return a;
}
int solve() {
int n;
cin >> n;
vi a(n);
int b[n + 1] = {0};
int c[n + 1] = {0};
int su = 0;
int count = 0, mn = hell;
rep(i, 0, n) {
cin >> a[i];
su += abs(a[i]);
if (a[i] < 0) {
count++;
}
mn = min(mn, abs(a[i]));
}
if (count % 2) {
su -= mn;
}
cout << su;
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
// sieve();
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
int k = 1;
while (t--) {
// cout<<"case #"<<k<<":"<<" ";k++;
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
//#define pp pair<pii,pii>
const int hell = 1000000007;
int power(int a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
int t = power(a, b / 2);
t %= hell;
t *= t;
t %= hell;
if (b % 2)
return (t * a) % hell;
else
return t;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b - a % b, a % b);
}
int digitsum(int x) {
while (x > 9) {
int ans = 0;
while (x != 0) {
ans += x % 10;
x /= 10;
}
x = ans;
}
return x;
}
int pw(int a, int b) {
int x = a;
rep(i, 1, b) { a = a * x; }
return a;
}
int solve() {
int n;
cin >> n;
vi a(n);
int b[n + 1] = {0};
int c[n + 1] = {0};
int su = 0;
int count = 0, mn = hell;
rep(i, 0, n) {
cin >> a[i];
su += abs(a[i]);
if (a[i] < 0) {
count++;
}
mn = min(mn, abs(a[i]));
}
if (count % 2) {
su -= 2 * mn;
}
cout << su;
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
// sieve();
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
int k = 1;
while (t--) {
// cout<<"case #"<<k<<":"<<" ";k++;
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| [
"assignment.change"
] | 876,768 | 876,769 | u240509821 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a[n];
long ans = 0;
long minus = 0;
long syou = 10000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0) {
minus++;
}
syou = min(syou, a[i]);
}
if (minus % 2 == 0) {
cout << ans << endl;
} else {
cout << ans - 2 * syou << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a[n];
long ans = 0;
long minus = 0;
long syou = 10000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0) {
minus++;
}
syou = min(syou, abs(a[i]));
}
if (minus % 2 == 0) {
cout << ans << endl;
} else {
cout << ans - 2 * syou << endl;
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 876,776 | 876,777 | u833295869 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
template <typename T> void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
#define OutaN(x) \
do { \
size_t i, len = sizeof(x) / sizeof(__typeof(x[0])) - 1; \
for (i = 0; i < len; i++) \
cout << x[i] << " "; \
cout << x[len] << '\n'; \
} while (0);
template <typename T> void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout.precision(18);
long n;
cin >> n;
ll a[n];
ll x;
ll total = 0;
ll minus = 0;
ll zero = 0;
ll ans, sum;
long i;
rep(i, n) {
cin >> x;
if (x < 0) {
minus++;
a[i] = x * -1;
} else {
a[i] = x;
}
total += a[i];
}
if (minus % 2 == 0) {
Out(total);
} else {
rep(i, n) {
sum = total - (a[i] * 2);
Max(ans, sum);
}
Out(ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
template <typename T> void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
#define OutaN(x) \
do { \
size_t i, len = sizeof(x) / sizeof(__typeof(x[0])) - 1; \
for (i = 0; i < len; i++) \
cout << x[i] << " "; \
cout << x[len] << '\n'; \
} while (0);
template <typename T> void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout.precision(18);
long n;
cin >> n;
ll a[n];
ll x;
ll total = 0;
ll minus = 0;
ll zero = 0;
ll ans = 0;
ll sum;
long i;
rep(i, n) {
cin >> x;
if (x < 0) {
minus++;
a[i] = x * -1;
} else {
a[i] = x;
}
total += a[i];
}
if (minus % 2 == 0) {
Out(total);
} else {
rep(i, n) {
sum = total - (a[i] * 2);
Max(ans, sum);
}
Out(ans);
}
return 0;
}
| [
"variable_declaration.add"
] | 876,782 | 876,783 | u518883877 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt_minus = 0;
cin >> N;
vector<long long> A(N);
bool zero_find = false;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0)
zero_find = true;
if (A[i] < 0 && !(zero_find)) {
cnt_minus++;
}
}
long long sum = 0, tiisai = abs(A[0]);
for (int i = 0; i < N; i++) {
sum += abs(A[i]);
tiisai = min(tiisai, abs(A[i]));
}
if (cnt_minus % 2 == 0 || zero_find)
cout << sum << endl;
else
cout << sum - tiisai << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt_minus = 0;
cin >> N;
vector<long long> A(N);
bool zero_find = false;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0)
zero_find = true;
if (A[i] < 0 && !(zero_find)) {
cnt_minus++;
}
}
long long sum = 0, tiisai = abs(A[0]);
for (int i = 0; i < N; i++) {
sum += abs(A[i]);
tiisai = min(tiisai, abs(A[i]));
}
if (cnt_minus % 2 == 0 || zero_find)
cout << sum << endl;
else
cout << sum - tiisai * 2 << endl;
} | [
"expression.operation.binary.add"
] | 876,788 | 876,789 | u507188501 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, c = 0;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
a[i] = -a[i];
}
sort(a, a + n);
ll x = 0;
for (int i = 0; i < n; ++i) {
x += a[i];
/* code */
}
if (c % 2) {
x -= 2 * a[0];
}
cout << x;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, c = 0;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
a[i] = -a[i];
c++;
}
}
sort(a, a + n);
ll x = 0;
for (int i = 0; i < n; ++i) {
x += a[i];
/* code */
}
if (c % 2) {
x -= 2 * a[0];
}
cout << x;
} | [
"expression.unary.arithmetic.add"
] | 876,796 | 876,797 | u305721160 | cpp |
p03062 | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
cinf(n, a);
int cnt = 0;
ll m = 10000000000;
ll sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 0)
cnt++;
m = min(m, a[i]);
sum += abs(a[i]);
}
if (cnt % 2 == 0)
cout << sum << endl;
else
cout << sum - m * 2 << endl;
}
| #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
cinf(n, a);
int cnt = 0;
ll m = 10000000000;
ll sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 0)
cnt++;
m = min(m, abs(a[i]));
sum += abs(a[i]);
}
if (cnt % 2 == 0)
cout << sum << endl;
else
cout << sum - m * 2 << endl;
}
| [
"call.add",
"call.arguments.change"
] | 876,798 | 876,799 | u928536113 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> vec(N);
int zero_num = 0;
int plus_num = 0;
int minus_num = 0;
long long sum = 0;
for (int i = 0; i < N; i++) {
long long hoge;
cin >> hoge;
vec.at(i) = abs(hoge);
if (hoge == 0) {
zero_num++;
}
if (hoge > 0) {
plus_num++;
}
if (hoge < 0) {
minus_num++;
}
sum += vec.at(i);
}
int tmp = abs(plus_num - minus_num);
if (tmp > zero_num) {
tmp -= zero_num;
} else {
tmp = 0;
}
if (minus_num % 2 != 0) {
sort(vec.begin(), vec.end());
sum -= vec.at(0);
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> vec(N);
int zero_num = 0;
int plus_num = 0;
int minus_num = 0;
long long sum = 0;
for (int i = 0; i < N; i++) {
long long hoge;
cin >> hoge;
vec.at(i) = abs(hoge);
if (hoge == 0) {
zero_num++;
}
if (hoge > 0) {
plus_num++;
}
if (hoge < 0) {
minus_num++;
}
sum += vec.at(i);
}
int tmp = abs(plus_num - minus_num);
if (tmp > zero_num) {
tmp -= zero_num;
} else {
tmp = 0;
}
if (minus_num % 2 != 0) {
sort(vec.begin(), vec.end());
sum -= vec.at(0) * 2;
}
cout << sum << endl;
return 0;
}
| [
"assignment.change"
] | 876,808 | 876,809 | u200509145 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define sz(v) (int)v.size()
#define pb push_back
using namespace std;
typedef long long ll;
ll N;
ll temp;
vector<ll> A;
int main() {
cin >> N;
rep(i, N) cin >> temp, A.pb(temp);
sort(ALL(A));
auto itr = lower_bound(ALL(A), 0);
int cnt = itr - A.begin();
ll sum = 0;
rep(i, N) sum += abs(A[i]);
ll m = *A.end();
rep(i, N) m = min(m, abs(A[i]));
if (cnt % 2 == 1)
sum -= 2 * m;
cout << sum << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define sz(v) (int)v.size()
#define pb push_back
using namespace std;
typedef long long ll;
ll N;
ll temp;
vector<ll> A;
int main() {
cin >> N;
rep(i, N) cin >> temp, A.pb(temp);
sort(ALL(A));
auto itr = lower_bound(ALL(A), 0);
int cnt = itr - A.begin();
ll sum = 0;
rep(i, N) sum += abs(A[i]);
ll m = 1e18;
rep(i, N) m = min(m, abs(A[i]));
if (cnt % 2 == 1)
sum -= 2 * m;
cout << sum << endl;
} | [
"variable_declaration.value.change",
"call.remove"
] | 876,833 | 876,834 | u281168735 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int num_negs = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < 0)
++num_negs;
}
vector<long long> B(N);
for (int i = 0; i < N; ++i) {
B[i] = abs(A[i]);
}
long long sum = 0;
for (int i = 0; i < N; ++i) {
sum += B[i];
}
if (num_negs % 2 == 0) {
cout << sum << endl;
} else {
sort(B.begin(), B.end());
cout << sum - B[0] << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int num_negs = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < 0)
++num_negs;
}
vector<long long> B(N);
for (int i = 0; i < N; ++i) {
B[i] = abs(A[i]);
}
long long sum = 0;
for (int i = 0; i < N; ++i) {
sum += B[i];
}
if (num_negs % 2 == 0) {
cout << sum << endl;
} else {
sort(B.begin(), B.end());
cout << sum - 2 * B[0] << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 876,835 | 876,836 | u045679746 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int num_negs = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < 0)
++num_negs;
}
vector<int> B(N);
for (int i = 0; i < N; ++i) {
B[i] = abs(A[i]);
}
long long sum = 0;
for (int i = 0; i < N; ++i) {
sum += B[i];
}
if (num_negs % 2 == 0) {
cout << sum << endl;
} else {
sort(B.begin(), B.end());
cout << sum - B[0] << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int num_negs = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < 0)
++num_negs;
}
vector<long long> B(N);
for (int i = 0; i < N; ++i) {
B[i] = abs(A[i]);
}
long long sum = 0;
for (int i = 0; i < N; ++i) {
sum += B[i];
}
if (num_negs % 2 == 0) {
cout << sum << endl;
} else {
sort(B.begin(), B.end());
cout << sum - 2 * B[0] << endl;
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,837 | 876,836 | u045679746 | cpp |
p03062 | #include <iostream>
using namespace std;
typedef long long ll;
int N;
ll A[100010], dp[100010][2] = {};
const ll inf = -1e18;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
dp[i][0] = inf;
dp[i][1] = inf;
}
for (int i = 2; i <= N; i++) {
if (i == 2) {
dp[i][0] = A[i - 1] + A[i];
dp[i][1] = -A[i - 1] - A[i];
} else {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]) + A[i];
dp[i][1] = max(dp[i - 1][0] - 2 * A[i - 1] + A[i],
dp[i - 1][1] + 2 * A[i - 1] - A[i]);
}
}
cout << max(dp[N][0], dp[N][1]) << endl;
} | #include <iostream>
using namespace std;
typedef long long ll;
int N;
ll A[100010], dp[100010][2] = {};
const ll inf = -1e18;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
dp[i][0] = inf;
dp[i][1] = inf;
}
for (int i = 2; i <= N; i++) {
if (i == 2) {
dp[i][0] = A[i - 1] + A[i];
dp[i][1] = -A[i - 1] - A[i];
} else {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]) + A[i];
dp[i][1] = max(dp[i - 1][0] - 2 * A[i - 1] - A[i],
dp[i - 1][1] + 2 * A[i - 1] - A[i]);
}
}
cout << max(dp[N][0], dp[N][1]) << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 876,840 | 876,841 | u138486156 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll absl(ll a) { return a < 0 ? -a : a; }
int main() {
int n;
cin >> n;
// vector<ll> v;
int i;
ll sum = 0;
ll minus_count = 0;
ll mn = INT_MAX;
for (i = 0; i < n; i++) {
ll x;
cin >> x;
minus_count += x < 0 ? 1 : 0;
sum += absl(x);
if (mn > absl(x))
mn = x;
}
if (minus_count % 2 == 0) {
cout << sum;
return 0;
}
cout << sum - mn * 2;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll absl(ll a) { return a < 0 ? -a : a; }
int main() {
int n;
cin >> n;
// vector<ll> v;
int i;
ll sum = 0;
ll minus_count = 0;
ll mn = INT_MAX;
for (i = 0; i < n; i++) {
ll x;
cin >> x;
minus_count += x < 0 ? 1 : 0;
sum += absl(x);
if (mn > absl(x))
mn = absl(x);
}
if (minus_count % 2 == 0) {
cout << sum;
return 0;
}
cout << sum - mn * 2;
}
| [
"call.add",
"call.arguments.change"
] | 876,842 | 876,843 | u956910277 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll absl(ll a) { return a < 0 ? -a : a; }
int main() {
int n;
cin >> n;
// vector<ll> v;
int i;
ll sum = 0;
ll minus_count = 0;
ll mn = INT_MAX;
for (i = 0; i < n; i++) {
ll x;
cin >> x;
minus_count += x < 0 ? 1 : 0;
sum += absl(x);
if (mn > x)
mn = x;
}
if (minus_count % 2 == 0) {
cout << sum;
return 0;
}
cout << sum - mn * 2;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll absl(ll a) { return a < 0 ? -a : a; }
int main() {
int n;
cin >> n;
// vector<ll> v;
int i;
ll sum = 0;
ll minus_count = 0;
ll mn = INT_MAX;
for (i = 0; i < n; i++) {
ll x;
cin >> x;
minus_count += x < 0 ? 1 : 0;
sum += absl(x);
if (mn > absl(x))
mn = absl(x);
}
if (minus_count % 2 == 0) {
cout << sum;
return 0;
}
cout << sum - mn * 2;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 876,844 | 876,843 | u956910277 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Split
namespace util {
std::vector<std::string> split(std::string s, char delimiter) {
std::vector<std::string> vs;
std::string sub;
for (auto c : s) {
if (c == delimiter)
vs.push_back(sub), sub.clear();
else
sub += c;
}
vs.push_back(sub);
return vs;
}
} // namespace util
// Minimum, Maximum
template <class T> T minimum(T head, T tail) { return std::min(head, tail); }
template <class H, class... T> H minimum(H head, T... tail) {
return std::min(head, minimum(tail...));
}
template <class T> T maximum(T head, T tail) { return std::max(head, tail); }
template <class H, class... T> H maximum(H head, T... tail) {
return std::max(head, maximum(tail...));
}
// Output
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> v) {
for (ll i = 0; i < (ll)v.size(); i++) {
os << " [" << i << "]" << v[i];
if (i % 10 == 9)
os << std::endl;
}
return os;
}
template <class T, class S>
std::ostream &operator<<(std::ostream &os, std::vector<std::pair<T, S>> vp) {
ll i = 0;
for (auto p : vp) {
os << " [" << i++ << "]" << p.first << " " << p.second;
if (i % 10 == 0)
os << std::endl;
}
return os;
}
void print() { std::cout << std::endl; }
template <typename H> void print(H head) { std::cout << head << std::endl; }
template <typename H, typename... T> void print(H head, T... tail) {
std::cout << head << " ", print(tail...);
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll N;
std::cin >> N;
std::vector<ll> va(N, 0LL);
for (ll i = 0; i < N; i++) {
std::cin >> va[i];
}
ll cnt = 0LL;
for (ll i = 0; i < N; i++) {
if (va[i] == 0) {
cnt = 0LL;
break;
}
if (va[i] < 0)
cnt++;
}
for (ll i = 0; i < N; i++) {
va[i] = std::abs(va[i]);
}
ll sum = std::accumulate(va.begin(), va.end(), 0);
if (cnt % 2 == 0) {
print(sum);
} else {
ll min_val = *std::min_element(va.begin(), va.end());
print(sum - 2 * min_val);
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Split
namespace util {
std::vector<std::string> split(std::string s, char delimiter) {
std::vector<std::string> vs;
std::string sub;
for (auto c : s) {
if (c == delimiter)
vs.push_back(sub), sub.clear();
else
sub += c;
}
vs.push_back(sub);
return vs;
}
} // namespace util
// Minimum, Maximum
template <class T> T minimum(T head, T tail) { return std::min(head, tail); }
template <class H, class... T> H minimum(H head, T... tail) {
return std::min(head, minimum(tail...));
}
template <class T> T maximum(T head, T tail) { return std::max(head, tail); }
template <class H, class... T> H maximum(H head, T... tail) {
return std::max(head, maximum(tail...));
}
// Output
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> v) {
for (ll i = 0; i < (ll)v.size(); i++) {
os << " [" << i << "]" << v[i];
if (i % 10 == 9)
os << std::endl;
}
return os;
}
template <class T, class S>
std::ostream &operator<<(std::ostream &os, std::vector<std::pair<T, S>> vp) {
ll i = 0;
for (auto p : vp) {
os << " [" << i++ << "]" << p.first << " " << p.second;
if (i % 10 == 0)
os << std::endl;
}
return os;
}
void print() { std::cout << std::endl; }
template <typename H> void print(H head) { std::cout << head << std::endl; }
template <typename H, typename... T> void print(H head, T... tail) {
std::cout << head << " ", print(tail...);
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll N;
std::cin >> N;
std::vector<ll> va(N, 0LL);
for (ll i = 0; i < N; i++) {
std::cin >> va[i];
}
ll cnt = 0LL;
for (ll i = 0; i < N; i++) {
if (va[i] == 0) {
cnt = 0LL;
break;
}
if (va[i] < 0)
cnt++;
}
for (ll i = 0; i < N; i++) {
va[i] = std::abs(va[i]);
}
ll sum = std::accumulate(va.begin(), va.end(), 0LL);
if (cnt % 2 == 0) {
print(sum);
} else {
ll min_val = *std::min_element(va.begin(), va.end());
print(sum - 2 * min_val);
}
return 0;
}
| [
"literal.number.type.widen.change"
] | 876,845 | 876,846 | u343930666 | cpp |
p03062 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
// const long long int MOD = 1000000007;
const int MOD = 1000000007;
// const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
long long int sum = 0;
int m = 0;
long long int le = MOD;
int zero = 0;
for (int i = 0; i < N; i++) {
cin >> M;
sum += abs(M);
le = min(le, abs(M));
m += M < 0;
zero += !M;
}
if ((m & 1) && (!zero))
sum -= le;
cout << sum << endl;
return 0;
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
// const long long int MOD = 1000000007;
const int MOD = 1000000007;
// const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
long long int sum = 0;
int m = 0;
long long int le = MOD;
int zero = 0;
for (int i = 0; i < N; i++) {
cin >> M;
sum += abs(M);
le = min(le, abs(M));
m += M < 0;
zero += !M;
}
if ((m & 1) && (!zero))
sum -= le * 2;
cout << sum << endl;
return 0;
} | [
"assignment.change"
] | 876,847 | 876,848 | u468700753 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
/*
AC
*/
ll n, a[100010], sum = 0, ans = -1e18, t = 0;
void init() {
cin >> n;
reg(i, 1, n) cin >> a[i];
reg(i, 1, n) if (a[i] < 0) t++;
reg(i, 1, n) sum = abs(a[i]);
}
int main(void) {
init();
if (t % 2 == 0) {
ans = sum;
} else {
reg(i, 1, n) { ans = max({ans, sum - 2 * abs(a[i])}); }
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
/*
AC
*/
ll n, a[100010], sum = 0, ans = -1e18, t = 0;
void init() {
cin >> n;
reg(i, 1, n) cin >> a[i];
reg(i, 1, n) if (a[i] < 0) t++;
reg(i, 1, n) sum += abs(a[i]);
}
int main(void) {
init();
if (t % 2 == 0) {
ans = sum;
} else {
reg(i, 1, n) { ans = max({ans, sum - 2 * abs(a[i])}); }
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change"
] | 876,863 | 876,864 | u372786981 | cpp |
p03062 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int n, num, sum = 0, k = 0, minn = 0x3f3f3f3f;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num;
sum += abs(num);
if (num < 0)
++k;
minn = min(abs(num), minn);
}
if (k & 1)
sum -= minn * 2;
cout << sum << '\n';
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
long long n, num, sum = 0, k = 0, minn = 0x3f3f3f3f;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num;
sum += abs(num);
if (num < 0)
++k;
minn = min(abs(num), minn);
}
if (k & 1)
sum -= minn * 2;
cout << sum << '\n';
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,872 | 876,873 | u777148280 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> A;
A.resize(N + 1, 0);
vector<ll> dp;
dp.resize(N + 1, 0);
dp[0] = 0;
vector<ll> rp;
rp.resize(N + 1, 0);
rp[0] = -INF;
for (int i = 0; i < N; i++)
cin >> A[i + 1];
dp[1] = (A[1]);
rp[1] = -(A[1]);
// cout<<1<<endl;
// cout<<dp[1]<<" "<<rp[1]<<endl;
if (N == 2) {
cout << max(dp[1] + A[2], rp[1] - A[2]);
return 0;
}
for (int i = 2; i <= N - 1; i++) { // 漸化式
// ll a = A[i-1];
// ll b = A[i];
ll dp1, dp2, dp3, dp4;
ll rp1, rp2, rp3, rp4;
// cout<<i<<endl;
dp1 = max(dp[i - 2] + A[i - 1] + A[i], dp[i - 2] - A[i - 1] - A[i]);
// cout<<dp1<<endl;
dp2 = dp[i - 1] + A[i];
dp3 = max(rp[i - 2] + A[i - 1] + A[i], rp[i - 2] - A[i - 1] - A[i]);
// if(i==2) dp3 = 0;
// cout<<dp2<<endl;
// cout<<dp3<<endl;
dp4 = rp[i - 1] - A[i];
// cout<<dp4<<endl;
rp1 = max(rp[i - 2] - A[i - 1] - A[i], rp[i - 2] + A[i - 1] + A[i]);
rp2 = rp[i - 1] + A[i];
rp3 = max(dp[i - 2] - A[i - 1] - A[i], dp[i - 2] - A[i - 1] - A[i]);
// if(i==2) rp3 = 0;
rp4 = dp[i - 1] - A[i];
ll res_dp = max(dp1, dp2);
res_dp = max(res_dp, dp3);
dp[i] = max(res_dp, dp4);
ll res_rp = max(rp1, rp2);
res_rp = max(res_rp, rp3);
rp[i] = max(res_rp, rp4);
// cout<<dp[i]<<" "<<rp[i]<<endl;
}
cout << max(dp[N - 1] + A[N], rp[N - 1] - A[N]) << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> A;
A.resize(N + 1, 0);
vector<ll> dp;
dp.resize(N + 1, 0);
dp[0] = 0;
vector<ll> rp;
rp.resize(N + 1, 0);
rp[0] = -INF;
for (int i = 0; i < N; i++)
cin >> A[i + 1];
dp[1] = (A[1]);
rp[1] = -(A[1]);
// cout<<1<<endl;
// cout<<dp[1]<<" "<<rp[1]<<endl;
if (N == 2) {
cout << max(dp[1] + A[2], rp[1] - A[2]);
return 0;
}
for (int i = 2; i <= N - 1; i++) { // 漸化式
// ll a = A[i-1];
// ll b = A[i];
ll dp1, dp2, dp3, dp4;
ll rp1, rp2, rp3, rp4;
dp1 = max(dp[i - 2] + A[i - 1] + A[i], dp[i - 2] - A[i - 1] - A[i]);
// cout<<dp1<<endl;
dp2 = dp[i - 1] + A[i];
dp3 = max(rp[i - 2] - A[i - 1] + A[i], rp[i - 2] + A[i - 1] - A[i]);
// if(i==2) dp3 = 0;
// cout<<dp2<<endl;
// cout<<dp3<<endl;
dp4 = rp[i - 1] - A[i];
// cout<<dp4<<endl;
rp1 = max(rp[i - 2] - A[i - 1] - A[i], rp[i - 2] + A[i - 1] + A[i]);
rp2 = rp[i - 1] + A[i];
rp3 = max(dp[i - 2] + A[i - 1] - A[i], dp[i - 2] - A[i - 1] + A[i]);
// if(i==2) rp3 = 0;
rp4 = dp[i - 1] - A[i];
ll res_dp = max(dp1, dp2);
res_dp = max(res_dp, dp3);
dp[i] = max(res_dp, dp4);
ll res_rp = max(rp1, rp2);
res_rp = max(res_rp, rp3);
rp[i] = max(res_rp, rp4);
// cout<<dp[i]<<" "<<rp[i]<<endl;
}
cout << max(dp[N - 1] + A[N], rp[N - 1] - A[N]) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 876,882 | 876,883 | u617525345 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long N;
cin >> N;
vector<long> A(N);
for (auto &i : A)
cin >> i;
cout << accumulate(A.cbegin(), A.cend(), 0L,
[](auto a, auto b) { return abs(a) + abs(b); }) -
(count_if(A.cbegin(), A.cend(), [](auto a) { return a < 0; })
? *min_element(
A.cbegin(), A.cend(),
[](auto a, auto b) { return abs(a) < abs(b); }) *
2
: 0)
<< endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long N;
cin >> N;
vector<long> A(N);
for (auto &i : A)
cin >> i;
cout << accumulate(A.cbegin(), A.cend(), 0L,
[](auto a, auto b) { return abs(a) + abs(b); }) -
(1 & count_if(A.cbegin(), A.cend(), [](auto a) { return a < 0; })
? abs(*min_element(
A.cbegin(), A.cend(),
[](auto a, auto b) { return abs(a) < abs(b); })) *
2
: 0)
<< endl;
} | [
"expression.operation.binary.add",
"call.add",
"call.arguments.change"
] | 876,902 | 876,903 | u462437857 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define INF 2000000000
int main() {
long long n;
cin >> n;
long long i, j;
long long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 0;
long long minus = 0, zero = 0;
long long m = INF;
for (i = 0; i < n; i++) {
ans += a[i];
if (a[i] < 0)
minus++;
else if (a[i] == 0)
zero++;
if (abs(a[i]) < m)
m = abs(a[i]);
}
if (minus % 2 == 1 and zero == 0) {
ans -= 2 * m;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define INF 2000000000
int main() {
long long n;
cin >> n;
long long i, j;
long long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 0;
long long minus = 0, zero = 0;
long long m = INF;
for (i = 0; i < n; i++) {
ans += abs(a[i]);
if (a[i] < 0)
minus++;
else if (a[i] == 0)
zero++;
if (abs(a[i]) < m)
m = abs(a[i]);
}
if (minus % 2 == 1 and zero == 0) {
ans -= 2 * m;
}
cout << ans << endl;
}
| [
"call.add",
"call.arguments.change"
] | 876,937 | 876,938 | u284045566 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.