[CCF CSP]消除类游戏2015-12-2

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

思路:从每个点的四个方向寻找相同的棋子,记录下来.

#include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <stdio.h>
using namespace std;

char a[101][101];
int mark[101][101];
int m,n;
void reMark(){
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            mark[i][j]=0;
        }
    }
}

int check(int x,int y){
    if(x<0||y<0||x>m||y>n) return 0;
    else if(mark[y][x]==1) 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;
    mark[y][x]=1;
    if(check(x,y+1)){
        dfs(x,y+1,c);
    }
    if(check(x+1,y)){
        dfs(x+1,y,c);
    }
    if(check(x,y-1)){
        dfs(x,y-1,c);
    }
    if(check(x-1,y)){
        dfs(x-1,y,c);
    }

}
void draw(int x1,int y1,int x2,int y2){
    if(x1>x2){
        for(int i=x1;i>=x2;i--){
            a[y1][i]=a[y1][i]=='|'||a[y1][i]=='+'?'+':'-';
        }
    }
    else if(x2>x1){
        for(int i=x2;i>=x1;i--){
            a[y1][i]=a[y1][i]=='|'||a[y1][i]=='+'?'+':'-';
        }
    }
    else if(y1>y2){
        for(int i=y1;i>=y2;i--){
            a[i][x1]=a[i][x1]=='-'||a[i][x1]=='+'?'+':'|';
        }
    }
    else if(y2>y1){
        for(int i=y2;i>=y1;i--){
            a[i][x1]=a[i][x1]=='-'||a[i][x1]=='+'?'+':'|';
        }
    }
}
int main() {
    for(int i=0;i<101;i++){
        for(int j=0;j<101;j++){
            a[i][j]='.';
        }
    }

    int q;
    int x1,y1,x2,y2;
    char c;
    cin>>m>>n>>q;

    for(int i=1;i<=q;i++){
        int operate;
        cin>>operate;
        if(operate==1){
            cin>>x1>>y1>>c;
            y1=n-1-y1;
            reMark();
            dfs(x1,y1,c);
        }
        else
        {
            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];
        }
        if(i<n-1) cout<<endl;
    }
    return 0;
}