8641: DSL_2_F : RMQ and RUQ
[Creator : ]
Description
Write a program which manipulates a sequence A = {$a_0,a_1,...,a_{n−1}$} with the following operations:
- update(s,t,x): change $a_s, a_{s+1}, ..., a_t$ to x.
- find(s,t): report the minimum element in $a_s, a_{s+1}, ..., a_t$.
Note that the initial values of $a_i\ (i=0,1,...,n−1)$ are $2^{31}-1$.
Input
In the first line, n (the number of elements in A) and q (the number of queries) are given.
Then, ith query queryi is given in the following format:
0 s t x
or
1 s t
The first digit represents the type of the query. '0' denotes update(s,t,x) and '1' denotes find(s,t).
Output
For each find operation, print the minimum value.
Constraints
$1≤n≤100,000$
$1≤q≤100,000$
$0≤s≤t<n$
$0≤x<2^{31}−1$
$1≤q≤100,000$
$0≤s≤t<n$
$0≤x<2^{31}−1$
Sample 1 Input
3 5
0 0 1 1
0 1 2 3
0 2 2 2
1 0 2
1 1 2
Sample 1 Output
1
2
Sample 2 Input
1 3
1 0 0
0 0 0 5
1 0 0
Sample 2 Output
2147483647
5