zoukankan      html  css  js  c++  java
  • Educational Codeforces Round 33 (Rated for Div. 2) A题

    A. Chess For Three

    Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two players, not three.

    So they play with each other according to following rules:

    Alex and Bob play the first game, and Carl is spectating;
    When the game ends, the one who lost the game becomes the spectator in the next game, and the one who was spectating plays against the winner.
    Alex, Bob and Carl play in such a way that there are no draws.

    Today they have played n games, and for each of these games they remember who was the winner. They decided to make up a log of games describing who won each game. But now they doubt if the information in the log is correct, and they want to know if the situation described in the log they made up was possible (that is, no game is won by someone who is spectating if Alex, Bob and Carl play according to the rules). Help them to check it!

    Input
    The first line contains one integer n (1 ≤ n ≤ 100) — the number of games Alex, Bob and Carl played.

    Then n lines follow, describing the game log. i-th line contains one integer ai (1 ≤ ai ≤ 3) which is equal to 1 if Alex won i-th game, to 2 if Bob won i-th game and 3 if Carl won i-th game.

    Output
    Print YES if the situation described in the log was possible. Otherwise print NO.

    input

    3
    1
    1
    2


    output

    YES

    思路:简单的模拟即可。

    AC代码:

     1 #include<bits/stdc++.h>
     2 
     3 using namespace std;
     4 int main(){
     5     int _;
     6     cin>>_;
     7     int flag=1;
     8     int arr[_+10];
     9     int a,b,c;
    10     a=1;b=2;c=3;
    11     for(int i=1;i<=_;i++){
    12         cin>>arr[i];
    13         if(arr[i]==c){
    14             flag=0;
    15         }
    16         if(flag){
    17             if(arr[i]==a){
    18                 swap(b,c);
    19             }else if(arr[i]==b){
    20                 swap(a,c);
    21             }else if(arr[i]==c){
    22                 swap(a,b);
    23             }
    24        }
    25     }
    26     if(flag){
    27         puts("YES");
    28     }else{
    29         puts("NO");
    30     } 
    31     return 0;
    32 }
  • 相关阅读:
    一文看懂Fluentd语法
    mongo 使用聚合合并字段
    加速开发流程的 Dockerfile 最佳实践
    nodejs之RSA加密/签名
    nodejs之https双向认证
    自签证书生成
    白话理解https
    一文看懂k8s Deployment yaml
    基于xtermjs实现的web terminal
    intelliJ 中文设置
  • 原文地址:https://www.cnblogs.com/pengge666/p/11511054.html
Copyright © 2011-2022 走看看