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 }

 

转载于:https://www.cnblogs.com/pengge666/p/11511054.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值