結果
問題 | No.197 手品 |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 12:32:13 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,380 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 86,824 KB |
実行使用メモリ | 92,660 KB |
最終ジャッジ日時 | 2023-08-20 15:54:55 |
合計ジャッジ時間 | 11,685 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 196 ms
92,252 KB |
testcase_01 | AC | 199 ms
92,144 KB |
testcase_02 | AC | 196 ms
92,144 KB |
testcase_03 | AC | 198 ms
91,936 KB |
testcase_04 | AC | 194 ms
92,216 KB |
testcase_05 | AC | 198 ms
92,124 KB |
testcase_06 | AC | 196 ms
92,196 KB |
testcase_07 | AC | 198 ms
92,188 KB |
testcase_08 | AC | 196 ms
92,216 KB |
testcase_09 | AC | 201 ms
92,024 KB |
testcase_10 | AC | 201 ms
91,944 KB |
testcase_11 | AC | 197 ms
92,224 KB |
testcase_12 | WA | - |
testcase_13 | AC | 200 ms
92,188 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 197 ms
92,248 KB |
testcase_24 | AC | 198 ms
92,052 KB |
testcase_25 | AC | 197 ms
92,344 KB |
testcase_26 | AC | 199 ms
92,168 KB |
testcase_27 | WA | - |
testcase_28 | AC | 209 ms
92,152 KB |
testcase_29 | WA | - |
testcase_30 | AC | 211 ms
92,200 KB |
testcase_31 | AC | 213 ms
92,148 KB |
testcase_32 | AC | 212 ms
92,212 KB |
testcase_33 | WA | - |
testcase_34 | AC | 260 ms
92,072 KB |
testcase_35 | AC | 206 ms
92,176 KB |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | AC | 207 ms
92,028 KB |
testcase_39 | WA | - |
testcase_40 | AC | 213 ms
92,172 KB |
testcase_41 | WA | - |
testcase_42 | AC | 202 ms
92,156 KB |
testcase_43 | AC | 210 ms
92,200 KB |
testcase_44 | WA | - |
testcase_45 | AC | 197 ms
92,056 KB |
testcase_46 | WA | - |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): A = input() N = int(input()) B = input() if N == 0: if A == B: print('FAILURE') else: print('SUCCESS') exit() if A.count('x') != B.count('x'): print('SUCCESS') exit() if A.count('x') == 0 and B.count('x') == 0: print('FAILURE') exit() if A.count('x') == 3 and B.count('x') == 3: print('FAILURE') exit() ok = set() ok.add('xxo') ok.add('oxx') ok.add('xoo') ok.add('oox') bad = set() bad.add('xox') bad.add('oxo') if A in ok: if B in ok: if N % 2 == 0: print('FAILURE') else: print('SUCCESS') else: if N % 2 == 0: print('SUCCESS') else: print('FAILURE') else: if B in ok: if N % 2 == 0: print('SUCCESS') else: print('FAILURE') else: if N % 2 == 0: print('FAILURE') else: print('SUCCESS') if __name__ == '__main__': main()