QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #802278 | #9871. Just another Sorting Problem | ucup-team3161# | WA | 0ms | 3844kb | C++20 | 505b | 2024-12-07 13:16:21 | 2024-12-07 13:16:21 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int T,n,s;char a[N];
void slv()
{
scanf("%d %s",&n,a+1);s=0;
for(int i=1,x;i<=n;++i) scanf("%d",&x),s+=x!=i;
if(!s) {puts("Alice");return;}
if(n==3)
{
if(a[1]=='A') puts(s==2?"Alice":"Bob");
else puts(s==2?"Bob":"Alice");
return;
}
if(a[1]=='A') puts(s<3?"Alice":"Bob");
else puts("Bob");
}
int main()
{
scanf("%d",&T);
while(T--) slv();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3844kb
input:
3 2 Alice 2 1 3 Bob 1 3 2 10 Bob 1 2 3 4 5 6 7 8 10 9
output:
Alice Bob Bob
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3652kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Bob
result:
wrong answer 2nd lines differ - expected: 'Alice', found: 'Bob'