結果

問題 No.1043 直列大学
ユーザー ntudantuda
提出日時 2024-11-08 19:32:56
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 489 ms / 2,000 ms
コード長 4,251 bytes
コンパイル時間 365 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 123,908 KB
最終ジャッジ日時 2024-11-08 19:33:05
合計ジャッジ時間 6,754 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
67,712 KB
testcase_01 AC 72 ms
68,224 KB
testcase_02 AC 73 ms
67,712 KB
testcase_03 AC 73 ms
67,584 KB
testcase_04 AC 72 ms
67,584 KB
testcase_05 AC 74 ms
67,584 KB
testcase_06 AC 74 ms
67,456 KB
testcase_07 AC 74 ms
67,712 KB
testcase_08 AC 82 ms
67,840 KB
testcase_09 AC 117 ms
78,336 KB
testcase_10 AC 126 ms
79,104 KB
testcase_11 AC 204 ms
87,680 KB
testcase_12 AC 489 ms
123,908 KB
testcase_13 AC 222 ms
95,172 KB
testcase_14 AC 251 ms
97,348 KB
testcase_15 AC 293 ms
103,808 KB
testcase_16 AC 229 ms
93,412 KB
testcase_17 AC 134 ms
80,256 KB
testcase_18 AC 190 ms
85,004 KB
testcase_19 AC 237 ms
92,992 KB
testcase_20 AC 130 ms
80,384 KB
testcase_21 AC 220 ms
92,724 KB
testcase_22 AC 230 ms
94,600 KB
testcase_23 AC 327 ms
104,800 KB
testcase_24 AC 171 ms
84,864 KB
testcase_25 AC 218 ms
89,088 KB
testcase_26 AC 248 ms
95,488 KB
testcase_27 AC 119 ms
78,592 KB
testcase_28 AC 147 ms
82,560 KB
testcase_29 AC 102 ms
78,464 KB
testcase_30 AC 207 ms
92,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1
    return x

def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2
    return x

class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        if isinstance(v, int):
            v = [e] * v

        self._n = len(v)
        self._log = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [e] * (2 * self._size)

        for i in range(self._n):
            self._d[self._size + i] = v[i]
        for i in range(self._size - 1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        self._d[p] = x
        for i in range(1, self._log + 1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        return self._d[p + self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size

        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def max_right(self, left: int,
                  f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left - self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        sm = self._e

        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right % 2:
                right >>= 1
            if not f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2 * right + 1
                    if f(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right + 1 - self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])

MOD = 10 ** 9 + 7
N, M = map(int, input().split())
V = list(map(int, input().split()))
R = list(map(int, input().split()))
A, B = map(int, input().split())
sumv = sum(V)
sumr = sum(R)
dpv = [0] * (sumv + 11)
dpr = [0] * (sumr + 1)
dpv[0] = 1
dpr[0] = 1
for v in V:
    for i in reversed(range(sumv - v + 1)):
        dpv[i + v] += dpv[i]
for r in R:
    for i in reversed(range(sumr - r + 1)):
        dpr[i + r] += dpr[i]
dpv[0] = 0
dpr[0] = 0
ST = SegTree(lambda x,y:x+y, 0, dpv)
ans = 0
#print(dpv)
#print(dpr)
for r in range(sumr+1):
    if dpr[r] > 0:
        minv = min(A * r, sumv + 10)
        maxv = min(B * r, sumv + 10)
        ans += dpr[r] * ST.prod(minv,maxv + 1)
        ans %= MOD
        #print(r,dpr[r],minv,maxv,ans)
print(ans)
0