| Task: | Dynamic Range Minimum Queries |
| Sender: | banghalq |
| Submission time: | 2025-09-18 17:08:00 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.04 s | details |
| #2 | TIME LIMIT EXCEEDED | -- | details |
Code
n,q = [int(x) for x in input().split()]
array = [int(x) for x in input().split()]
solution = []
for _ in range(q):
indic, k, u = [int(x) for x in input().split()]
if indic == 1:
array[k-1] = u
else:
solution.append(min(array))
for elt in solution:
print(elt)
Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 8 80 7 6 4 6 2 9 4 8 2 1 1 2 1 2 2 1 3 ... |
| correct output |
|---|
| 7 6 4 4 2 ... |
| user output |
|---|
| 2 2 2 2 2 ... Truncated |
Test 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 200000 398739055 65343131 699208332 3... |
| correct output |
|---|
| 28609 129890 20378 20378 311522 ... |
| user output |
|---|
| (empty) |
