結果

問題 No.2521 Don't be Same
ユーザー MasKoaTSMasKoaTS
提出日時 2023-10-27 13:13:12
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 1,467 bytes
コンパイル時間 399 ms
コンパイル使用メモリ 82,592 KB
実行使用メモリ 103,528 KB
平均クエリ数 2.61
最終ジャッジ日時 2024-09-25 13:00:48
合計ジャッジ時間 7,959 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 10 RE * 13 WA * 4
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import itertools as iter
import collections as coll
import heapq as hq
import bisect as bis
from decimal import Decimal as dec
from functools import cmp_to_key
import math
import sys
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10 ** 6)
inp = sys.stdin.readline
input = lambda : inp()[:-1]
getN = lambda : int(inp())
getNs = lambda : map(int, inp().split())
getList = lambda : list(map(int, inp().split()))
getStrs = lambda n : [input() for _ in [0] * n]
getEdges = lambda n : [[x - 1 for x in getNs()] for _ in [0] * n]
def yexit(): print("Yes"); exit(0)
def nexit(): print("No"); exit(0)
pi = 3.141592653589793
mod = 1000000007
MOD = 998244353
INF = 4611686018427387903
dx = [1, 0, -1, 0]; dy = [0, 1, 0, -1]
#di = coll.defaultdict(int)
"""
Main Code
"""
a = getList()
def input_judge(a):
lis = list(map(str, inp().split()))
if(lis[0] == 'A'):
i, x = int(lis[1]) - 1, int(lis[2])
a[i] -= x
elif(lis[0] == 'B'):
a[0] = a[1] = 0
else:
exit(0)
k = (a[0] > a[1])
if(a[k] + 1 == a[k ^ 1]):
print("Second", flush = True)
input_judge(a)
else:
print("First", flush = True)
while(True):
if(a[0] == a[1]):
print('B', flush = True)
else:
k = (a[0] > a[1])
x = a[k ^ 1]
if(a[k] > 0):
x = a[k ^ 1] - a[k] - 1 if(a[k] & 1) else a[k ^ 1] - a[k] + 1
print(*['A', (k ^ 1) + 1, x], flush = True)
input_judge(a)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0