| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 7 초 | 2048 MB | 28 | 17 | 16 | 59.259% |
In a high-tech industrial facility, a series of nuclear reactors are arranged in a linear configuration. Each reactor operates under strict pressure regulations to ensure safety and efficiency. To prevent critical failures, each reactor has a specific maximum pressure limit. When a reactor’s internal pressure reaches or exceeds this limit, a controlled pressure release (venting) is initiated. This system requires sophisticated management due to dynamic operational adjustments and the need for continuous monitoring.
You are tasked with designing and implementing a system to manage the pressure of a line of $n$ reactors. Each reactor, indexed from 1ドル$ to $n,ドル has an initial maximum pressure limit $p_i$. All of the reactors’ initial pressure are 0ドル$. The system must support two types of operations:
The first line contains two integers $n$ and $q,ドル representing the number of reactors and the number of operations, respectively.
The second line contains $n$ integers, the $i$-th integer $p_i$ represents the initial maximum pressure limit of the $i$-th reactor.
The following $q$ lines describe the operations. Each line begins with an integer $op$.
For each query that $op = 2,ドル print a single integer on a new line, representing the total number of venting operations that have occurred among all reactors within the specified range since the beginning of the system’s operation.
10 5 5 10 23 45 10 45 65 10 68 9 1 5 10 664 1 2 9 5 2 4 10 1 8 8 5 2 1 10
8 9
10 10 79 26 9 28 13 40 26 54 69 19 1 1 5 6 1 5 7 2 2 4 7 1 9 10 19 2 5 7 1 5 7 27 2 10 10 2 9 9 1 6 6 20 1 3 8 6
0 0 1 0
10 10 56 29 49 42 47 21 23 54 8 31 2 9 9 1 5 6 23 2 6 7 2 4 7 1 5 6 68 2 1 9 2 3 6 1 2 10 89 2 6 8 1 3 6 53
0 1 1 3 3 5
ICPC > Regionals > Asia Pacific > Taiwan > Taiwan Online Programming Contest > TOPC 2025 I번