1206B - Make Product Equal One - CodeForces Solution


dp implementation *900

Please click on ads to support us..

Python Code:

input()
c=1
s=d=0
for x in map(int,input().split()):c&=x!=0;d^=x<0;s+=(x-1,abs(x+1))[x<1]
print(s+c*d*2)

C++ Code:

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

using ll = long long;

void resolve() {
    ll n;
    cin >> n;
    ll res = 0;
    ll cntNeg = 0;
    bool wasZero = false;
    for (ll i = 0; i < n; ++i) {
        ll x;
        cin >> x;
        res += abs(abs(x) - 1);
        cntNeg += x < 0;

        if (!x) {
            wasZero = true;
        }
    }

    res += ((cntNeg & 1) << 1LL) * (!wasZero);
    cout << res << '\n';
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    resolve();
    return 0;
}


Comments

Submit
0 Comments
More Questions

978B - File Name
1426B - Symmetric Matrix
732B - Cormen --- The Best Friend Of a Man
1369A - FashionabLee
1474B - Different Divisors
1632B - Roof Construction
388A - Fox and Box Accumulation
451A - Game With Sticks
768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail