UVALive 6451:Tables(模拟 Grade D)

VJ题目链接

题意：模拟输出表格

思路：模拟……很暴力

代码：

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;

int graph[][];

int main() {
    int n;
    while (scanf("%d", &n) != EOF) {
        if (n == ) break;
        memset(graph, , sizeof(graph));

        int maxcol = ;
        for (int i = ; i < n; i++){
            int m;
            scanf("%d", &m);
            for (int j = ; j < m; j++) {
                int row, col;
                scanf("%d%d", &row, &col);
                int bgc = ;
                while (graph[i][bgc] != ) bgc++;
                col = bgc+col;
                row = i+row;
                int id = (i+)*+bgc+;
                maxcol = max(maxcol, col);
                for (int r = i; r < row; r++) {
                    for (int c = bgc; c < col; c++) {
                        graph[r][c] = id;
                    }
                }
            }
        }

        //for (int i = 0; i < n; i++) {
        //    for (int j = 0; j < maxcol; j++) {
        //        printf("%d ", graph[i][j]);
        //    }puts("");
        //}puts("");

        for (int i = ; i < maxcol; i++) {
            printf(" --");
        }puts("");

        for (int i = ; graph[i][]; i++) {
            //Line
            printf("|");
            for (int j = ; graph[i][j]; j++) {
                if (graph[i][j] == (i+)*+j+) printf("%d", graph[i][j]);
                else printf("  ");
                if (graph[i][j] == graph[i][j+]) printf(" ");
                else printf("|");
            }puts("");

            //Button
            int store = ;
            for (int j = ; graph[i][j]; j++) {
                if (graph[i][j] == graph[i+][j]) store++;
                else {
                    while (store) {
                        printf("   ");
                        store--;
                    }
                    printf(" --");
                }
            }puts("");
        }
        puts("");
    }
    return ;
}