-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB_Numbers_Box.cpp
More file actions
68 lines (65 loc) · 1.28 KB
/
B_Numbers_Box.cpp
File metadata and controls
68 lines (65 loc) · 1.28 KB
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
void print(const vector<int>& v) {
for (int i : v) {
cout << i << " ";
}
cout << endl;
}
void solve() {
int n,m;
cin >> n >> m;
vector<int>v(n);
int zeros=0,size=0,sum=0;
int minel = 120;
for(int i=0;i<n;i++)
{
vector<int>rows(m);
int neg = 0;
for(int j=0;j<m;j++)
{
cin >> rows[j];
if(rows[j]<0)
{
neg++;
}
if(rows[j]==0)
{
zeros++;
}
minel = min(minel, abs(rows[j]));
sum+=abs(rows[j]);
}
//if even number of negatives, their effect is null. else not null.
if(neg%2!=0)
size++;
}
// cout << minel << endl;
// cout << sum << endl;
if(size%2==0)
{
cout << sum << endl;
}
else{
if(zeros>0)
{
cout << sum << endl;
}
else{
sum = sum - (2*abs(minel));
cout << sum << endl;
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t-- > 0) {
solve();
}
}