Submission #1196491

#TimeUsernameProblemLanguageResultExecution timeMemory
1196491ofozIntercastellar (JOI22_ho_t1)Pypy 3
100 / 100
314 ms65904 KiB
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 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 solve()

Compilation message (stdout)

Compiling 'Main.py'...

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

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...