Submission #3424348

---

Source Code Expand

import sys
stdin = sys.stdin

sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())


k = ni()
a = list(li())

a = a[::-1]
b = [a[0]]

for i in range(k-1):
    cur = a[i+1]
    while b[i] > cur:
        cur += cur
    
    b.append(cur)
    
        
exist = True
mn = float("inf")
mx = 0

# 判定
if a[0] != 2:
    exist = False
    
else:
    for i in range(k-1):
        if a[i+1] > 2*a[i] - 1:
            exist = False
            break
        
if exist:
    print(b[-1], b[-1] + (a[-1] - 1))
else:
    print(-1)

Submission Info

Judge Result