結果
問題 | No.197 手品 |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 21:07:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 252 ms / 1,000 ms |
コード長 | 1,846 bytes |
コンパイル時間 | 810 ms |
コンパイル使用メモリ | 87,032 KB |
実行使用メモリ | 92,432 KB |
最終ジャッジ日時 | 2023-08-20 20:38:24 |
合計ジャッジ時間 | 12,401 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 188 ms
92,064 KB |
testcase_01 | AC | 192 ms
92,324 KB |
testcase_02 | AC | 189 ms
92,352 KB |
testcase_03 | AC | 189 ms
92,276 KB |
testcase_04 | AC | 191 ms
92,228 KB |
testcase_05 | AC | 190 ms
92,168 KB |
testcase_06 | AC | 190 ms
92,056 KB |
testcase_07 | AC | 189 ms
92,160 KB |
testcase_08 | AC | 191 ms
92,344 KB |
testcase_09 | AC | 193 ms
92,288 KB |
testcase_10 | AC | 192 ms
92,308 KB |
testcase_11 | AC | 193 ms
92,336 KB |
testcase_12 | AC | 193 ms
92,180 KB |
testcase_13 | AC | 252 ms
92,276 KB |
testcase_14 | AC | 188 ms
92,376 KB |
testcase_15 | AC | 191 ms
92,320 KB |
testcase_16 | AC | 190 ms
92,232 KB |
testcase_17 | AC | 188 ms
92,308 KB |
testcase_18 | AC | 191 ms
92,324 KB |
testcase_19 | AC | 191 ms
92,336 KB |
testcase_20 | AC | 191 ms
92,348 KB |
testcase_21 | AC | 194 ms
92,172 KB |
testcase_22 | AC | 196 ms
92,400 KB |
testcase_23 | AC | 190 ms
92,316 KB |
testcase_24 | AC | 188 ms
92,276 KB |
testcase_25 | AC | 191 ms
92,236 KB |
testcase_26 | AC | 196 ms
92,296 KB |
testcase_27 | AC | 189 ms
92,184 KB |
testcase_28 | AC | 189 ms
92,428 KB |
testcase_29 | AC | 194 ms
92,136 KB |
testcase_30 | AC | 190 ms
92,288 KB |
testcase_31 | AC | 192 ms
92,152 KB |
testcase_32 | AC | 189 ms
92,300 KB |
testcase_33 | AC | 189 ms
92,152 KB |
testcase_34 | AC | 192 ms
92,432 KB |
testcase_35 | AC | 191 ms
92,272 KB |
testcase_36 | AC | 192 ms
92,164 KB |
testcase_37 | AC | 189 ms
92,168 KB |
testcase_38 | AC | 193 ms
92,432 KB |
testcase_39 | AC | 193 ms
92,336 KB |
testcase_40 | AC | 193 ms
92,316 KB |
testcase_41 | AC | 193 ms
92,176 KB |
testcase_42 | AC | 191 ms
92,312 KB |
testcase_43 | AC | 190 ms
92,292 KB |
testcase_44 | AC | 191 ms
92,312 KB |
testcase_45 | AC | 195 ms
92,168 KB |
testcase_46 | AC | 193 ms
92,352 KB |
ソースコード
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 = list(input()) N = int(input()) B = list(input()) if N >= 3: p = (N - 3) // 2 N -= p * 2 ans = [[] for i in range(5)] ans[0].append(A) for i in range(4): for j in range(len(ans[i])): b = deepcopy(ans[i][j]) b[0], b[1] = b[1], b[0] c = deepcopy(ans[i][j]) c[1], c[2] = c[2], c[1] ans[i+1].append(b) ans[i+1].append(c) if B in ans[N]: print('FAILURE') else: print('SUCCESS') if __name__ == '__main__': main()