Submission #67143716

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import collections
def solve_alt():
    n = int(input())
    s = list(map(int, input().split()))
    nds = sorted([(s[i], i) for i in range(n)])
    dst = [-1] * n
    cur_q = collections.deque([0])
    dst[0] = 1
    unv_ptr = 0
    pth_len = 1
    while cur_q:
        if dst[n - 1] != -1:
            break
        max_pwr = 0
        for u_idx in cur_q:
            max_pwr = max(max_pwr, 2 * s[u_idx])
        nxt_q = collections.deque()
        while unv_ptr < n and nds[unv_ptr][0] <= max_pwr:
            v_siz, v_idx = nds[unv_ptr]
            if dst[v_idx] == -1:
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import collections

def solve_alt():
    n = int(input())
    s = list(map(int, input().split()))
    nds = sorted([(s[i], i) for i in range(n)])
    dst = [-1] * n
    cur_q = collections.deque([0])
    dst[0] = 1
    unv_ptr = 0
    pth_len = 1
    while cur_q:
        if dst[n - 1] != -1:
            break
        max_pwr = 0
        for u_idx in cur_q:
            max_pwr = max(max_pwr, 2 * s[u_idx])
        nxt_q = collections.deque()
        while unv_ptr < n and nds[unv_ptr][0] <= max_pwr:
            v_siz, v_idx = nds[unv_ptr]
            if dst[v_idx] == -1:
                dst[v_idx] = pth_len + 1
                nxt_q.append(v_idx)
            unv_ptr += 1
        cur_q = nxt_q
        pth_len += 1
    print(dst[n - 1])

t = int(input())
for _ in range(t):
    solve_alt()

Submission Info

Judge Result