UVA1605 Building for UN (构造)

题解：

有n个国家，要求你设计一栋楼并为这n个国家划分房间，要求国家的房间必须连通，且每两个国家之间必须有一间房间是相邻的

只需要设计两层就可以了，每个国家占第一层的每一行，占第二层的每一列，这样的话就既满足联通又相邻了

代码

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 100000
#define LL long long
int cas=1,T;
char ans[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
int main()
{ 
    int n;
    while (scanf("%d",&n)!=EOF)
    {
        printf("2 %d %d\n",n,n);
        for (int i = 0;i<n;i++)
        {
            for (int j = 0;j<n;j++)
                printf("%c",ans[i]);
            printf("\n");
        }
        printf("\n");
        for (int i = 0;i<n;i++)
        {
            for (int j = 0;j<n;j++)
            {
                printf("%c",ans[j]);
            }
            printf("\n");
        }
    }
    //freopen("in","r",stdin);
    //scanf("%d",&T);
    //printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
    return 0;
}

题目

The United Nations has decided to build a new headquarters in Saint Petersburg, Russia. It will have a
form of a rectangular parallelepiped and will consist of several rectangular floors, one on top of another.
Each floor is a rectangular grid of the same dimensions, each cell of this grid is an office.
Two offices are considered adjacent if they are located on the same floor and share a common wall,
or if one’s floor is the other’s ceiling.
The St. Petersburg building will host n national missions. Each country gets several offices that
form a connected set.
Moreover, modern political situation shows that countries might want to form secret coalitions. For
that to be possible, each pair of countries must have at least one pair of adjacent offices, so that they
can raise the wall or the ceiling they share to perform secret pair-wise negotiations just in case they
need to.
You are hired to design an appropriate building for the UN.
Input
Input consists of several datasets. Each of them has a single integer number n (1 ≤ n ≤ 50) — the
number of countries that are hosted in the building.
Output
On the first line of the output for each dataset write three integer numbers h, w, and l — height, width
and length of the building respectively.
h descriptions of floors should follow. Each floor description consists of l lines with w characters on
each line. Separate descriptions of adjacent floors with an empty line.
Use capital and small Latin letters to denote offices of different countries. There should be at most
1 000 000 offices in the building. Each office should be occupied by a country. There should be exactly
n different countries in the building. In this problem the required building design always exists.
Print a blank line between test cases.
Sample Input
4
Sample Output
2 2 2
AB
CC

zz
zz