#923850 (C++17) No.2521 Don't be Same

• 問題: No.2521 Don't be Same
• ユーザー: binap
• 提出日時: 2023-10-28 00:03:26
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 70 ms / 2,000 ms
• コード長: 2,125 bytes
• コンパイル時間: 5,061 ms
• コンパイル使用メモリ: 263,096 KB
• 実行使用メモリ: 24,516 KB
• 平均クエリ数: 10.00
• 最終ジャッジ日時: 2023-10-28 00:03:37
• 合計ジャッジ時間: 8,317 ms
• ジャッジサーバーID （参考情報）: judge13 / judge10

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	68 ms; 24,504 KB
testcase_01	AC	62 ms; 24,516 KB
testcase_02	AC	64 ms; 24,516 KB
testcase_03	AC	62 ms; 24,516 KB
testcase_04	AC	67 ms; 24,516 KB
testcase_05	AC	65 ms; 24,516 KB
testcase_06	AC	64 ms; 24,516 KB
testcase_07	AC	67 ms; 24,516 KB
testcase_08	AC	66 ms; 24,516 KB
testcase_09	AC	65 ms; 24,516 KB
testcase_10	AC	62 ms; 24,516 KB
testcase_11	AC	63 ms; 24,516 KB
testcase_12	AC	62 ms; 24,516 KB
testcase_13	AC	63 ms; 24,516 KB
testcase_14	AC	63 ms; 24,516 KB
testcase_15	AC	67 ms; 24,516 KB
testcase_16	AC	62 ms; 24,516 KB
testcase_17	AC	62 ms; 24,516 KB
testcase_18	AC	64 ms; 24,516 KB
testcase_19	AC	62 ms; 24,516 KB
testcase_20	AC	64 ms; 24,516 KB
testcase_21	AC	62 ms; 24,516 KB
testcase_22	AC	66 ms; 24,516 KB
testcase_23	AC	62 ms; 24,516 KB
testcase_24	AC	64 ms; 24,516 KB
testcase_25	AC	65 ms; 24,516 KB
testcase_26	AC	70 ms; 24,516 KB
testcase_27	AC	64 ms; 24,516 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m>
std::ostream& operator<<(std::ostream& os, const atcoder::static_modint<m>& a) {os << a.val(); return os;}
template<typename T>
istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

int main(){
	int x, y;
	cin >> x >> y;
	auto s = [&](){
		if(x == y){
			cout << "B\n";
			x = 0;
			y = 0;
			return;
		}
		if(x == 0){
			cout << 'A' << ' ' <<  2 << ' ' << y << "\n";
			y = 0;
			return;
		}
		if(y == 0){
			cout << 'A' << ' ' <<  1 << ' ' << x << "\n";
			x = 0;
			return;
		}
		if(x > y){
			if(y % 2 == 0){
				cout << 'A' << ' ' << 1 << ' ' << x - (y - 1) << "\n";
				x = y - 1;
			}else{
				cout << 'A' << ' ' << 1 << ' ' << x - (y + 1) << "\n";
				x = y + 1;
			}
			return;
		}else{
			if(x % 2 == 0){
				cout << 'A' << ' ' << 2 << ' ' << y - (x - 1) << "\n";
				y = x - 1;
			}else{
				cout << 'A' << ' ' << 2 << ' ' << y - (x + 1) << "\n";
				y = x + 1;
			}
			return;
		}
	};
	auto t = [&](){
		char z;
		cin >> z;
		if(z == 'A'){
			int i;
			int d;
			cin >> i >> d;
			if(i == 1) x -= d;
			if(i == 2) y -= d;
			return false;
		}
		if(z == 'B'){
			x = 0;
			y = 0;
			return false;
		}
		if(z == 'C'){
			return true;
		}
		if(z == 'D'){
			return true;
		}
		assert(true);
		return true;
	};
	
	if((x % 2 == 0 and y == x - 1) or (y % 2 == 0 and x == y - 1)){
		cout << "Second\n";
	}else{
		cout << "First\n";
		s();
	}
	while(true){
		if(t()) break;
		s();
	}
	return 0;
}