結果
問題 | No.2406 Difference of Coordinate Squared |
ユーザー | chineristAC |
提出日時 | 2023-08-04 22:45:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 190 ms / 2,000 ms |
コード長 | 2,093 bytes |
コンパイル時間 | 313 ms |
コンパイル使用メモリ | 87,340 KB |
実行使用メモリ | 101,012 KB |
最終ジャッジ日時 | 2023-08-17 18:46:18 |
合計ジャッジ時間 | 10,662 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
99,352 KB |
testcase_01 | AC | 157 ms
99,624 KB |
testcase_02 | AC | 190 ms
100,716 KB |
testcase_03 | AC | 145 ms
99,336 KB |
testcase_04 | AC | 181 ms
101,012 KB |
testcase_05 | AC | 163 ms
99,776 KB |
testcase_06 | AC | 149 ms
99,668 KB |
testcase_07 | AC | 150 ms
99,264 KB |
testcase_08 | AC | 155 ms
99,584 KB |
testcase_09 | AC | 157 ms
99,820 KB |
testcase_10 | AC | 142 ms
99,616 KB |
testcase_11 | AC | 155 ms
99,236 KB |
testcase_12 | AC | 151 ms
99,552 KB |
testcase_13 | AC | 153 ms
99,740 KB |
testcase_14 | AC | 144 ms
99,248 KB |
testcase_15 | AC | 146 ms
99,620 KB |
testcase_16 | AC | 143 ms
99,560 KB |
testcase_17 | AC | 139 ms
99,348 KB |
testcase_18 | AC | 149 ms
99,440 KB |
testcase_19 | AC | 168 ms
99,288 KB |
testcase_20 | AC | 169 ms
99,532 KB |
testcase_21 | AC | 155 ms
99,284 KB |
testcase_22 | AC | 142 ms
99,416 KB |
testcase_23 | AC | 165 ms
99,476 KB |
testcase_24 | AC | 157 ms
99,388 KB |
testcase_25 | AC | 150 ms
99,588 KB |
testcase_26 | AC | 146 ms
99,268 KB |
testcase_27 | AC | 140 ms
99,584 KB |
testcase_28 | AC | 137 ms
99,504 KB |
testcase_29 | AC | 137 ms
99,272 KB |
testcase_30 | AC | 135 ms
99,404 KB |
testcase_31 | AC | 143 ms
99,508 KB |
testcase_32 | AC | 141 ms
99,448 KB |
testcase_33 | AC | 146 ms
99,196 KB |
testcase_34 | AC | 149 ms
99,508 KB |
testcase_35 | AC | 148 ms
99,176 KB |
testcase_36 | AC | 141 ms
99,248 KB |
testcase_37 | AC | 139 ms
99,220 KB |
testcase_38 | AC | 138 ms
99,408 KB |
testcase_39 | AC | 138 ms
99,220 KB |
testcase_40 | AC | 141 ms
99,268 KB |
testcase_41 | AC | 139 ms
99,444 KB |
testcase_42 | AC | 146 ms
99,320 KB |
testcase_43 | AC | 139 ms
99,396 KB |
testcase_44 | AC | 150 ms
99,540 KB |
testcase_45 | AC | 141 ms
99,608 KB |
testcase_46 | AC | 145 ms
99,508 KB |
testcase_47 | AC | 151 ms
99,472 KB |
testcase_48 | AC | 155 ms
99,520 KB |
testcase_49 | AC | 134 ms
99,448 KB |
testcase_50 | AC | 146 ms
99,208 KB |
testcase_51 | AC | 136 ms
99,268 KB |
testcase_52 | AC | 134 ms
99,268 KB |
testcase_53 | AC | 129 ms
99,244 KB |
testcase_54 | AC | 144 ms
99,436 KB |
testcase_55 | AC | 149 ms
99,448 KB |
testcase_56 | AC | 150 ms
99,420 KB |
ソースコード
import sys input = lambda :sys.stdin.readline().rstrip() def cmb(n, r, mod): if ( r<0 or r>n ): return 0 return (g1[n] * g2[r] % mod) * g2[n-r] % mod mod = 998244353 N = 10**6 + 10 g1 = [1]*(N+1) g2 = [1]*(N+1) inverse = [1]*(N+1) for i in range( 2, N + 1 ): g1[i]=( ( g1[i-1] * i ) % mod ) inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod ) g2[i]=( (g2[i-1] * inverse[i]) % mod ) inverse[0]=0 N,M = map(int,input().split()) if M == 0: res = 0 """ X+Y = 0 """ if N & 1 == 0: res += cmb(N,N//2,mod) * pow(inverse[2],N,mod) * 2 % mod res %= mod res -= cmb(N,N//2,mod) * cmb(N,N//2,mod) * pow(inverse[2],2*N,mod) % mod res %= mod print(res) else: divisors = [] for d in range(1,abs(M)+1): if d*d > abs(M): break if M % d == 0: divisors.append(d) divisors.append(-d) if abs(M)//d != d: divisors.append(M//d) divisors.append(-M//d) divisors.sort() res = 0 for d in divisors: p = d m = M // d tmp = 1 if (N+p) & 1 == 0 and 0 <= (N+p)//2 <= N: tmp *= cmb(N,(N+p)//2,mod) tmp %= mod else: tmp = 0 if (N+m) & 1 == 0 and 0 <= (N+m)//2 <= N: tmp *= cmb(N,(N+m)//2,mod) tmp %= mod else: tmp = 0 res += tmp res %= mod res *= pow(inverse[4],N,mod) res %= mod print(res) exit() dp = [[0]*(2*N+1) for i in range(2*N+1)] dp[0][0] = 1 for _ in range(N): ndp = [[0]*(2*N+1) for i in range(2*N+1)] for i in range(-N,N+1): for j in range(-N,N+1): if not dp[i][j]: continue for ni,nj in [(i-1,j),(i+1,j),(i,j-1),(i,j+1)]: ndp[ni][nj] += dp[i][j] * inverse[4] % mod ndp[ni][nj] %= mod dp = ndp check = 0 for i in range(-N,N+1): for j in range(-N,N+1): if i*i-j*j == M: check += dp[i][j] check %= mod print(check)