栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

zoj 2572 Color ASCII Characters

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

zoj 2572 Color ASCII Characters

#include <stdio.h>#include <string.h>char str[102][102];int color[102][102];void colorit(int i, int j, int k){    if(color[i][j] == k) return;    switch(str[i][j]){    case '-':        color[i][j] = k;        if(color[i][j - 1] != k && (str[i][j - 1] == '-' || str[i][j - 1] == '+' || str[i][j - 1] == '*')) colorit(i, j - 1, k);        if(color[i][j + 1] != k && (str[i][j + 1] == '-' || str[i][j + 1] == '+' || str[i][j + 1] == '*')) colorit(i, j + 1, k);        break;    case '|':        color[i][j] = k;        if(color[i - 1][j] != k && (str[i - 1][j] == '|' || str[i - 1][j] == '+' || str[i - 1][j] == '*')) colorit(i - 1, j, k);        if(color[i + 1][j] != k && (str[i + 1][j] == '|' || str[i + 1][j] == '+' || str[i + 1][j] == '*')) colorit(i + 1, j, k);        break;    case '+':        color[i][j] = k;        if(color[i][j - 1] != k && (str[i][j - 1] == '-' || str[i][j - 1] == '+' || str[i][j - 1] == '*')) colorit(i, j - 1, k);        if(color[i][j + 1] != k && (str[i][j + 1] == '-' || str[i][j + 1] == '+' || str[i][j + 1] == '*')) colorit(i, j + 1, k);        if(color[i - 1][j] != k && (str[i - 1][j] == '|' || str[i - 1][j] == '+' || str[i - 1][j] == '*')) colorit(i - 1, j, k);        if(color[i + 1][j] != k && (str[i + 1][j] == '|' || str[i + 1][j] == '+' || str[i + 1][j] == '*')) colorit(i + 1, j, k);        break;    case '/':        color[i][j] = k;        if(color[i - 1][j + 1] != k && (str[i - 1][j + 1] == '/' || str[i - 1][j + 1] == 'X' || str[i - 1][j + 1] == '*')) colorit(i - 1, j + 1, k);        if(color[i + 1][j - 1] != k && (str[i + 1][j - 1] == '/' || str[i + 1][j - 1] == 'X' || str[i + 1][j - 1] == '*')) colorit(i + 1, j - 1, k);        break;    case '\':        color[i][j] = k;        if(color[i - 1][j - 1] != k && (str[i - 1][j - 1] == '\' || str[i - 1][j - 1] == 'X' || str[i - 1][j - 1] == '*')) colorit(i - 1, j - 1, k);        if(color[i + 1][j + 1] != k && (str[i + 1][j + 1] == '\' || str[i + 1][j + 1] == 'X' || str[i + 1][j + 1] == '*')) colorit(i + 1, j + 1, k);        break;    case 'X':        color[i][j] = k;        if(color[i - 1][j + 1] != k && (str[i - 1][j + 1] == '/' || str[i - 1][j + 1] == 'X' || str[i - 1][j + 1] == '*')) colorit(i - 1, j + 1, k);        if(color[i + 1][j - 1] != k && (str[i + 1][j - 1] == '/' || str[i + 1][j - 1] == 'X' || str[i + 1][j - 1] == '*')) colorit(i + 1, j - 1, k);        if(color[i - 1][j - 1] != k && (str[i - 1][j - 1] == '\' || str[i - 1][j - 1] == 'X' || str[i - 1][j - 1] == '*')) colorit(i - 1, j - 1, k);        if(color[i + 1][j + 1] != k && (str[i + 1][j + 1] == '\' || str[i + 1][j + 1] == 'X' || str[i + 1][j + 1] == '*')) colorit(i + 1, j + 1, k);        break;    case '*':        color[i][j] = k;        if(color[i][j - 1] != k && (str[i][j - 1] == '-' || str[i][j - 1] == '+' || str[i][j - 1] == '*')) colorit(i, j - 1, k);        if(color[i][j + 1] != k && (str[i][j + 1] == '-' || str[i][j + 1] == '+' || str[i][j + 1] == '*')) colorit(i, j + 1, k);        if(color[i - 1][j] != k && (str[i - 1][j] == '|' || str[i - 1][j] == '+' || str[i - 1][j] == '*')) colorit(i - 1, j, k);        if(color[i + 1][j] != k && (str[i + 1][j] == '|' || str[i + 1][j] == '+' || str[i + 1][j] == '*')) colorit(i + 1, j, k);        if(color[i - 1][j + 1] != k && (str[i - 1][j + 1] == '/' || str[i - 1][j + 1] == 'X' || str[i - 1][j + 1] == '*')) colorit(i - 1, j + 1, k);        if(color[i + 1][j - 1] != k && (str[i + 1][j - 1] == '/' || str[i + 1][j - 1] == 'X' || str[i + 1][j - 1] == '*')) colorit(i + 1, j - 1, k);        if(color[i - 1][j - 1] != k && (str[i - 1][j - 1] == '\' || str[i - 1][j - 1] == 'X' || str[i - 1][j - 1] == '*')) colorit(i - 1, j - 1, k);        if(color[i + 1][j + 1] != k && (str[i + 1][j + 1] == '\' || str[i + 1][j + 1] == 'X' || str[i + 1][j + 1] == '*')) colorit(i + 1, j + 1, k);        break;    default:        break;    }}int main(){    int i, j, k, n, m;    while(scanf("%d%d", &n, &m) != EOF) {        getchar();        memset(str, 0, sizeof(str));        memset(color, 0, sizeof(color));        for (i = 1; i <= n; i++) gets(str[i] + 1);        scanf("%d", &m);        while(m--) { scanf("%d%d%d", &i, &j, &k); colorit(i + 1, j + 1, k);        }        for (i = 1; i <= n; i++) { j = 1; while(str[i][j]) {     if(color[i][j] == 0) putchar(str[i][j++]);     else{         k = j + 1;         while(color[i][k] == color[i][j]) k++;         printf("[m%d", color[i][j]);         do{  putchar(str[i][j++]);         }while(j < k);         printf("m]");     } } putchar('n');        }    }    return 0;   }
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/371628.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号