""" A prince is on a mission to save the princess. On the way, there is a circular track with N dungeons. Each dungeon has a dragon, which can be defeated with an energy Ai. Each dungeon also has an vessel with an energy drink, whose energy level is Bi kept for consumption. In order to save the princess, the prince has to defeat all the dragons. The prince can chose which dungeon to start from. Note: 1. The prince cannot defeat a dragon if his current energy level is less than the energy required to kill a dragon. 2. The prince uses only minimum amount of energy to defeat the dragon, and carries the rest with him. 3. The prince is so exhausted in the search for the princess, that when he reaches the circular track his energy level is 0. 4. Once the prince enters the circular track, he can advance only in forward direction in order to kill the next dragon. Input Format: First line of input contains T - number of test cases. Its followed by 3T lines. 1. First line contains N - the number of dungeons. 2. Second line contains N integers - the amount of energy required to defeat the dragon, starting from the 1st dungeon. 3. Third line contains N integers - the amount of energy in the vessel, starting from the 1st dungeon. Constraints: 1 <= T <= 10 1 <= N <= 1000 1 <= Ai, Bi <= 1000 1 <= T <= 10 1 <= N <= 100000 1 <= Ai, Bi <= 1000 Output Format: For each test case, print the dungeon number starting at which, the prince can defeat all the dragons. If there are multiple possible answers, print the smallest number. If the prince cannot defeat the dragons, print -1. Sample Input: 3 3 1 5 7 2 6 3 4 5 10 12 4 20 2 1 15 3 7 10 6 8 9 7 Sample Output: -1 4 1 """ T = int(input()) while T: N = int(input()) A = list(map(int, input().split(' '))) B = list(map(int, input().split(' '))) """ print('N:', N) print('A:', A) print('B:', B) """ dungeons = [int(x) for x in range(N)] path = None """ print("Dungeons:", dungeons) print("Possibilities:", possibilities) """ start = 0 #print("Start:", start) while start < N: newPath = dungeons[start:] if start != 0: newPath += dungeons[0: start] #print("NEW PATH:", newPath) energy = 0 #print("Energy:", energy) for i in newPath: """ print("Dungeon", i) print("Energy Needed (A[%d]):" % i, A[i], "Energy Boost (B[%d]):" % i, B[i]) """ energy += B[i] #print("Energy:", energy) if energy < A[i]: #print("Insufficient Energy... Breaking and creating a new path") break else: #print("Dungeon's Dragon was defeated...") energy -= A[i] #print("Energy Left:", energy) else: #print("PATH CLEARED!") path = start + 1 #print("Possibilities:", possibilities) if path is not None: break start += 1 if path is not None: print(path) else: print(-1) T -= 1

Dragon Game [CP Challenge]