QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#807935 | #9871. Just another Sorting Problem | Hiraethsoul# | WA | 1ms | 3836kb | C++23 | 955b | 2024-12-10 14:51:28 | 2024-12-10 14:51:40 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n;
string s;
cin >> n >> s;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<pair<int, int>> pos;
for (int i = 1; i <= n; i++)
{
if (a[i] != i)
{
pos.push_back({i, a[i]});
}
}
if (pos.size() == 2 && pos[0].first == pos[1].second && pos[0].second == pos[1].first)
{
if (s == "Alice")
{
cout << "Alice" << '\n';
}
else
cout << "Bob" << '\n';
}
else
{
if (s == "Alice")
{
cout << "Bob" << '\n';
}
else
cout << "Alice" << '\n';
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
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: 1ms
memory: 3836kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Bob
result:
wrong answer 2nd lines differ - expected: 'Alice', found: 'Bob'