QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #814441 | #9871. Just another Sorting Problem | light_ink_dots# | WA | 0ms | 3732kb | C++23 | 363b | 2024-12-14 17:34:07 | 2024-12-14 17:34:15 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int maxn=100005;
int T,n;
int p[maxn];
string s;
int main(){
scanf("%d",&T);
while(T--){
cin>>n>>s;
int cnt=0;
for(int i=1;i<=n;i++)
scanf("%d",&p[i]),cnt+=p[i]==i;
if(cnt==n)
puts("Alice");
else if(s=="Alice"&&cnt==n-2)
puts("Alice");
else puts("Bob");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
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: 3664kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Bob
result:
wrong answer 2nd lines differ - expected: 'Alice', found: 'Bob'