Teris2(Semi-finished product)

#include <conio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <time.h>
#include <windows.h>
using namespace std;
int map[200]={0};
vector<string> block{"0000001001110000", "0000001101100000", "0000011001100000", "0000111100000000", "0000011000110000", "0000011100010000", "0000011101000000"}; //7種方塊
int bid;  //方塊編號
string bstr;  //方塊內容
int nowxy;  //現在位置
//第一題，地圖繪製，0用白色方塊顯示，其餘用黑色方塊
void draw_map() {
    system("cls");  //cls means clear screen
    for(int i = 0 ; i < 200 ; i++ ){
        if( map[i] == 0 ){
            cout << "□";
        }
        else{
            cout << "■" ;
        }
        if(i % 10 == 9){
            cout << endl;
        }
    }
}

void init_map() {
    for(int i = 0 ; i < 200 ; i++){
        if( i%10 == 0 || (i-9) % 10 == 0 || i > 190 ){
            map[i] = 1;
        }
    }
}

void draw_block(){
    //system("cls");
    for(int i = 0 ; i < 16 ; i++){
        if(bstr[i] =='0'){
            cout << "□";
        }
        else{
            cout << "■";
        }
        if(i % 4 == 3){
            cout << endl;
        }
    }
}

bool move( int f , int t ){
    int i , j;

    //清除上一步F
    for( i = 3 ; i>=0 ; i-- ){
        for( j = 3; j >= 0 ; j-- ){
            if(bstr[i*4+j] !='0'){
                map[f+i*10+j] = 0;
            }
        }
    }
    //偵測碰撞(T點)
    bool collision = false;
    for( i = 3 ; i>=0 ; i-- ){
        for( j = 3; j >= 0 ; j-- ){
            if(bstr[i*4+j] != '0'){
                if(map[t+i*10+j] != 0){
                    collision = true;
                }
            }
        }
    }
    int a;
    if(collision == false){
        a = t;
    }
    else{
        a = f;
    }
    for(i = 3 ; i >= 0 ; i--){
        for(j = 3 ; j >= 0 ; j--){
            if(bstr[i*4+j] !='0'){
                map[a+i*10+j] = bstr[i*4+j] - '0';
            }
        }
    }
    nowxy = a;
    return not collision;
}

void clockwise(){
    int r[16]= { 12,8,4,0, 13, 9 , 5 , 1 , 14,10,6,2,15,11,7,3};
    int i;
    string t = bstr;
    for(i = 0 ; i <=15 ; i++){
        t[i] = bstr[r[i]];
    }
    for(i = 0 ; i <=15 ; i++){
        bstr[i] = t[i];
    }
}

bool rotate(int f){
    int i , j;
    //清除上一步F
    for( i=3 ; i>=0 ; i-- ){
        for( j=3 ; j>=0 ; j-- ){
            if(bstr[i*4+j] !='0'){
                map[f+i*10+j] = 0;
            }
        }
    }
    clockwise();

    //偵測碰撞(T點)
    bool collision = false;
    for( i=3 ; i>=0 ; i-- ){
        for( j=3 ; j>=0 ; j--){
            if(bstr[i*4+j] != '0'){
                if(map[f+i*10+j] != 0){
                    collision = true;
                }
            }
        }
    }

    if(collision == true){
        clockwise();
        clockwise();
        clockwise();
    }
    int a = f;
    for( i=3 ; i>=0 ; i-- ){
        for( j=3 ; j>=0 ; j--){
            if(bstr[i*4+j] !='0'){
                map[a+i*10+j] = bstr[i*4+j] -'0';
            }
        }
    }
    nowxy = a;
    return not collision;

}

int main(void)
{
    int k;  //紀錄你按到哪一個按鍵

    init_map();
    draw_map();

    cin >> bid;
    bstr = block[bid];
    draw_block();

    nowxy = 3;
    move(3,3);
    draw_map();
    do{
        k = _getch();
        if( k == 'e' ){
        // from nowxy to nowxy+10
        move( nowxy , nowxy - 10 );
        }
        else if( k == 'd' ){
            move( nowxy ,  nowxy + 10 );
        }
        else if( k == 's' ){
            move( nowxy ,  nowxy - 1 );
        }
        else if( k == 'f' ){
            move( nowxy ,  nowxy + 1 );
        }
        else if( k == 'q' ){
            break;
        }
        else if( k == 'r' ){
            /*clockwise();
            draw_block();  第一題測試
            continue; */
            rotate(nowxy);
            move(nowxy,nowxy);
        }
        draw_map();
    }while(k!=27);

    return 0;
}