QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#855074 | #9871. Just another Sorting Problem | Dukerki | WA | 0ms | 3620kb | C++20 | 621b | 2025-01-12 13:52:13 | 2025-01-12 13:52:23 |
Judging History
answer
#include<iostream>
#include<string>
using namespace std;
void EachT(){
int n,cnt = 0;
string name;
cin>>n>>name;
for (int i = 1; i <= n; i++)
{
int temp;
cin>>temp;
if(temp!= i){
cnt++;
}
}
if(name == "Alice" && cnt == 2 ){
cout<<"Alice"<<'\n';
}
else{
if(name == "Bob" && (cnt == 3 && n == 3)){
cout<<"Alice"<<'\n';
}
else{
cout<<"Bob"<<'\n';
}
}
}
int main(){
int t;
cin>>t;
while(t--){
EachT();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
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: 3620kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Bob
result:
wrong answer 2nd lines differ - expected: 'Alice', found: 'Bob'