結果
問題 | No.1683 Robot Guidance |
ユーザー | ansain |
提出日時 | 2021-09-17 22:21:34 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 474 ms / 2,000 ms |
コード長 | 2,953 bytes |
コンパイル時間 | 324 ms |
コンパイル使用メモリ | 87,256 KB |
実行使用メモリ | 124,568 KB |
最終ジャッジ日時 | 2023-09-12 08:09:07 |
合計ジャッジ時間 | 17,451 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 363 ms
123,648 KB |
testcase_01 | AC | 352 ms
123,676 KB |
testcase_02 | AC | 350 ms
123,832 KB |
testcase_03 | AC | 345 ms
124,168 KB |
testcase_04 | AC | 344 ms
124,124 KB |
testcase_05 | AC | 364 ms
124,056 KB |
testcase_06 | AC | 371 ms
124,568 KB |
testcase_07 | AC | 364 ms
124,092 KB |
testcase_08 | AC | 456 ms
124,308 KB |
testcase_09 | AC | 370 ms
124,252 KB |
testcase_10 | AC | 396 ms
124,188 KB |
testcase_11 | AC | 402 ms
124,356 KB |
testcase_12 | AC | 439 ms
124,420 KB |
testcase_13 | AC | 351 ms
123,712 KB |
testcase_14 | AC | 412 ms
124,500 KB |
testcase_15 | AC | 395 ms
124,060 KB |
testcase_16 | AC | 372 ms
123,748 KB |
testcase_17 | AC | 367 ms
123,940 KB |
testcase_18 | AC | 375 ms
123,992 KB |
testcase_19 | AC | 364 ms
123,928 KB |
testcase_20 | AC | 367 ms
124,048 KB |
testcase_21 | AC | 365 ms
123,676 KB |
testcase_22 | AC | 344 ms
123,752 KB |
testcase_23 | AC | 364 ms
123,560 KB |
testcase_24 | AC | 474 ms
124,212 KB |
testcase_25 | AC | 353 ms
123,728 KB |
testcase_26 | AC | 346 ms
123,752 KB |
testcase_27 | AC | 346 ms
124,040 KB |
testcase_28 | AC | 352 ms
123,560 KB |
testcase_29 | AC | 350 ms
123,864 KB |
testcase_30 | AC | 341 ms
123,904 KB |
testcase_31 | AC | 347 ms
123,756 KB |
testcase_32 | AC | 353 ms
123,736 KB |
testcase_33 | AC | 379 ms
124,052 KB |
testcase_34 | AC | 401 ms
124,228 KB |
testcase_35 | AC | 380 ms
123,832 KB |
testcase_36 | AC | 378 ms
124,004 KB |
testcase_37 | AC | 362 ms
124,284 KB |
testcase_38 | AC | 340 ms
123,784 KB |
testcase_39 | AC | 334 ms
123,632 KB |
testcase_40 | AC | 320 ms
123,512 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial #from math import isqrt, prod, comb #python3.8用(notpypy) #from bisect import bisect_left, bisect_right #from functools import lru_cache, reduce #from heapq import heappush, heappop, heapify, heappushpop, heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 #numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) class PrepereFactorial2: # maxnumまでの階乗を事前計算して、順列、組み合わせ、重複組み合わせを計算するクラス。逆元のテーブルもpow無しで前計算する。maxnumに比べて関数呼び出しが多いならこちら def __init__(self, maxnum=3*10**5, mod=10**9+7): self.factorial = [1]*(maxnum+1) modinv_table = [-1] * (maxnum+1) modinv_table[1] = 1 for i in range(2, maxnum+1): self.factorial[i] = (self.factorial[i-1]*i) % mod modinv_table[i] = (-modinv_table[mod % i] * (mod // i)) % mod self.invfactorial = [1]*(maxnum+1) for i in range(1, maxnum+1): self.invfactorial[i] = self.invfactorial[i-1]*modinv_table[i] % mod self.mod = mod def permutation(self, n, r): return self.factorial[n]*self.invfactorial[n-r] % self.mod def combination(self, n, r): return self.permutation(n, r)*self.invfactorial[r] % self.mod def combination_with_repetition(self, n, r): if n==0: if r==0: return 1 else: return 0 return self.combination(n+r-1, r) def main(): mod = 10**9+7 mod2 = 998244353 a,b,x,y=map(int, input().split()) pf=PrepereFactorial2(2*10**6+10) ans=0 xu=(b+4)//4 yu=(b+3)//4 xd=(b+2)//4 yd=(b+1)//4 for xnum in range(a+1): ynum = a-xnum if (xnum+x >= 0 and (xnum+x) % 2 == 0 and (xnum-x) >= 0 and (xnum-x) % 2==0 and ynum+y >= 0 and (ynum+y) % 2 == 0 and (ynum-y) >= 0 and (ynum-y) % 2==0): ans+=pf.combination_with_repetition(xu,(xnum+x)//2)*pf.combination_with_repetition(xd,(xnum-x)//2)%mod*pf.combination_with_repetition(yu,(ynum+y)//2)%mod*pf.combination_with_repetition(yd,(ynum-y)//2) print(ans%mod) if __name__ == '__main__': main()