1018. 锤子剪刀布 (20)
时间限制
100 ms
内存限制
32000 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
现给出两人的交锋记录,请统计双方的胜、平、负次数,并且给出双方分别出什么手势的胜算最大。
输入格式:
输入第1行给出正整数N(<=105),即双方交锋的次数。随后N行,每行给出一次交锋的信息,即甲、乙双方同时给出的的手势。C代表“锤子”、J代表“剪刀”、B代表“布”,第1个字母代表甲方,第2个代表乙方,中间有1个空格。
输出格式:
输出第1、2行分别给出甲、乙的胜、平、负次数,数字间以1个空格分隔。第3行给出两个字母,分别代表甲、乙获胜次数最多的手势,中间有1个空格。如果解不唯一,则输出按字母序最小的解。
输入样例:10 C J J B C B B B B C C C C B J B B C J J输出样例:
5 3 2 2 3 5 B B
/* @ author: GaominQuan @ data: 2014 - 2 - 21 @ mail: ensoleilly@gmail.com */ #include<iostream> #include<vector> using namespace std; enum types{B,C,J}; enum result{win,loss,same}; result race(types t1, types t2){ result rt; if(t1 == t2){ rt = same; }else{ if( t1 == B && t2 == C || t1 == C && t2 == J || t1 == J && t2 == B){ rt = win; }else{ rt = loss; } } return rt; } struct person{ int becauseWin[3]; int winTime; int lossTime; int equalTime; person(){ winTime = 0; lossTime = 0; equalTime = 0; for(int i = 0; i<3; i++){ //Notice Here !!!!!!!!!!!!!!!!!!!!!!!!!!! i and types which you need to use??? becauseWin[i] = 0; } }; }; types changeToTypes(char t1){ switch (t1){ case 'C':return C; case 'B':return B; case 'J':return J; } } char chooseMaxWin(person p){ int maxTime = 0; int maxType = 0; for(int i = 0; i<3; i++){ if(p.becauseWin[i] > maxTime){ maxTime = p.becauseWin[i]; maxType = i; } } switch(maxType){ case 0:return 'B'; case 1:return 'C'; case 2:return 'J'; } } int main(){ person p1,p2; person winer,losser; int N = 0; cin>>N; for(int i = 0; i<N; i++){ char t1,t2; cin>>t1>>t2; types type1 = changeToTypes(t1); types type2 = changeToTypes(t2); switch(race(type1,type2)){ case same: p1.equalTime++; p2.equalTime++; break; case win: p1.winTime++; p2.lossTime++; p1.becauseWin[type1]++; break; case loss: p2.winTime++; p1.lossTime++; p2.becauseWin[type2]++; break; } } cout<<p1.winTime<<" "<<p1.equalTime<<" "<<p1.lossTime<<endl; cout<<p2.winTime<<" "<<p2.equalTime<<" "<<p2.lossTime<<endl; cout<<chooseMaxWin(p1)<<" "<<chooseMaxWin(p2)<<endl; return 0; }