QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #802479 | #9871. Just another Sorting Problem | ucup-team4893# | WA | 0ms | 3720kb | C++17 | 964b | 2024-12-07 13:48:15 | 2024-12-07 13:48:16 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<fstream>
#define fopen(x, y) freopen(x".in", "r", stdin); freopen(y".out", "w", stdout);
//#define int long long
#ifdef int
#define inf 0x3f3f3f3f3f3f3f3fll
#else
#define inf 0x3f3f3f3f
#endif
using namespace std;
int n, a[100005]; string s;
void work() {
cin >> n >> s;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
if(n == 2) {
cout << "Alice\n";
return ;
}
int dif = 0, mx = 0;
for(int i = 1; i <= n; i++) {
dif += (a[i] != i);
}
for(int i = 1; i < n; i++) {
mx = max(mx, dif - (a[i] != i) - (a[i + 1] != i + 1) + (a[i] != i + 1) + (a[i + 1] != i));
}
// if(dif != 3 && mx == 2 && dif != 2) cout << "?!\n";
if(dif == 2 && s == "Alice" || dif == 3 && s == "Bob" || mx == 2 && s == "Bob") {
cout << "Alice\n";
return ;
}
cout << "Bob\n";
}
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int _ = 1;
cin >> _;
while(_--) work();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3720kb
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: 3644kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Alice
result:
ok 2 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3676kb
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:
Alice Bob Alice Alice Alice Bob Bob Alice Bob Bob
result:
ok 10 lines
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3596kb
input:
46 4 Alice 4 1 3 2 4 Bob 4 1 3 2 4 Bob 3 2 4 1 4 Bob 2 4 1 3 4 Bob 1 4 3 2 4 Bob 4 1 2 3 4 Alice 1 2 4 3 4 Alice 3 2 1 4 4 Bob 2 1 4 3 4 Bob 4 3 1 2 4 Alice 1 3 2 4 4 Bob 3 1 4 2 4 Bob 1 3 2 4 4 Alice 2 4 1 3 4 Bob 2 1 3 4 4 Alice 2 1 3 4 4 Bob 4 2 3 1 4 Bob 3 4 2 1 4 Alice 4 1 2 3 4 Bob 2 4 3 1 4 B...
output:
Bob Alice Alice Bob Bob Bob Alice Alice Bob Bob Alice Bob Bob Bob Bob Alice Bob Bob Bob Alice Alice Bob Alice Alice Alice Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Alice Bob Bob
result:
wrong answer 2nd lines differ - expected: 'Bob', found: 'Alice'