/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 16ms 3.062 MiB
#2 Accepted 439ms 7.27 MiB
#3 Time Exceeded ≥1090ms ≥7.227 MiB
#4 Time Exceeded ≥1081ms ≥7.238 MiB
#5 Time Exceeded ≥1064ms ≥12.688 MiB
#6 Time Exceeded ≥1091ms ≥12.754 MiB

Code

N = int(input())
A = list(map(int, input().split()))
Q = int(input())
queries = [int(input()) for _ in range(Q)]

min_value = float('inf')
min_index = -1

for i in range(N):
    if A[i] < min_value:
        min_value = A[i]
        min_index = i

for X in queries:
    print(min_index + 1)
    A[min_index] = X
    min_value = float('inf')
    for i in range(N):
        if A[i] < min_value:
            min_value = A[i]
            min_index = i

Information

Submit By
Type
Submission
Problem
P1086 KuZ the Position
Contest
Bangladesh 2.0
Language
Python 3 (Python 3.12.3)
Submit At
2024-08-16 15:57:10
Judged At
2024-10-03 13:29:19
Judged By
Score
20
Total Time
≥1091ms
Peak Memory
≥12.754 MiB