"I've been here once," Mino exclaims with delight, "it's breathtakingly amazing."
"What is it like?"
"Look, Kanno, you've got your paintbrush, and I've got my words. Have a try, shall we?"
There are four kinds of flowers in the wood, Amaranths, Begonias, Centaureas and Dianthuses.
The wood can be represented by a rectangular grid of nn rows and mm columns. In each cell of the grid, there is exactly one type of flowers.
According to Mino, the numbers of connected components formed by each kind of flowers are aa, bb, cc and dd respectively. Two cells are considered in the same connected component if and only if a path exists between them that moves between cells sharing common edges and passes only through cells containing the same flowers.
You are to help Kanno depict such a grid of flowers, with nn and mm arbitrarily chosen under the constraints given below. It can be shown that at least one solution exists under the constraints of this problem.
Note that you can choose arbitrary nn and mm under the constraints below, they are not given in the input.
The first and only line of input contains four space-separated integers aa, bb, cc and dd (1≤a,b,c,d≤1001≤a,b,c,d≤100) — the required number of connected components of Amaranths, Begonias, Centaureas and Dianthuses, respectively.
In the first line, output two space-separated integers nn and mm (1≤n,m≤501≤n,m≤50) — the number of rows and the number of columns in the grid respectively.
Then output nn lines each consisting of mm consecutive English letters, representing one row of the grid. Each letter should be among 'A', 'B', 'C' and 'D', representing Amaranths, Begonias, Centaureas and Dianthuses, respectively.
In case there are multiple solutions, print any. You can output each letter in either case (upper or lower).
5 3 2 1
4 7 DDDDDDD DABACAD DBABACD DDDDDDD
50 50 1 1
4 50 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ABABABABABABABABABABABABABABABABABABABABABABABABAB BABABABABABABABABABABABABABABABABABABABABABABABABA DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD
1 6 4 5
7 7 DDDDDDD DDDBDBD DDCDCDD DBDADBD DDCDCDD DBDBDDD DDDDDDD
In the first example, each cell of Amaranths, Begonias and Centaureas forms a connected component, while all the Dianthuses form one.
思路:主要留意到A~D的范围只有100,假设A~D的数量非增,如下图一所示分成四个区域,每个区域如图二所示涂即可,其中A和B各留下一个连通块不涂,最后才将橙色区域用B填满剩下的空格,蓝色区域用A填满剩下的空格就行。
# include <bits/stdc++.h>
using namespace std;
struct node{int x, y;}a[5];
bool cmp(node u, node v){return u.x > v.x;}
int b[50][50];
void fun(int x0, int y0, int x1, int y1, int num, int col, int k)
{
if(num == 0) return;
for(int i=x0; i<=x1; i+=k)
{
for(int j=y0; j<=y1; j+=k)
{
if(!b[i][j]) b[i][j] = col;
if(--num == 0) return;
}
}
}
int main()
{
for(int i=1; i<=4; ++i)
{
scanf("%d",&a[i].x);
a[i].y = i;
}
sort(a+1,a+5, cmp);
fun(1,1,24,24,a[1].x-1, a[1].y, 2);
fun(26,26,49,49,a[2].x-1, a[2].y, 2);
fun(1,26,24,49,a[3].x, a[3].y, 2);
fun(26,1,49,24,a[4].x, a[4].y, 2);
fun(1,1,25,25,10000,a[2].y, 1);
fun(1,1,49,49,10000, a[1].y,1);
printf("49 49\n");
for(int i=1; i<=49; ++i,putchar('\n'))
for(int j=1; j<=49; ++j)
printf("%c",'A'+b[i][j]-1);
return 0;
}