QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #807132 | #9871. Just another Sorting Problem | hyjhyj111# | WA | 0ms | 3792kb | C++20 | 963b | 2024-12-09 19:18:00 | 2024-12-09 19:18:00 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
constexpr i64 inf = 1e13;
//constexpr auto operator"" _f(const char* str, std::size_t len) {
// return [fmt = std::string_view(str, len)](auto&&... args) {
// return std::vformat(fmt, std::make_format_args(args...));
// };
//}
void solve() {
int n;
std::cin >> n;
std::string s;
std::cin >> s;
std::vector<int> p(n);
for (auto &x : p) std::cin >> x, x --;
if (n == 2) return std::cout << "Alice\n", void();
int cnt = 0;
for (int i = 0;i < n;i ++)
cnt += i != p[i];
if ((cnt == 2 && s == "Alice") || cnt == 0) std::cout << "Alice" << "\n";
else std::cout << "Bob\n";
}
signed main() {
std::cin.tie(nullptr)->sync_with_stdio(false);
int _ = 1;
std::cin >> _;
while (_ --) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
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: 3792kb
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: 3640kb
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'