結果

問題 No.197 手品
ユーザー cozy_saunacozy_sauna
提出日時 2021-10-26 12:56:43
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,056 bytes
コンパイル時間 1,791 ms
コンパイル使用メモリ 82,228 KB
実行使用メモリ 66,636 KB
最終ジャッジ日時 2024-04-15 11:28:16
合計ジャッジ時間 4,730 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
64,336 KB
testcase_01 AC 58 ms
65,464 KB
testcase_02 AC 60 ms
65,292 KB
testcase_03 AC 59 ms
64,880 KB
testcase_04 AC 62 ms
65,448 KB
testcase_05 WA -
testcase_06 AC 58 ms
64,540 KB
testcase_07 AC 58 ms
64,608 KB
testcase_08 AC 58 ms
64,840 KB
testcase_09 AC 58 ms
66,020 KB
testcase_10 AC 58 ms
64,452 KB
testcase_11 AC 58 ms
64,668 KB
testcase_12 AC 59 ms
65,388 KB
testcase_13 AC 60 ms
65,096 KB
testcase_14 AC 60 ms
64,132 KB
testcase_15 AC 60 ms
65,372 KB
testcase_16 AC 59 ms
64,832 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 60 ms
65,168 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 59 ms
65,144 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 60 ms
64,412 KB
testcase_31 AC 60 ms
64,960 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 59 ms
64,724 KB
testcase_35 AC 59 ms
65,720 KB
testcase_36 AC 60 ms
64,796 KB
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 58 ms
64,656 KB
testcase_41 AC 60 ms
64,612 KB
testcase_42 AC 60 ms
64,812 KB
testcase_43 AC 60 ms
65,908 KB
testcase_44 WA -
testcase_45 AC 60 ms
65,040 KB
testcase_46 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from heapq import heappush, heappop
from math import factorial, gcd, exp
from copy import copy, deepcopy
from time import time
setrecursionlimit(10 ** 6)
readline = stdin.readline
# @lru_cache(maxsize=None)
INF = 10 ** 18
MOD = 1000000007
# MOD = 998244353
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
def I(): return int(readline())
def S(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x)-1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(x): return [[] for _ in [0] * x]
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y+dy, x+dx) for dy, dx in DYDX if 0 <= y+dy < ly and 0 <= x+dx < lx]
def imax(A, idx=-1, m=-(1<<18)):
    for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m < a]
    return idx
def imin(A, idx=-1, m=1<<18):
    for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m > a]
    return idx
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    puts(E)
####################################################################

B = input()
N = I()
A = input()

def check(A, B, N):
    a = A.count('x')
    b = B.count('x')
    if a != b: return True
    if a == 0 or a == 3: return False 
    if a == 1:
        i = A.index('x')
        ii = A.index('x')
    else:
        i = A.index('o')
        ii = A.index('o')

    d = abs(i-ii)
    if N < d: return True
    N -= d 
    return N % 2 == 1

print('SUCCESS' if check(A, B, N) else 'FAILURE')
0