QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#807864 | #9871. Just another Sorting Problem | ucup-team4975# | WA | 0ms | 3656kb | C++23 | 1002b | 2024-12-10 13:26:00 | 2024-12-10 13:26:02 |
Judging History
answer
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'
#define debug(x) cout << #x << ":: " << x << endl;
#define FINISH cout << "FINISH" << endl;
#define debugv(x) cout << #x << ":: ";\
for (auto i : x) \
cout << i << " "; \
cout << endl
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int inf = 0x3f3f3f3f;
const int N = 200020;
void solve()
{
int n;
string s;
cin >> n >> s;
vector<int> a(n + 1, 0);
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
cnt++;
}
if (n == 2) {
cout << "Alice" << el;
return;
}
if (s == "Bob") {
cout << "Bob" << el;
return;
}
if (cnt == 2) {
cout << "Alice" << el;
}
else {
cout << "Bob" << el;
}
}
int main()
{
ios:: sync_with_stdio("false");
cin.tie(nullptr);
cout.tie(nullptr);
int T= 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
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: 3656kb
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: 3556kb
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'