結果
問題 | No.886 Direct |
ユーザー | mkawa2 |
提出日時 | 2023-05-02 21:46:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 581 ms / 4,000 ms |
コード長 | 2,429 bytes |
コンパイル時間 | 173 ms |
コンパイル使用メモリ | 82,724 KB |
実行使用メモリ | 261,124 KB |
最終ジャッジ日時 | 2024-11-21 10:05:10 |
合計ジャッジ時間 | 8,228 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
52,836 KB |
testcase_01 | AC | 38 ms
53,104 KB |
testcase_02 | AC | 39 ms
53,552 KB |
testcase_03 | AC | 63 ms
68,600 KB |
testcase_04 | AC | 38 ms
54,632 KB |
testcase_05 | AC | 38 ms
54,076 KB |
testcase_06 | AC | 37 ms
52,816 KB |
testcase_07 | AC | 36 ms
53,608 KB |
testcase_08 | AC | 37 ms
54,376 KB |
testcase_09 | AC | 37 ms
53,244 KB |
testcase_10 | AC | 39 ms
54,176 KB |
testcase_11 | AC | 37 ms
53,136 KB |
testcase_12 | AC | 37 ms
53,944 KB |
testcase_13 | AC | 37 ms
53,548 KB |
testcase_14 | AC | 36 ms
53,128 KB |
testcase_15 | AC | 37 ms
53,324 KB |
testcase_16 | AC | 37 ms
53,408 KB |
testcase_17 | AC | 59 ms
68,632 KB |
testcase_18 | AC | 59 ms
68,968 KB |
testcase_19 | AC | 58 ms
69,300 KB |
testcase_20 | AC | 57 ms
67,944 KB |
testcase_21 | AC | 61 ms
69,928 KB |
testcase_22 | AC | 60 ms
69,072 KB |
testcase_23 | AC | 282 ms
234,404 KB |
testcase_24 | AC | 316 ms
240,108 KB |
testcase_25 | AC | 202 ms
176,444 KB |
testcase_26 | AC | 247 ms
216,712 KB |
testcase_27 | AC | 581 ms
251,072 KB |
testcase_28 | AC | 478 ms
248,876 KB |
testcase_29 | AC | 549 ms
243,920 KB |
testcase_30 | AC | 551 ms
244,152 KB |
testcase_31 | AC | 568 ms
261,124 KB |
testcase_32 | AC | 560 ms
244,096 KB |
testcase_33 | AC | 549 ms
244,048 KB |
testcase_34 | AC | 544 ms
243,972 KB |
testcase_35 | AC | 578 ms
244,512 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(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 md = 10**9+7 # md = 998244353 class Sieve: def __init__(self, n): self.plist = [2] min_prime_factor = [2, 0]*(n//2+1) for x in range(3, n+1, 2): if min_prime_factor[x] == 0: min_prime_factor[x] = x self.plist.append(x) if x**2 > n: continue for y in range(x**2, n+1, 2*x): if min_prime_factor[y] == 0: min_prime_factor[y] = x self.min_prime_factor = min_prime_factor def isprime(self, x): return self.min_prime_factor[x] == x def pf(self, x): pp, ee = [], [] while x > 1: mpf = self.min_prime_factor[x] if pp and mpf == pp[-1]: ee[-1] += 1 else: pp.append(mpf) ee.append(1) x //= mpf return pp, ee # unsorted def factor(self, a): ff = [1] pp, ee = self.pf(a) for p, e in zip(pp, ee): ff, gg = [], ff w = p for _ in range(e): for f in gg: ff.append(f*w) w *= p ff += gg return ff h, w = LI() if h == w == 1: print(0) exit() if h > w: h, w = w, h sv = Sieve(w) aa = [h-i for i in range(h)] bb = [w-i for i in range(w)] aa += [0]*(w-h) aa[0] = bb[0] = 0 for p in sv.plist: for i in range((w-1)//p, 0, -1): aa[i] += aa[i*p] bb[i] += bb[i*p] aa[i] %= md bb[i] %= md cc = [a*b%md for a, b in zip(aa, bb)] for p in sv.plist: for i in range((w-1)//p, 0, -1)[::-1]: cc[i] -= cc[i*p] cc[i] %= md ans = cc[1]*2+(h-1)*w+h*(w-1) print(ans%md)