QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#624011 | #8046. Rock-Paper-Scissors Pyramid | Dukerki | WA | 7ms | 5264kb | C++20 | 1.7kb | 2024-10-09 14:41:59 | 2024-10-09 14:41:59 |
Judging History
answer
#include <iostream>
#include <vector>
using namespace std;
string tar;
char win(char p1,char p2) {
if (p1 == 'S') {
if (p2 == 'S') {
return 'S';
}
else if (p2 == 'P') {
return 'S';
}
else {
return 'R';
}
}
else if (p1 == 'P') {
if (p2 == 'S') {
return 'S';
}
else if (p2 == 'P') {
return 'P';
}
else {
return 'P';
}
}
else {
if (p2== 'S') {
return 'R';
}
else if (p2 == 'P') {
return 'P';
}
else {
return 'R';
}
}
return '$';
}
char solve(int l,int r) {
if (r - l+1 <= 2) {
return win(tar[r], tar[l]);
}
int midl = (l + r) / 2, midr = (l + r) / 2 + 1;
if ((r - l + 1) % 2) {
int mid = midl;
midl--;
char a= solve(l, midl), b= solve(midr, r);
if (win(a, tar[mid]) != tar[mid]) {
return a;
}
else if (win(b, tar[mid]) != tar[mid]) {
return b;
}
else {
return win(a, b);
}
}
else {
char who = win(tar[midl], tar[midr]);
if (who == tar[midl] && who == tar[midr]) {
return win(solve(l, midl - 1), solve(midr + 1, r));
}
else if (who == tar[midl]) {
return solve(l, midl - 1);
}
else {
return solve(midr + 1, r);
}
}
}
int main()
{
int t;
cin >> t;
while (t--) {
cin >> tar;
tar = '$' + tar;
cout<<solve(1, tar.size()-1)<<"\n";
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3764kb
input:
2 SPR SPSRRP
output:
S P
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 7ms
memory: 5264kb
input:
1 RPPSRPPRSRSRRRPPSPRPRSRRSRRPPPRSPSSRRRSPPPRRRPRRRSSRPSSRPRRPSRRRPRSRPSRPSRRSPPRPRRRSPRSSSRPRRRPPSRRRRPPSRSRRRPRPRPRPPRRSRRPSRPPSRRRSRRSRRSPSRPRPSPSSRRSPSPSRPRRRPPRSRSPSPPRRPRSRPPSSSRPSPRRPSSSPRRSRRSRRSRSPSSSSRSSPPRRRRPRRRSPSRSPRSSPRSPSPRPRRRPPRPPRPPPSRRRRSSPRRSRRRPRRRSSRRPSRPPRSPPSPPPSPSPSPPSSPRRR...
output:
S
result:
wrong answer 1st lines differ - expected: 'R', found: 'S'