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 <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// pair sort
bool compare_by_b(pair<LL, LL> a, pair<LL, LL> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
void solve(long long N, std::vector<long long> A) {
int minus = 0;
REP(i, N) if (A[i] < 0) minus++;
REP(i, N) if (A[i] < 0) A[i] *= -1;
LL sum = 0;
LL minim = 1000000000000;
REP(i, N) {
sum += A[i];
minim = min(minim, A[i]);
}
if (minus % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - minim << endl;
}
}
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;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// pair sort
bool compare_by_b(pair<LL, LL> a, pair<LL, LL> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
void solve(long long N, std::vector<long long> A) {
int minus = 0;
REP(i, N) if (A[i] < 0) minus++;
REP(i, N) if (A[i] < 0) A[i] *= -1;
LL sum = 0;
LL minim = 1000000000000;
REP(i, N) {
sum += A[i];
minim = min(minim, A[i]);
}
if (minus % 2 == 0) {
cout << sum << endl;
} else {
cout << sum - minim * 2 << endl;
}
}
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;
}
| [
"expression.operation.binary.add"
] | 875,653 | 875,654 | u978109511 | cpp |
p03062 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
int main() {
int N;
int count = 0;
cin >> N;
long long int sum = 0;
vector<long long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
count++;
sum += abs(A[i]);
}
if (count % 2 == 0) {
cout << sum;
return 0;
}
for (int i = 0; i < N; i++) {
if (A[i] < 0)
A[i] *= -1;
}
sort(A.begin(), A.end());
A[0] *= -1;
sum = sum - 2 * A[0];
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
int main() {
int N;
int count = 0;
cin >> N;
long long int sum = 0;
vector<long long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
count++;
sum += abs(A[i]);
}
if (count % 2 == 0) {
cout << sum;
return 0;
}
for (int i = 0; i < N; i++) {
if (A[i] < 0)
A[i] *= -1;
}
sort(A.begin(), A.end());
A[0] *= -1;
sum = sum + 2 * A[0];
cout << sum;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 875,660 | 875,661 | u109191542 | cpp |
p03062 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[214514][2]; // 0: straight 1:reversed
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[1][0] = a[0] + a[1];
dp[1][1] = -(a[0] + a[1]);
for (int i = 2; i < n; i++) {
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 - 1][0], dp[n - 1][1]) << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[214514][2]; // 0: straight 1:reversed
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[1][0] = a[0] + a[1];
dp[1][1] = -(a[0] + a[1]);
for (int i = 2; i < n; i++) {
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<<i<<" "<<dp[i][0]<<" "<<dp[i][1]<<endl;
}
cout << max(dp[n - 1][0], dp[n - 1][1]) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,669 | 875,670 | u335590796 | cpp |
p03062 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll n, a[100005], rj;
ll dp[100005][2];
ll f(int p, int pr) {
if (p == n - 1)
return a[n - 1] * (pr ? -1 : 1);
if (dp[p][pr] != -1)
return dp[p][pr];
return dp[p][pr] = max(f(p + 1, 0) + a[p] * (pr ? -1 : 1),
f(p + 1, 1) + a[p] * (pr ? -1 : 1));
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
cout << f(0, 0) << endl;
} | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll n, a[100005], rj;
ll dp[100005][2];
ll f(int p, int pr) {
if (p == n - 1)
return a[n - 1] * (pr ? -1 : 1);
if (dp[p][pr] != -1)
return dp[p][pr];
return dp[p][pr] = max(f(p + 1, 0) + a[p] * (pr ? -1 : 1),
f(p + 1, 1) - a[p] * (pr ? -1 : 1));
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
cout << f(0, 0) << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 875,671 | 875,672 | u032723841 | cpp |
p03062 | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
int N;
cin >> N;
lint sum = 0;
lint min_num = 0;
bool flag = true;
for (int i = 0; i < N; i++) {
lint tmp;
cin >> tmp;
if (tmp < 0)
flag = !flag;
sum += abs(tmp);
min_num = min(min_num, abs(tmp));
}
if (flag)
cout << sum << endl;
else
cout << sum - min_num * 2 << endl;
return;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
execute();
int stop;
cin >> stop;
return 0;
} | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
int N;
cin >> N;
lint sum = 0;
lint min_num = INF64;
bool flag = true;
for (int i = 0; i < N; i++) {
lint tmp;
cin >> tmp;
if (tmp < 0)
flag = !flag;
sum += abs(tmp);
min_num = min(min_num, abs(tmp));
}
if (flag)
cout << sum << endl;
else
cout << sum - min_num * 2 << endl;
return;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
execute();
int stop;
cin >> stop;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 875,674 | 875,675 | u874525170 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define N 120000
#define int long long
map<int, int> mp;
int a[N];
signed main() {
int n;
cin >> n;
int fu = 0;
int sum = 0;
int minn = 9999999999999;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
sum += abs(a[i]);
minn = min(minn, abs(a[i]));
if (a[i] < 0)
fu++;
}
if (fu % 2 == 1) {
printf("%lld\n", sum - minn);
} else {
printf("%lld\n", sum);
}
} | #include <bits/stdc++.h>
using namespace std;
#define N 120000
#define int long long
map<int, int> mp;
int a[N];
signed main() {
int n;
cin >> n;
int fu = 0;
int sum = 0;
int minn = 9999999999999;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
sum += abs(a[i]);
minn = min(minn, abs(a[i]));
if (a[i] < 0)
fu++;
}
if (fu % 2 == 1) {
printf("%lld\n", sum - 2 * minn);
} else {
printf("%lld\n", sum);
}
} | [
"expression.operation.binary.add"
] | 875,676 | 875,677 | u099891281 | cpp |
p03062 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG cerr << "!" << endl;
#define BITLE(n) (1LL << ((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s, f, t) ((s).substr((f)-1, (t) - (f) + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vi A(n);
bool fl = false;
for (auto &a : A) {
cin >> a;
if (a == 0)
fl = true;
}
ll ans = 0;
if (fl) {
for (int i = 0; i < n - 1; i++) {
ans += abs(A[i]);
}
} else {
ll minus = 0;
bool flfl = false;
for (int i = 0; i < n; i++) {
if (A[i] < 0)
minus++;
}
if (minus % 2)
flfl = true;
if (flfl) {
for (int i = 0; i < n; i++)
A[i] = abs(A[i]);
sort(ALL(A));
for (int i = 1; i < n; i++)
ans += abs(A[i]);
ans -= A[0];
} else {
for (int i = 0; i < n; i++)
ans += abs(A[i]);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG cerr << "!" << endl;
#define BITLE(n) (1LL << ((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s, f, t) ((s).substr((f)-1, (t) - (f) + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vi A(n);
bool fl = false;
for (auto &a : A) {
cin >> a;
if (a == 0)
fl = true;
}
ll ans = 0;
if (fl) {
for (int i = 0; i < n; i++) {
ans += abs(A[i]);
}
} else {
ll minus = 0;
bool flfl = false;
for (int i = 0; i < n; i++) {
if (A[i] < 0)
minus++;
}
if (minus % 2)
flfl = true;
if (flfl) {
for (int i = 0; i < n; i++)
A[i] = abs(A[i]);
sort(ALL(A));
for (int i = 1; i < n; i++)
ans += abs(A[i]);
ans -= A[0];
} else {
for (int i = 0; i < n; i++)
ans += abs(A[i]);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 875,681 | 875,682 | u905715926 | cpp |
p03062 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG cerr << "!" << endl;
#define BITLE(n) (1LL << ((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s, f, t) ((s).substr((f)-1, (t) - (f) + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vi A(n);
bool fl = false;
for (auto &a : A) {
cin >> a;
if (a == 0)
fl = true;
}
ll ans = 0;
if (fl) {
for (int i = 0; i < n - 1; i++) {
ans += abs(A[i]);
}
} else {
ll minus = 0;
bool flfl = false;
for (int i = 0; i < n; i++) {
if (A[i] < 0)
minus++;
}
if (minus % 2)
flfl = true;
if (flfl) {
for (int i = 0; i < n; i++)
A[i] = abs(A[i]);
sort(ALL(A));
for (int i = 1; i < n; i++)
ans += abs(A[i]);
ans -= A[0];
} else {
for (int i = 0; i < n; i++)
ans += A[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG cerr << "!" << endl;
#define BITLE(n) (1LL << ((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s, f, t) ((s).substr((f)-1, (t) - (f) + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vi A(n);
bool fl = false;
for (auto &a : A) {
cin >> a;
if (a == 0)
fl = true;
}
ll ans = 0;
if (fl) {
for (int i = 0; i < n; i++) {
ans += abs(A[i]);
}
} else {
ll minus = 0;
bool flfl = false;
for (int i = 0; i < n; i++) {
if (A[i] < 0)
minus++;
}
if (minus % 2)
flfl = true;
if (flfl) {
for (int i = 0; i < n; i++)
A[i] = abs(A[i]);
sort(ALL(A));
for (int i = 1; i < n; i++)
ans += abs(A[i]);
ans -= A[0];
} else {
for (int i = 0; i < n; i++)
ans += abs(A[i]);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"call.add",
"call.arguments.change"
] | 875,683 | 875,682 | u905715926 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int flag = 0;
int co = 0;
for (int i = 1; i < n; i++) {
if (a[i] == 0) {
flag = 1;
} else if (a[i] < 0) {
co++;
}
}
if (flag == 1 or co % 2 == 0) {
long long su = 0;
for (int i = 0; i < n; i++) {
su += abs(a[i]);
}
cout << su << endl;
} else {
long long su = 0;
long long mi = 1e+10;
for (int i = 0; i < n; i++) {
su += abs(a[i]);
mi = min(abs(a[i]), mi);
}
cout << su - 2 * mi << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int flag = 0;
int co = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 0) {
flag = 1;
} else if (a[i] < 0) {
co++;
}
}
if (flag == 1 or co % 2 == 0) {
long long su = 0;
for (int i = 0; i < n; i++) {
su += abs(a[i]);
}
cout << su << endl;
} else {
long long su = 0;
long long mi = 1e+10;
for (int i = 0; i < n; i++) {
su += abs(a[i]);
mi = min(abs(a[i]), mi);
}
cout << su - 2 * mi << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 875,689 | 875,690 | u338193317 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
ll sum = 0, tmp1 = inf, tmp2 = 0;
cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] <= 0)
tmp2++;
tmp1 = min(tmp1, abs(a[i]));
}
if (tmp2 % 2)
sum -= tmp1;
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
ll sum = 0, tmp1 = inf, tmp2 = 0;
cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] <= 0)
tmp2++;
tmp1 = min(tmp1, abs(a[i]));
}
if (tmp2 % 2)
sum -= 2 * tmp1;
cout << sum << endl;
return 0;
}
| [
"assignment.change"
] | 875,691 | 875,692 | u831873811 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
int main() {
ll n, count = 0, ans = 0, point;
cin >> n;
vector<ll> A(n);
RAP(i, n) {
cin >> A[i];
if (A[i] < 0) {
count++;
}
}
sort(A.begin(), A.end());
if (count % 2 == 1) {
auto itr = lower_bound(A.begin(), A.end(), 0);
ll idx = distance(A.begin(), itr);
if (itr != A.end()) {
if (abs(A[idx - 1]) > A[idx]) {
point = idx;
} else {
point = idx - 1;
}
} else {
point = idx - 1;
}
RAP(i, n) { ans += abs(A[i]); }
ans -= A[point] * 2;
} else {
RAP(i, n) { ans += abs(A[i]); }
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
int main() {
ll n, count = 0, ans = 0, point;
cin >> n;
vector<ll> A(n);
RAP(i, n) {
cin >> A[i];
if (A[i] < 0) {
count++;
}
}
sort(A.begin(), A.end());
if (count % 2 == 1) {
auto itr = lower_bound(A.begin(), A.end(), 0);
ll idx = distance(A.begin(), itr);
if (itr != A.end()) {
if (abs(A[idx - 1]) > A[idx]) {
point = idx;
} else {
point = idx - 1;
}
} else {
point = idx - 1;
}
RAP(i, n) { ans += abs(A[i]); }
ans -= abs(A[point]) * 2;
} else {
RAP(i, n) { ans += abs(A[i]); }
}
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 875,700 | 875,701 | u761994361 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int ans, neg, mn = 200000000000007;
signed main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
ans += abs(a[i]);
mn = min(mn, abs(a[i]));
if (a[i] < 0)
neg++;
}
if (neg % 2)
ans -= mn;
cout << ans;
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int ans, neg, mn = 200000000000007;
signed main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
ans += abs(a[i]);
mn = min(mn, abs(a[i]));
if (a[i] < 0)
neg++;
}
// cout << ans << endl;
if (neg % 2)
ans -= 2 * mn;
cout << ans;
cout << endl;
return 0;
}
| [
"assignment.change"
] | 875,714 | 875,715 | u652712806 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <class A, class B>
ostream &operator<<(ostream &ost, const pair<A, B> &p) {
ost << "{" << p.first << "," << p.second << "}";
return ost;
}
template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) {
ost << "{";
for (int i = 0; i < v.size(); i++) {
if (i)
ost << ",";
ost << v[i];
}
ost << "}";
return ost;
}
signed main() {
int N;
cin >> N;
vint A(N);
rep(i, N) cin >> A[i];
int neg = 0;
rep(i, N) {
if (A[i] < 0)
neg++;
A[i] = abs(A[i]);
}
int al = accumulate(all(A), 0ll);
if (neg & 1) {
al -= *min_element(all(A));
}
cout << al << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <class A, class B>
ostream &operator<<(ostream &ost, const pair<A, B> &p) {
ost << "{" << p.first << "," << p.second << "}";
return ost;
}
template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) {
ost << "{";
for (int i = 0; i < v.size(); i++) {
if (i)
ost << ",";
ost << v[i];
}
ost << "}";
return ost;
}
signed main() {
int N;
cin >> N;
vint A(N);
rep(i, N) cin >> A[i];
int neg = 0;
rep(i, N) {
if (A[i] < 0)
neg++;
A[i] = abs(A[i]);
}
int al = accumulate(all(A), 0ll);
if (neg & 1) {
al -= *min_element(all(A)) * 2;
}
cout << al << endl;
return 0;
} | [
"assignment.change"
] | 875,726 | 875,727 | u685892567 | cpp |
p03062 | #include "bits/stdc++.h"
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using namespace std;
using ull = unsigned long long;
using ll = long long;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
struct __INIT {
__INIT() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
int main() {
int N;
cin >> N;
vector<ll> A(N);
int minus = 0;
ull sum = 0;
ll min_n = 1000000000;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
sum += abs(a);
min_n = min(min_n, abs(a));
if (a < 0)
minus++;
}
if (minus % 2)
cout << sum - abs(min_n) << endl;
else
cout << sum << endl;
} | #include "bits/stdc++.h"
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using namespace std;
using ull = unsigned long long;
using ll = long long;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
struct __INIT {
__INIT() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
int main() {
int N;
cin >> N;
vector<ll> A(N);
int minus = 0;
ull sum = 0;
ll min_n = 1000000000;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
sum += abs(a);
min_n = min(min_n, abs(a));
if (a < 0)
minus++;
}
if (minus % 2)
cout << sum - 2 * min_n << endl;
else
cout << sum << endl;
} | [
"call.arguments.change"
] | 875,728 | 875,729 | u102067593 | cpp |
p03062 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int a, b[100010], c[100010], ans = 0, ant = 0;
cin >> a;
for (int i = 0; i < a; i++)
cin >> b[i];
for (int i = 0; i < a; i++) {
c[i] = abs(b[i]);
ans += c[i];
}
for (int i = 0; i < a; i++) {
if (b[i] < 0) {
ant++;
}
}
sort(c, c + a);
if (ant % 2 == 0) {
cout << ans << endl;
}
else {
cout << ans - c[0] << endl;
}
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int a, b[100010], c[100010], ans = 0, ant = 0;
cin >> a;
for (int i = 0; i < a; i++)
cin >> b[i];
for (int i = 0; i < a; i++) {
c[i] = abs(b[i]);
ans += c[i];
}
for (int i = 0; i < a; i++) {
if (b[i] < 0) {
ant++;
}
}
sort(c, c + a);
if (ant % 2 == 0) {
cout << ans << endl;
}
else {
cout << ans - 2 * c[0] << endl;
}
}
| [
"expression.operation.binary.add"
] | 875,730 | 875,731 | u530329977 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int mai = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
mai++;
A[i] = -A[i];
}
}
long long mini = 100000000000;
long long goukei = 0;
if (mai / 2 != 0) {
for (int i = 0; i < N; i++) {
mini = min(mini, A[i]);
goukei += A[i];
}
cout << goukei - 2 * mini << endl;
} else {
for (int i = 0; i < N; i++) {
goukei += A[i];
}
cout << goukei << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int mai = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
mai++;
A[i] = -A[i];
}
}
long long mini = 100000000000;
long long goukei = 0;
if (mai % 2 != 0) {
for (int i = 0; i < N; i++) {
mini = min(mini, A[i]);
goukei += A[i];
}
cout << goukei - 2 * mini << endl;
} else {
for (int i = 0; i < N; i++) {
goukei += A[i];
}
cout << goukei << endl;
}
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 875,732 | 875,733 | u222866518 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int mai = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
mai++;
A[i] = -A[i];
}
}
long long mini = 1000000000;
long long goukei = 0;
if (mai / 2 != 0) {
for (int i = 0; i < N; i++) {
mini = min(mini, A[i]);
goukei += A[i];
}
cout << goukei - 2 * mini << endl;
} else {
for (int i = 0; i < N; i++) {
goukei += A[i];
}
cout << goukei << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int mai = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
mai++;
A[i] = -A[i];
}
}
long long mini = 100000000000;
long long goukei = 0;
if (mai % 2 != 0) {
for (int i = 0; i < N; i++) {
mini = min(mini, A[i]);
goukei += A[i];
}
cout << goukei - 2 * mini << endl;
} else {
for (int i = 0; i < N; i++) {
goukei += A[i];
}
cout << goukei << endl;
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 875,735 | 875,733 | u222866518 | cpp |
p03062 | #define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
const long long MOD = (ll)1e9 + 7;
const long long MAX = (ll)170 * 80;
int main(void) {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
ll ans = 0;
ll min = (ll)1e9 + 100;
ll now = 0;
rep(i, 0, N) {
ans += abs(A[i]);
if (abs(min) > abs(A[i]))
min = A[i];
if (A[i] < 0)
now++;
}
if (now % 2 == 0)
cout << ans << endl;
else
cout << ans - min * 2 << endl;
return 0;
} | #define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
const long long MOD = (ll)1e9 + 7;
const long long MAX = (ll)170 * 80;
int main(void) {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
ll ans = 0;
ll min = (ll)1e9 + 100;
ll now = 0;
rep(i, 0, N) {
ans += abs(A[i]);
if (abs(min) > abs(A[i]))
min = A[i];
if (A[i] < 0)
now++;
}
if (now % 2 == 0)
cout << ans << endl;
else
cout << ans - abs(min) * 2 << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 875,736 | 875,737 | u381755004 | cpp |
p03062 | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
vector<long long> arr(n);
for (long long i = 0; i < n; i++)
cin >> arr[i];
long long sum = 0;
long long mn = LLONG_MIN;
long long cnt = 0;
for (long long i = 0; i < n; i++) {
mn = min(mn, abs(arr[i]));
sum += abs(arr[i]);
if (arr[i] < 0)
cnt++;
}
if (cnt % 2 == 0)
cout << sum;
else
cout << sum - (2 * mn);
return 0;
}
| /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
vector<long long> arr(n);
for (long long i = 0; i < n; i++)
cin >> arr[i];
long long sum = 0;
long long mn = LLONG_MAX;
long long cnt = 0;
for (long long i = 0; i < n; i++) {
mn = min(mn, abs(arr[i]));
sum += abs(arr[i]);
if (arr[i] < 0)
cnt++;
}
if (cnt % 2 == 0)
cout << sum;
else
cout << sum - (2 * mn);
return 0;
}
| [
"variable_declaration.value.change",
"identifier.change"
] | 875,738 | 875,739 | u752949890 | cpp |
p03062 | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
vector<long long> arr(n);
for (long long i = 0; i < n; i++)
cin >> arr[i];
long long sum = 0;
long long mn = LLONG_MIN;
long long cnt = 0;
for (long long i = 0; i < n; i++) {
mn = min(mn, arr[i]);
sum += abs(arr[i]);
if (arr[i] < 0)
cnt++;
}
if (cnt % 2 == 0)
cout << sum;
else
cout << sum - (2 * mn);
return 0;
}
| /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
vector<long long> arr(n);
for (long long i = 0; i < n; i++)
cin >> arr[i];
long long sum = 0;
long long mn = LLONG_MAX;
long long cnt = 0;
for (long long i = 0; i < n; i++) {
mn = min(mn, abs(arr[i]));
sum += abs(arr[i]);
if (arr[i] < 0)
cnt++;
}
if (cnt % 2 == 0)
cout << sum;
else
cout << sum - (2 * mn);
return 0;
}
| [
"variable_declaration.value.change",
"identifier.change",
"call.add",
"call.arguments.change"
] | 875,740 | 875,739 | u752949890 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define nl "\n"
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef vector<ll> vl;
typedef vector<vector<ll>> matrix; // matrix A(n, vl(m)); //n*m行列
typedef vector<string> vs;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define sortup(V) sort(V.begin(), V.end())
#define sortdown(V) sort(V.rbegin(), V.rend())
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define MOD 1000000007 // 998244353
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// solution comes here
ll N;
cin >> N;
ll A, ans = 0, MIN = 1e15, neg = 0;
bool haveZERO = false;
rep(i, N) {
cin >> A;
if (0 == A)
haveZERO = true;
neg += (A < 0);
A = abs(A);
ans += A;
chmin(MIN, A);
}
if (haveZERO or neg % 2 == 0)
cout << ans << nl;
else
cout << ans - MIN << nl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define nl "\n"
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef vector<ll> vl;
typedef vector<vector<ll>> matrix; // matrix A(n, vl(m)); //n*m行列
typedef vector<string> vs;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define sortup(V) sort(V.begin(), V.end())
#define sortdown(V) sort(V.rbegin(), V.rend())
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define MOD 1000000007 // 998244353
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// solution comes here
ll N;
cin >> N;
ll A, ans = 0, MIN = 1e15, neg = 0;
bool haveZERO = false;
rep(i, N) {
cin >> A;
if (0 == A)
haveZERO = true;
neg += (A < 0);
A = abs(A);
ans += A;
chmin(MIN, A);
}
if (haveZERO or neg % 2 == 0)
cout << ans << nl;
else
cout << ans - 2 * MIN << nl;
} | [
"expression.operation.binary.add"
] | 875,746 | 875,747 | u924527074 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 100100100100
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
ll mina = INF;
ll count = 0;
bool zero = false;
rep(i, n) {
if (a[i] == 0) {
zero = true;
}
if (a[i] < 0) {
count++;
}
sum += abs(a[i]);
mina = min(mina, abs(a[i]));
}
if (zero) {
cout << sum << endl;
return 0;
}
if (count % 2 == 0) {
cout << sum << endl;
return 0;
}
cout << sum - mina << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 100100100100
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
ll mina = INF;
ll count = 0;
bool zero = false;
rep(i, n) {
if (a[i] == 0) {
zero = true;
}
if (a[i] < 0) {
count++;
}
sum += abs(a[i]);
mina = min(mina, abs(a[i]));
}
if (zero) {
cout << sum << endl;
return 0;
}
if (count % 2 == 0) {
cout << sum << endl;
return 0;
}
cout << sum - 2 * mina << endl;
}
| [
"expression.operation.binary.add"
] | 875,753 | 875,754 | u971166345 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define MOD 1000000007
using namespace std;
string to_hex(int x) {
stringstream ss;
ss << hex << x;
return ss.str();
}
inline int get_int() {
int ret;
scanf("%d", &ret);
return ret;
}
inline vector<int> get_ints(int n) {
vector<int> ret(n);
FOR(i, n) { scanf("%d", &ret[i]); }
return ret;
}
inline string get_str() {
string ret;
cin >> ret;
return ret;
}
bool is_prime(int n) {
int s = sqrt(n) + 1;
for (int i = 2; i <= s; ++i) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
vector<P> prime_division(int n) {
vector<P> ret;
int s = sqrt(n) + 1;
int c = 0;
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
c = 0;
do {
++c;
n /= i;
} while (n % i == 0);
ret.push_back(P(i, c));
}
}
return ret;
}
struct UnionFind {
vector<int> data;
UnionFind(int size) { data = vector<int>(size, -1); }
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
string to_string(string s) { return s; }
template <class T> string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail> void debug_print(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug_print(tail...);
}
template <class... T> void debug(T... args) {
cerr << "[" << __LINE__ << "]: ";
debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll max_minus = 1e10;
ll sum = 0;
int minus_ct = 0;
FOR(i, N) {
ll A;
cin >> A;
sum += abs(A);
if (A <= 0) {
minus_ct++;
}
if (max_minus > A) {
max_minus = abs(A);
}
}
if (minus_ct % 2 == 1) {
sum -= 2 * max_minus;
}
print(sum);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define MOD 1000000007
using namespace std;
string to_hex(int x) {
stringstream ss;
ss << hex << x;
return ss.str();
}
inline int get_int() {
int ret;
scanf("%d", &ret);
return ret;
}
inline vector<int> get_ints(int n) {
vector<int> ret(n);
FOR(i, n) { scanf("%d", &ret[i]); }
return ret;
}
inline string get_str() {
string ret;
cin >> ret;
return ret;
}
bool is_prime(int n) {
int s = sqrt(n) + 1;
for (int i = 2; i <= s; ++i) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
vector<P> prime_division(int n) {
vector<P> ret;
int s = sqrt(n) + 1;
int c = 0;
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
c = 0;
do {
++c;
n /= i;
} while (n % i == 0);
ret.push_back(P(i, c));
}
}
return ret;
}
struct UnionFind {
vector<int> data;
UnionFind(int size) { data = vector<int>(size, -1); }
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
string to_string(string s) { return s; }
template <class T> string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail> void debug_print(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug_print(tail...);
}
template <class... T> void debug(T... args) {
cerr << "[" << __LINE__ << "]: ";
debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll max_minus = 1e10;
ll sum = 0;
int minus_ct = 0;
FOR(i, N) {
ll A;
cin >> A;
sum += abs(A);
if (A <= 0) {
minus_ct++;
}
if (max_minus > abs(A)) {
max_minus = abs(A);
}
}
if (minus_ct % 2 == 1) {
sum -= 2 * max_minus;
}
print(sum);
return 0;
} | [
"control_flow.branch.if.condition.change",
"call.add"
] | 875,759 | 875,760 | u656771711 | cpp |
p03062 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> map<T, T> primeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
template <typename T> bool IsPrimeNumber(T num) {
if (num <= 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i, s, e) for (ll i = s; i < e; i++)
#define repeq(i, s, e) for (ll i = s; i <= e; i++)
int main() {
ll n, ans = 0;
in(n);
vll a(n);
pair<ll, ll> tmp = make_pair(1000000001, -1);
in(a[0]);
rep(i, 1, n) {
in(a[i]);
if (a[i - 1] < 0) {
a[i - 1] *= -1;
a[i] *= -1;
}
if (tmp.first > a[i - 1]) {
tmp.first = a[i - 1];
tmp.second = i - 1;
}
}
if (a[n - 1] < 0) {
if (a[n - 1] > tmp.first) {
a[n - 1] *= -1;
a[tmp.second] *= -1;
}
}
rep(i, 0, n) { ans += a[i]; }
outn(ans);
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> map<T, T> primeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
template <typename T> bool IsPrimeNumber(T num) {
if (num <= 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i, s, e) for (ll i = s; i < e; i++)
#define repeq(i, s, e) for (ll i = s; i <= e; i++)
int main() {
ll n, ans = 0;
in(n);
vll a(n);
pair<ll, ll> tmp = make_pair(1000000001, -1);
in(a[0]);
rep(i, 1, n) {
in(a[i]);
if (a[i - 1] < 0) {
a[i - 1] *= -1;
a[i] *= -1;
}
if (tmp.first > a[i - 1]) {
tmp.first = a[i - 1];
tmp.second = i - 1;
}
}
if (a[n - 1] < 0) {
if (a[n - 1] * -1 > tmp.first) {
a[n - 1] *= -1;
a[tmp.second] *= -1;
}
}
rep(i, 0, n) { ans += a[i]; }
outn(ans);
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 875,769 | 875,770 | u757628628 | cpp |
p03062 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> map<T, T> primeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
template <typename T> bool IsPrimeNumber(T num) {
if (num <= 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i, s, e) for (ll i = s; i < e; i++)
#define repeq(i, s, e) for (ll i = s; i <= e; i++)
int main() {
ll n, ans = 0;
in(n);
vll a(n);
pair<ll, ll> tmp = make_pair(1000000001, -1);
in(a[0]);
rep(i, 1, n) {
in(a[i]);
if (a[i - 1] < 0) {
a[i - 1] *= -1;
a[i] *= -1;
}
if (tmp.first > a[i - 1]) {
tmp.first = a[i - 1];
tmp.second = i - 1;
}
}
if (a[n - 1] < 0) {
if (a[n - 1] > tmp.first) {
a[n - 1] *= 1;
a[tmp.second] *= -1;
}
}
rep(i, 0, n) { ans += a[i]; }
outn(ans);
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> map<T, T> primeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
template <typename T> bool IsPrimeNumber(T num) {
if (num <= 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i, s, e) for (ll i = s; i < e; i++)
#define repeq(i, s, e) for (ll i = s; i <= e; i++)
int main() {
ll n, ans = 0;
in(n);
vll a(n);
pair<ll, ll> tmp = make_pair(1000000001, -1);
in(a[0]);
rep(i, 1, n) {
in(a[i]);
if (a[i - 1] < 0) {
a[i - 1] *= -1;
a[i] *= -1;
}
if (tmp.first > a[i - 1]) {
tmp.first = a[i - 1];
tmp.second = i - 1;
}
}
if (a[n - 1] < 0) {
if (a[n - 1] * -1 > tmp.first) {
a[n - 1] *= -1;
a[tmp.second] *= -1;
}
}
rep(i, 0, n) { ans += a[i]; }
outn(ans);
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.unary.arithmetic.add"
] | 875,771 | 875,770 | u757628628 | cpp |
p03062 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define sortAl(v) sort(v.begin(), v.end())
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define cout(n) cout << fixed << setprecision(n)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> v(n);
FOR(i, 0, n) cin >> v[i];
bool is_odd = false;
FOR(i, 0, n) if (v[i] < 0) is_odd += 1;
ll ans = 0;
FOR(i, 0, n) ans += abs(abs(v[i]));
if (is_odd) {
ll x = 1e9;
FOR(i, 0, n) x = min(x, abs(v[i]));
ans -= x * 2;
}
cout << ans << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define sortAl(v) sort(v.begin(), v.end())
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define cout(n) cout << fixed << setprecision(n)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> v(n);
FOR(i, 0, n) cin >> v[i];
bool is_odd = false;
FOR(i, 0, n) if (v[i] < 0) is_odd ^= 1;
ll ans = 0;
FOR(i, 0, n) ans += abs(abs(v[i]));
if (is_odd) {
ll x = 1e9;
FOR(i, 0, n) x = min(x, abs(v[i]));
ans -= x * 2;
}
cout << ans << endl;
} | [
"expression.operator.change"
] | 875,772 | 875,773 | u347746039 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return 0;
return gcd(b, b % a);
}
int main() {
long int n, c = 0, b = 0, min;
cin >> n;
for (int i = 0; i < n; ++i) {
long int a;
cin >> a;
if (i == 0)
min = a;
if (a < 0)
c++;
b += abs(a);
if (abs(a) < abs(min)) {
min = abs(a);
}
}
cout << (c % 2 == 0 ? b : b - min * 2) << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return 0;
return gcd(b, b % a);
}
int main() {
long int n, c = 0, b = 0, min;
cin >> n;
for (int i = 0; i < n; ++i) {
long int a;
cin >> a;
if (i == 0)
min = abs(a);
if (a < 0)
c++;
b += abs(a);
if (abs(a) < abs(min)) {
min = abs(a);
}
}
cout << (c % 2 == 0 ? b : b - min * 2) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 875,774 | 875,775 | u798665594 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
#define max0(a, b, c) max(max(a, b), c)
#define min0(a, b, c) min(min(a, b), c)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int max_n = 100000;
int n;
ll a[max_n + 1];
void solve() {
ll ans = 0, hu = 0;
bool flag = false;
rep(i, n) {
if (a[i] == 0)
flag = true;
else if (a[i] < 0)
hu++;
}
if (flag || hu % 2 == 0) {
rep(i, n) ans += abs(a[i]);
cout << ans;
} else {
rep(i, n) ans += abs(a[i]);
priority_queue<ll, vector<ll>, greater<ll>> p;
priority_queue<ll, vector<ll>, greater<ll>> m;
rep(i, n) {
if (a[i] > 0)
p.push(a[i]);
else
m.push(abs(a[i]));
}
if (p.empty())
ans -= 2 * m.top();
else
ans -= 2 * min(p.top(), m.top());
}
cout << ans;
}
int main() {
cin >> n;
rep(i, n) cin >> a[i];
solve();
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
#define max0(a, b, c) max(max(a, b), c)
#define min0(a, b, c) min(min(a, b), c)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int max_n = 100000;
int n;
ll a[max_n + 1];
void solve() {
ll ans = 0, hu = 0;
bool flag = false;
rep(i, n) {
if (a[i] == 0)
flag = true;
else if (a[i] < 0)
hu++;
}
if (flag || hu % 2 == 0) {
rep(i, n) ans += abs(a[i]);
} else {
rep(i, n) ans += abs(a[i]);
priority_queue<ll, vector<ll>, greater<ll>> p;
priority_queue<ll, vector<ll>, greater<ll>> m;
rep(i, n) {
if (a[i] > 0)
p.push(a[i]);
else
m.push(abs(a[i]));
}
if (p.empty())
ans -= 2 * m.top();
else
ans -= 2 * min(p.top(), m.top());
}
cout << ans;
}
int main() {
cin >> n;
rep(i, n) cin >> a[i];
solve();
} | [] | 875,778 | 875,779 | u619683748 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
ll a[100000], n;
int main() {
cin >> n;
ll mn = 1L << 60;
ll mi = 0;
ll ans = 0;
ll z = 0;
rep(i, n) {
cin >> a[i];
if (a[i] < 0)
mi++;
else if (a[i] == 0)
z++;
chmin(mn, abs(a[i]));
ans += abs(a[i]);
}
if (mi % 2) {
if (z > 0) {
cout << ans << endl;
} else {
cout << ans - 2 * mi << endl;
}
} else {
cout << ans << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
ll a[100000], n;
int main() {
cin >> n;
ll mn = 1L << 60;
ll mi = 0;
ll ans = 0;
ll z = 0;
rep(i, n) {
cin >> a[i];
if (a[i] < 0)
mi++;
else if (a[i] == 0)
z++;
chmin(mn, abs(a[i]));
ans += abs(a[i]);
}
if (mi % 2) {
if (z) {
cout << ans << endl;
} else {
cout << ans - 2 * mn << endl;
}
} else {
cout << ans << endl;
}
}
| [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 875,780 | 875,781 | u926242698 | cpp |
p03062 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define y0 y3487465 // j0
#define y1 y1347829 // j1
#define INF2 4000000000000000037
#define INF 1000000007
#define PI (acos(-1))
#define MOD 1000000007
#define EPS 1e(-9);
using namespace std;
typedef long long ll;
void Main() {
int N;
cin >> N;
ll A[N];
ll minusmin = -INF;
ll plusmin = INF;
ll ans = 0;
ll minusct = 0;
rep(i, N) {
cin >> A[i];
if (A[i] < 0) {
minusct++;
ans -= A[i];
maxi(minusmin, A[i]);
} else {
ans += A[i];
mini(plusmin, A[i]);
}
}
if (minusct % 2 == 1) {
if (minusmin + plusmin < 0) {
ans -= plusmin;
} else {
ans += minusmin;
}
}
cout << ans << "\n";
}
//-----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------
| #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define y0 y3487465 // j0
#define y1 y1347829 // j1
#define INF2 4000000000000000037
#define INF 1000000007
#define PI (acos(-1))
#define MOD 1000000007
#define EPS 1e(-9);
using namespace std;
typedef long long ll;
void Main() {
int N;
cin >> N;
ll A[N];
ll minusmin = -INF;
ll plusmin = INF;
ll ans = 0;
ll minusct = 0;
rep(i, N) {
cin >> A[i];
if (A[i] < 0) {
minusct++;
ans -= A[i];
maxi(minusmin, A[i]);
} else {
ans += A[i];
mini(plusmin, A[i]);
}
}
if (minusct % 2 == 1) {
if (minusmin + plusmin < 0) {
ans -= plusmin * 2;
} else {
ans += minusmin * 2;
}
}
cout << ans << "\n";
}
//-----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------
| [
"assignment.change"
] | 875,800 | 875,801 | u556276145 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int, int>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for (auto &&x : c)
#define rep(i, a, n) for (int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, n) for (int i = (int)(n); i >= 0; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_ = 1001001001;
const long long INF = 1001001001001001001LL;
const int DX[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0},
DY[9] = {-1, 0, 1, 0, -1, 1, 1, -1, 0};
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto i = begin(v); i != end(v); i++)
os << *i << (i == end(v) - 1 ? "" : " ");
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto i = begin(v); i != end(v); i++)
is >> *i;
return is;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T, class U> bool chmax(T &a, const U &b) {
return a < b ? a = b, 1 : 0;
}
template <class T, class U> bool chmin(T &a, const U &b) {
return a > b ? a = b, 1 : 0;
}
template <class T> void psum(T &c) { partial_sum(begin(c), end(c), begin(c)); }
template <class T> using heap = priority_queue<T, vector<T>, greater<T>>;
struct before_main_function {
before_main_function() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << setprecision(15) << fixed;
// #define endl "\n"
}
} before_main_function;
template <class T, typename U>
void assign(T &container, int N, initializer_list<U> list) {
for (auto e : list) {
container[N] = e;
N++;
}
}
//------------------8<------------------------------------8<--------------------
signed main() {
int N;
cin >> N;
vector<int> A(N);
cin >> A;
int minuscnt = 0;
int absmine = 10e9, abse, sum;
for (auto e : A) {
if (e >= 0) {
abse = e;
} else {
abse = -e;
minuscnt++;
}
if (absmine > abse) {
sum += absmine;
absmine = abse;
} else {
sum += abse;
}
}
sum -= 10e9;
if (absmine == 0 || minuscnt % 2 == 0) {
sum += absmine;
} else {
sum -= absmine;
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int, int>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for (auto &&x : c)
#define rep(i, a, n) for (int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, n) for (int i = (int)(n); i >= 0; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_ = 1001001001;
const long long INF = 1001001001001001001LL;
const int DX[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0},
DY[9] = {-1, 0, 1, 0, -1, 1, 1, -1, 0};
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto i = begin(v); i != end(v); i++)
os << *i << (i == end(v) - 1 ? "" : " ");
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto i = begin(v); i != end(v); i++)
is >> *i;
return is;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T, class U> bool chmax(T &a, const U &b) {
return a < b ? a = b, 1 : 0;
}
template <class T, class U> bool chmin(T &a, const U &b) {
return a > b ? a = b, 1 : 0;
}
template <class T> void psum(T &c) { partial_sum(begin(c), end(c), begin(c)); }
template <class T> using heap = priority_queue<T, vector<T>, greater<T>>;
struct before_main_function {
before_main_function() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << setprecision(15) << fixed;
// #define endl "\n"
}
} before_main_function;
template <class T, typename U>
void assign(T &container, int N, initializer_list<U> list) {
for (auto e : list) {
container[N] = e;
N++;
}
}
//------------------8<------------------------------------8<--------------------
signed main() {
int N;
cin >> N;
vector<int> A(N);
cin >> A;
int minuscnt = 0;
int absmine = 10e9, abse, sum = 0;
for (auto e : A) {
if (e >= 0) {
abse = e;
} else {
abse = -e;
minuscnt++;
}
if (absmine > abse) {
sum += absmine;
absmine = abse;
} else {
sum += abse;
}
}
sum -= 10e9;
if (absmine == 0 || minuscnt % 2 == 0) {
sum += absmine;
} else {
sum -= absmine;
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 875,802 | 875,803 | u087520103 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
int neg = 0, min = abs(a[0]), sum = 0, zero = 0;
for (i = 0; i < n; i++) {
if (a[i] < 0)
neg++;
if (a[i] == 0)
zero = 1;
if (abs(a[i]) < min)
min = abs(a[i]);
sum += abs(a[i]);
}
if (neg % 2 == 1 && zero == 0)
sum -= min * 2;
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long int neg = 0, min = abs(a[0]), sum = 0, zero = 0;
for (i = 0; i < n; i++) {
if (a[i] < 0)
neg++;
if (a[i] == 0)
zero = 1;
if (abs(a[i]) < min)
min = abs(a[i]);
sum += abs(a[i]);
}
if (neg % 2 == 1 && zero == 0)
sum -= min * 2;
cout << sum;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 875,805 | 875,806 | u408650734 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, sum = 0;
cin >> n;
long long x[n];
for (int i = 0; i < n; i += 1) {
cin >> x[i];
if (x[i] <= 0) {
sum ^= 1;
}
}
if (sum) {
long long maxi = -1000000000;
for (int i = 0; i < n; i += 1) {
ans += abs(x[i]);
maxi = max(maxi, abs(x[i]));
}
cout << ans - maxi;
} else {
for (int i = 0; i < n; i += 1) {
ans += abs(x[i]);
}
cout << ans;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, sum = 0;
cin >> n;
long long x[n];
for (int i = 0; i < n; i += 1) {
cin >> x[i];
if (x[i] <= 0) {
sum ^= 1;
}
}
if (sum) {
long long maxi = 1000000000;
for (int i = 0; i < n; i += 1) {
ans += abs(x[i]);
maxi = min(maxi, abs(x[i]));
}
cout << ans - 2 * maxi;
} else {
for (int i = 0; i < n; i += 1) {
ans += abs(x[i]);
}
cout << ans;
}
} | [
"expression.operation.unary.arithmetic.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 875,807 | 875,808 | u689442090 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
int n;
cin >> n;
vi v(n);
int c = 0;
rep(i, n) {
cin >> v[i];
if (v[i] < 0) {
c++;
v[i] *= -1;
}
}
if (c % 2 == 0) {
int sum = 0;
rep(i, n) sum += v[i];
cout << sum << endl;
} else {
int sum = 0;
sort(v.begin(), v.end());
rep(i, n) sum += v[i];
cout << sum - v[0] * 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
int n;
cin >> n;
vi v(n);
int c = 0;
rep(i, n) {
cin >> v[i];
if (v[i] < 0) {
c++;
v[i] *= -1;
}
}
if (c % 2 == 0) {
ll sum = 0;
rep(i, n) sum += v[i];
cout << sum << endl;
} else {
ll sum = 0;
sort(v.begin(), v.end());
rep(i, n) sum += v[i];
cout << sum - v[0] * 2 << endl;
}
}
| [
"variable_declaration.type.change"
] | 875,821 | 875,822 | u422633119 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
int n;
cin >> n;
vi v(n);
int c = 0;
rep(i, n) {
cin >> v[i];
if (v[i] < 0) {
c++;
v[i] *= -1;
}
}
if (c % 2 == 0) {
int sum = 0;
rep(i, n) sum += v[i];
cout << sum << endl;
} else {
int sum = 0;
sort(v.begin(), v.end());
rep(i, n) sum += v[i];
cout << sum - v[0] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
int n;
cin >> n;
vi v(n);
int c = 0;
rep(i, n) {
cin >> v[i];
if (v[i] < 0) {
c++;
v[i] *= -1;
}
}
if (c % 2 == 0) {
ll sum = 0;
rep(i, n) sum += v[i];
cout << sum << endl;
} else {
ll sum = 0;
sort(v.begin(), v.end());
rep(i, n) sum += v[i];
cout << sum - v[0] * 2 << endl;
}
}
| [
"variable_declaration.type.change"
] | 875,823 | 875,822 | u422633119 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[110000];
signed main() {
cin >> N;
int ans = 0, m = INT_MAX, minus = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ans += abs(a[i]);
m = min(m, abs(a[i]));
minus += (a[i] < 0);
}
if (minus & 1)
ans -= m;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[110000];
signed main() {
cin >> N;
int ans = 0, m = INT_MAX, minus = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ans += abs(a[i]);
m = min(m, abs(a[i]));
minus += (a[i] < 0);
}
if (minus & 1)
ans -= m * 2;
cout << ans << endl;
}
| [
"assignment.change"
] | 875,828 | 875,829 | u450832845 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[110000];
signed main() {
cin >> N;
int ans = 0, m = INT_MAX, minus = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ans += abs(a[i]);
m = min(m, abs(a[i]));
minus += a[i] < 0;
}
if (minus & 1)
ans -= m;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[110000];
signed main() {
cin >> N;
int ans = 0, m = INT_MAX, minus = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ans += abs(a[i]);
m = min(m, abs(a[i]));
minus += (a[i] < 0);
}
if (minus & 1)
ans -= m * 2;
cout << ans << endl;
}
| [
"assignment.change"
] | 875,830 | 875,829 | u450832845 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int count = 0;
vector<int64_t> a(n);
vector<int64_t> A(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
A.at(i) = abs(a.at(i));
if (a.at(i) < 0) {
count++;
}
}
sort(A.begin(), A.end());
int64_t sum = 0;
for (int i = 0; i < n; i++) {
sum += A.at(i);
}
if (count % 2 == 0) {
cout << sum;
} else {
cout << sum - A.at(0);
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int count = 0;
vector<int64_t> a(n);
vector<int64_t> A(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
A.at(i) = abs(a.at(i));
if (a.at(i) < 0) {
count++;
}
}
sort(A.begin(), A.end());
int64_t sum = 0;
for (int i = 0; i < n; i++) {
sum += A.at(i);
}
if (count % 2 == 0) {
cout << sum;
} else {
cout << sum - 2 * A.at(0);
}
} | [
"expression.operation.binary.add"
] | 875,831 | 875,832 | u607229598 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n;
cin >> n;
ll ans = 0;
ll min = 10000000000;
int count = 0;
bool has_zero = false;
rep(i, n) {
ll l;
cin >> l;
if (l == 0) {
has_zero = true;
} else if (l < 0) {
count++;
if (abs(l) < min) {
min = abs(l);
}
}
ans += abs(l);
}
if (has_zero || count % 2 == 0) {
cout << ans << endl;
} else {
cout << ans - 2 * min << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n;
cin >> n;
ll ans = 0;
ll min = 10000000000;
int count = 0;
bool has_zero = false;
rep(i, n) {
ll l;
cin >> l;
if (l == 0) {
has_zero = true;
} else if (l < 0) {
count++;
}
if (abs(l) < min) {
min = abs(l);
}
ans += abs(l);
}
if (has_zero || count % 2 == 0) {
cout << ans << endl;
} else {
cout << ans - 2 * min << endl;
}
return 0;
}
| [] | 875,837 | 875,838 | u292106243 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define pi pair<int, int>
#define pl pair<long long, long long>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define en cout << endl //セミコロンつけろ
//#define MM 1000000000
//#define MOD MM+7
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
// 'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
template <typename T> T GCD(T u, T v) { return v ? GCD(v, u % v) : u; }
template <typename T> T LCM(T x, T y) {
T gc = GCD(x, y);
return x * y / gc;
}
const int COM_MAX = 500500;
long long fac[COM_MAX], finv[COM_MAX], inv[COM_MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < COM_MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int N;
cin >> N;
vector<long long> a(N);
long long sum = 0, odd = 0, zer = 0;
long long mn = MM;
for (int i = 0; i < N; i++) {
cin >> a[i];
mn = min(mn, abs(a[i]));
if (a[i] % 2 == 0)
odd++;
sum += abs(a[i]);
if (a[i] == 0)
zer = 1;
}
if (odd % 2 == 0 || zer) {
cout << sum << endl;
} else {
cout << sum - 2 * mn << endl;
}
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define pi pair<int, int>
#define pl pair<long long, long long>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define en cout << endl //セミコロンつけろ
//#define MM 1000000000
//#define MOD MM+7
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
// 'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
template <typename T> T GCD(T u, T v) { return v ? GCD(v, u % v) : u; }
template <typename T> T LCM(T x, T y) {
T gc = GCD(x, y);
return x * y / gc;
}
const int COM_MAX = 500500;
long long fac[COM_MAX], finv[COM_MAX], inv[COM_MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < COM_MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int N;
cin >> N;
vector<long long> a(N);
long long sum = 0, odd = 0, zer = 0;
long long mn = MM;
for (int i = 0; i < N; i++) {
cin >> a[i];
mn = min(mn, abs(a[i]));
if (a[i] < 0)
odd++;
sum += abs(a[i]);
if (a[i] == 0)
zer = 1;
}
if (odd % 2 == 0 || zer) {
cout << sum << endl;
} else {
cout << sum - 2 * mn << endl;
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 875,846 | 875,847 | u342051078 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
int cnt;
ll int ans = 0;
ll int mind = 1e11;
cin >> n;
REP(i, n) {
ll int t;
cin >> t;
if (t <= 0) {
cnt++;
}
ans += abs(t);
mind = min(abs(t), mind);
}
if (cnt % 2 == 1) {
cout << ans - 2 * mind << endl;
} else {
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
int cnt = 0;
ll int ans = 0;
ll int mind = 1e15;
// cout << mind << endl;
cin >> n;
REP(i, n) {
ll int t;
cin >> t;
if (t <= 0) {
cnt++;
}
ans += abs(t);
mind = min(abs(t), mind);
}
if (cnt % 2 == 1) {
cout << ans - 2 * mind << endl;
} else {
cout << ans << endl;
}
}
| [
"variable_declaration.value.change",
"literal.number.change"
] | 875,854 | 875,853 | u086355897 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const ll mod = 1000000007;
const ll INF = mod * mod;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
//#define int long long
void solve() {
int n;
cin >> n;
ll a[100100];
rep(i, n) { cin >> a[i]; }
ll dp[100100][2];
dp[0][0] = 0;
dp[0][1] = -INF;
rep1(i, n) {
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], dp[i - 1][1] + 2 * a[i - 1]) - a[i];
}
cout << dp[n][0] << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// init();
solve();
// cout << "finish" << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const ll mod = 1000000007;
const ll INF = mod * mod;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
//#define int long long
void solve() {
int n;
cin >> n;
ll a[100100];
rep(i, n) { cin >> a[i]; }
ll dp[100100][2];
dp[0][0] = a[0];
dp[0][1] = -INF;
rep1(i, n) {
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], dp[i - 1][1] + 2 * a[i - 1]) - a[i];
}
cout << dp[n][0] << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// init();
solve();
// cout << "finish" << endl;
return 0;
} | [] | 875,857 | 875,858 | u508571192 | cpp |
p03062 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> p(n), x(n);
vector<int> r;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= 0)
a++;
else {
if (a % 2)
b++;
a = 0;
}
x[i] = abs(p[i]);
}
sort(x.begin(), x.end());
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += x[i];
}
if (a % 2)
ans -= x[0] * 2;
cout << ans << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> p(n), x(n);
vector<int> r;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= 0)
a++;
else {
if (a % 2)
b++;
// a = 0;
}
x[i] = abs(p[i]);
}
sort(x.begin(), x.end());
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += x[i];
}
if (a % 2)
ans -= x[0] * 2;
cout << ans << endl;
return 0;
} | [] | 875,861 | 875,862 | u098844816 | cpp |
p03062 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> p(n), x(n);
vector<int> r;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] < 0)
a++;
else {
if (a % 2)
b++;
a = 0;
}
x[i] = abs(p[i]);
}
sort(x.begin(), x.end());
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += x[i];
}
if (a % 2)
ans -= x[0] * 2;
cout << ans << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> p(n), x(n);
vector<int> r;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= 0)
a++;
else {
if (a % 2)
b++;
// a = 0;
}
x[i] = abs(p[i]);
}
sort(x.begin(), x.end());
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += x[i];
}
if (a % 2)
ans -= x[0] * 2;
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 875,863 | 875,862 | u098844816 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
int main() {
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll dp[n][2];
dp[0][0] = a[0];
dp[0][1] = -a[0];
rrep(i, 1, n - 1) {
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]);
}
// rep(i, n - 1) {rep(j, 2) cout << setw(11) << left << dp[i][j] << " "; cout
// << endl;} 最後i + 1番目選べないからそのまま
cout << max(dp[n - 2][0] + a[n - 1], dp[n - 2][1] + a[n - 1]) << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
int main() {
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll dp[n][2];
dp[0][0] = a[0];
dp[0][1] = -a[0];
rrep(i, 1, n - 1) {
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]);
}
// rep(i, n - 1) {rep(j, 2) cout << setw(11) << left << dp[i][j] << " "; cout
// << endl;} 最後i + 1番目選べないからそのまま
cout << max(dp[n - 2][0] + a[n - 1], dp[n - 2][1] - a[n - 1]) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 875,875 | 875,876 | u277556971 | cpp |
p03062 | #include <iostream>
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(a % b, b);
}
int n;
int a[500000], sum, b[500000], cnt;
int main() {
cin >> n;
int x = 1000000000;
for (int i = 1; i <= n; i++) {
cin >> b[i];
a[i] = abs(b[i]);
if (b[i] < 0)
cnt++;
sum += a[i];
x = min(x, a[i]);
}
if (cnt % 2)
sum -= 2 * x;
cout << sum;
} | #include <iostream>
#define int long long
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(a % b, b);
}
int n;
int a[500000], sum, b[500000], cnt;
signed main() {
cin >> n;
int x = 1000000000;
for (int i = 1; i <= n; i++) {
cin >> b[i];
a[i] = abs(b[i]);
if (b[i] < 0)
cnt++;
sum += a[i];
x = min(x, a[i]);
}
if (cnt % 2)
sum -= 2 * x;
cout << sum;
} | [
"variable_declaration.type.primitive.change"
] | 875,885 | 875,886 | u798339690 | cpp |
p03062 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, s = 0, c = 0, m = 1000000000;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 0)
s += a[i];
else if (a[i] < 0) {
c++;
s += -a[i];
}
m = min(m, (ll)fabs(a[i]));
}
if (m == 0 || c % 2 == 0)
cout << s << endl;
else
cout << s - m << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, s = 0, c = 0, m = 1000000000;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 0)
s += a[i];
else if (a[i] < 0) {
c++;
s += -a[i];
}
m = min(m, (ll)fabs(a[i]));
}
if (m == 0 || c % 2 == 0)
cout << s << endl;
else
cout << s - 2 * m << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 875,887 | 875,888 | u930561195 | cpp |
p03062 | //#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC push_options
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define __V vector
#define all(x) x.begin(), x.end()
#define oit ostream_iterator
#define mod 998244353ll
using namespace std;
void doin() {
cin.tie();
cout.tie();
ios::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
}
template <typename X, typename Y>
istream &operator>>(istream &in, pair<X, Y> &a) {
in >> a.first >> a.second;
return in;
}
template <typename T> void getv(T &i) { cin >> i; }
template <typename T, typename... Ns> void getv(vector<T> &v, int n, Ns... ns) {
v.resize(n);
for (auto &i : v)
getv(i, ns...);
}
template <typename T> void getv1(T &i) { cin >> i; }
template <typename T, typename... Ns>
void getv1(vector<T> &v, int n, Ns... ns) {
v.resize(n + 1);
for (int i = 1; i <= n; i++)
getv(v[i], ns...);
}
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
inline void getch(char &x) {
while (x = getchar_unlocked(), x < 33) {
;
}
}
inline void getstr(string &str) {
str.clear();
char cur;
while (cur = getchar_unlocked(), cur < 33) {
;
}
while (cur > 32) {
str += cur;
cur = getchar_unlocked();
}
}
template <typename T> inline bool sc(T &num) {
bool neg = 0;
int c;
num = 0;
while (c = getchar_unlocked(), c < 33) {
if (c == EOF)
return false;
}
if (c == '-') {
neg = 1;
c = getchar_unlocked();
}
for (; c > 47; c = getchar_unlocked())
num = num * 10 + c - 48;
if (neg)
num *= -1;
return true;
}
typedef unsigned long long ull;
typedef long long ll;
typedef float ld;
typedef ll _I;
typedef pair<_I, _I> pi;
typedef pair<ld, ld> pd;
typedef map<_I, _I> mii;
typedef __V<_I> vi;
typedef __V<char> vc;
typedef __V<ld> vd;
typedef __V<vd> vvd;
typedef __V<pi> vpi;
typedef __V<__V<_I>> vvi;
typedef __V<__V<char>> vvc;
typedef __V<__V<pi>> vvpi;
using AntonTsypko = void;
using arsijo = AntonTsypko;
using god = arsijo;
uniform_real_distribution<double> double_dist(0, 1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
int main() {
doin();
int n;
vi a;
cin >> n;
ll sum = 0, m = INT_MAX, d = 0;
getv(a, n);
for (auto i : a) {
sum += abs(i);
if (i < 0)
d++;
m = min(abs(i), m);
}
if (d & 1)
sum -= m;
cout << sum;
return 0;
}
| //#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC push_options
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define __V vector
#define all(x) x.begin(), x.end()
#define oit ostream_iterator
#define mod 998244353ll
using namespace std;
void doin() {
cin.tie();
cout.tie();
ios::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
}
template <typename X, typename Y>
istream &operator>>(istream &in, pair<X, Y> &a) {
in >> a.first >> a.second;
return in;
}
template <typename T> void getv(T &i) { cin >> i; }
template <typename T, typename... Ns> void getv(vector<T> &v, int n, Ns... ns) {
v.resize(n);
for (auto &i : v)
getv(i, ns...);
}
template <typename T> void getv1(T &i) { cin >> i; }
template <typename T, typename... Ns>
void getv1(vector<T> &v, int n, Ns... ns) {
v.resize(n + 1);
for (int i = 1; i <= n; i++)
getv(v[i], ns...);
}
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
inline void getch(char &x) {
while (x = getchar_unlocked(), x < 33) {
;
}
}
inline void getstr(string &str) {
str.clear();
char cur;
while (cur = getchar_unlocked(), cur < 33) {
;
}
while (cur > 32) {
str += cur;
cur = getchar_unlocked();
}
}
template <typename T> inline bool sc(T &num) {
bool neg = 0;
int c;
num = 0;
while (c = getchar_unlocked(), c < 33) {
if (c == EOF)
return false;
}
if (c == '-') {
neg = 1;
c = getchar_unlocked();
}
for (; c > 47; c = getchar_unlocked())
num = num * 10 + c - 48;
if (neg)
num *= -1;
return true;
}
typedef unsigned long long ull;
typedef long long ll;
typedef float ld;
typedef ll _I;
typedef pair<_I, _I> pi;
typedef pair<ld, ld> pd;
typedef map<_I, _I> mii;
typedef __V<_I> vi;
typedef __V<char> vc;
typedef __V<ld> vd;
typedef __V<vd> vvd;
typedef __V<pi> vpi;
typedef __V<__V<_I>> vvi;
typedef __V<__V<char>> vvc;
typedef __V<__V<pi>> vvpi;
using AntonTsypko = void;
using arsijo = AntonTsypko;
using god = arsijo;
uniform_real_distribution<double> double_dist(0, 1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
int main() {
doin();
int n;
vi a;
cin >> n;
ll sum = 0, m = INT_MAX, d = 0;
getv(a, n);
for (auto i : a) {
sum += abs(i);
if (i < 0)
d++;
m = min(abs(i), m);
}
if (d & 1)
sum -= 2 * m;
cout << sum;
return 0;
}
| [
"assignment.change"
] | 875,891 | 875,892 | u084411645 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli N, sum = 0, min = 2000000000, count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
lli a;
cin >> a;
if (a < 0) {
count++;
CHMIN(min, abs(a));
}
sum += abs(a);
}
if (count % 2 == 1)
COUT(sum - 2 * min);
else
COUT(sum);
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli N, sum = 0, min = 2000000000, count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
lli a;
cin >> a;
if (a < 0) {
count++;
}
CHMIN(min, abs(a));
sum += abs(a);
}
if (count % 2 == 1)
COUT(sum - 2 * min);
else
COUT(sum);
return 0;
} | [] | 875,893 | 875,894 | u155216115 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli N, sum = 0, min = 2000000000, count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
lli a;
cin >> a;
if (a < 0)
count++;
CHMIN(min, a);
sum += abs(a);
}
if (count % 2 == 1)
COUT(sum + 2 * min);
else
COUT(sum);
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli N, sum = 0, min = 2000000000, count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
lli a;
cin >> a;
if (a < 0) {
count++;
}
CHMIN(min, abs(a));
sum += abs(a);
}
if (count % 2 == 1)
COUT(sum - 2 * min);
else
COUT(sum);
return 0;
} | [
"call.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 875,895 | 875,894 | u155216115 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
ll ans;
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &(a[i]));
}
int cnt = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 0)
cnt += 1;
}
ll whole = 0LL;
ll min_a = INF;
for (int i = 0; i < n; ++i) {
whole += abs(a[i]);
min_a = min(min_a, abs(a[i]));
}
if (cnt % 2 == 0) {
ans = whole;
} else {
ans = whole - min_a;
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
ll ans;
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &(a[i]));
}
int cnt = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 0)
cnt += 1;
}
ll whole = 0LL;
ll min_a = INF;
for (int i = 0; i < n; ++i) {
whole += abs(a[i]);
min_a = min(min_a, abs(a[i]));
}
if (cnt % 2 == 0) {
ans = whole;
} else {
ans = whole - 2 * min_a;
}
printf("%lld\n", ans);
return 0;
}
| [
"assignment.change"
] | 875,898 | 875,899 | u497422208 | cpp |
p03062 | /*
*
* Author : Amit Kumar
* Date : June 3 2019
*
*/
#include <bits/stdc++.h>
//#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#define msl map<string, long long>
#define umii unordered_map<int, int>
#define umll unordered_map<long long, long long>
#define umsi unordered_map<string, int>
#define umsl map<string, long long>
#define si set<int>
#define sl set<long long>
#define pii pair<int, int>
#define psi pair<string, int>
#define psl pair<string, long>
#define pll pair<long long, long long>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpsi vector<psi>
#define vpsl vector<psl>
#define pqi priority_queue<int>
#define pql priority_queue<long long>
#define ub upper_bound
#define lb lower_bound
#define bint long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define iv(v) \
for (auto &i : v) { \
cin >> i; \
}
#define ov(v) \
for (auto i : v) { \
cout << i << " "; \
} \
cout << endl;
#define ovn(v) \
for (auto i : v) { \
cout << i << endl; \
}
#define euv(v) \
for (auto i : v) { \
cerr << i << " "; \
} \
cerr << endl;
#define eovn(v) \
for (auto i : v) { \
cerr << i << endl; \
}
#define os(s) \
for (auto itr : s) { \
cout << itr << " "; \
} \
cout << endl;
#define osn(s) \
for (auto itr : s) { \
cout << itr << endl; \
}
#define eos(s) \
for (auto itr : s) { \
cerr << itr << " "; \
} \
cerr << endl;
#define eosn(s) \
for (auto itr : s) { \
cerr << itr << endl; \
}
#define rep(x) for (auto i = 0; i < (x); ++i)
#define _rep(a, b) for (auto i = (a); i < (b); ++i)
#define endl '\n'
using namespace std;
auto SOLUTION_FUNCTION(void) -> void {
// your solution goes here
bint n;
cin >> n;
bint min_number = INT_MAX;
bint sum = 0;
bint negative_counter = 0;
rep(n) {
bint temp;
cin >> temp;
negative_counter += (temp < 0);
min_number = min(abs(temp), min_number);
sum += abs(temp);
}
if (negative_counter & 1)
cout << sum - min_number << endl;
else
cout << sum << endl;
return;
}
int main(void) {
#ifdef FAST_INPUT_OUTPUT
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(10);
cout << fixed;
cout << boolalpha;
#endif
#ifdef MY_LOCAL_PROJECT
freopen("din", "r", stdin);
freopen("dout", "w", stdout);
#endif
int testcase = 1;
#ifdef MORE_THAN_ONE_TESTCASE
cin >> testcase;
#endif
while (testcase--) {
SOLUTION_FUNCTION();
}
#ifdef MY_LOCAL_PROJECT
cout << "Time : " << 1.0 * (double)clock() / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
| /*
*
* Author : Amit Kumar
* Date : June 3 2019
*
*/
#include <bits/stdc++.h>
//#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#define msl map<string, long long>
#define umii unordered_map<int, int>
#define umll unordered_map<long long, long long>
#define umsi unordered_map<string, int>
#define umsl map<string, long long>
#define si set<int>
#define sl set<long long>
#define pii pair<int, int>
#define psi pair<string, int>
#define psl pair<string, long>
#define pll pair<long long, long long>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpsi vector<psi>
#define vpsl vector<psl>
#define pqi priority_queue<int>
#define pql priority_queue<long long>
#define ub upper_bound
#define lb lower_bound
#define bint long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define iv(v) \
for (auto &i : v) { \
cin >> i; \
}
#define ov(v) \
for (auto i : v) { \
cout << i << " "; \
} \
cout << endl;
#define ovn(v) \
for (auto i : v) { \
cout << i << endl; \
}
#define euv(v) \
for (auto i : v) { \
cerr << i << " "; \
} \
cerr << endl;
#define eovn(v) \
for (auto i : v) { \
cerr << i << endl; \
}
#define os(s) \
for (auto itr : s) { \
cout << itr << " "; \
} \
cout << endl;
#define osn(s) \
for (auto itr : s) { \
cout << itr << endl; \
}
#define eos(s) \
for (auto itr : s) { \
cerr << itr << " "; \
} \
cerr << endl;
#define eosn(s) \
for (auto itr : s) { \
cerr << itr << endl; \
}
#define rep(x) for (auto i = 0; i < (x); ++i)
#define _rep(a, b) for (auto i = (a); i < (b); ++i)
#define endl '\n'
using namespace std;
auto SOLUTION_FUNCTION(void) -> void {
// your solution goes here
bint n;
cin >> n;
bint min_number = INT_MAX;
bint sum = 0;
bint negative_counter = 0;
rep(n) {
bint temp;
cin >> temp;
negative_counter += (temp < 0);
min_number = min(abs(temp), min_number);
sum += abs(temp);
}
if (negative_counter & 1)
cout << sum - (2 * min_number) << endl;
else
cout << sum << endl;
return;
}
int main(void) {
#ifdef FAST_INPUT_OUTPUT
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(10);
cout << fixed;
cout << boolalpha;
#endif
#ifdef MY_LOCAL_PROJECT
freopen("din", "r", stdin);
freopen("dout", "w", stdout);
#endif
int testcase = 1;
#ifdef MORE_THAN_ONE_TESTCASE
cin >> testcase;
#endif
while (testcase--) {
SOLUTION_FUNCTION();
}
#ifdef MY_LOCAL_PROJECT
cout << "Time : " << 1.0 * (double)clock() / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
| [] | 875,902 | 875,903 | u896543512 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int c = 0;
int s = 0;
int m = 1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
c += (a[i] < 0 ? 1 : 0);
s += abs(a[i]);
m = min(m, abs(a[i]));
}
cout << (c % 2 == 0 ? s : s - 2 * m) << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n;
cin >> n;
int a[n];
int c = 0;
int s = 0;
int m = 1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
c += (a[i] < 0 ? 1 : 0);
s += abs(a[i]);
m = min(m, abs(a[i]));
}
cout << (c % 2 == 0 ? s : s - 2 * m) << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 875,907 | 875,908 | u948459352 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define FOR(i, n) for (size_t i = 0; i < (n); i++)
#define cinv(v, n) \
for (size_t i = 0; i < (n); i++) { \
cin >> (v)[i]; \
}
#define nvec(type, v, n) \
vector<type> v(n); \
cinv(v, n)
#define npairs(type1, type2, v, n) \
vector<pair<type1, type2>> v(n); \
for (size_t i = 0; i < (n); i++) { \
cin >> v[i].first >> v[i].second; \
}
#define min_index(v) size_t(min_element(all(v)) - (v).begin())
#define max_index(v) size_t(max_element(all(v)) - (v).begin())
#define min_e(v) *min_element(all(v))
#define max_e(v) *max_element(all(v))
#define count_le(v, a) size_t(upper_bound(all(v), a) - (v).begin())
#define count_lt(v, a) size_t(lower_bound(all(v), a) - (v).begin())
#define count_ge(v, a) size_t((v).end() - lower_bound(all(v), a))
#define count_gt(v, a) size_t((v).end() - upper_bound(all(v), a))
#define order(neq_sl) [](const &auto s, const &auto l) { return neq_sl; }
#define make_lr(v, type, l, r) \
vector<type> l(n + 1), r(n + 1); \
FOR(i, n) { \
l[i + 1] = l[i] + v[i]; \
r[i + 1] = r[i] + v[n - 1 - i]; \
}
#define acm accumulate
#define SUM(v) accumulate(all(v), 0l)
int main() {
int n;
cin >> n;
nvec(long, a, n);
sort(all(a));
bool b = count_lt(a, 0) % 2 == 0;
FOR(i, n) { a[i] = abs(a[i]); }
cout << SUM(a) - min_e(a) * 2 * b;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define FOR(i, n) for (size_t i = 0; i < (n); i++)
#define cinv(v, n) \
for (size_t i = 0; i < (n); i++) { \
cin >> (v)[i]; \
}
#define nvec(type, v, n) \
vector<type> v(n); \
cinv(v, n)
#define npairs(type1, type2, v, n) \
vector<pair<type1, type2>> v(n); \
for (size_t i = 0; i < (n); i++) { \
cin >> v[i].first >> v[i].second; \
}
#define min_index(v) size_t(min_element(all(v)) - (v).begin())
#define max_index(v) size_t(max_element(all(v)) - (v).begin())
#define min_e(v) *min_element(all(v))
#define max_e(v) *max_element(all(v))
#define count_le(v, a) size_t(upper_bound(all(v), a) - (v).begin())
#define count_lt(v, a) size_t(lower_bound(all(v), a) - (v).begin())
#define count_ge(v, a) size_t((v).end() - lower_bound(all(v), a))
#define count_gt(v, a) size_t((v).end() - upper_bound(all(v), a))
#define order(neq_sl) [](const &auto s, const &auto l) { return neq_sl; }
#define make_lr(v, type, l, r) \
vector<type> l(n + 1), r(n + 1); \
FOR(i, n) { \
l[i + 1] = l[i] + v[i]; \
r[i + 1] = r[i] + v[n - 1 - i]; \
}
#define acm accumulate
#define SUM(v) accumulate(all(v), 0l)
int main() {
int n;
cin >> n;
nvec(long, a, n);
sort(all(a));
bool b = count_lt(a, 0) % 2;
FOR(i, n) { a[i] = abs(a[i]); }
cout << SUM(a) - min_e(a) * 2 * b;
} | [
"expression.operation.binary.remove"
] | 875,915 | 875,916 | u412025794 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define FOR(i, n) for (size_t i = 0; i < (n); i++)
#define cinv(v, n) \
for (size_t i = 0; i < (n); i++) { \
cin >> (v)[i]; \
}
#define nvec(type, v, n) \
vector<type> v(n); \
cinv(v, n)
#define npairs(type1, type2, v, n) \
vector<pair<type1, type2>> v(n); \
for (size_t i = 0; i < (n); i++) { \
cin >> v[i].first >> v[i].second; \
}
#define min_index(v) size_t(min_element(all(v)) - (v).begin())
#define max_index(v) size_t(max_element(all(v)) - (v).begin())
#define min_e(v) *min_element(all(v))
#define max_e(v) *max_element(all(v))
#define count_le(v, a) size_t(upper_bound(all(v), a) - (v).begin())
#define count_lt(v, a) size_t(lower_bound(all(v), a) - (v).begin())
#define count_ge(v, a) size_t((v).end() - lower_bound(all(v), a))
#define count_gt(v, a) size_t((v).end() - upper_bound(all(v), a))
#define order(neq_sl) [](const &auto s, const &auto l) { return neq_sl; }
#define make_lr(v, type, l, r) \
vector<type> l(n + 1), r(n + 1); \
FOR(i, n) { \
l[i + 1] = l[i] + v[i]; \
r[i + 1] = r[i] + v[n - 1 - i]; \
}
#define acm accumulate
#define SUM(v) accumulate(all(v), 0l)
int main() {
int n;
cin >> n;
nvec(long, a, n);
sort(all(a));
bool b = count_lt(a, 0) % 2 == 0;
FOR(i, n) { a[i] = abs(a[i]); }
cout << SUM(a) - min_e(a) * 2 * b;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define FOR(i, n) for (size_t i = 0; i < (n); i++)
#define cinv(v, n) \
for (size_t i = 0; i < (n); i++) { \
cin >> (v)[i]; \
}
#define nvec(type, v, n) \
vector<type> v(n); \
cinv(v, n)
#define npairs(type1, type2, v, n) \
vector<pair<type1, type2>> v(n); \
for (size_t i = 0; i < (n); i++) { \
cin >> v[i].first >> v[i].second; \
}
#define min_index(v) size_t(min_element(all(v)) - (v).begin())
#define max_index(v) size_t(max_element(all(v)) - (v).begin())
#define min_e(v) *min_element(all(v))
#define max_e(v) *max_element(all(v))
#define count_le(v, a) size_t(upper_bound(all(v), a) - (v).begin())
#define count_lt(v, a) size_t(lower_bound(all(v), a) - (v).begin())
#define count_ge(v, a) size_t((v).end() - lower_bound(all(v), a))
#define count_gt(v, a) size_t((v).end() - upper_bound(all(v), a))
#define order(neq_sl) [](const &auto s, const &auto l) { return neq_sl; }
#define make_lr(v, type, l, r) \
vector<type> l(n + 1), r(n + 1); \
FOR(i, n) { \
l[i + 1] = l[i] + v[i]; \
r[i + 1] = r[i] + v[n - 1 - i]; \
}
#define acm accumulate
#define SUM(v) accumulate(all(v), 0l)
int main() {
int n;
cin >> n;
nvec(long, a, n);
sort(all(a));
bool b = count_lt(a, 0) % 2 != 0;
FOR(i, n) { a[i] = abs(a[i]); }
cout << SUM(a) - min_e(a) * 2 * b;
} | [
"misc.opposites",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 875,915 | 875,918 | u412025794 | cpp |
p03062 | #include <bits/stdc++.h>
#define MOD 1000000007
#define MOD2 1000000006
#define TEMPMOD1 998244353
#define TEMPMOD2 998244352
#define INF 1000000000000000007
#define NEGINF -1000000000000000007
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define vpll vector<pll>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll arr1[n];
for (ll i = 0; i < n; i++) {
cin >> arr1[i];
}
sort(arr1, arr1 + n);
ll ans = 0, store;
ll pos = 0;
for (; pos < n; pos += 2) {
if (pos == (n - 1)) {
break;
}
store = arr1[pos] + arr1[pos + 1];
if (store >= 0) {
ans += store;
pos++;
break;
}
ans -= store;
}
for (; pos < n; pos++) {
ans += arr1[pos];
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define MOD 1000000007
#define MOD2 1000000006
#define TEMPMOD1 998244353
#define TEMPMOD2 998244352
#define INF 1000000000000000007
#define NEGINF -1000000000000000007
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define vpll vector<pll>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll arr1[n];
for (ll i = 0; i < n; i++) {
cin >> arr1[i];
}
sort(arr1, arr1 + n);
ll ans = 0, store;
ll pos = 0;
for (; pos < n; pos += 2) {
if (pos == (n - 1)) {
break;
}
store = arr1[pos] + arr1[pos + 1];
if (store >= 0) {
ans += store;
pos += 2;
break;
}
ans -= store;
}
for (; pos < n; pos++) {
ans += arr1[pos];
}
cout << ans;
return 0;
} | [] | 875,919 | 875,920 | u785846901 | cpp |
p03062 | #include <bits/stdc++.h>
#define MOD 1000000007
#define MOD2 1000000006
#define TEMPMOD1 998244353
#define TEMPMOD2 998244352
#define INF 1000000000000000007
#define NEGINF -1000000000000000007
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define vpll vector<pll>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll arr1[n];
for (ll i = 0; i < n; i++) {
cin >> arr1[i];
}
sort(arr1, arr1 + n);
ll ans = 0, store;
ll pos = 0;
for (; pos < n; pos += 2) {
if (pos == (n - 1)) {
break;
}
store = arr1[pos] + arr1[pos + 1];
if (store >= 0) {
ans += store;
break;
}
ans -= store;
}
for (; pos < n; pos++) {
ans += arr1[pos];
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define MOD 1000000007
#define MOD2 1000000006
#define TEMPMOD1 998244353
#define TEMPMOD2 998244352
#define INF 1000000000000000007
#define NEGINF -1000000000000000007
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define vpll vector<pll>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll arr1[n];
for (ll i = 0; i < n; i++) {
cin >> arr1[i];
}
sort(arr1, arr1 + n);
ll ans = 0, store;
ll pos = 0;
for (; pos < n; pos += 2) {
if (pos == (n - 1)) {
break;
}
store = arr1[pos] + arr1[pos + 1];
if (store >= 0) {
ans += store;
pos += 2;
break;
}
ans -= store;
}
for (; pos < n; pos++) {
ans += arr1[pos];
}
cout << ans;
return 0;
} | [
"assignment.add"
] | 875,921 | 875,920 | u785846901 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
bool SecondCompare(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
bool SecondCompareDes(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
ll minll(ll a, ll b) {
if (a >= b)
return b;
else
return a;
}
ll maxll(ll a, ll b) {
if (a >= b)
return a;
else
return b;
}
ll n;
const int SIZE = 2e5 + 10;
ll a[SIZE];
ll cou;
int main() {
cin >> n;
ll min_num = LL_INF;
ll ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
++cou;
ans += abs(a[i]);
min_num = min(abs(a[i]), min_num);
}
if (cou % 2 != 0) {
ans -= min_num;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
bool SecondCompare(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
bool SecondCompareDes(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
ll minll(ll a, ll b) {
if (a >= b)
return b;
else
return a;
}
ll maxll(ll a, ll b) {
if (a >= b)
return a;
else
return b;
}
ll n;
const int SIZE = 2e5 + 10;
ll a[SIZE];
ll cou;
int main() {
cin >> n;
ll min_num = LL_INF;
ll ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
++cou;
ans += abs(a[i]);
min_num = min(abs(a[i]), min_num);
}
if (cou % 2 != 0) {
ans -= 2 * min_num;
}
cout << ans << endl;
} | [
"assignment.change"
] | 875,922 | 875,923 | u085486962 | 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[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
count++;
}
}
int ans = 0;
if (count % 2 == 0) {
for (int i = 0; i < N; i++) {
ans += abs(A[i]);
}
}
if (count % 2 == 1) {
int m = 1000000001;
for (int i = 0; i < N; i++) {
m = min(m, abs(A[i]));
}
for (int i = 0; i < N; i++) {
ans += abs(A[i]);
}
ans -= 2 * m;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
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 count = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
count++;
}
}
long long ans = 0;
if (count % 2 == 0) {
for (int i = 0; i < N; i++) {
ans += abs(A[i]);
}
}
if (count % 2 == 1) {
long long m = 1000000001;
for (int i = 0; i < N; i++) {
m = min(m, abs(A[i]));
}
for (int i = 0; i < N; i++) {
ans += abs(A[i]);
}
ans -= 2 * m;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 875,926 | 875,927 | u314008046 | cpp |
p03062 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll ar[n], cnt = 0, tot = 0;
for (int i = 0; i < n; i++) {
cin >> ar[i];
if (ar[i] < 0)
cnt++;
ar[i] = abs(ar[i]);
tot += ar[i];
}
sort(ar, ar + n);
if (cnt & 1)
tot -= ar[0];
cout << tot << el;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll ar[n], cnt = 0, tot = 0;
for (int i = 0; i < n; i++) {
cin >> ar[i];
if (ar[i] < 0)
cnt++;
ar[i] = abs(ar[i]);
tot += ar[i];
}
sort(ar, ar + n);
if (cnt & 1)
tot -= 2 * ar[0];
cout << tot << el;
return 0;
} | [
"assignment.change"
] | 875,928 | 875,929 | u287988203 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j, k) for (ll i = (j); i < (k); ++i)
#define rep(i, j) reps(i, 0, j)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef pair<Pii, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "{";
rep(i, v.size()) { out << v[i] << ", "; }
return out << "}" << endl;
}
int main() {
int N;
cin >> N;
vector<ll> A(N);
ll a = LINF;
int idx = -1;
ll ans = 0;
int ret = 0;
int zr = 0;
rep(i, N) {
cin >> A[i];
if (a > abs(A[i])) {
a = abs(A[i]);
idx = i;
}
if (A[i] < 0) {
ret++;
}
if (A[i] == 0) {
zr++;
}
}
if (ret % 2 == 0 || zr > 0) {
rep(i, N) { ans += max(A[i], -A[i]); }
} else {
rep(i, N) {
if (i == idx)
ans += -A[i];
else {
ans += max(A[i], -A[i]);
}
}
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j, k) for (ll i = (j); i < (k); ++i)
#define rep(i, j) reps(i, 0, j)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef pair<Pii, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "{";
rep(i, v.size()) { out << v[i] << ", "; }
return out << "}" << endl;
}
int main() {
int N;
cin >> N;
vector<ll> A(N);
ll a = LINF;
int idx = -1;
ll ans = 0;
int ret = 0;
int zr = 0;
rep(i, N) {
cin >> A[i];
if (a > abs(A[i])) {
a = abs(A[i]);
idx = i;
}
if (A[i] < 0) {
ret++;
}
if (A[i] == 0) {
zr++;
}
}
if (ret % 2 == 0 || zr > 0) {
rep(i, N) { ans += max(A[i], -A[i]); }
} else {
rep(i, N) {
if (i == idx)
ans += -a;
else {
ans += max(A[i], -A[i]);
}
}
}
printf("%lld\n", ans);
return 0;
} | [
"assignment.value.change"
] | 875,936 | 875,937 | u406423757 | cpp |
p03062 | #include <algorithm>
#include <iostream>
typedef long long ll;
using namespace std;
int N;
ll val;
int main() {
cin >> N;
ll sum = 0;
ll min_val = 1e12;
int ncnt = 0;
while (N--) {
cin >> val;
sum += abs(val);
min_val = min(min_val, abs(val));
if (val <= 0)
ncnt++;
}
if (ncnt % 2) {
cout << sum - min_val;
} else {
cout << sum;
}
} | #include <algorithm>
#include <iostream>
typedef long long ll;
using namespace std;
int N;
ll val;
int main() {
cin >> N;
ll sum = 0;
ll min_val = 1e12;
int ncnt = 0;
while (N--) {
cin >> val;
sum += abs(val);
min_val = min(min_val, abs(val));
if (val <= 0)
ncnt++;
}
if (ncnt % 2) {
cout << sum - 2 * min_val;
} else {
cout << sum;
}
} | [
"expression.operation.binary.add"
] | 875,955 | 875,956 | u416526752 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(vector<int> vec) {
ll pos_sum = 0;
int cnt = 0;
int positive_min = INT_MAX;
int negtive_max = INT_MIN;
ll neg_sum = 0;
for (int x : vec) {
if (x < 0)
cnt++, neg_sum += x, negtive_max = max(negtive_max, x);
else
positive_min = min(positive_min, x), pos_sum += x;
}
if (cnt % 2 == 0) {
return pos_sum - neg_sum;
}
return max(pos_sum - neg_sum - positive_min * 2,
pos_sum - neg_sum + negtive_max * 2);
}
int main() {
int n;
cin >> n;
vector<int> dat(n);
for (int i = 0; i < n; ++i)
cin >> dat[i];
cout << solve(dat);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(vector<ll> vec) {
ll pos_sum = 0;
int cnt = 0;
ll positive_min = INT_MAX;
ll negtive_max = INT_MIN;
ll neg_sum = 0;
for (ll x : vec) {
if (x < 0)
cnt++, neg_sum += x, negtive_max = max(negtive_max, x);
else
positive_min = min(positive_min, x), pos_sum += x;
}
if (cnt % 2 == 0) {
return pos_sum - neg_sum;
}
return max(pos_sum - neg_sum - positive_min * 2,
pos_sum - neg_sum + negtive_max * 2);
}
int main() {
int n;
cin >> n;
vector<ll> dat(n);
for (int i = 0; i < n; ++i)
cin >> dat[i];
cout << solve(dat);
} | [
"variable_declaration.type.change"
] | 875,963 | 875,964 | u914762730 | cpp |
p03062 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
const bool unsyncedio = std::ios::sync_with_stdio(false);
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<ll> a(n);
ll cneg = 0;
ll c0 = 0;
ll minabs = 1000000001;
fori(n) {
cin >> a[i];
if (a[i] == 0)
c0++;
else if (a[i] < 0)
cneg++;
minabs = min(minabs, abs(a[i]));
}
ll sub = 0;
if (c0 == 0 && cneg % 2 == 1)
sub = minabs;
ll ans = 0;
fori(n) ans += abs(a[i]);
ans -= sub;
cout << ans << endl;
}
| /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
const bool unsyncedio = std::ios::sync_with_stdio(false);
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<ll> a(n);
ll cneg = 0;
ll c0 = 0;
ll minabs = 1000000001;
fori(n) {
cin >> a[i];
if (a[i] == 0)
c0++;
else if (a[i] < 0)
cneg++;
minabs = min(minabs, abs(a[i]));
}
ll sub = 0;
if (c0 == 0 && cneg % 2 == 1)
sub = minabs;
ll ans = 0;
fori(n) ans += abs(a[i]);
ans -= (2 * sub);
cout << ans << endl;
}
| [] | 875,971 | 875,972 | u014617387 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mi, ze, sum, li, lit;
sum = 0;
cin >> n;
vector<long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
if (vec.at(i) < 0) {
mi++;
vec.at(i) = -vec.at(i);
} else if (vec.at(i) == 0) {
ze == 1;
}
}
li = vec.at(1);
lit = 1;
if (ze == 1) {
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
} else if (mi % 2 == 0) {
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
} else if (mi % 2 == 1) {
for (int j = 0; j < n; j++) {
if (vec.at(j) < li) {
li = vec.at(j);
lit = j;
}
}
vec.at(lit) = -vec.at(lit);
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, mi, ze, sum, li, lit;
sum = 0;
cin >> n;
vector<long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
if (vec.at(i) < 0) {
mi++;
vec.at(i) = -vec.at(i);
} else if (vec.at(i) == 0) {
ze == 1;
}
}
li = vec.at(1);
lit = 1;
if (ze == 1) {
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
} else if (mi % 2 == 0) {
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
} else if (mi % 2 == 1) {
for (int j = 0; j < n; j++) {
if (vec.at(j) < li) {
li = vec.at(j);
lit = j;
}
}
vec.at(lit) = -vec.at(lit);
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change"
] | 875,975 | 875,976 | u593555034 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mi, ze, sum, li, lit;
sum = 0;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
if (vec.at(i) < 0) {
mi++;
vec.at(i) = -vec.at(i);
} else if (vec.at(i) == 0) {
ze == 1;
}
}
li = vec.at(1);
lit = 1;
if (ze == 1) {
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
} else if (mi % 2 == 0) {
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
} else if (mi % 2 == 1) {
for (int j = 0; j < n; j++) {
if (vec.at(j) < li) {
li = vec.at(j);
lit = j;
}
}
vec.at(lit) = -vec.at(lit);
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, mi, ze, sum, li, lit;
sum = 0;
cin >> n;
vector<long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
if (vec.at(i) < 0) {
mi++;
vec.at(i) = -vec.at(i);
} else if (vec.at(i) == 0) {
ze == 1;
}
}
li = vec.at(1);
lit = 1;
if (ze == 1) {
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
} else if (mi % 2 == 0) {
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
} else if (mi % 2 == 1) {
for (int j = 0; j < n; j++) {
if (vec.at(j) < li) {
li = vec.at(j);
lit = j;
}
}
vec.at(lit) = -vec.at(lit);
for (int j = 0; j < n; j++) {
sum += vec.at(j);
}
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change"
] | 875,977 | 875,976 | u593555034 | cpp |
p03062 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[100000];
int b[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll mi = 1e9, sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
b[i] = a[i] < 0;
sum += abs(a[i]);
mi = min(mi, abs(a[i]));
}
for (int i = 0; i < n - 1; ++i)
if (b[i])
b[i] ^= 1, b[i + 1] ^= 1;
if (b[n - 1])
cout << sum - mi;
else
cout << sum;
}
| #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[100000];
int b[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll mi = 1e9, sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
b[i] = a[i] < 0;
sum += abs(a[i]);
mi = min(mi, abs(a[i]));
}
for (int i = 0; i < n - 1; ++i)
if (b[i])
b[i] ^= 1, b[i + 1] ^= 1;
if (b[n - 1])
cout << sum - 2 * mi;
else
cout << sum;
}
| [
"expression.operation.binary.add"
] | 875,982 | 875,983 | u562319622 | cpp |
p03062 | // https://atcoder.jp/contests/abc125/tasks/abc125_d
#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 INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
int main() {
ll N, t, minimize, score = 0;
bool mcnt = false;
vector<ll> A(1e5);
cin >> N;
REP(i, N) {
cin >> t;
if (t < 0)
mcnt = !mcnt;
t = abs(t);
score += t;
minimize = min(minimize, t);
}
if (mcnt)
score -= 2 * minimize;
cout << score << '\n';
return 0;
}
| // https://atcoder.jp/contests/abc125/tasks/abc125_d
#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 INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
int main() {
ll N, t, minimize = INF, score = 0;
bool mcnt = false;
vector<ll> A(1e5);
cin >> N;
REP(i, N) {
cin >> t;
if (t < 0)
mcnt = !mcnt;
t = abs(t);
score += t;
minimize = min(minimize, t);
}
if (mcnt)
score -= 2 * minimize;
cout << score << '\n';
return 0;
}
| [
"variable_declaration.value.change"
] | 875,984 | 875,985 | u414220724 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t = 0, B = 0;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
A.at(i) = (-1) * A.at(i);
t++;
}
}
sort(A.begin(), A.end());
for (int i = 1; i < N; i++) {
B += A.at(i);
}
if (t % 2 == 1) {
cout << B - A.at(0) << endl;
} else {
cout << B + A.at(0) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t = 0;
long B = 0;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
A.at(i) = (-1) * A.at(i);
t++;
}
}
sort(A.begin(), A.end());
for (int i = 1; i < N; i++) {
B += A.at(i);
}
if (t % 2 == 1) {
cout << B - A.at(0) << endl;
} else {
cout << B + A.at(0) << endl;
}
} | [
"variable_declaration.type.widen.change"
] | 875,986 | 875,987 | u182791129 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
bool is_minus(int i) { return (i < 0); }
int main() {
// input
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> B;
// compute
int ans = 0;
size_t n_count = count_if(A.begin(), A.end(), is_minus);
if (n_count % 2 == 0) {
for (int i = 0; i < N; i++) {
ans = ans + abs(A[i]);
}
} else {
for (int i = 0; i < N; i++) {
ans = ans + abs(A[i]);
B.push_back(abs(A[i]));
}
int min = *min_element(B.begin(), B.end());
ans = ans - 2 * min;
}
// output
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
bool is_minus(long i) { return (i < 0); }
int main() {
// input
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<long> B;
// compute
long long ans = 0;
size_t n_count = count_if(A.begin(), A.end(), is_minus);
if (n_count % 2 == 0) {
for (int i = 0; i < N; i++) {
ans = ans + abs(A[i]);
}
} else {
for (int i = 0; i < N; i++) {
ans = ans + abs(A[i]);
B.push_back(abs(A[i]));
}
long min = *min_element(B.begin(), B.end());
ans = ans - 2 * min;
}
// output
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 875,994 | 875,995 | u100588472 | cpp |
p03062 |
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999LL
#define INTBIG 1111111111
#define MOD 1000000007
#define PI pair<int, int>
#define VI vector<int>
#define VVI vector<vector<int>>
int N, A[100002], cnt = 0, ans = 0;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
cnt++;
A[i] *= (-1);
}
ans += A[i];
}
sort(A, A + N);
if (cnt % 2 == 0)
cout << ans << endl;
else
cout << ans - 2 * A[0] << endl;
return 0;
} |
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999LL
#define INTBIG 1111111111
#define MOD 1000000007
#define PI pair<int, int>
#define VI vector<int>
#define VVI vector<vector<int>>
LL N, A[100002], cnt = 0, ans = 0;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
cnt++;
A[i] *= (-1);
}
ans += A[i];
}
sort(A, A + N);
if (cnt % 2 == 0)
cout << ans << endl;
else
cout << ans - 2 * A[0] << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 876,000 | 876,001 | u657512990 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#define VV(T) vector<vector<T>>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define rep(i, n) REP(i, 0, n) // 0, 1, ..., n-1
#define REP(i, x, n) for (int i = x; i < n; i++) // x, x + 1, ..., n-1
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define pb push_back
#define pu push
#define mp make_pair
#define fi first
#define sc second
#define COUT(x) cout << (x) << endl
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define VECCOUT(x) \
for (auto &youso_ : (x)) \
cout << youso_ << " "; \
cout << endl
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> a(N);
rep(i, N) cin >> a[i];
int num_minus = 0;
ll mi = 1LL << 100;
ll sum = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0)
num_minus++;
chmin(mi, abs(a[i]));
sum += abs(a[i]);
}
if (num_minus % 2 == 0)
COUT(sum);
else
COUT(sum - mi * 2);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#define VV(T) vector<vector<T>>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define rep(i, n) REP(i, 0, n) // 0, 1, ..., n-1
#define REP(i, x, n) for (int i = x; i < n; i++) // x, x + 1, ..., n-1
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define pb push_back
#define pu push
#define mp make_pair
#define fi first
#define sc second
#define COUT(x) cout << (x) << endl
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define VECCOUT(x) \
for (auto &youso_ : (x)) \
cout << youso_ << " "; \
cout << endl
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> a(N);
rep(i, N) cin >> a[i];
int num_minus = 0;
ll mi = 1LL << 60;
ll sum = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0)
num_minus++;
chmin(mi, abs(a[i]));
sum += abs(a[i]);
}
if (num_minus % 2 == 0)
COUT(sum);
else
COUT(sum - mi * 2);
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 876,007 | 876,008 | u038027079 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, cnt = 0;
cin >> n;
int a[100001];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0) {
cnt++;
}
a[i] = abs(a[i]);
}
// cout << ans << endl;
sort(a, a + n);
if (cnt % 2)
ans -= 2 * a[0];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, cnt = 0;
cin >> n;
long long a[100001];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0) {
cnt++;
}
a[i] = abs(a[i]);
}
sort(a, a + n);
if (cnt % 2)
ans -= 2 * a[0];
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,009 | 876,010 | u729578060 | cpp |
p03062 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, i, count = 0;
ll sum = 0, min = 1000000000;
cin >> n;
for (i = 0; i < n; i++) {
ll num;
cin >> num;
if (num < 0)
count++;
num = abs(num);
sum += num;
if (min > num)
min = num;
}
if (count % 2 == 0)
cout << sum << endl;
else
cout << sum - min << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, i, count = 0;
ll sum = 0, min = 1000000000;
cin >> n;
for (i = 0; i < n; i++) {
ll num;
cin >> num;
if (num < 0)
count++;
num = abs(num);
sum += num;
if (min > num)
min = num;
}
if (count % 2 == 0)
cout << sum << endl;
else
cout << sum - (2 * min) << endl;
return 0;
} | [] | 876,024 | 876,025 | u112766430 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
int ans = 0, counter = 0;
std::cin >> n;
int a[n];
for (i = 0; i < n; i++) {
std::cin >> a[i];
if (a[i] < 0) {
counter++;
a[i] = -a[i];
}
}
if (counter % 2 == 0) {
for (i = 0; i < n; i++)
ans += a[i];
}
if (counter % 2 == 1) {
sort(a, a + n);
for (i = 1; i < n; i++) {
ans += a[i];
}
ans -= a[0];
}
std::cout << ans << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
long long int ans = 0, counter = 0;
std::cin >> n;
long long int a[n];
for (i = 0; i < n; i++) {
std::cin >> a[i];
if (a[i] < 0) {
counter++;
a[i] = -a[i];
}
}
if (counter % 2 == 0) {
for (i = 0; i < n; i++)
ans += a[i];
}
if (counter % 2 == 1) {
sort(a, a + n);
for (i = 1; i < n; i++) {
ans += a[i];
}
ans -= a[0];
}
std::cout << ans << std::endl;
} | [
"variable_declaration.type.widen.change"
] | 876,034 | 876,035 | u409569205 | cpp |
p03062 | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main(void) {
int N;
int count = 0;
long int min = LONG_MAX;
long int sum = 0;
cin >> N;
vector<long int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
if (data[i] < 0)
count++;
if (abs(data[i]) < min)
min = abs(data[i]);
sum += abs(data[i]);
}
if (!count % 2)
cout << sum << endl;
else
cout << sum - 2 * min << endl;
return 0;
} | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main(void) {
int N;
int count = 0;
long int min = LONG_MAX;
long int sum = 0;
cin >> N;
vector<long int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
if (data[i] < 0)
count++;
if (abs(data[i]) < min)
min = abs(data[i]);
sum += abs(data[i]);
}
if (!(count % 2))
cout << sum << endl;
else
cout << sum - 2 * min << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 876,042 | 876,043 | u465631492 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int n, num[100005], dp[100005][2];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> num[i];
dp[1][0] = num[1];
dp[1][1] = -num[1];
for (int i = 2; i <= n; ++i) {
dp[i][0] = max(dp[i - 1][0] + num[i], dp[i - 1][1] - num[i]);
dp[i][1] = max(dp[i - 1][1] + num[i], dp[i - 1][0] - num[i]);
}
cout << dp[n][0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, num[100005], dp[100005][2];
signed main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> num[i];
dp[1][0] = num[1];
dp[1][1] = -num[1];
for (int i = 2; i <= n; ++i) {
dp[i][0] = max(dp[i - 1][0] + num[i], dp[i - 1][1] - num[i]);
dp[i][1] = max(dp[i - 1][1] + num[i], dp[i - 1][0] - num[i]);
}
cout << dp[n][0] << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 876,051 | 876,052 | u332820511 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
int vis[MAXN][2], N;
ll dp[MAXN][2], arr[MAXN];
ll solve(int a, int sign) {
if (a == N)
return (sign == 0) ? arr[a] : -arr[a];
if (vis[a][sign])
return dp[a][sign];
vis[a][sign] = 1;
if (sign == 0)
return dp[a][sign] = max(arr[a] + solve(a + 1, sign),
-arr[a] + solve(a + 1, sign ^ 1));
else
return dp[a][sign] = max(-arr[a] + solve(a + 1, sign),
arr[a] + solve(a + 1, sign ^ 1));
}
int main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> arr[i];
cout << solve(1, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
int vis[MAXN][2], N;
ll dp[MAXN][2], arr[MAXN];
ll solve(int a, int sign) {
if (a == N)
return (sign == 0) ? arr[a] : -arr[a];
if (vis[a][sign])
return dp[a][sign];
vis[a][sign] = 1;
if (sign == 0)
return dp[a][sign] =
max(arr[a] + solve(a + 1, 0), -arr[a] + solve(a + 1, 1));
else
return dp[a][sign] =
max(-arr[a] + solve(a + 1, 0), arr[a] + solve(a + 1, 1));
}
int main() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> arr[i];
cout << solve(1, 0) << endl;
return 0;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 876,055 | 876,056 | u734266451 | cpp |
p03062 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
int main() {
int n;
cin >> n;
vector<int> a(n);
ll sum = 0ll;
int mc = 0, min_max = numeric_limits<int>::min(),
max_min = numeric_limits<int>::max();
REP(i, n) {
cin >> a[i];
if (a[i] < 0) {
mc += 1;
min_max = max(min_max, a[i]);
} else {
max_min = min(max_min, a[i]);
}
sum += max(a[i], -a[i]);
}
if (mc % 2) {
sum = max(sum - 2 * max_min, sum + 2 * min_max);
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
ll sum = 0ll;
ll mc = 0, min_max = numeric_limits<int>::min(),
max_min = numeric_limits<int>::max();
REP(i, n) {
cin >> a[i];
if (a[i] < 0) {
mc += 1;
min_max = max(min_max, a[i]);
} else {
max_min = min(max_min, a[i]);
}
sum += max(a[i], -a[i]);
}
if (mc % 2) {
sum = max(sum - 2 * max_min, sum + 2 * min_max);
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 876,057 | 876,058 | u772304668 | cpp |
p03062 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, k, minus = 0, zero = 0;
long sums = 0, min;
cin >> N;
long *A = new long[N];
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
minus++;
if (A[i] == 0)
zero++;
}
if (zero > 0 || minus % 2 == 0) {
for (i = 0; i < N; i++)
sums += labs(A[i]);
} else {
min = A[0];
for (i = 0; i < N; i++) {
sums += labs(A[i]);
if (min > labs(A[i]))
min = labs(A[i]);
}
sums = sums - 2 * min;
}
cout << sums << endl;
} | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, k, minus = 0, zero = 0;
long sums = 0, min;
cin >> N;
long *A = new long[N];
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
minus++;
if (A[i] == 0)
zero++;
}
if (zero > 0 || minus % 2 == 0) {
for (i = 0; i < N; i++)
sums += labs(A[i]);
} else {
min = labs(A[0]);
for (i = 0; i < N; i++) {
sums += labs(A[i]);
if (min > labs(A[i]))
min = labs(A[i]);
}
sums = sums - 2 * min;
}
cout << sums << endl;
} | [
"call.add",
"call.arguments.change"
] | 876,059 | 876,060 | u203033720 | cpp |
p03062 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, k, minus = 0, zero = 0;
long sums, min;
cin >> N;
long *A = new long[N];
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
minus++;
if (A[i] == 0)
zero++;
}
if (zero > 0 || minus % 2 == 0) {
for (i = 0; i < N; i++)
sums += labs(A[i]);
} else {
min = A[0];
for (i = 0; i < N; i++) {
sums += labs(A[i]);
if (min > labs(A[i]))
min = labs(A[i]);
}
sums = sums - 2 * min;
}
cout << sums << endl;
} | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, k, minus = 0, zero = 0;
long sums = 0, min;
cin >> N;
long *A = new long[N];
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
minus++;
if (A[i] == 0)
zero++;
}
if (zero > 0 || minus % 2 == 0) {
for (i = 0; i < N; i++)
sums += labs(A[i]);
} else {
min = labs(A[0]);
for (i = 0; i < N; i++) {
sums += labs(A[i]);
if (min > labs(A[i]))
min = labs(A[i]);
}
sums = sums - 2 * min;
}
cout << sums << endl;
} | [
"variable_declaration.value.change",
"call.add",
"call.arguments.change"
] | 876,061 | 876,060 | u203033720 | cpp |
p03062 | #include <iostream>
using namespace std;
int main() {
int n, i = 0, count = 0;
long int num[100000];
long int ans = 0, l, min = 0;
cin >> n;
while (i < n) {
cin >> l;
num[i] = l;
i++;
}
i = 0;
while (i < n) {
if (num[i] < 0) {
count++;
num[i] = -1 * num[i];
}
if (min > num[i] || min == 0) {
min = num[i];
}
ans += num[i];
i++;
}
if (count % 2 == 1) {
ans -= 2 * min;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, i = 0, count = 0;
long int num[100000];
long int ans = 0, l, min = -1;
cin >> n;
while (i < n) {
cin >> l;
num[i] = l;
i++;
}
i = 0;
while (i < n) {
if (num[i] < 0) {
count++;
num[i] = -1 * num[i];
}
if (min > num[i] || min == -1) {
min = num[i];
}
ans += num[i];
i++;
}
if (count % 2 == 1) {
ans -= 2 * min;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 876,062 | 876,063 | u567920843 | cpp |
p03062 | // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FER(i, a, b) for (int i = int(a); i < int(b); ++i)
#define IFR(i, a, b) for (int i = int(a); i >= int(b); i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e5 + 5;
const ll inf = 1e18;
ll mm[N];
int main() {
int n;
scanf("%d", &n);
FER(i, 0, n) scanf("%lld", &mm[i]);
ll pos = -1, mx = inf;
int c = 0;
FER(i, 0, n) {
if (mx > abs(mm[i])) {
mx = abs(mm[i]);
pos = i;
}
if (mm[i] < 0)
c++;
}
ll ans = 0;
FER(i, 0, n) ans += abs(mm[i]);
if (c % 2 == 0) {
printf("%lld\n", ans);
return 0;
}
ans -= 2 * mm[pos];
printf("%lld\n", ans);
return 0;
}
| // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FER(i, a, b) for (int i = int(a); i < int(b); ++i)
#define IFR(i, a, b) for (int i = int(a); i >= int(b); i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e5 + 5;
const ll inf = 1e18;
ll mm[N];
int main() {
int n;
scanf("%d", &n);
FER(i, 0, n) scanf("%lld", &mm[i]);
ll pos = -1, mx = inf;
int c = 0;
FER(i, 0, n) {
if (mx > abs(mm[i])) {
mx = abs(mm[i]);
pos = i;
}
if (mm[i] < 0)
c++;
}
ll ans = 0;
FER(i, 0, n) ans += abs(mm[i]);
if (c % 2 == 0) {
printf("%lld\n", ans);
return 0;
}
ans -= 2 * mx;
printf("%lld\n", ans);
return 0;
}
| [
"assignment.value.change",
"expression.operation.binary.change"
] | 876,078 | 876,079 | u024867716 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long int lli;
#define pb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define INF 1000000000
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
int n;
int arr[100000 + 5], dp[100000 + 5][2];
int main() {
fastio;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[1][0] = arr[1];
dp[1][1] = -arr[1];
for (int i = 2; i < n; i++) {
dp[i][0] = max(dp[i - 1][0] + arr[i], dp[i - 1][1] - arr[i]);
dp[i][1] = max(dp[i - 1][0] - arr[i], dp[i - 1][1] + arr[i]);
}
dp[n][0] = max(dp[n - 1][0] + arr[n], dp[n - 1][1] - arr[n]);
cout << dp[n][0] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long int lli;
#define pb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define INF 1000000000
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
int n;
lli arr[100000 + 5], dp[100000 + 5][2];
int main() {
fastio;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[1][0] = arr[1];
dp[1][1] = -arr[1];
for (int i = 2; i < n; i++) {
dp[i][0] = max(dp[i - 1][0] + arr[i], dp[i - 1][1] - arr[i]);
dp[i][1] = max(dp[i - 1][0] - arr[i], dp[i - 1][1] + arr[i]);
}
dp[n][0] = max(dp[n - 1][0] + arr[n], dp[n - 1][1] - arr[n]);
cout << dp[n][0] << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 876,082 | 876,083 | u059313618 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
long long cnt = 0;
for (long long i = 0; i < n; i++) {
cin >> v[i];
if (v[i] < 0) {
cnt++;
v[i] = abs(v[i]);
}
}
sort(v.begin(), v.end());
int ans = 0;
for (int i = 0; i < n; i++)
ans += v[i];
cnt = cnt % 2;
if (cnt)
ans = ans - v[0] * 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
long long cnt = 0;
for (long long i = 0; i < n; i++) {
cin >> v[i];
if (v[i] < 0) {
cnt++;
v[i] = abs(v[i]);
}
}
sort(v.begin(), v.end());
long long ans = 0;
for (long long i = 0; i < n; i++)
ans += v[i];
cnt = cnt % 2;
if (cnt)
ans = ans - v[0] * 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 876,086 | 876,087 | u426657245 | cpp |
p03062 | /**
*Code Author: codeknight13
*Institution: IIT(ISM)
**/
#include <bits/stdc++.h>
using namespace std;
/*
use these format of input when number of inputs not provided
while(scanf("%lld",&n)!=EOF)
*/
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define vi vector<ll>
#define vii vector<vi>
#define viii vector<vii>
#define pii pair<ll, ll>
#define vpii vector<pii>
#define mii unordered_map<ll, ll>
#define mci map<char, ll>
#define pq priority_queue
#define str string
#define len length()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define nl cout << endl
#define sp " "
#define all(ar) ar.begin(), ar.end()
#define itern(n) for (int i = 0; i < n; i++)
#define ritern(n) for (int i = n - 1; i >= 0; i--)
#define sz(x) ((int)(x).size())
#define pi acos(1); /* pi */
#define inf (int(1e9 + 7))
#define fl(x) int(x)
#define mod % (inf)
#define yes "YES"
#define no "NO"
// debugger
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) \
cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
// functions
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
//#------------------------------complete
//template------------------------------#//
int main() {
fast;
int n;
cin >> n;
vi a(n);
int cnt = 0;
ll sum = 0;
ll sub = INT_MAX;
itern(n) {
cin >> a[i];
if (a[i] < 0)
cnt++;
a[i] = abs(a[i]);
sum += a[i];
sub = min(a[i], sub);
}
if (cnt % 2)
sum -= sub;
cout << sum;
return 0;
} | /**
*Code Author: codeknight13
*Institution: IIT(ISM)
**/
#include <bits/stdc++.h>
using namespace std;
/*
use these format of input when number of inputs not provided
while(scanf("%lld",&n)!=EOF)
*/
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define vi vector<ll>
#define vii vector<vi>
#define viii vector<vii>
#define pii pair<ll, ll>
#define vpii vector<pii>
#define mii unordered_map<ll, ll>
#define mci map<char, ll>
#define pq priority_queue
#define str string
#define len length()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define nl cout << endl
#define sp " "
#define all(ar) ar.begin(), ar.end()
#define itern(n) for (int i = 0; i < n; i++)
#define ritern(n) for (int i = n - 1; i >= 0; i--)
#define sz(x) ((int)(x).size())
#define pi acos(1); /* pi */
#define inf (int(1e9 + 7))
#define fl(x) int(x)
#define mod % (inf)
#define yes "YES"
#define no "NO"
// debugger
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) \
cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
// functions
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
//#------------------------------complete
//template------------------------------#//
int main() {
fast;
int n;
cin >> n;
vi a(n);
int cnt = 0;
ll sum = 0;
ll sub = INT_MAX;
itern(n) {
cin >> a[i];
if (a[i] < 0)
cnt++;
a[i] = abs(a[i]);
sum += a[i];
sub = min(a[i], sub);
}
if (cnt % 2)
sum -= 2 * sub;
cout << sum;
return 0;
} | [
"assignment.change"
] | 876,090 | 876,091 | u062650584 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x = 0;
cin >> n;
long long a[n], min = LLONG_MAX, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
a[i] *= -1;
x++;
if (a[i] < min) {
min = a[i];
}
}
sum += a[i];
}
if (x % 2 == 0) {
cout << sum;
} else {
cout << sum - 2 * min;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x = 0;
cin >> n;
long long a[n], min = LLONG_MAX, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
a[i] *= -1;
x++;
}
if (a[i] < min) {
min = a[i];
}
sum += a[i];
}
if (x % 2 == 0) {
cout << sum;
} else {
cout << sum - 2 * min;
}
return 0;
}
| [] | 876,096 | 876,097 | u835914531 | cpp |
p03062 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
ll nega = 0, zero = 0, mi = inf, sum = 0;
rep(i, n) {
ll x;
cin >> x;
sum += abs(x);
mi = min(abs(x), mi);
if (x == 0)
zero++;
if (x < 0)
nega++;
}
if (zero || nega % 2 == 0) {
cout << sum << endl;
} else
cout << sum - mi << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
ll nega = 0, zero = 0, mi = inf, sum = 0;
rep(i, n) {
ll x;
cin >> x;
sum += abs(x);
mi = min(abs(x), mi);
if (x == 0)
zero++;
if (x < 0)
nega++;
}
if (zero || nega % 2 == 0) {
cout << sum << endl;
} else
cout << sum - 2 * mi << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 876,098 | 876,099 | u352642493 | cpp |
p03062 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
ll nega = 0, zero = 0, mi = inf, sum = 0;
rep(i, n) {
ll x;
cin >> x;
sum += x;
mi = min(abs(x), mi);
if (x == 0)
zero++;
if (x < 0)
nega++;
}
if (zero || nega % 2 == 0) {
cout << sum << endl;
} else
cout << sum - mi << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
ll nega = 0, zero = 0, mi = inf, sum = 0;
rep(i, n) {
ll x;
cin >> x;
sum += abs(x);
mi = min(abs(x), mi);
if (x == 0)
zero++;
if (x < 0)
nega++;
}
if (zero || nega % 2 == 0) {
cout << sum << endl;
} else
cout << sum - 2 * mi << endl;
return 0;
}
| [
"call.add",
"call.arguments.change",
"expression.operation.binary.add"
] | 876,100 | 876,099 | u352642493 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
ll N[maxn];
int main() {
int n;
cin >> n;
int cnt = 0;
ll sum = 0;
ll minn = 1e9 + 1;
for (int i = 0; i < n; i++) {
scanf("%d", &N[i]);
sum += abs(N[i]);
if (N[i] < 0)
cnt++;
minn = min(minn, abs(N[i]));
}
if (cnt % 2 == 0)
cout << sum << endl;
else
cout << sum - minn << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
ll N[maxn];
int main() {
int n;
cin >> n;
int cnt = 0;
ll sum = 0;
ll minn = 1e9 + 1;
for (int i = 0; i < n; i++) {
scanf("%lld", &N[i]);
sum += abs(N[i]);
if (N[i] < 0)
cnt++;
minn = min(minn, abs(N[i]));
}
if (cnt % 2 == 0)
cout << sum << endl;
else
cout << sum - 2 * minn << endl;
} | [
"literal.string.change",
"call.arguments.change"
] | 876,107 | 876,108 | u491404948 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int getGCD(int a, int b) {
if (b == 0)
return a;
return getGCD(b, a % b);
}
int main() {
int N;
long long max_sum;
std::cin >> N;
std::vector<long long> A(N);
for (int i = 0; i < N; ++i)
std::cin >> A[i];
int minus_cnt = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < 0) {
A[i] = -A[i];
minus_cnt = minus_cnt + 1;
}
}
if (minus_cnt % 2 == 0) {
max_sum = std::accumulate(A.begin(), A.end(), 0);
} else {
std::vector<long long>::iterator iter =
std::min_element(A.begin(), A.end());
int index = std::distance(A.begin(), iter);
A[index] = -A[index];
max_sum = accumulate(A.begin(), A.end(), 0);
}
std::cout << max_sum << "\n";
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int getGCD(int a, int b) {
if (b == 0)
return a;
return getGCD(b, a % b);
}
int main() {
int N;
long long max_sum;
std::cin >> N;
std::vector<long long> A(N);
for (int i = 0; i < N; ++i)
std::cin >> A[i];
int minus_cnt = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < 0) {
A[i] = -A[i];
// std::cout << A[i] << "\n";
minus_cnt = minus_cnt + 1;
}
}
if (minus_cnt % 2 == 0) {
max_sum = accumulate(A.begin(), A.end(), 0LL);
} else {
std::vector<long long>::iterator iter =
std::min_element(A.begin(), A.end());
int index = std::distance(A.begin(), iter);
A[index] = -A[index];
max_sum = accumulate(A.begin(), A.end(), 0LL);
}
std::cout << max_sum << "\n";
} | [
"literal.number.type.widen.change"
] | 876,117 | 876,118 | u395248672 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i, a, b, c) for (int(i) = (a); (i) <= (b); (i) += (c))
#define fdn(i, a, b, c) for (int(i) = (a); (i) >= (b); (i) -= (c))
#define MEM0(a) memset((a), 0, sizeof(a));
#define MEM_1(a) memset((a), -1, sizeof(a));
#define ALL(a) a.begin(), a.end()
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {
ll ret = 1;
for (; b; b >>= 1, a = (a * a) % MMM)
if (b & 1)
ret = (ret * a) % MMM;
return ret;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return a + b;
return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int p, z, m;
ll a[100000];
int main() {
int n;
scanf("%d", &n);
fup(i, 0, n - 1, 1) {
ll x;
scanf("%lld", &x);
if (x == 0)
z++;
else if (x > 0)
p++;
else {
m++;
x *= -1;
}
a[i] = x;
}
sort(a, a + n);
ll sum = accumulate(a, a + n, 0);
if (z || m % 2 == 0)
return !printf("%lld", sum);
printf("%lld", sum - 2 * a[0]);
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i, a, b, c) for (int(i) = (a); (i) <= (b); (i) += (c))
#define fdn(i, a, b, c) for (int(i) = (a); (i) >= (b); (i) -= (c))
#define MEM0(a) memset((a), 0, sizeof(a));
#define MEM_1(a) memset((a), -1, sizeof(a));
#define ALL(a) a.begin(), a.end()
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {
ll ret = 1;
for (; b; b >>= 1, a = (a * a) % MMM)
if (b & 1)
ret = (ret * a) % MMM;
return ret;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return a + b;
return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int p, z, m;
ll a[100000];
int main() {
int n;
scanf("%d", &n);
fup(i, 0, n - 1, 1) {
ll x;
scanf("%lld", &x);
if (x == 0)
z++;
else if (x > 0)
p++;
else {
m++;
x *= -1;
}
a[i] = x;
}
sort(a, a + n);
ll sum = accumulate(a, a + n, 0LL);
if (z || m % 2 == 0)
return !printf("%lld", sum);
printf("%lld", sum - 2 * a[0]);
} | [
"literal.number.type.widen.change"
] | 876,119 | 876,120 | u942290141 | cpp |
p03062 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are strictly smaller!!
// OT.find_by_order(k-1)
//
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define db4(x, y, z, w) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< "," << #w << "=" << w << endl
#define ll long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define X first
#define Y second
#define sz(x) (int)((x).size())
#define pii pair<int, int>
#define MOD (ll)(1e9 + 7)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
typedef vector<int> vi;
#define inf (ll)(1e18)
#define double long double
#define int long long
//////////////////////
const int N = 1005;
int memo[2 * N][N];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
// vector<int> a(n);
int mn = inf, sum = 0, st = 0, vr;
rep(i, n) {
cin >> vr;
sum += abs(vr);
if (vr < 0)
st ^= 1;
if (abs(vr) < mn) {
mn = abs(vr);
}
}
if (st)
cout << sum - mn << '\n';
else
cout << sum << '\n';
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are strictly smaller!!
// OT.find_by_order(k-1)
//
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define db4(x, y, z, w) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< "," << #w << "=" << w << endl
#define ll long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define X first
#define Y second
#define sz(x) (int)((x).size())
#define pii pair<int, int>
#define MOD (ll)(1e9 + 7)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
typedef vector<int> vi;
#define inf (ll)(1e18)
#define double long double
#define int long long
//////////////////////
const int N = 1005;
int memo[2 * N][N];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
// vector<int> a(n);
int mn = inf, sum = 0, st = 0, vr;
rep(i, n) {
cin >> vr;
sum += abs(vr);
if (vr < 0)
st ^= 1;
if (abs(vr) < mn) {
mn = abs(vr);
}
}
if (st)
cout << sum - 2 * mn << '\n';
else
cout << sum << '\n';
} | [
"expression.operation.binary.add"
] | 876,143 | 876,144 | u325189601 | cpp |
p03062 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are strictly smaller!!
// OT.find_by_order(k-1)
//
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define db4(x, y, z, w) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< "," << #w << "=" << w << endl
#define ll long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define X first
#define Y second
#define sz(x) (int)((x).size())
#define pii pair<int, int>
#define MOD (ll)(1e9 + 7)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
typedef vector<int> vi;
#define inf (ll)(1e18)
#define double long double
#define int long long
//////////////////////
const int N = 1005;
int memo[2 * N][N];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
// vector<int> a(n);
int mn = -inf, sum = 0, st = 0, vr;
rep(i, n) {
cin >> vr;
sum += abs(vr);
if (vr < 0)
st ^= 1;
if (abs(vr) < mn) {
mn = abs(vr);
}
}
if (st)
cout << sum - mn << '\n';
else
cout << sum << '\n';
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are strictly smaller!!
// OT.find_by_order(k-1)
//
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define db4(x, y, z, w) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< "," << #w << "=" << w << endl
#define ll long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define X first
#define Y second
#define sz(x) (int)((x).size())
#define pii pair<int, int>
#define MOD (ll)(1e9 + 7)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
typedef vector<int> vi;
#define inf (ll)(1e18)
#define double long double
#define int long long
//////////////////////
const int N = 1005;
int memo[2 * N][N];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
// vector<int> a(n);
int mn = inf, sum = 0, st = 0, vr;
rep(i, n) {
cin >> vr;
sum += abs(vr);
if (vr < 0)
st ^= 1;
if (abs(vr) < mn) {
mn = abs(vr);
}
}
if (st)
cout << sum - 2 * mn << '\n';
else
cout << sum << '\n';
} | [
"expression.operation.unary.arithmetic.remove"
] | 876,145 | 876,144 | u325189601 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i, a) for (auto &i : a)
typedef pair<int, int> P;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
const ll mod = 1000000009;
int main() {
int n;
cin >> n;
VLL a(n);
REP(i, n) cin >> a[i];
ll ans = 0;
sort(ALL(a));
int cnt = 0;
REP(i, n) if (a[i] < 0) cnt++;
REP(i, n) a[i] = abs(a[i]);
sort(ALL(a));
if (cnt % 2 == 0) {
a[0] = -a[0];
}
REP(i, n) ans += a[i];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i, a) for (auto &i : a)
typedef pair<int, int> P;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
const ll mod = 1000000009;
int main() {
int n;
cin >> n;
VLL a(n);
REP(i, n) cin >> a[i];
ll ans = 0;
sort(ALL(a));
int cnt = 0;
REP(i, n) if (a[i] < 0) cnt++;
REP(i, n) a[i] = abs(a[i]);
sort(ALL(a));
if (cnt % 2 == 1) {
a[0] = -a[0];
}
REP(i, n) ans += a[i];
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 876,148 | 876,149 | u856232850 | cpp |
p03062 | #include <iostream>
using namespace std;
int main() {
int N, flag = 0, cnt = 0;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
flag = 1;
}
if (A[i] < 0)
cnt += 1;
}
if (cnt % 2 == 0)
flag = 1;
long long min = labs(A[0]);
for (int i = 1; i < N; i++)
if (labs(A[i]) < min)
min = A[i];
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += labs(A[i]);
}
if (flag == 0)
ans -= 2 * min;
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, flag = 0, cnt = 0;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
flag = 1;
}
if (A[i] < 0)
cnt += 1;
}
if (cnt % 2 == 0)
flag = 1;
long long min = labs(A[0]);
for (int i = 1; i < N; i++)
if (labs(A[i]) < min)
min = labs(A[i]);
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += labs(A[i]);
}
if (flag == 0)
ans -= 2 * min;
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 876,157 | 876,158 | u344977358 | cpp |
p03062 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int num_negative = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < 0) {
++num_negative;
}
}
ll sum = 0;
for (int i = 0; i < N; ++i) {
sum += abs(A[i]);
}
if (num_negative % 2 == 0) {
cout << sum << endl;
} else {
auto it = min_element(begin(A), end(A),
[](ll a, ll b) { return abs(a) < abs(b); });
cout << sum - 2 * (*it) << endl;
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int num_negative = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < 0) {
++num_negative;
}
}
ll sum = 0;
for (int i = 0; i < N; ++i) {
sum += abs(A[i]);
}
if (num_negative % 2 == 0) {
cout << sum << endl;
} else {
auto it = min_element(begin(A), end(A),
[](ll a, ll b) { return abs(a) < abs(b); });
cout << sum - 2 * abs(*it) << endl;
}
return 0;
}
| [
"call.add"
] | 876,161 | 876,162 | u273834941 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define MAX 100005
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define ull long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define nl '\n'
#define zai << ' ' <<
#define all(a) a.begin(), a.end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
int a[MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum = 0, cnt = 0, mn = INF;
for (int i = 0; i < n; i++) {
if (a[i] < 0)
cnt++;
sum += abs(a[i]);
mn = min(mn, abs(a[i]));
}
if (cnt % 2 == 0)
cout << sum;
else
cout << sum - 2 * mn;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define MAX 100005
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define ull long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define nl '\n'
#define zai << ' ' <<
#define all(a) a.begin(), a.end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
long long a[MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0, cnt = 0, mn = INF;
for (int i = 0; i < n; i++) {
if (a[i] < 0)
cnt++;
sum += abs(a[i]);
mn = min(mn, abs(a[i]));
}
if (cnt % 2 == 0)
cout << sum;
else
cout << sum - 2 * mn;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,172 | 876,173 | u885635198 | cpp |
p03062 | /*input
11
-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000
-1000000000 1000000000 -1000000000 1000000000
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(i, n) for (int i = n; i > 0; i--)
#define REPS(i, n) for (int i = 1; (i * i) <= n; i++)
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) \
for (auto it = arr.begin(); it != arr.end(); ++it) \
cout << *it << " "; \
cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x, y) cout << x << " " << y << endl;
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int INF = 1e18 + 1;
const int MOD = 1e9 + 7;
const double PI = 3.14159265358979323846264338;
int raise(int a, int n, int m = MOD) {
if (n == 0)
return 1;
if (n == 1)
return a;
int x = 1;
x *= raise(a, n / 2, m);
x %= m;
x *= x;
x %= m;
if (n % 2)
x *= a;
x %= m;
return x;
}
int floor1(int n, int k) {
if (n % k == 0 || n >= 0)
return n / k;
return (n / k) - 1;
}
int ceil1(int n, int k) { return floor1(n + k - 1, k); }
void solve() {
int minus = 0;
int n;
int sum = 0;
int minn = INF;
cin >> n;
RE(i, n) {
int x;
cin >> x;
minn = min(minn, abs(x));
sum += abs(x);
minus += (x < 0);
minus %= 2;
}
if (minus)
cout << sum - minn;
else
cout << sum;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen(".in","r",stdin);freopen(".out","w",stdout);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | /*input
5
10 -4 -8 -11 3
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(i, n) for (int i = n; i > 0; i--)
#define REPS(i, n) for (int i = 1; (i * i) <= n; i++)
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) \
for (auto it = arr.begin(); it != arr.end(); ++it) \
cout << *it << " "; \
cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x, y) cout << x << " " << y << endl;
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int INF = 1e18 + 1;
const int MOD = 1e9 + 7;
const double PI = 3.14159265358979323846264338;
int raise(int a, int n, int m = MOD) {
if (n == 0)
return 1;
if (n == 1)
return a;
int x = 1;
x *= raise(a, n / 2, m);
x %= m;
x *= x;
x %= m;
if (n % 2)
x *= a;
x %= m;
return x;
}
int floor1(int n, int k) {
if (n % k == 0 || n >= 0)
return n / k;
return (n / k) - 1;
}
int ceil1(int n, int k) { return floor1(n + k - 1, k); }
void solve() {
int minus = 0;
int n;
int sum = 0;
int minn = INF;
cin >> n;
RE(i, n) {
int x;
cin >> x;
minn = min(minn, abs(x));
sum += abs(x);
minus += (x < 0);
minus %= 2;
}
// cout << sum << " " << minn <<endl;
if (minus)
cout << sum - 2 * minn;
else
cout << sum;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen(".in","r",stdin);freopen(".out","w",stdout);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | [
"expression.operation.binary.add"
] | 876,174 | 876,175 | u799165954 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define N 100000
long long a[N];
int main() {
long long sum = 0, minimum = 0;
int negCount = 0;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0) {
negCount++;
}
minimum = min(minimum, abs(a[i]));
}
if (negCount % 2 != 0) {
sum -= 2 * minimum;
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define N 100000
long long a[N];
int main() {
long long sum = 0, minimum = 1e18;
int negCount = 0;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0) {
negCount++;
}
minimum = min(minimum, abs(a[i]));
}
if (negCount % 2 != 0) {
sum -= 2 * minimum;
}
cout << sum << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 876,198 | 876,199 | u981907639 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.