-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA_Colour_the_Flag.cpp
137 lines (132 loc) · 3.15 KB
/
A_Colour_the_Flag.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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int t;
cin >> t;
while (t--)
{
int n, m;
cin >> n >> m;
int arr[n][m];
for (int i = 0; i < n; i++)
{
string s;
cin >> s;
for (int j = 0; j < m; j++)
{
if (s[j] == '.')
{
arr[i][j] = -1;
}
else if (s[j] == 'R')
{
arr[i][j] = 0;
}
else
{
arr[i][j] = 1;
}
}
}
int ans1[n][m];
for (int i = 0; i < n; i++)
{
bool f = 0;
if (i & 1)
f = 1;
for (int j = 0; j < m; j++)
{
if (!f)
ans1[i][j] = 0;
else
ans1[i][j] = 1;
f = !f;
}
}
int ans2[n][m];
for (int i = 0; i < n; i++)
{
bool f = 1;
if (i & 1)
f = 0;
for (int j = 0; j < m; j++)
{
if (!f)
ans2[i][j] = 0;
else
ans2[i][j] = 1;
f = !f;
// cout<<ans2[i][j];
}
// cout<<endl;
}
bool ans = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (arr[i][j] != -1 and (arr[i][j] != ans1[i][j]))
{
// cout<<arr[i][j]<<" "<<ans1[i][j]<<endl;
ans = 0;
break;
}
}
if (!ans)
break;
}
if (ans)
{
cout << "Yes" << endl;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (ans1[i][j] == 0)
cout << 'R';
else
cout << 'W';
}
cout << endl;
}
}
else
{
ans = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (arr[i][j] != -1 and arr[i][j] != ans2[i][j])
{
ans = 0;
break;
}
}
if (!ans)
break;
}
if (ans)
{
cout << "Yes" << endl;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (ans2[i][j] == 0)
cout << 'R';
else
cout << 'W';
}
cout << endl;
}
}
else
{
cout << "No" << endl;
}
}
}
}