Guys does this problem required Segment Tree Beats to solve it ?↵
================================================================↵
↵
Given an array of size n <= 10^5 initially filed with zeros, answer two types of queries:↵
↵
1 A B C : Perform the following operation arr[i] = max(arr[i],C) , where i = A (MOD B) and 1 <= i <= n .↵
↵
2 I : Print value arr[I] .↵
↵
Constraints : ↵
1 <= A < B <= N and C <= 10^9↵
↵
1 <= I <= N .↵
↵
1 <= n , q <= 10^5 .↵
↵
================================================================↵
↵
Given an array of size n <= 10^5 initially filed with zeros, answer two types of queries:↵
↵
1 A B C : Perform the following operation arr[i] = max(arr[i],C) , where i = A (MOD B) and 1 <= i <= n .↵
↵
2 I : Print value arr[I] .↵
↵
Constraints : ↵
1 <= A < B <= N and C <= 10^9↵
↵
1 <= I <= N .↵
↵
1 <= n , q <= 10^5 .↵
↵
