QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#802643 | #9871. Just another Sorting Problem | ucup-team5234# | AC ✓ | 11ms | 3864kb | C++23 | 3.0kb | 2024-12-07 14:16:24 | 2024-12-07 14:16:24 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int) (x).size()
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(auto i = (a); i < (b); i++)
#define For(i, a, b, c) \
for(auto i = (a); i != (b); i += (c))
#define REPR(i, n) for(auto i = (n) - 1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), (v).end())
#define eb emplace_back
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
const double EPS = 1e-6;
const int MOD = 1e9 + 7;
const int INF = (1 << 30);
const ll LINF = 1e18;
const double math_PI = acos(-1);
template<typename T>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(
a, make_v<T>(ts...));
}
template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(
T &t, const V &v) {
t = v;
}
template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(
T &t, const V &v) {
for(auto &e: t) fill_v(e, v);
}
template<class T>
bool chmax(T &a, const T &b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T &a, const T &b) {
if(a > b) {
a = b;
return true;
}
return false;
}
template<typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
cin >> p.first >> p.second;
return is;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for(T &x: vec) is >> x;
return is;
}
template<typename T>
string join(vector<T> &vec, string splitter) {
stringstream ss;
REP(i, SZ(vec)) {
if(i != 0) ss << splitter;
ss << vec[i];
}
return ss.str();
}
template<typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
os << join(vec, " ");
return os;
}
#ifdef LOCAL
#include "./cpp-dump/dump.hpp"
#include "./cpp-dump/mytypes.hpp"
#define dump(...) cpp_dump(__VA_ARGS__)
namespace cp = cpp_dump;
#else
#define dump(...)
#define preprocess(...)
#define CPP_DUMP_SET_OPTION(...)
#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)
#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)
#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)
#endif
void solve() {
int N;
string S;
cin >> N >> S;
vi V(N);
cin >> V;
int cnt = 0;
REP(i, N) {
if(i + 1 != V[i]) cnt++;
}
if(N == 2) {
cout << "Alice" << endl;
} else if(cnt == 0) {
cout << "Alice" << endl;
} else if((cnt == 0 || cnt == 2) && S == "Alice") {
cout << "Alice" << endl;
} else if(N == 3 && cnt == 3 && S == "Bob") {
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int T;
cin >> T;
while(T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3524kb
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: 3648kb
input:
2 2 Alice 2 1 2 Bob 2 1
output:
Alice Alice
result:
ok 2 lines
Test #3:
score: 0
Accepted
time: 1ms
memory: 3572kb
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: 0
Accepted
time: 1ms
memory: 3508kb
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 Bob Bob Bob Bob Bob Alice Alice Bob Bob Alice Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob
result:
ok 46 lines
Test #5:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
238 5 Alice 5 4 2 1 3 5 Bob 1 4 5 3 2 5 Bob 3 1 4 5 2 5 Alice 1 4 2 5 3 5 Bob 3 2 5 4 1 5 Alice 1 3 4 2 5 5 Bob 2 3 4 5 1 5 Bob 1 4 3 2 5 5 Bob 2 4 1 3 5 5 Bob 3 4 2 5 1 5 Alice 5 3 2 1 4 5 Bob 1 2 4 3 5 5 Alice 1 4 5 2 3 5 Alice 5 3 4 1 2 5 Alice 3 4 2 1 5 5 Alice 2 5 1 4 3 5 Alice 1 3 5 4 2 5 Alic...
output:
Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob ...
result:
ok 238 lines
Test #6:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
1438 6 Alice 1 2 4 3 6 5 6 Bob 2 4 3 1 5 6 6 Alice 4 3 6 2 5 1 6 Alice 5 3 6 1 2 4 6 Bob 3 1 2 4 5 6 6 Bob 5 4 2 3 6 1 6 Bob 3 2 1 5 4 6 6 Alice 1 5 3 6 2 4 6 Bob 2 1 3 5 6 4 6 Alice 5 4 2 6 1 3 6 Bob 6 3 2 4 1 5 6 Bob 6 3 4 5 2 1 6 Bob 5 3 1 4 6 2 6 Bob 5 6 3 2 4 1 6 Alice 4 3 5 1 2 6 6 Alice 5 2 1...
output:
Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob ...
result:
ok 1438 lines
Test #7:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
10000 7 Alice 5 6 3 1 2 4 7 7 Bob 5 1 4 3 7 6 2 7 Bob 2 5 1 7 4 6 3 7 Alice 3 1 5 6 7 2 4 7 Alice 1 7 3 2 4 6 5 7 Alice 2 4 7 5 6 1 3 7 Alice 7 3 6 1 2 5 4 7 Alice 4 1 6 5 2 7 3 7 Bob 6 2 3 1 7 4 5 7 Bob 1 7 4 3 6 5 2 7 Bob 7 3 1 4 2 6 5 7 Alice 3 5 7 6 2 4 1 7 Alice 6 7 5 2 1 4 3 7 Bob 7 5 1 4 6 3 ...
output:
Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob ...
result:
ok 10000 lines
Test #8:
score: 0
Accepted
time: 11ms
memory: 3864kb
input:
10000 8 Alice 4 2 1 8 3 6 5 7 8 Bob 6 2 7 1 3 5 4 8 8 Alice 5 8 1 6 7 2 3 4 8 Bob 5 8 1 3 4 7 2 6 8 Alice 4 7 6 5 3 8 2 1 8 Bob 7 2 6 5 4 1 8 3 8 Bob 5 8 7 4 2 3 6 1 8 Bob 3 8 2 5 7 6 4 1 8 Bob 6 1 5 3 2 8 7 4 8 Bob 4 5 7 8 2 3 1 6 8 Alice 3 8 5 6 2 1 4 7 8 Alice 8 1 3 4 7 5 2 6 8 Alice 2 8 4 3 7 6 ...
output:
Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob ...
result:
ok 10000 lines
Test #9:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
10000 9 Bob 8 7 1 5 4 2 9 6 3 9 Alice 3 6 2 1 5 7 9 8 4 9 Alice 7 9 3 6 8 5 1 4 2 9 Alice 4 7 8 3 1 2 6 9 5 9 Alice 9 7 2 8 1 4 5 3 6 9 Alice 6 2 9 8 1 5 3 7 4 9 Alice 7 1 5 3 4 6 8 9 2 9 Bob 1 3 7 8 2 4 9 6 5 9 Alice 1 9 8 6 7 3 2 4 5 9 Alice 4 3 8 5 6 9 1 2 7 9 Bob 1 2 7 3 4 9 8 5 6 9 Alice 9 3 1 ...
output:
Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob ...
result:
ok 10000 lines
Test #10:
score: 0
Accepted
time: 8ms
memory: 3580kb
input:
10000 10 Bob 10 5 1 4 8 3 2 6 9 7 10 Alice 6 8 5 3 10 7 4 2 1 9 10 Bob 1 4 2 9 7 8 3 10 5 6 10 Bob 10 2 6 9 1 5 8 7 4 3 10 Bob 3 4 9 8 10 6 5 2 1 7 10 Alice 6 3 4 10 2 5 1 9 8 7 10 Bob 3 9 2 7 4 8 10 5 1 6 10 Alice 6 8 3 10 5 7 1 2 4 9 10 Bob 9 10 2 6 5 4 7 3 8 1 10 Alice 4 6 3 1 2 9 8 10 7 5 10 Bob...
output:
Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob ...
result:
ok 10000 lines
Test #11:
score: 0
Accepted
time: 2ms
memory: 3796kb
input:
1000 100 Alice 1 2 3 4 5 6 7 8 9 24 11 12 13 14 15 16 17 18 19 20 21 22 23 10 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 ...
output:
Alice Alice Bob Bob Alice Bob Bob Bob Bob Bob Alice Bob Alice Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Alice Bob Bob Bob Bob Alice Bob Bob Bob Bob Alice Alice Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Alice Bob Alice Alice Bob ...
result:
ok 1000 lines
Test #12:
score: 0
Accepted
time: 4ms
memory: 3556kb
input:
100 1000 Bob 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99...
output:
Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Alice Bob Alice Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice Alice Bob Alice Bob Bob Bob Bob Alice Bob Bob Bob Bob Bob Alice Alice Bob Alice Bob Bob Bob Alice Alice Bob ...
result:
ok 100 lines
Test #13:
score: 0
Accepted
time: 4ms
memory: 3644kb
input:
10 10000 Bob 1902 2494 8486 9389 6347 8536 3762 3042 572 1386 793 3801 9657 1153 2769 3889 963 5009 8630 4574 3977 5532 8188 9478 5427 207 3640 6530 4695 4122 8179 4708 778 7771 3770 7715 8319 5188 8724 3389 2683 2317 2811 2261 1258 4291 2310 7694 9488 6457 8001 9997 4017 5146 1276 2692 9110 1182 68...
output:
Bob Bob Bob Bob Bob Bob Bob Bob Alice Alice
result:
ok 10 lines
Test #14:
score: 0
Accepted
time: 2ms
memory: 3672kb
input:
1 100000 Bob 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99...
output:
Bob
result:
ok single line: 'Bob'
Test #15:
score: 0
Accepted
time: 2ms
memory: 3636kb
input:
1 100000 Alice 87870 65653 72129 93082 43620 83771 15352 47792 24229 88660 26573 21862 37547 48534 29977 92083 80025 50811 37078 69117 32850 42488 16021 41977 9549 52797 24292 92839 55290 4681 30018 18428 69696 13806 93653 28725 57447 41781 20125 898 86433 95123 69284 59083 52024 14300 4057 17624 43...
output:
Bob
result:
ok single line: 'Bob'
Test #16:
score: 0
Accepted
time: 5ms
memory: 3676kb
input:
1 100000 Alice 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 ...
output:
Alice
result:
ok single line: 'Alice'
Test #17:
score: 0
Accepted
time: 2ms
memory: 3652kb
input:
1 100000 Alice 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 ...
output:
Alice
result:
ok single line: 'Alice'
Test #18:
score: 0
Accepted
time: 5ms
memory: 3616kb
input:
1 100000 Bob 99284 14326 13742 32087 9604 78559 42621 66244 36246 14965 59658 74300 39412 93652 61484 14345 73 83840 37743 87450 43005 74136 11079 16547 39574 63960 90866 63359 11477 49852 90188 66492 41372 77379 43808 16328 91219 25595 14558 95418 31752 20673 2109 94875 54945 10840 57200 24495 1927...
output:
Bob
result:
ok single line: 'Bob'
Test #19:
score: 0
Accepted
time: 2ms
memory: 3652kb
input:
1 100000 Bob 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99...
output:
Bob
result:
ok single line: 'Bob'
Extra Test:
score: 0
Extra Test Passed