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
| vector <string> two_ten = {"LLLLNNNPPP","LIIIIINNPP"};
vector <string> two_fif = {"LIIIIINNYNNNPPP","LLLLNNNYYYYNNPP"};
vector <string> three_five = {"TLLLL","TTTYL","TYYYY"};
vector <string> four_five = {"LLLLP","LWWPP","WWYPP","WYYYY"};
vector <string> five_five = {"PPPFF","PPFFL","UUXFL","UXXXL","UUXLL"};
void solve ()
{
int n = read (),m = read (),fl = 0;
if (n * m % 5 != 0) {puts ("no");return;}
if (n > m) fl ^= 1,swap (n,m);
if (n > 2 && m % 5 != 0) fl ^= 1,swap (n,m);
vector <vector <char>> ans (n + 1,vector <char> (m + 1));
auto fill = [&] (int n,int st,vector <string> &chr,int bias = 0) -> void
{
for (int i = 1;i <= n;++i)
{
int pos = 0;
for (auto v : chr[i - 1]) ans[i + bias][st + pos] = v,++pos;
}
};
if (n == 1)
{
if (m != 5) {puts ("no");return;}
for (int i = 1;i <= 5;++i) ans[1][i] = 'I';
}
else if (n == 2)
{
if (m == 5) {puts ("no");return;}
int dx = 0,dy = 0;
for (int i = 0;i <= m;++i)
if (10 * i <= m && (m - 10 * i) % 15 == 0) {dx = i;dy = (m - 10 * i) / 15;break;}
int pos = 1;
while (dx--) fill (2,pos,two_ten),pos += 10;
while (dy--) fill (2,pos,two_fif),pos += 15;
}
else
{
for (int i = 1;i <= m;i += 5) fill (3,i,three_five);
int delta = (3 + n % 3);
if (delta == 3) delta = 0;
for (int i = 4;i <= n - delta;i += 3)
{
for (int o = 0;o < 3;++o)
{
ans[i + o] = ans[i + o - 3];
reverse (ans[i + o].begin () + 1,ans[i + o].end ());
}
}
for (int i = 1;delta && i <= m;i += 5) fill (3 + n % 3,i,n % 3 == 0 ? three_five : (n % 3 == 1 ? four_five : five_five),n - (3 + n % 3));
}
puts ("yes");
if (!fl)
{
for (int i = 1;i <= n;++i)
{
for (int j = 1;j <= m;++j) printf ("%c",ans[i][j]);
puts ("");
}
}
else
{
for (int j = 1;j <= m;++j)
{
for (int i = 1;i <= n;++i) printf ("%c",ans[i][j]);
puts ("");
}
}
}
|
