-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbooleanMatrixProblem.cpp
More file actions
85 lines (83 loc) · 1.71 KB
/
booleanMatrixProblem.cpp
File metadata and controls
85 lines (83 loc) · 1.71 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <iostream>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main()
{
fast int tc;
cin >> tc;
while (tc--)
{
int m, n;
cin >> m >> n;
int a[m][n];
bool rf = 0, cf = 0;
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
cin >> a[i][j];
}
}
for (int i = 0; i < m; i++)
{
if (a[i][0] == 1)
{
rf = 1;
break;
}
}
for (int j = 0; j < n; j++)
{
if (a[0][j] == 1)
{
cf = 1;
}
}
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
if (a[i][j] == 1)
{
a[i][0] = 1;
a[0][j] = 1;
}
}
}
for (int i = 1; i < m; i++)
{
for (int j = 1; j < n; j++)
{
if (a[i][0] == 1 || a[0][j] == 1)
{
a[i][j] = 1;
}
}
}
if (rf)
{
for (int i = 0; i < m; i++)
{
a[i][0] = 1;
}
}
if (cf)
{
for (int j = 0; j < n; j++)
{
a[0][j] = 1;
}
}
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
cout << a[i][j] << " ";
}
cout << "\n";
}
}
}