結果

問題 No.2550 MORE! JUMP! MORE!
ユーザー StanMarshStanMarsh
提出日時 2023-11-25 14:43:52
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 424 ms / 2,000 ms
コード長 6,026 bytes
コンパイル時間 199 ms
コンパイル使用メモリ 81,828 KB
実行使用メモリ 123,256 KB
最終ジャッジ日時 2023-11-25 14:44:05
合計ジャッジ時間 12,132 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 151 ms
91,128 KB
testcase_01 AC 152 ms
91,128 KB
testcase_02 AC 150 ms
91,128 KB
testcase_03 AC 150 ms
90,488 KB
testcase_04 AC 160 ms
91,128 KB
testcase_05 AC 152 ms
91,128 KB
testcase_06 AC 150 ms
90,616 KB
testcase_07 AC 151 ms
90,616 KB
testcase_08 AC 151 ms
90,616 KB
testcase_09 AC 150 ms
90,616 KB
testcase_10 AC 148 ms
90,488 KB
testcase_11 AC 151 ms
91,128 KB
testcase_12 AC 163 ms
90,488 KB
testcase_13 AC 175 ms
91,128 KB
testcase_14 AC 152 ms
91,128 KB
testcase_15 AC 149 ms
90,616 KB
testcase_16 AC 149 ms
90,616 KB
testcase_17 AC 150 ms
91,128 KB
testcase_18 AC 151 ms
90,488 KB
testcase_19 AC 150 ms
91,128 KB
testcase_20 AC 309 ms
110,840 KB
testcase_21 AC 253 ms
101,368 KB
testcase_22 AC 177 ms
92,408 KB
testcase_23 AC 284 ms
108,280 KB
testcase_24 AC 386 ms
123,256 KB
testcase_25 AC 293 ms
110,456 KB
testcase_26 AC 268 ms
104,440 KB
testcase_27 AC 349 ms
116,728 KB
testcase_28 AC 317 ms
113,400 KB
testcase_29 AC 269 ms
106,232 KB
testcase_30 AC 413 ms
117,880 KB
testcase_31 AC 398 ms
117,880 KB
testcase_32 AC 400 ms
117,880 KB
testcase_33 AC 405 ms
117,880 KB
testcase_34 AC 411 ms
117,880 KB
testcase_35 AC 394 ms
117,880 KB
testcase_36 AC 396 ms
117,880 KB
testcase_37 AC 424 ms
117,880 KB
testcase_38 AC 396 ms
117,880 KB
testcase_39 AC 398 ms
117,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from random import getrandbits, randrange
from string import ascii_lowercase, ascii_uppercase
import sys
from math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf, cos, sin
from copy import deepcopy, copy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import (
    accumulate,
    product,
    combinations,
    combinations_with_replacement,
    permutations,
)
from bisect import bisect, bisect_left, bisect_right
from functools import lru_cache, reduce
from decimal import Decimal, getcontext
from typing import List, Tuple, Optional


inf = float("inf")


def ceil_div(a, b):
    return (a + b - 1) // b


def isqrt(num):
    res = int(sqrt(num))
    while res * res > num:
        res -= 1
    while (res + 1) * (res + 1) <= num:
        res += 1
    return res


def int1(s):
    return int(s) - 1


from types import GeneratorType


def bootstrap(f, stack=[]):
    def wrapped(*args, **kwargs):
        if stack:
            return f(*args, **kwargs)
        else:
            to = f(*args, **kwargs)
            while True:
                if type(to) is GeneratorType:
                    stack.append(to)
                    to = next(to)
                else:
                    stack.pop()
                    if not stack:
                        break
                    to = stack[-1].send(to)
            return to

    return wrapped


import sys
import os

input = lambda: sys.stdin.readline().rstrip("\r\n")

print = lambda *args, end="\n", sep=" ": sys.stdout.write(
    sep.join(map(str, args)) + end
)


def II():
    return int(input())


def MII(base=0):
    return map(lambda s: int(s) - base, input().split())


def LII(base=0):
    return list(MII(base))


def NA():
    n = II()
    a = LII()
    return n, a


def read_graph(n, m, base=0, directed=False, return_edges=False):

    g = [[] for _ in range(n)]
    edges = []
    for _ in range(m):
        a, b = MII(base)
        if return_edges:
            edges.append((a, b))
        g[a].append(b)
        if not directed:
            g[b].append(a)
    if return_edges:
        return g, edges
    return g


