QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #811007 | #9871. Just another Sorting Problem | Nana7# | WA | 1ms | 3636kb | C++14 | 665b | 2024-12-12 14:37:50 | 2024-12-12 14:37:50 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define I inline
using namespace std;
const int N = 100100;
char s[N];
int p[N];
int n,m;
I void solve() {
cin>>n; cin>>s; //cout<<n<<' '<<s<<endl;
for(int i=1;i<=n;++i) cin>>p[i];
int dif=0;
for(int i=1;i<=n;++i) {
if(p[i]!=i) dif++;
}
if(n==2) {
cout<<"Alice"<<endl;
return ;
}
if(n==3&&p[1]==3&&p[2]==1&&s[0]=='B') {
cout<<"Alice"<<endl;
return ;
}
if(s[0]=='A') {
if(dif==2) {
cout<<"Alice"<<endl;
} else cout<<"Bob"<<endl;
} else {
cout<<"Bob"<<endl;
}
}
int main()
{
int T; cin>>T;
while(T--) {
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3564kb
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: 0
Accepted
time: 0ms
memory: 3632kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Alice
result:
ok 2 lines
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3636kb
input:
10 3 Bob 2 3 1 3 Alice 3 1 2 3 Bob 3 1 2 3 Alice 1 3 2 3 Alice 3 2 1 3 Bob 2 1 3 3 Bob 1 3 2 3 Alice 2 1 3 3 Alice 2 3 1 3 Bob 3 2 1
output:
Bob Bob Alice Alice Alice Bob Bob Alice Bob Bob
result:
wrong answer 1st lines differ - expected: 'Alice', found: 'Bob'