• 220 - Othello （UVA）

    题目链接如下：

    Online Judge

    我最终的代码如下（有个细节，88行输出时，需要%2d；locate函数第三个参数是0的话，代表只是判断是否可以放置；1代表下一步棋，包括替换被夹住的棋子）：

    1. #include 
    2. #include 
    3. // #define debug
    4. const int sz = 10;
    5.  
    6. int n, sum, xx, yy;
    7. char board[sz][sz];
    8. char op[4];
    9. char curr, other;
    10. int dirX[] = {1, 1, 0, -1, -1, -1, 0, 1};
    11. int dirY[] = {0, 1, 1, 1, 0, -1, -1, -1};
    12.  
    13. int locate(int u, int v, int k){
    14.     if(k == 0 && (board[u][v] == 'W' || board[u][v] == 'B')){
    15.         return 0;
    16.     }
    17.     if(k == 1){
    18.         board[u][v] = curr;
    19.     }
    20.     for(int i = 0; i < 8; ++i){
    21.         for(int len = 1; len < 8; ++len){
    22.             if(u + len * dirX[i] < 1 || u + len * dirX[i] > 8 || v + len * dirY[i] < 1 || v + len * dirY[i] > 8){
    23.                 break;
    24.             }
    25.             if(board[u + len * dirX[i]][v + len * dirY[i]] == curr){
    26.                 if(len == 1){
    27.                     break;
    28.                 }
    29.                 if(k == 0){
    30.                     return 1;
    31.                 }
    32.                 for(int j = 1; j < len; ++j){
    33.                     board[u + j * dirX[i]][v + j * dirY[i]] = curr;
    34.                 }
    35.                 break;
    36.             }
    37.             if(board[u + len * dirX[i]][v + len * dirY[i]] == '-'){
    38.                 break;
    39.             }
    40.         }
    41.     }
    42.     return 0;
    43. }
    44.  
    45. int main(){
    46.     #ifdef debug
    47.         freopen("0.txt","r",stdin);
    48.         freopen("1.txt","w",stdout);
    49.     #endif
    50.     scanf("%d\n", &n);
    51.     for(int kase = 0; kase < n; ++kase){
    52.         if(kase){
    53.             printf("\n");
    54.         }
    55.         for(int i = 1; i <= 8; ++i){
    56.             scanf("%s", board[i] + 1);
    57.         }
    58.         scanf("%s", op);
    59.         curr = op[0];
    60.         other = (curr == 'B' ? 'W' : 'B');
    61.         while(scanf("%s", op)){
    62.             if(op[0] == 'L'){
    63.                 sum = 0;
    64.                 for(int i = 1; i <= 8; ++i){
    65.                     for(int j = 1; j <= 8; ++j){
    66.                         if(locate(i, j, 0)){
    67.                             printf("%s(%d,%d)", sum ? " " : "", i, j);
    68.                             sum++;
    69.                         }
    70.                     }
    71.                 }
    72.                 printf("%s", sum ? "\n" : "No legal move.\n");
    73.             } else if(op[0] == 'M'){
    74.                 if(!locate(op[1] - '0', op[2] - '0', 0)){
    75.                     std::swap(curr, other);
    76.                 }
    77.                 locate(op[1] - '0', op[2] - '0', 1);
    78.                 xx = yy = 0;
    79.                 for(int i = 1; i <= 8; ++i){
    80.                     for(int j = 1; j <= 8; ++j){
    81.                         if(board[i][j] == 'B'){
    82.                             xx++;
    83.                         } else if(board[i][j] == 'W'){
    84.                             yy++;
    85.                         }
    86.                     }
    87.                 }
    88.                 printf("Black - %2d White - %2d\n", xx, yy);
    89.                 std::swap(curr, other);
    90.             } else{
    91.                 for(int i = 1; i <= 8; ++i){
    92.                     printf("%s\n", board[i] + 1);
    93.                 }
    94.                 break;
    95.             }
    96.         }
    97.     }
    98.     #ifdef debug
    99.         fclose(stdin);
    100.         fclose(stdout);
    101.     #endif
    102.     return 0;
    103. }

    一开始把判断能否放置棋子的函数和下一步棋的函数分开来写，代码如下：

    1. #include 
    2. #include 
    3. // #define debug
    4. const int sz = 10;
    5.  
    6. int n, sum, xx, yy;
    7. char board[sz][sz];
    8. char op[4];
    9. char curr, other;
    10. int dirX[] = {1, 1, 0, -1, -1, -1, 0, 1};
    11. int dirY[] = {0, 1, 1, 1, 0, -1, -1, -1};
    12.  
    13. bool canLocate(int u, int v){
    14.     if(board[u][v] == 'W' || board[u][v] == 'B'){
    15.         return false;
    16.     }
    17.     for(int i = 0; i < 8; ++i){
    18.         for(int len = 1; len < 8; ++len){
    19.             if(u + len * dirX[i] < 1 || u + len * dirX[i] > 8 || v + len * dirY[i] < 1 || v + len * dirY[i] > 8){
    20.                 break;
    21.             }
    22.             if(board[u + len * dirX[i]][v + len * dirY[i]] == curr){
    23.                 if(len == 1){
    24.                     break;
    25.                 }
    26.                 return true;
    27.             }
    28.             if(board[u + len * dirX[i]][v + len * dirY[i]] == '-'){
    29.                 break;
    30.             }
    31.         }
    32.     }
    33.     return false;
    34. }
    35.  
    36. void locate(int u, int v){
    37.     board[u][v] = curr;
    38.     for(int i = 0; i < 8; ++i){
    39.         for(int len = 1; len < 8; ++len){
    40.             if(u + len * dirX[i] < 1 || u + len * dirX[i] > 8 || v + len * dirY[i] < 1 || v + len * dirY[i] > 8){
    41.                 break;
    42.             }
    43.             if(board[u + len * dirX[i]][v + len * dirY[i]] == curr){
    44.                 if(len == 1){
    45.                     break;
    46.                 }
    47.                 for(int j = 1; j < len; ++j){
    48.                     board[u + j * dirX[i]][v + j * dirY[i]] = curr;
    49.                 }
    50.                 break;
    51.             }
    52.             if(board[u + len * dirX[i]][v + len * dirY[i]] == '-'){
    53.                 break;
    54.             }
    55.         }
    56.     }
    57. }
    58.  
    59. int main(){
    60.     #ifdef debug
    61.         freopen("0.txt","r",stdin);
    62.         freopen("1.txt","w",stdout);
    63.     #endif
    64.     scanf("%d\n", &n);
    65.     for(int kase = 0; kase < n; ++kase){
    66.         if(kase){
    67.             printf("\n");
    68.         }
    69.         for(int i = 1; i <= 8; ++i){
    70.             scanf("%s", board[i] + 1);
    71.         }
    72.         scanf("%s", op);
    73.         curr = op[0];
    74.         other = (curr == 'B' ? 'W' : 'B');
    75.         while(scanf("%s", op)){
    76.             if(op[0] == 'L'){
    77.                 sum = 0;
    78.                 for(int i = 1; i <= 8; ++i){
    79.                     for(int j = 1; j <= 8; ++j){
    80.                         if(canLocate(i, j)){
    81.                             printf("%s(%d,%d)", sum ? " " : "", i, j);
    82.                             sum++;
    83.                         }
    84.                     }
    85.                 }
    86.                 printf("%s", sum ? "\n" : "No legal move.\n");
    87.             } else if(op[0] == 'M'){
    88.                 if(!canLocate(op[1] - '0', op[2] - '0')){
    89.                     std::swap(curr, other);
    90.                 }
    91.                 locate(op[1] - '0', op[2] - '0');
    92.                 xx = yy = 0;
    93.                 for(int i = 1; i <= 8; ++i){
    94.                     for(int j = 1; j <= 8; ++j){
    95.                         if(board[i][j] == 'B'){
    96.                             xx++;
    97.                         } else if(board[i][j] == 'W'){
    98.                             yy++;
    99.                         }
    100.                     }
    101.                 }
    102.                 printf("Black - %2d White - %2d\n", xx, yy);
    103.                 std::swap(curr, other);
    104.             } else{
    105.                 for(int i = 1; i <= 8; ++i){
    106.                     printf("%s\n", board[i] + 1);
    107.                 }
    108.                 break;
    109.             }
    110.         }
    111.     }
    112.     #ifdef debug
    113.         fclose(stdin);
    114.         fclose(stdout);
    115.     #endif
    116.     return 0;
    117. }

  • 相关阅读:
    PDF转Markdown的开源工具解析
    [架构之路-225]：计算机硬件与体系结构 - 分类方法大汇总: RISC, CISC
    数据分析学习及实用技巧 —— LF《数据分析集训营》
    【 C++ 】函数模板进阶
    人工智能轨道交通行业周刊-第21期（2022.10.31-11.6）
    【云开发】小程序端操作数据库详解
    你还不会写API文档吗
    clion配置cygwin必按包
    魔众题库系统 v8.8.0 公式编辑升级，注册站内信和邮件，手机Banner支持视频背景
    相对路径（下级，同级）
  • 原文地址：https://blog.csdn.net/linh2006/article/details/133353132