Tank - NDDCoder

Fork

#include<iostream>
#define ROCK 1
#define NONE 0
using namespace std;
int N;
int maze[13][6];
int tempMaze[13][6];
int moveX[] = {-1,0,0};
int moveY[] = {0,1,-1};
int vis[16][6];
void initVis(){
    for(int i=1;i<=N;i++){
        for(int j=1;j<=5;j++){
            vis[i][j] = 0;
        }
    }
}
void destroyRock(int row){
	int ed = row - 2;
    if(row<=2){
 		ed = 1;
    }
    for(int i=row;i>=ed;i--){
        for(int j=1;j<=5;j++){
            maze[i][j] = NONE;
        }
    }
}
void reverseRock(int row){
	int ed = row - 2;
    if(row<=2){
 		ed = 1;
    }
    for(int i=row;i>=ed;i--){
        for(int j=1;j<=5;j++){
            maze[i][j] = tempMaze[i][j];
        }
    }
}
bool isValid(int x,int y){
    if(x>=1&&x<=N&&y>=1&&y<=5) return true;
    return false;
}
int ans = 0;
void Try(int row,int col,int numBomb,int score){
    if(row==1){
        //do smt;
        int temp = score;
        if(maze[row][col]==ROCK)
            temp-=1;
        else temp+=1;
        if(temp==21){
        	for(int i=1;i<=N;i++){
        		for(int j=1;j<=5;j++){
        			cout<<maze[i][j]<<" ";
				}
				cout<<endl;
			}
			cout<<endl;
		}
        if(temp>ans){
//        	cout<<temp<<endl;
            ans = temp;
        }
        return;
    }
    for(int i=0;i<3;i++){
        int nextX = row + moveX[i];
        int nextY = col + moveY[i];
        if(isValid(nextX,nextY)&&vis[nextX][nextY]==0){
        	vis[nextX][nextY] = vis[row][col] + 1;
            if(numBomb==1){
                //neu con bom thi dung bom
                int temp = maze[row][col];
                destroyRock(row);
                if(temp==ROCK){
                	Try(nextX,nextY,numBomb-1,score-1);
				}
                else{
                	Try(nextX,nextY,numBomb-1,score+1);
				} 
                reverseRock(row);
            }
            if(maze[row][col]==NONE){
                Try(nextX,nextY,numBomb,score+1);
            }
            else{
				Try(nextX,nextY,numBomb,score-1);
            }
			vis[nextX][nextY] = 0;
        }
    }
}
int main()
{
    freopen("input.txt","r",stdin);
    int tc,T;
    cin>>T;
    for(tc=1;tc<=T;tc++){
        cin>>N;
        for(int i=1;i<=N;i++){
            for(int j=1;j<=5;j++){
                cin>>maze[i][j];
                tempMaze[i][j] = maze[i][j];
            }
        }
        ans = 0;
        initVis();
        vis[N][3] = 1;
        Try(N,3,1,0);
        cout<<ans<<endl;

}
    return 0;
}