Task: | Battle Simulation |
Sender: | Qianyun Guo |
Submission time: | 2017-10-03 16:53:08 +0300 |
Language: | C++ |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.05 s | details |
#2 | ACCEPTED | 0.06 s | details |
#3 | ACCEPTED | 0.05 s | details |
#4 | ACCEPTED | 0.04 s | details |
#5 | ACCEPTED | 0.06 s | details |
#6 | ACCEPTED | 0.04 s | details |
#7 | ACCEPTED | 0.07 s | details |
#8 | ACCEPTED | 0.05 s | details |
#9 | ACCEPTED | 0.05 s | details |
#10 | ACCEPTED | 0.05 s | details |
#11 | ACCEPTED | 0.05 s | details |
#12 | ACCEPTED | 0.04 s | details |
#13 | ACCEPTED | 0.05 s | details |
#14 | ACCEPTED | 0.06 s | details |
#15 | ACCEPTED | 0.13 s | details |
#16 | ACCEPTED | 0.05 s | details |
Code
#include<bits/stdc++.h> using namespace std; string s; map<char, char> m; int main() { cin >> s; m['R'] = 'S'; m['B'] = 'K'; m['L'] = 'H'; int l = (int) s.length(); int i = 0; while (i < l-2){ if (s[i] != s[i+1] && s[i] != s[i+2] && s[i+1] != s[i+2]){ cout << 'C'; i += 3; } else { cout << m[s[i]]; i ++; } } for (int j = i; j < l; j++) cout << m[s[j]]; cout << endl; return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
BL |
correct output |
---|
KH |
user output |
---|
KH |
Test 2
Verdict: ACCEPTED
input |
---|
LRBRLBBLRRBLLBRRBLBRLLRBBRLBRL... |
correct output |
---|
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
user output |
---|
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
Test 3
Verdict: ACCEPTED
input |
---|
L |
correct output |
---|
H |
user output |
---|
H |
Test 4
Verdict: ACCEPTED
input |
---|
LBR |
correct output |
---|
C |
user output |
---|
C |
Test 5
Verdict: ACCEPTED
input |
---|
BBBLRLLLBB |
correct output |
---|
KKCHHHKK |
user output |
---|
KKCHHHKK |
Test 6
Verdict: ACCEPTED
input |
---|
BLRBBBRBRRBLLLBRRRBBBBLLRBRBBL... |
correct output |
---|
CKKKSKSCHCSSKKKKHCSKKHHCCKHKHK... |
user output |
---|
CKKKSKSCHCSSKKKKHCSKKHHCCKHKHK... |
Test 7
Verdict: ACCEPTED
input |
---|
RLBBBBRRRBLRLRBBRBLBLBRLLRRRRL... |
correct output |
---|
CKKKSSCSCKCKCHHSSSSHHKKHHCSCHC... |
user output |
---|
CKKKSSCSCKCKCHHSSSSHHKKHHCSCHC... |
Test 8
Verdict: ACCEPTED
input |
---|
BBLRBRRLBBRRLBLLBLBRRRRRLBLLRL... |
correct output |
---|
KCKSCKSCHHKCSSSCHHCHHCKKSSHSCC... |
user output |
---|
KCKSCKSCHHKCSSSCHHCHHCKKSSHSCC... |
Test 9
Verdict: ACCEPTED
input |
---|
BBLRLRBBBBLRBBRRRRRBBLRLRBBBBL... |
correct output |
---|
KCCKKCKKSSSSSKCCKKCCCSCCHHKCHC... |
user output |
---|
KCCKKCKKSSSSSKCCKKCCCSCCHHKCHC... |
Test 10
Verdict: ACCEPTED
input |
---|
LBLRRRBRRLLRLLRBBBRBRLRRLBRLLB... |
correct output |
---|
HCSSKSSHHSHCKKSCSCSHCSKKKHHKKK... |
user output |
---|
HCSSKSSHHSHCKKSCSCSHCSKKKHHKKK... |
Test 11
Verdict: ACCEPTED
input |
---|
LBRBLRRRRLRLLBBLRRRBBBLLBRBBLR... |
correct output |
---|
CCSSSHSHHKCSSKKKHCKCCCHKHHKKCC... |
user output |
---|
CCSSSHSHHKCSSKKKHCKCCCHKHHKKCC... |
Test 12
Verdict: ACCEPTED
input |
---|
BRRLRBBBRBRBRLBRLBBBRBLBLBBLBB... |
correct output |
---|
KSSCKKSKSCCKKKCKHKKHKKKKCKKKSS... |
user output |
---|
KSSCKKSKSCCKKKCKHKKHKKKKCKKKSS... |
Test 13
Verdict: ACCEPTED
input |
---|
LLRRLLRRLRRLBBRBBRLLRBRLLRRLBB... |
correct output |
---|
HHSSHHSSHSCKSKCCSHHSCKSCKKHHHS... |
user output |
---|
HHSSHHSSHSCKSKCCSHHSCKSCKKHHHS... |
Test 14
Verdict: ACCEPTED
input |
---|
LBRRRBRBLLBRRLBLBLBBLRBBRBLBBL... |
correct output |
---|
CSSKCCCHKHKCKKCKCCSSHHKCSKCKCS... |
user output |
---|
CSSKCCCHKHKCKKCKCCSSHHKCSKCKCS... |
Test 15
Verdict: ACCEPTED
input |
---|
BBBLRLLLBBBLRBBBRBRRBLLLBRRRBB... |
correct output |
---|
KKCHHHKKCKKKSKSCHCSSKKKKHCSKKH... |
user output |
---|
KKCHHHKKCKKKSKSCHCSSKKKKHCSKKH... |
Test 16
Verdict: ACCEPTED
input |
---|
LBRLRBBLRBRLRLBRBL |
correct output |
---|
CCCCCC |
user output |
---|
CCCCCC |