Problem:


Score : 700 points

Problem Statement

We have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.
Vertex 1 is the root, and the parent of Vertex i (i \geq 2) is Vertex \left[ \frac{i}{2} \right].

Each vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.
Now, process the following query Q times:

Given are a vertex v of the tree and a positive integer L.
  Let us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.
  Find the maximum possible total value of the chosen items.

Here, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\ldots,w_k (k\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.

Constraints

All values in input are integers.

1 \leq N < 2^{18}

1 \leq Q \leq 10^5

1 \leq V_i \leq 10^5

1 \leq W_i \leq 10^5

For the values v and L given in each query, 1 \leq v \leq N and 1 \leq L \leq 10^5.

Input

Let v_i and L_i be the values v and L given in the i-th query.
Then, Input is given from Standard Input in the following format:

N
V_1 W_1
:
V_N W_N
Q
v_1 L_1
:
v_Q L_Q

Output

For each integer i from 1 through Q,
the i-th line should contain the response to the i-th query.

Sample Input 1

3
1 2
2 3
3 4
3
1 1
2 5
3 5

Sample Output 1

0
3
3

In the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.

In the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.

Sample Input 2

15
123 119
129 120
132 112
126 109
118 103
115 109
102 100
130 120
105 105
132 115
104 102
107 107
127 116
121 104
121 115
8
8 234
9 244
10 226
11 227
12 240
13 237
14 206
15 227

Sample Output 2

256
255
250
247
255
259
223
253



Sample input:
3
1 2
2 3
3 4
3
1 1
2 5
3 5


Sample output:
0
3
3

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    def dp_all(lis, l):
        res = [(0,0)]
        for v,w in lis:
            res += [(sv+v,sw+w) for (sv,sw) in res if sw+w <= l]
        return max(res)[0]

    def array(lis):
        res = [(0,0)]
        for v,w in lis:
            res += [(sw+w,sv+v) for (sw,sv) in res]
        res.sort(key = lambda x:(x[0],-x[1]))
        res_sw = []
        res_sv = []
        maxv = 0
        for i in range(len(res)):
            w,v = res[i]
            if v < maxv:
                continue
            res_sw.append(w)
            res_sv.append(v)
            maxv = v
        return res_sw,res_sv

    def dp(lis, res_sw, res_sv, l):
        liss = [(0,0)]
        for v,w in lis:
            liss += [(sw+w,sv+v) for (sw,sv) in liss if sw+w <= l]
        ans = 0
        for sw,sv in liss:
            j = bisect.bisect_right(res_sw, l-sw)-1
            s = sv+res_sv[j]
            if ans < s:
                ans = s
        return ans

    n = I()
    g = [None]*(n+1)
    for i in range(1,n+1):
        v,w = LI()
        g[i] = (v,w)
    q = I()
    mem_sw = defaultdict(lambda : None)
    mem_sv = defaultdict(lambda : None)
    m = n.bit_length()>>1
    for _ in range(q):
        x,l = LI()
        bit = x
        lis = []
        while x:
            lis.append(g[x])
            x >>= 1
        h = len(lis)
        if h <= m:
            print(dp_all(lis,l))
        else:
            bit &= (1<<h)-(1<<m)
            bit >>= m
            if mem_sw[bit] is None:
                mem_sw[bit],mem_sv[bit] = array(lis[-m:])
            print(dp(lis[:-m],mem_sw[bit],mem_sv[bit],l))
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    def dp_all(lis, l):
        res = [(0,0)]
        for v,w in lis:
            res += [(sv+v,sw+w) for (sv,sw) in res if sw+w <= l]
        return max(res)[0]

    def array(lis):
        res = [(0,0)]
        for v,w in lis:
            res += [(sw+w,sv+v) for (sw,sv) in res]
        res.sort(key = lambda x:(x[0],-x[1]))
        res_sw = []
        res_sv = []
        maxv = 0
        for i in range(len(res)):
            w,v = res[i]
            if v < maxv:
                continue
            res_sw.append(w)
            res_sv.append(v)
            maxv = v
        return res_sw,res_sv

    def dp(lis, res_sw, res_sv, l):
        liss = [(0,0)]
        for v,w in lis:
            liss += [(sw+w,sv+v) for (sw,sv) in liss if sw+w <= l]
        ans = 0
        for sw,sv in liss:
            j = bisect.bisect_right(res_sw, l-sw)-1
            s = sv+res_sv[j]
            if ans < s:
                ans = s
        return ans

    n = I()
    g = [None]*(n+1)
    for i in range(1,n+1):
        v,w = LI()
        g[i] = (v,w)
    q = I()
    mem_sw = defaultdict(lambda : None)
    mem_sv = defaultdict(lambda : None)
    m = n.bit_length()>>1
    for _ in range(q):
        x,l = LI()
        bit = x
        lis = []
        while x:
            lis.append(g[x])
            x >>= 1
        h = len(lis)
        if h < m:
            print(dp_all(lis,l))
        else:
            bit &= (1<<h)-(1<<m)
            bit >>= m
            if mem_sw[bit] is None:
                mem_sw[bit],mem_sv[bit] = array(lis[-m:])
            print(dp(lis[:-m],mem_sw[bit],mem_sv[bit],l))
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    def dp_all(lis, l):
        res = [(0,0)]
        for v,w in lis:
            res += [(sv+v,sw+w) for (sv,sw) in res if sw+w <= l]
        return max(res)[0]

    def array(lis):
        res = [(0,0)]
        for v,w in lis:
            res += [(sw+w,sv+v) for (sw,sv) in res]
        res.sort(key = lambda x:(x[0],-x[1]))
        res_sw = []
        res_sv = []
        maxv = 0
        for i in range(len(res)):
            w,v = res[i]
            if v < maxv:
                continue
            res_sw.append(w)
            res_sv.append(v)
            maxv = v
        return res_sw,res_sv

    def dp(lis, res_sw, res_sv, l):
        liss = [(0,0)]
        for v,w in lis:
            liss += [(sw+w,sv+v) for (sw,sv) in liss if sw+w <= l]
        ans = 0
        for sw,sv in liss:
            j = bisect.bisect_right(res_sw, l-sw)-1
            s = sv+res_sv[j]
            if ans < s:
                ans = s
        return ans

    n = I()
    g = [None]*(n+1)
    for i in range(1,n+1):
        v,w = LI()
        g[i] = (v,w)
    q = I()
    mem_sw = defaultdict(lambda : None)
    mem_sv = defaultdict(lambda : None)
    m = n.bit_length()>>1
    for _ in range(q):
        x,l = LI()
        bit = x
        lis = []
        while x:
            lis.append(g[x])
            x >>= 1
        h = len(lis)
        if h < m:
            print(dp_all(lis,l))
        else:
            bit &= (1<<h)-(1<<m)
            if mem_sw[bit] is None:
                mem_sw[bit],mem_sv[bit] = array(lis[-m:])
            print(dp(lis[:-m],mem_sw[bit],mem_sv[bit],l))
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    N = int(input())
    I = [[int(i) for i in input().split()] for _ in range(N)]
    limit = min(N, 2 ** 9 - 1)
    lowerV = [[-1 for i in range(10 ** 5 + 1)] for _ in range(limit)]
    lowerV[0][0] = 0
    lowerV[0][I[0][1]] = I[0][0]
    for i in range(1, limit):
        nv, nw = I[i]
        for w in range(10 ** 5 + 1 - nw):
            if lowerV[(i - 1) // 2][w] > -1:
                lowerV[i][w] = max(lowerV[i][w], lowerV[(i-1)//2][w])
                lowerV[i][w+nw] = max(lowerV[i][w+nw], lowerV[(i-1)//2][w] + nv)
            
    for i in range(limit):
        for w in range(1, 10 ** 5 + 1):
            lowerV[i][w] = max(lowerV[i][w], lowerV[i][w-1])
        

    Q = int(input())
    Ans = [-1] * Q
    for q in range(Q):
        v, L = map(int, input().split())
        v -= 1
        if v < limit: Ans[q] = lowerV[v][L]
        else:
            Another = []
            count = 0
            while v >= limit:
                Another.append((I[v][0], I[v][1]))
                v = (v - 1) // 2
                count += 1
            for i in range(2 ** count):
                D = i
                av, aw = 0, 0
                for j in range(count):
                    if D % 2 == 1:
                        av += Another[j][0]
                        aw += Another[j][1]
                if aw <= L:
                    Ans[q] = max(Ans[q], av + lowerV[v][L - aw])
            
    print(*Ans, sep="\n")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    N = int(input())
    I = [[int(i) for i in input().split()] for _ in range(N)]
    limit = min(N, 2 ** 10 - 1)
    lowerV = [[-1 for i in range(10 ** 5 + 1)] for _ in range(limit)]
    lowerV[0][0] = 0
    lowerV[0][I[0][1]] = I[0][0]
    for i in range(1, limit):
        nv, nw = I[i]
        for w in range(10 ** 5 + 1 - nw):
            if lowerV[(i - 1) // 2][w] > -1:
                lowerV[i][w] = max(lowerV[i][w], lowerV[(i-1)//2][w])
                lowerV[i][w+nw] = max(lowerV[i][w+nw], lowerV[(i-1)//2][w] + nv)
            
    for i in range(limit):
        for w in range(1, 10 ** 5 + 1):
            lowerV[i][w] = max(lowerV[i][w], lowerV[i][w-1])
        

    Q = int(input())
    Ans = [-1] * Q
    for q in range(Q):
        v, L = map(int, input().split())
        v -= 1
        if v < limit: Ans[q] = lowerV[v][L]
        else:
            Another = []
            count = 0
            while v >= limit:
                Another.append((I[v][0], I[v][1]))
                v = (v - 1) // 2
                count += 1
            for i in range(2 ** count):
                D = i
                av, aw = 0, 0
                for j in range(count):
                    if D % 2 == 1:
                        av += Another[j][0]
                        aw += Another[j][1]
                if aw <= L:
                    Ans[q] = max(Ans[q], av + lowerV[v][L - aw])
            
    print(*Ans, sep="\n")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import sys,random,time,bisect
input=sys.stdin.buffer.readline

start=time.time()
N=int(input())
vw=[(-1,-1)]
for i in range(N):
    vw.append(tuple(map(int,input().split())))

dp=[[] for i in range(2**9)]
def make_dp(v):
    t=[[0,0] for i in range(15)]
    V=v
    id=0
    while v>=1:
        t[id]=vw[v]
        id+=1
        v//=2
    n=id
    temp=[[0,0] for i in range(2**n)]
    for i in range(n):
        for j in range(2**i,2**(i+1)):
            temp[j][0]=temp[j-2**i][0]+t[i][0]
            temp[j][1]=temp[j-2**i][1]+t[i][1]
    temp.sort(key=lambda x:x[1])
    for i in range(1,2**n):
        temp[i][0]=max(temp[i][0],temp[i-1][0])

    dp[V]=[0]*(10**5+1)
    for i in range(2**n-1):
        L=temp[i][1]
        R=temp[i+1][1]
        if L>=10**5:
            break
        elif R>10**5:
            R=10**5+1
        for j in range(L,R):
            dp[V][j]=temp[i][0]
    else:
        L=temp[-1][1]
        if L<=10**5:
            for j in range(L,10**5+1):
                dp[V][j]=temp[-1][0]

MAX=min(2**9,N+1)
for i in range(1,MAX):
    make_dp(i)

Q=int(input())
query=[[] for i in range(N+1)]
for i in range(Q):
    v,L=map(int,input().split())
    query[v].append((L,i))

ans=[0]*Q
temp=[[0,0] for i in range(2**9)]
t=[[0,0] for i in range(15)]
def solve(v):
    V=v
    id=0
    while v>=2**9:
        t[id]=vw[v]
        id+=1
        v//=2
    n=id
    for i in range(n):
        for j in range(2**i,2**(i+1)):
            temp[j][0]=temp[j-2**i][0]+t[i][0]
            temp[j][1]=temp[j-2**i][1]+t[i][1]

    for L,ID in query[V]:
        res=0
        for i in range(2**n):
            if L>=temp[i][1]:
                res=max(res,temp[i][0]+dp[v][L-temp[i][1]])
        ans[ID]=res

for i in range(1,N+1):
    if query[i]:
        solve(i)

for i in range(Q):
    print(ans[i])

Submission status: Wrong Answer

Solution code:
def examA():
    N = DI()/dec(7)
    ans = N
    print(N)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    N = I()
    n = N.bit_length()
    V = [0]*N; W = [0]*N
    for i in range(N):
        V[i], W[i] = LI()
    q = I()
    Q = [LI()for _ in range(q)]
    ans = [0]*q
    if N<1024:
        S = [[]for _ in range(N)]
        for i in range(N):
            key = i + 1
            cur = []
            while (key > 0):
                cur.append(key-1)
                key //= 2
            dp = {0: 0}
            for loop in range(1 << (len(cur))):
                value, weight = 0, 0
                for j in range(len(cur)):
                    if loop & (1 << j):
                        value += V[cur[j]]
                        weight += W[cur[j]]
                if weight in dp:
                    if dp[weight] < value:
                        dp[weight] = value
                else:
                    dp[weight] = value
            D = sorted(dp.items())
            #print(D)
            now = 0
            for j in range(len(D)):
                if now < D[j][1]:
                    now = D[j][1]
                else:
                    D[j] = [D[j][0],now]
            S[i] = D

        for i,[v,l] in enumerate(Q):
            D = S[v-1]
            for j in range(len(D))[::-1]:
                if D[j][0]<=l:
                    ans[i] = D[j][1]
                    break
        for v in ans:
            print(v)
        return


    half = 1<<9
    S = [[0]*(100001) for _ in range(half)]
    for i in range(half//2,half):
        key = i + 1
        cur = []
        while (key > 0):
            cur.append(key-1)
            key //= 2
        dp = {0: 0}
        for loop in range(1 << (len(cur))):
            value, weight = 0, 0
            for j in range(len(cur)):
                if loop & (1 << j):
                    value += V[cur[j]]
                    weight += W[cur[j]]
            if weight in dp:
                if dp[weight] < value:
                    dp[weight] = value
            else:
                dp[weight] = value
        D = sorted(dp.items())
        now = 0
        for j in range(len(D)):
            if now < D[j][1]:
                now = D[j][1]
            else:
                D[j] = [D[j][0],now]
        now = 0
        j = 0
        for s in range(100001):
            if j<len(D) and s==D[j][0]:
                now = D[j][1]
                j += 1
            S[i][s] = now

    for i,[v,l] in enumerate(Q):
        v -= 1
        key = v + 1
        if key<=512:
            cur = []
            while (key > 0):
                cur.append(key-1)
                key //= 2
            dp = {0: 0}
            for loop in range(1 << (len(cur))):
                value, weight = 0, 0
                for j in range(len(cur)):
                    if loop & (1 << j):
                        value += V[cur[j]]
                        weight += W[cur[j]]
                if weight in dp:
                    if dp[weight] < value:
                        dp[weight] = value
                else:
                    dp[weight] = value
            D = sorted(dp.items())
            if D[j][0] <= l:
                if ans[i]<D[j][1]:
                    ans[i] = D[j][1]
            continue
        cur = []
        while (key > 1024):
            cur.append(key-1)
            key //= 2
        cur.append(key-1)
        key = (key-1)//2
        k = len(cur)
        D2 = S[key]
        latter_W = [0] * (1 << k)
        latter_V = [0] * (1 << k)
        ans[i] = deepcopy(D2[l])
        for loop in range(1, 1<<k):
            a = loop & (-loop)
            b = loop.bit_length() - 1

            now_w = latter_W[loop-a] + W[cur[b]]

            now_v = latter_V[loop-a] + V[cur[b]]

            latter_W[loop] = now_w
            latter_V[loop] = now_v

            if now_w<=l:
                ans[i] = max(ans[i], D2[l - now_w] + now_v)

    for v in ans:
        print(v)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examE()

"""

        for weight,value in dp:
            if weight>l:
                continue
            now = l-weight
            if ans[i]<D2[now]+value:
                ans[i] = D2[now]+value
"""

Submission status: Wrong Answer

Solution code:
def examA():
    N = DI()/dec(7)
    ans = N
    print(N)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    N = I()
    n = N.bit_length()
    V = [0]*N; W = [0]*N
    for i in range(N):
        V[i], W[i] = LI()
    q = I()
    Q = [LI()for _ in range(q)]
    ans = [0]*q
    if N<1024:
        S = [[]for _ in range(N)]
        for i in range(N):
            key = i + 1
            cur = []
            while (key > 0):
                cur.append(key-1)
                key //= 2
            dp = {0: 0}
            for loop in range(1 << (len(cur))):
                value, weight = 0, 0
                for j in range(len(cur)):
                    if loop & (1 << j):
                        value += V[cur[j]]
                        weight += W[cur[j]]
                if weight in dp:
                    if dp[weight] < value:
                        dp[weight] = value
                else:
                    dp[weight] = value
            D = sorted(dp.items())
            #print(D)
            now = 0
            for j in range(len(D)):
                if now < D[j][1]:
                    now = D[j][1]
                else:
                    D[j] = [D[j][0],now]
            S[i] = D

        for i,[v,l] in enumerate(Q):
            D = S[v-1]
            for j in range(len(D))[::-1]:
                if D[j][0]<=l:
                    ans[i] = D[j][1]
                    break
        for v in ans:
            print(v)
        return


    half = 1<<9
    S = [[0]*(100001) for _ in range(half)]
    for i in range(half//2,half):
        key = i + 1
        cur = []
        while (key > 0):
            cur.append(key-1)
            key //= 2
        dp = {0: 0}
        for loop in range(1 << (len(cur))):
            value, weight = 0, 0
            for j in range(len(cur)):
                if loop & (1 << j):
                    value += V[cur[j]]
                    weight += W[cur[j]]
            if weight in dp:
                if dp[weight] < value:
                    dp[weight] = value
            else:
                dp[weight] = value
        D = sorted(dp.items())
        now = 0
        for j in range(len(D)):
            if now < D[j][1]:
                now = D[j][1]
            else:
                D[j] = [D[j][0],now]
        now = 0
        j = 0
        for s in range(100001):
            if j<len(D) and s==D[j][0]:
                now = D[j][1]
                j += 1
            S[i][s] = now

    for i,[v,l] in enumerate(Q):
        v -= 1
        key = v + 1
        if key<=512:
            cur = []
            while (key > 0):
                cur.append(key-1)
                key //= 2
            dp = {0: 0}
            for loop in range(1 << (len(cur))):
                value, weight = 0, 0
                for j in range(len(cur)):
                    if loop & (1 << j):
                        value += V[cur[j]]
                        weight += W[cur[j]]
                if weight in dp:
                    if dp[weight] < value:
                        dp[weight] = value
                else:
                    dp[weight] = value
            D = sorted(dp.items())
            if D[j][0] <= l:
                if ans[i]<D[j][1]:
                    ans[i] = D[j][1]
            continue
        cur = []
        while (key > 512):
            cur.append(key-1)
            key //= 2
        k = len(cur)
        D2 = S[key - 1]
        latter_W = [0] * (1 << k)
        latter_V = [0] * (1 << k)
        ans[i] = deepcopy(D2[l])
        for loop in range(1, 1<<k):
            a = loop & (-loop)
            b = loop.bit_length() - 1

            now_w = latter_W[loop-a] + W[cur[b]]

            now_v = latter_V[loop-a] + V[cur[b]]

            latter_W[loop] = now_w
            latter_V[loop] = now_v

            if now_w<=l:
                ans[i] = max(ans[i], D2[l - now_w] + now_v)


    for v in ans:
        print(v)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examE()

"""

        for weight,value in dp:
            if weight>l:
                continue
            now = l-weight
            if ans[i]<D2[now]+value:
                ans[i] = D2[now]+value
"""

Submission status: Wrong Answer

Solution code:
def examA():
    N = DI()/dec(7)
    ans = N
    print(N)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    N = I()
    n = N.bit_length()
    V = [0]*N; W = [0]*N
    for i in range(N):
        V[i], W[i] = LI()
    q = I()
    Q = [LI()for _ in range(q)]
    ans = [0]*q
    if N<1024:
        S = [[]for _ in range(N)]
        for i in range(N):
            key = i + 1
            cur = []
            while (key > 0):
                cur.append(key-1)
                key //= 2
            dp = {0: 0}
            for loop in range(1 << (len(cur))):
                value, weight = 0, 0
                for j in range(len(cur)):
                    if loop & (1 << j):
                        value += V[cur[j]]
                        weight += W[cur[j]]
                if weight in dp:
                    if dp[weight] < value:
                        dp[weight] = value
                else:
                    dp[weight] = value
            D = sorted(dp.items())
            #print(D)
            now = 0
            for j in range(len(D)):
                if now < D[j][1]:
                    now = D[j][1]
                else:
                    D[j] = [D[j][0],now]
            S[i] = D

        for i,[v,l] in enumerate(Q):
            D = S[v-1]
            for j in range(len(D))[::-1]:
                if D[j][0]<=l:
                    ans[i] = D[j][1]
                    break
        for v in ans:
            print(v)
        return


    half = 1<<9
    S = [[0]*(100001) for _ in range(half)]
    for i in range(half//2,half):
        key = i + 1
        cur = []
        while (key > 0):
            cur.append(key-1)
            key //= 2
        dp = {0: 0}
        for loop in range(1 << (len(cur))):
            value, weight = 0, 0
            for j in range(len(cur)):
                if loop & (1 << j):
                    value += V[cur[j]]
                    weight += W[cur[j]]
            if weight in dp:
                if dp[weight] < value:
                    dp[weight] = value
            else:
                dp[weight] = value
        D = sorted(dp.items())
        now = 0
        for j in range(len(D)):
            if now < D[j][1]:
                now = D[j][1]
            else:
                D[j] = [D[j][0],now]
        now = 0
        j = 0
        for s in range(100001):
            if j<len(D) and s==D[j][0]:
                now = D[j][1]
                j += 1
            S[i][s] = now

    for i,[v,l] in enumerate(Q):
        v -= 1
        key = v + 1
        if key<=512:
            cur = []
            while (key > 0):
                cur.append(key-1)
                key //= 2
            dp = {0: 0}
            for loop in range(1 << (len(cur))):
                value, weight = 0, 0
                for j in range(len(cur)):
                    if loop & (1 << j):
                        value += V[cur[j]]
                        weight += W[cur[j]]
                if weight in dp:
                    if dp[weight] < value:
                        dp[weight] = value
                else:
                    dp[weight] = value
            D = sorted(dp.items())
            if D[j][0] <= l:
                if ans[i]<D[j][1]:
                    ans[i] = D[j][1]
            continue
        cur = []
        while (key > 512):
            cur.append(key-1)
            key //= 2
        k = len(cur)
        D2 = S[key - 1]
        latter_W = [0] * (1 << k)
        latter_V = [0] * (1 << k)
        ans[i] = deepcopy(D2[l])
        for loop in range(1, 1<<k):
            a = loop & (-loop)
            b = loop.bit_length() - 1

            now_w = latter_W[loop-a] + W[cur[b]]

            now_v = latter_V[loop-a] + V[cur[b]]

            #latter_W[i] = now_w
            #latter_V[i] = now_v

            #if now_w<=l:
            #    ans[i] = max(ans[i], D2[l - now_w] + now_v)


    for v in ans:
        print(v)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examE()

"""

        for weight,value in dp:
            if weight>l:
                continue
            now = l-weight
            if ans[i]<D2[now]+value:
                ans[i] = D2[now]+value
"""