結果
問題 | No.2521 Don't be Same |
ユーザー |
![]() |
提出日時 | 2023-10-27 23:41:10 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,793 bytes |
コンパイル時間 | 2,105 ms |
コンパイル使用メモリ | 193,496 KB |
最終ジャッジ日時 | 2025-02-17 16:11:28 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | WA * 2 TLE * 1 -- * 24 |
ソースコード
#include <bits/stdc++.h>#ifdef LOCAL#include <debug.hpp>#else#define debug(...) void(0)#endifusing namespace std;typedef long long ll;#define all(x) begin(x), end(x)constexpr int INF = (1 << 30) - 1;constexpr long long IINF = (1LL << 60) - 1;constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};template <class T> istream& operator>>(istream& is, vector<T>& v) {for (auto& x : v) is >> x;return is;}template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {auto sep = "";for (const auto& x : v) os << exchange(sep, " ") << x;return os;}template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }template <class T> void mkuni(vector<T>& v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }int a[2];void query(int type, int i, int x) {if (type == 0) {assert(x <= a[i]);cout << "A " << i + 1 << ' ' << x;} elsecout << 'B';cout << endl;char c;cin >> c;if (c != 'A') exit(0);cin >> i >> x;a[--i] -= x;}int main() {ios::sync_with_stdio(false);cin.tie(nullptr);cin >> a[0] >> a[1];if (a[0] == a[1]) {cout << "First" << endl;query(1, -1, -1);return 0;}for (int k = 0; k < 2; k++) {if (a[k] == 1) {if (a[k ^ 1] == 2)cout << "Second" << endl;else {cout << "First" << endl;query(0, k ^ 1, a[k ^ 1] - 2);}char c;cin >> c;if (c != 'A') exit(0);int i, x;cin >> i >> x;a[--i] -= x;if (a[0] == a[1]) {query(1, -1, -1);return 0;} else {assert(a[0] == 0 or a[1] == 0);if (a[0] > 0)query(0, 0, a[0]);elsequery(0, 1, a[1]);return 0;}}}while (true) {cout << "First" << endl;int m = min(a[0], a[1]);if (a[0] == a[1]) {query(1, -1, -1);return 0;}if (a[0] == 0) {query(0, 1, a[1]);return 0;}if (a[1] == 0) {query(0, 0, a[0]);return 0;}for (int i = 0; i < 2; i++) {if (a[i] != m) {query(0, i, a[i] - (m - 1));}}}return 0;}