QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #806421 | #9871. Just another Sorting Problem | hxu10# | WA | 13ms | 10648kb | Python3 | 392b | 2024-12-09 10:33:52 | 2024-12-09 10:33:53 |
Judging History
answer
def main():
n,s = input().split()
n = int(n)
arr = list(map(int,input().split()))
diff = 0
for i in range(n):
if arr[i]!=i+1: diff += 1
if diff == 0 or n==2:
print("Alice")
return
if diff == 2 and s == "Alice":
print("Alice")
return
print("Bob")
T = int(input())
t = 1
while t <= T:
main()
t += 1
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 13ms
memory: 10628kb
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: 12ms
memory: 10612kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Alice
result:
ok 2 lines
Test #3:
score: -100
Wrong Answer
time: 13ms
memory: 10648kb
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 Bob Alice Alice Bob Bob Alice Bob Bob
result:
wrong answer 1st lines differ - expected: 'Alice', found: 'Bob'