[CCF CSP]画图2015-12-3

题目链接:http://118.190.20.162/view.page?gpid=T35

思路:简单的DFS+模拟就可以了

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <map>
#include <memory.h>
using namespace std;
int m,n,q;
char a[101][101];
int vis[101][101];
int fx[4]={0,0,-1,1};
int fy[4]={-1,1,0,0};
int check(int x,int y){
    if(x<0||y<0||x>m||y>n) return 0;
    else if(vis[y][x]) return 0;
    else if(a[y][x]=='+'||a[y][x]=='|'||a[y][x]=='-') return 0;
    else return 1;
}
void dfs(int x,int y,char c){
    a[y][x]=c;
    vis[y][x]=1;
    for(int i=0;i<4;i++){
        int xx=x+fx[i];
        int yy=y+fy[i];
        if(check(xx,yy)){
            dfs(xx,yy,c);
        }
    }
}
void draw(int x1,int y1,int x2,int y2){
    if(x1>x2){
        swap(x1,x2);
    }
    if(y1>y2){
        swap(y1,y2);
    }
    if(y1==y2) {
        for (int i = x1; i <= x2; i++) {
            a[y1][i] = (a[y1][i] == '+' || a[y1][i] == '|') ? '+' : '-';
        }
    }
    else {
        for (int i = y1; i <= y2; i++) {
            a[i][x1] = (a[i][x1] == '+' || a[i][x1] == '-') ? '+' : '|';
        }
    }
}
int main() {
    memset(a,'.',sizeof(a));
    cin>>m>>n>>q;
    for(int i=0;i<q;i++){
        int op;
        cin>>op;
        if(op==1){
            int x,y;
            char c;
            cin>>x>>y>>c;
            y=n-1-y;
            memset(vis,0,sizeof(vis));
            dfs(x,y,c);
        }
        else
        {
            int x1,y1,x2,y2;
            cin>>x1>>y1>>x2>>y2;
            y1=n-1-y1;
            y2=n-1-y2;
            draw(x1,y1,x2,y2);
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cout<<a[i][j];
        }
        cout<<endl;
    }
    return 0;
}