結果
| 問題 | No.2278 Time Bomb Game 2 |
| ユーザー |
 tsugutsugu
|
| 提出日時 | 2023-04-21 23:17:44 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,161 bytes |
| コンパイル時間 | 3,414 ms |
| コンパイル使用メモリ | 245,420 KB |
| 実行使用メモリ | 6,824 KB |
| 最終ジャッジ日時 | 2024-11-06 16:41:49 |
| 合計ジャッジ時間 | 4,803 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 WA * 1 |
| other | AC * 38 WA * 32 |
ソースコード
#include <bits/stdc++.h>using namespace std;int main() {ios::sync_with_stdio(false);cin.tie(nullptr);int n, k, t;cin >> n >> k >> t;string s;cin >> s;k--;int cntA = count(s.begin(), s.end(), 'A');if (cntA == 0) {cout << "Alice" << '\n';return 0;} else {cout << "Bob" << '\n';return 0;}if (s[k] == 'A') {bool adj = false;if (k > 0 && s[k - 1] == 'A') {adj = true;}if (k < n - 1 && s[k + 1] == 'A') {adj = true;}if (adj) {int l = -1, r = n;for (int i = 1; i <= t; i++) {if (k + i >= n) {break;}if (s[k + i] == 'B') {r = i;break;}}for (int i = 1; i <= t; i++) {if (k - i < 0) {break;}if (s[k - i] == 'B') {l = i;break;}}if (l == -1 && r == n) {cout << "Bob" << '\n';return 0;}bool win = false;if (l >= 0 && r < n && l % 2 != r % 2) {win = true;}if (l >= 0) {if (l % 2 == t % 2) {win = true;}}if (r < n) {if (r % 2 == t % 2) {win = true;}}cout << (win ? "Alice" : "Bob") << '\n';} else {if (t % 2 == 0) {cout << "Bob" << '\n';return 0;}if ((k > 1 && s[k - 2] == 'A') || (k < n - 2 && s[k + 2] == 'A')) {cout << "Alice" << '\n';return 0;}t--;bool win = false;if (k > 0) {int nk = k - 1;int l = -1, r = n;for (int i = 1; i <= t; i++) {if (nk + i >= n) {break;}if (s[nk + i] == 'A') {r = i;break;}}for (int i = 1; i <= t; i++) {if (nk - i < 0) {break;}if (s[nk - i] == 'A') {l = i;break;}}if (l >= 0 && r < n && l % 2 != r % 2) {win = true;}if (l >= 0) {if (l % 2 == t % 2) {win = true;}}if (r < n) {if (r % 2 == t % 2) {win = true;}}}if (k < n - 1) {int nk = k + 1;int l = -1, r = n;for (int i = 1; i <= t; i++) {if (nk + i >= n) {break;}if (s[nk + i] == 'A') {r = i;break;}}for (int i = 1; i <= t; i++) {if (nk - i < 0) {break;}if (s[nk - i] == 'A') {l = i;break;}}if (l >= 0 && r < n && l % 2 != r % 2) {win = true;}if (l >= 0) {if (l % 2 == t % 2) {win = true;}}if (r < n) {if (r % 2 == t % 2) {win = true;}}}cout << (win ? "Bob" : "Alice") << '\n';}} else {for (int i = 0; i < n; i++) {s[i] = s[i] ^ 'A' ^ 'B';}bool adj = false;if (k > 0 && s[k - 1] == 'A') {adj = true;}if (k < n - 1 && s[k + 1] == 'A') {adj = true;}if (adj) {int l = -1, r = n;for (int i = 1; i <= t; i++) {if (k + i >= n) {break;}if (s[k + i] == 'B') {r = i;break;}}for (int i = 1; i <= t; i++) {if (k - i < 0) {break;}if (s[k - i] == 'B') {l = i;break;}}if (l == -1 && r == n) {cout << "Alice" << '\n';return 0;}bool win = false;if (l >= 0 && r < n && l % 2 != r % 2) {win = true;}if (l >= 0) {if (l % 2 == t % 2) {win = true;}}if (r < n) {if (r % 2 == t % 2) {win = true;}}cout << (win ? "Bob" : "Alice") << '\n';} else {if (t % 2 == 0) {cout << "Alice" << '\n';return 0;}if ((k > 1 && s[k - 2] == 'A') || (k < n - 2 && s[k + 2] == 'A')) {cout << "Bob" << '\n';return 0;}t--;bool win = false;if (k > 0) {int nk = k - 1;int l = -1, r = n;for (int i = 1; i <= t; i++) {if (nk + i >= n) {break;}if (s[nk + i] == 'A') {r = i;break;}}for (int i = 1; i <= t; i++) {if (nk - i < 0) {break;}if (s[nk - i] == 'A') {l = i;break;}}if (l >= 0 && r < n && l % 2 != r % 2) {win = true;}if (l >= 0) {if (l % 2 == t % 2) {win = true;}}if (r < n) {if (r % 2 == t % 2) {win = true;}}}if (k < n - 1) {int nk = k + 1;int l = -1, r = n;for (int i = 1; i <= t; i++) {if (nk + i >= n) {break;}if (s[nk + i] == 'A') {r = i;break;}}for (int i = 1; i <= t; i++) {if (nk - i < 0) {break;}if (s[nk - i] == 'A') {l = i;break;}}if (l >= 0 && r < n && l % 2 != r % 2) {win = true;}if (l >= 0) {if (l % 2 == t % 2) {win = true;}}if (r < n) {if (r % 2 == t % 2) {win = true;}}}cout << (win ? "Alice" : "Bob") << '\n';}}}