제출 #1196490

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1196490		ofoz	Intercastellar (JOI22_ho_t1)	Pypy 3	0 / 100	235 ms	58932 KiB

Main

from sys import stdout, setrecursionlimit
from math import ceil, floor, sqrt

def cnt_two(x: int):
    res = 0
    while x % 2 == 0:
        res += 1
        x //= 2

    return (res, x)


def solve():
    n = int(input())
    a = []
    for _ in range(n): a.append(int(input()))
    q = int(input())
    queries = []
    for _ in range(q): queries.append(int(input()))

    last = -1
    i = 0
    j = 0
    cur = 0
    while i < n and j < q:
        x = queries[j]
        if x <= cur:
            print(last)
            j += 1
            continue

        cnt, after = cnt_two(a[i])
        cur += (1<<cnt)
        last = after
        i += 1
        if x <= cur:
            print(last)
            j += 1









solve()

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 37%)

=======

• Subtask 1: 0 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40