CCF 201512-3 画图 (DFS搜索+模拟)

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#define freopenr freopen("in.txt", "r", stdin)
#define freopenw freopen("out.txt", "w", stdout)
using namespace std;

typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const LL LNF = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 100 + 5;
const int mod = 1e9 + 7;
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
const char *Hex[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int Min(int a, int b){ return a < b ? a : b; }
inline int Max(int a, int b){ return a > b ? a : b; }
inline LL Min(LL a, LL b){ return a < b ? a : b; }
inline LL Max(LL a, LL b){ return a > b ? a : b; }
inline bool is_in(int r, int c){
    return r >= 0 && r < n && c >= 0 && c < m;
}

char s[maxn][maxn];

void dfs(int r, int c, char ch){
    s[r][c] = ch;
    for(int i = 0; i < 4; ++i){
        int x = r + dr[i];
        int y = c + dc[i];
        if(!is_in(x, y) || s[x][y] == ch || s[x][y] == ‘+‘ || s[x][y] == ‘-‘ || s[x][y] == ‘|‘ )  continue;
        dfs(x, y, ch);
    }
}

void print(){
    for(int i = n-1; i >= 0; --i){
        for(int j = 0; j < m; ++j)
            printf("%c", s[i][j]);
        printf("\n");
    }
}

int main(){
    while(scanf("%d %d", &m, &n) == 2){
        int q; scanf("%d", &q);
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j)
                s[i][j] = ‘.‘;

        int p, x, y, x1, x2, y1, y2;
        char ch[5];
        while(q--){
            scanf("%d", &p);
            if(p){
               scanf("%d %d %s", &y, &x, ch);
               dfs(x, y, ch[0]);
            }
            else{
                scanf("%d %d %d %d", &y1, &x1, &y2, &x2);
                if(x1 > x2) swap(x1, x2);
                if(y1 > y2) swap(y1, y2);
                if(x1 == x2)
                    for(int i = y1; i <= y2; ++i)
                        if(s[x1][i] == ‘|‘ || s[x1][i] == ‘+‘)  s[x1][i] = ‘+‘;
                        else  s[x1][i] = ‘-‘;
                else
                    for(int i = x1; i <= x2; ++i)
                        if(s[i][y1] == ‘-‘ || s[i][y1] == ‘+‘)  s[i][y1] = ‘+‘;
                        else  s[i][y1] = ‘|‘;
            }
        }
        print();
    }
    return 0;
}