QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #805324 | #9871. Just another Sorting Problem | LittleXi# | WA | 1ms | 3860kb | C++11 | 505b | 2024-12-08 15:41:10 | 2024-12-08 15:41:10 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1000100
#define ll long long
int n, m, cnt, a[MAXN];
char s[20];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d%s",&n,s+1);
cnt = 0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(a[i] != i) cnt++;
}
if(s[1] == 'A' && cnt <= 2 || cnt == 0 || n <= 2) printf("Alice\n");
else printf("Bob\n");
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3800kb
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: 3860kb
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: 3760kb
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'