CodeForces/A_Be_Positive.cpp at master · Ash8389/CodeForces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve()
{
    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }

    int neg = 0, zero = 0;

    for (int i = 0; i < n; i++)
    {
        if (a[i] == -1)
        {
            neg++;
        }
        else if (a[i] == 0)
        {
            zero++;
        }
    }

    int res = 0;

    if (neg & 1)
    {
        res += 2;
    }
    res += zero;

    cout << res << "\n";
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;

    while (t--)
    {
        solve();
    }

    return 0;
}