算典03_习题_06_POJ-1888

Crossword Answers

题意

有一张图上，有黑块和白块，白块上有字母
从上到下每一行，从左到右，给符合条件的白块依次编号，条件是：此白块的左边或上边是边界或黑块
要求找到每一行的单词(按上面编好的号排序)和每一列的单词输出，单词即为最大连续的白块

题解

只要单纯地模拟即可，注意最后的输出要按编号排序，且编号要右对齐，这里编号不会超过100；
找每列的单词时用一个标记数组，也是每一行地遍历即可

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1e1 +5;
#define met(a,b) memset(a, b, sizeof(a));
int n, m;
char s[maxn][maxn];
int maps[maxn][maxn];
int id;

void Set(int i, int j) {
    if(i == 0 || j == 0 || s[i][j-1] == '*' || s[i-1][j] == '*') {
        maps[i][j] = id++;
        return;
    }
}

int main(){
    #ifdef _LOCAL
    freopen("in.txt","r", stdin);
    #endif // _LOCAL

    bool line = 0; int kase = 0;
    while(scanf("%d%d", &n, &m) == 2 && n){
        met(maps,0); id = 1;
        for(int i = 0; i < n; ++i){
            scanf("%s", s[i]);
            for(int j = 0; j < m; ++j){
                if(s[i][j] == '*')maps[i][j] = -1;
            }
        }

        for(int i = 0; i < n; ++i){
            for(int j = 0; j < m; ++j){
                if(s[i][j]!='*')Set(i, j);
            }
        }
        if(line) printf("\n");
        if(!line) line = 1;
        printf("puzzle #%d:\nAcross\n", ++kase);
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < m;){
                if(maps[i][j] > 0){
                    if(maps[i][j]<100)printf(" ");
                    if(maps[i][j]<10)printf(" ");
                    printf("%d.", maps[i][j]);
                    while(j < m && maps[i][j] >=0){
                        printf("%c", s[i][j]);
                        ++j;
                    }
                    printf("\n");
                }
                else ++j;
            }
        }

        printf("Down\n");
        bool vis[maxn][maxn]; met(vis, 0);
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < m;){
                if(! vis[i][j] && maps[i][j] > 0){
                    if(maps[i][j]<100)printf(" ");
                    if(maps[i][j]<10)printf(" ");
                    printf("%d.", maps[i][j]); vis[i][j] = 1;

                    int k = i;
                    while(k < n && maps[k][j] >= 0){
                        printf("%c", s[k][j]);
                        vis[k][j] = 1;
                        ++k;
                    }
                    printf("\n");


                }
                else ++j;
            }
        }
    }

    return 0;
}