Submission details
Task:Dynamic Range Minimum Queries
Sender:aalto26dh_007
Submission time:2026-09-21 10:09:53 +0300
Language:C++ (C++23)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#2--details

Code

#include <iostream>
#include <vector>
#include <string>
#include <format>
#include <algorithm>


int main (int argc, char **argv) {

    int n, q;
    std::cin >> n >> q;

    std::vector<int> numbers;
    numbers.reserve(n);
    for (int i=0; i<n; i++) {
        int num;
        std::cin >> num;

        numbers.push_back(num);
    }

    //std::cout << std::format("{}", numbers) << std::endl;

    std::string result;
    for (int i=0; i<q; i++) {
        int t, a, b;
        std::cin >> t >> a >> b;
        
        if (t == 1) {
            numbers.at(a-1) = b;
        } else {
            a--;
            b--;
            std::vector<int> subvector (numbers.begin() + a, numbers.begin() + b);
            std::sort(subvector.begin(), subvector.end());
            result = result + std::to_string(subvector.front()) + '\n';
        }
    }

    std::cout << result << std::endl;


    return 0;
}

Test details

Test 1

Verdict:

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
(empty)

Test 2

Verdict:

input
200000 200000
398739055 65343131 699208332 3...

correct output
28609
129890
20378
20378
311522
...

user output
(empty)