Submission #39009966

---

Source Code Expand

#!/usr/bin/env python3
import math
import sys


sys.setrecursionlimit(10**8)

def isprime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3, int(math.sqrt(n)) + 1, 2):
        if n % i == 0: return False
    return True


def solve(N: int, M: int, A: "List[int]", B: "List[int]"):
    ans = 0
    for i in range(M) :
        ans += A[B[i]-1]
    print(ans)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    B = [int(next(tokens)) for _ in range(M)]  # type: "List[int]"
    solve(N, M, A, B)

if __name__ == '__main__':
    main()

Submission Info

Judge Result