QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #816275 | #9871. Just another Sorting Problem | lzy | WA | 0ms | 3620kb | C++23 | 483b | 2024-12-16 08:33:55 | 2024-12-16 08:33:56 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef long long ll;
const int N=1e6+10;
ll a[N];
int main()
{
IOS;
int T;
cin>>T;
while(T--)
{
ll n;
cin>>n;
string s;
cin>>s;
for(int i=1;i<=n;i++)
cin>>a[i];
int ans=0;
for(int i=1;i<=n;i++)
if(i!=a[i])
ans++;
if((ans==2&&s=="Alice")||(ans==0&&s=="Bob"))
cout<<"Alice\n";
else
cout<<"Bob\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
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: 3580kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Bob
result:
wrong answer 2nd lines differ - expected: 'Alice', found: 'Bob'