def read_graph_with_weight(n, m, base=0, directed=False, return_edges=False):

    g = [[] for _ in range(n)]
    edges = []
    for _ in range(m):
        a, b, w = MII()
        a, b = a - base, b - base
        if return_edges:
            edges.append((a, b, w))
        g[a].append((b, w))
        if not directed:
            g[b].append((a, w))
    if return_edges:
        return g, edges
    return g


def iterate_tokens():
    for line in sys.stdin:
        for word in line.split():
            yield word


tokens = None


def NI():
    global tokens
    if tokens is None:
        tokens = iterate_tokens()
    return int(next(tokens))


def LNI(n):
    return [NI() for _ in range(n)]


def yes(res):
    print("Yes" if res else "No")


def YES(res):
    print("YES" if res else "NO")


def pairwise(a):
    n = len(a)
    for i in range(n - 1):
        yield a[i], a[i + 1]


def factorial(n):
    return reduce(lambda x, y: x * y, range(1, n + 1))


def cmin(dp, i, x):
    if x < dp[i]:
        dp[i] = x


def cmax(dp, i, x):
    if x > dp[i]:
        dp[i] = x


def alp_a_to_i(s):
    return ord(s) - ord("a")


def alp_A_to_i(s):
    return ord(s) - ord("A")


def alp_i_to_a(i):
    return chr(ord("a") + i)


def alp_i_to_A(i):
    return chr(ord("A") + i)


d4 = [(1, 0), (0, 1), (-1, 0), (0, -1)]
d8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]


def ranges(n, m):
    return ((i, j) for i in range(n) for j in range(m))


def valid(i, j, n, m):
    return 0 <= i < n and 0 <= j < m


def ninj(i, j, n, m):
    return [(i + di, j + dj) for di, dj in d4 if valid(i + di, j + dj, n, m)]


def gen(x, *args):
    if len(args) == 1:
        return [x] * args[0]
    if len(args) == 2:
        return [[x] * args[1] for _ in [0] * args[0]]
    if len(args) == 3:
        return [[[x] * args[2] for _ in [0] * args[1]] for _ in [0] * args[0]]
    if len(args) == 4:
        return [
            [[[x] * args[3] for _ in [0] * args[2]] for _ in [0] * args[1]]
            for _ in [0] * args[0]
        ]


list2d = lambda a, b, v: [[v] * b for _ in range(a)]
list3d = lambda a, b, c, v: [[[v] * c for _ in range(b)] for _ in range(a)]


class Debug:
    def __init__(self, debug=False):
        self.debug = debug
        cur_path = os.path.dirname(os.path.abspath(__file__))
        self.local = os.path.exists(cur_path + "/.cph")

    def get_ic(self):
        if self.debug and self.local:
            from icecream import ic

            return ic
        else:
            return lambda *args, **kwargs: ...


class Factorial:
    def __init__(self, N, mod) -> None:
        N += 1
        self.mod = mod
        self.f = [1 for _ in range(N)]
        self.g = [1 for _ in range(N)]
        for i in range(1, N):
            self.f[i] = self.f[i - 1] * i % self.mod
        self.g[-1] = pow(self.f[-1], mod - 2, mod)
        for i in range(N - 2, -1, -1):
            self.g[i] = self.g[i + 1] * (i + 1) % self.mod

    def fac(self, n):
        return self.f[n]

    def fac_inv(self, n):
        return self.g[n]

    def comb(self, n, m):
        if n < m or m < 0 or n < 0:
            return 0
        return self.f[n] * self.g[m] % self.mod * self.g[n - m] % self.mod

    def perm(self, n, m):
        if n < m or m < 0 or n < 0:
            return 0
        return self.f[n] * self.g[n - m] % self.mod

    def catalan(self, n):
        return (self.comb(2 * n, n) - self.comb(2 * n, n - 1)) % self.mod

    def inv(self, n):
        return self.f[n - 1] * self.g[n] % self.mod


mod = 998244353
fact = Factorial(10**5, mod=mod)

ic = Debug(1).get_ic()
n, a = NA()


res = 0
ic(res)
for i, ai in enumerate(a, 0):
    pre = (i + 2) * pow(2, i - 1, mod) if i >= 1 else 1
    post = pow(2, n - i - 2, mod) if i != n - 1 else 1

    res += pre * post * ai

    res %= mod
print(res % mod)
0