QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #809299 | #9871. Just another Sorting Problem | ucup-team4479# | WA | 0ms | 3540kb | C++23 | 979b | 2024-12-11 14:00:59 | 2024-12-11 14:01:00 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N];
void solve() {
int n;
string s;
cin>>n>>s;
for(int i=1;i<=n;i++)cin>>a[i];
if(n>=4)
{
if(s[0]=='B')
{
cout<<"Bob\n";
return ;
}
int dif=0;
for(int i=1;i<=n;i++)
{
if(a[i]!=i)dif++;
}
if(dif==2)cout<<"Alice\n";
else cout<<"Bob\n";
return;
}
if(n==2)
{
cout<<"Alice\n";
return;
}
if(a[1]=='3'&&a[2]=='1'&&a[3]=='2' || a[1]=='2'&&a[2]=='3'&&a[3]=='1')
{
if(s[0]=='B')cout<<"Alice\n";
else cout<<"Bob\n";
}
else
{
if(s[0]=='A')cout<<"Alice\n";
else cout<<"Bob\n";
}
return;
}
int main() {
cin.tie(nullptr) -> ios::sync_with_stdio(false);
cout.tie(0);
int T;
cin >> T;
while (T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3488kb
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: 3488kb
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: 3540kb
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 Alice Bob Alice Alice Bob Bob Alice Alice Bob
result:
wrong answer 1st lines differ - expected: 'Alice', found: 'Bob'