-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathset_zeroes.cpp
82 lines (78 loc) · 1.74 KB
/
set_zeroes.cpp
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>
using namespace std;
void setZeroes(vector<vector<int>> &matrix)
{
int n = matrix.size(), m = matrix[0].size();
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (matrix[i][j] == 0)
{
// Set all the elements that are not zero as -9999
for (int k = 0; k < m; k++)
{
if (matrix[i][k] != 0)
{
matrix[i][k] = -9999;
}
}
break;
}
}
}
// Traverse column wise
for (int j = 0; j < m; j++)
{
for (int i = 0; i < n; i++)
{
if (matrix[i][j] == 0)
{
// Set all the elements that are not zero as -9999
for (int k = 0; k < n; k++)
{
if (matrix[k][j] != 0)
{
matrix[k][j] = -9999;
}
}
}
}
}
// Update all -9999 as 0
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (matrix[i][j] == -9999)
{
matrix[i][j] = 0;
}
}
}
}
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> v;
for (int i = 0; i < n; i++)
{
vector<int> x;
for (int j = 0; j < m; j++)
{
int temp;
cin >> temp;
x.push_back(temp);
}
v.push_back(x);
}
setZeroes(v);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
cout << v[i][j] << " ";
cout << endl;
}
return 0;
}