結果
問題 | No.308 素数は通れません |
ユーザー | mkawa2 |
提出日時 | 2023-03-21 17:45:12 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,133 bytes |
コンパイル時間 | 155 ms |
コンパイル使用メモリ | 82,312 KB |
実行使用メモリ | 58,352 KB |
最終ジャッジ日時 | 2024-09-18 14:25:16 |
合計ジャッジ時間 | 6,544 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
55,780 KB |
testcase_01 | AC | 43 ms
55,168 KB |
testcase_02 | AC | 39 ms
56,756 KB |
testcase_03 | AC | 40 ms
55,304 KB |
testcase_04 | AC | 40 ms
55,372 KB |
testcase_05 | AC | 41 ms
55,280 KB |
testcase_06 | AC | 39 ms
55,420 KB |
testcase_07 | AC | 39 ms
55,168 KB |
testcase_08 | AC | 40 ms
55,064 KB |
testcase_09 | AC | 41 ms
55,736 KB |
testcase_10 | AC | 40 ms
55,296 KB |
testcase_11 | AC | 43 ms
55,056 KB |
testcase_12 | AC | 38 ms
55,916 KB |
testcase_13 | AC | 40 ms
55,080 KB |
testcase_14 | AC | 38 ms
56,220 KB |
testcase_15 | AC | 38 ms
55,504 KB |
testcase_16 | AC | 37 ms
55,684 KB |
testcase_17 | AC | 38 ms
55,248 KB |
testcase_18 | AC | 40 ms
56,228 KB |
testcase_19 | AC | 39 ms
55,580 KB |
testcase_20 | AC | 38 ms
55,780 KB |
testcase_21 | AC | 39 ms
56,728 KB |
testcase_22 | AC | 44 ms
54,876 KB |
testcase_23 | AC | 44 ms
55,148 KB |
testcase_24 | AC | 40 ms
55,472 KB |
testcase_25 | AC | 41 ms
55,640 KB |
testcase_26 | AC | 39 ms
56,332 KB |
testcase_27 | AC | 37 ms
55,172 KB |
testcase_28 | AC | 38 ms
56,108 KB |
testcase_29 | AC | 37 ms
55,916 KB |
testcase_30 | AC | 37 ms
56,884 KB |
testcase_31 | AC | 38 ms
55,388 KB |
testcase_32 | AC | 37 ms
55,356 KB |
testcase_33 | AC | 39 ms
56,964 KB |
testcase_34 | AC | 38 ms
55,120 KB |
testcase_35 | AC | 41 ms
56,260 KB |
testcase_36 | AC | 38 ms
55,892 KB |
testcase_37 | AC | 38 ms
56,376 KB |
testcase_38 | AC | 38 ms
55,240 KB |
testcase_39 | AC | 39 ms
55,996 KB |
testcase_40 | AC | 38 ms
55,968 KB |
testcase_41 | AC | 39 ms
55,148 KB |
testcase_42 | AC | 40 ms
56,204 KB |
testcase_43 | AC | 39 ms
55,540 KB |
testcase_44 | AC | 39 ms
55,152 KB |
testcase_45 | AC | 39 ms
55,884 KB |
testcase_46 | AC | 39 ms
55,604 KB |
testcase_47 | AC | 40 ms
55,364 KB |
testcase_48 | AC | 40 ms
56,556 KB |
testcase_49 | AC | 41 ms
56,816 KB |
testcase_50 | AC | 43 ms
55,372 KB |
testcase_51 | AC | 44 ms
56,552 KB |
testcase_52 | AC | 41 ms
55,688 KB |
testcase_53 | AC | 40 ms
54,936 KB |
testcase_54 | AC | 39 ms
55,124 KB |
testcase_55 | AC | 38 ms
55,152 KB |
testcase_56 | AC | 37 ms
56,520 KB |
testcase_57 | AC | 38 ms
55,148 KB |
testcase_58 | AC | 37 ms
55,996 KB |
testcase_59 | AC | 38 ms
55,716 KB |
testcase_60 | AC | 38 ms
56,796 KB |
testcase_61 | AC | 38 ms
55,688 KB |
testcase_62 | AC | 38 ms
55,880 KB |
testcase_63 | AC | 39 ms
55,308 KB |
testcase_64 | AC | 41 ms
56,288 KB |
testcase_65 | AC | 41 ms
56,240 KB |
testcase_66 | AC | 41 ms
55,172 KB |
testcase_67 | AC | 41 ms
55,836 KB |
testcase_68 | AC | 40 ms
55,668 KB |
testcase_69 | AC | 41 ms
55,784 KB |
testcase_70 | AC | 42 ms
56,528 KB |
testcase_71 | AC | 40 ms
57,084 KB |
testcase_72 | AC | 42 ms
57,612 KB |
testcase_73 | AC | 39 ms
56,092 KB |
testcase_74 | AC | 40 ms
56,472 KB |
testcase_75 | AC | 38 ms
55,424 KB |
testcase_76 | WA | - |
testcase_77 | AC | 41 ms
55,896 KB |
testcase_78 | AC | 40 ms
55,488 KB |
testcase_79 | AC | 41 ms
55,000 KB |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | AC | 39 ms
56,464 KB |
testcase_83 | AC | 39 ms
55,816 KB |
testcase_84 | WA | - |
testcase_85 | AC | 40 ms
55,520 KB |
testcase_86 | WA | - |
testcase_87 | WA | - |
testcase_88 | AC | 42 ms
54,948 KB |
testcase_89 | AC | 42 ms
55,032 KB |
testcase_90 | WA | - |
testcase_91 | AC | 40 ms
58,352 KB |
testcase_92 | AC | 40 ms
57,536 KB |
testcase_93 | AC | 39 ms
57,536 KB |
testcase_94 | AC | 39 ms
57,200 KB |
testcase_95 | AC | 41 ms
57,616 KB |
testcase_96 | AC | 41 ms
56,032 KB |
testcase_97 | AC | 45 ms
56,988 KB |
testcase_98 | AC | 38 ms
56,096 KB |
testcase_99 | AC | 38 ms
55,124 KB |
testcase_100 | AC | 36 ms
55,812 KB |
testcase_101 | WA | - |
testcase_102 | AC | 39 ms
56,800 KB |
testcase_103 | AC | 39 ms
56,292 KB |
testcase_104 | AC | 39 ms
57,264 KB |
testcase_105 | AC | 40 ms
58,304 KB |
testcase_106 | AC | 40 ms
56,184 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 from random import randrange def is_prime(n): # K...信頼度 K = 20 if n == 2: return True if n == 1 or n & 1 == 0: return False d = (n-1) >> 1 while d & 1 == 0: d >>= 1 for k in range(K): a = randrange(1, n) t = d y = pow(a, t, n) while t != n-1 and y != 1 and y != n-1: y = pow(y, 2, n) t <<= 1 if y != n-1 and t & 1 == 0: return False return True primes = set( [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499]) def ok(w): def push(ij): if fin[ij]: return fin[ij] = 1 st.append(ij) fin = [0]*n for p in primes: if p-1 >= n: break fin[p-1] = 1 fin[0] = 1 st = [0] while st: ij = st.pop() if ij == n-1: return True i, j = divmod(ij, w) if i: push(ij-w) if j: push(ij-1) if ij+w < n: push(ij+w) if j+1 < w: push(ij+1) return False def ok1(w): def push(ij): if ij in fin: return fin.add(ij) if ij+1 in primes: return st.append(ij) fin = set() st = [0] while st: ij = st.pop() i, j = divmod(ij, w) if i > d or j > d: return True if i: push(ij-w) if j: push(ij-1) if ij+w < n: push(ij+w) if j+1 < w: push(ij+1) def ok2(w): def push(ij): if ij in fin: return fin.add(ij) if is_prime(ij+1): return st.append(ij) fin = set() gi, gj = divmod(n-1, w) st = [n-1] while st: ij = st.pop() i, j = divmod(ij, w) if abs(i-gi) > d or abs(j-gj) > d: return True if i: push(ij-w) if j: push(ij-1) if ij+w < n: push(ij+w) if j+1 < w: push(ij+1) d = 4 n = II() if n < 500: for w in range(3, n+1): if ok(w): print(w) exit() else: for w in range(8, 1000): if ok1(w) and ok2(w): print(w) exit()