Segment Tree Test

View as PDF

Points: 15 (partial)
Time limit: 5.0s
Memory limit: 256M

Problem type

Xyene is doing a contest. He comes across the following problem:

You have an array of elements, indexed from to . There are operations you need to perform on it.

Each operation is one of the following:

• C x v Change the -th element of the array to .
• M l r Output the minimum of all the elements from the -th to the -th index, inclusive.
• G l r Output the greatest common divisor of all the elements from the -th to the -th index, inclusive.
• Q l r Output the number of numbers equal to the result of the operation G l r from all the elements from the -th to the -th index, inclusive.

At any time, every element in the array is between and (inclusive).

Xyene knows that one fast solution uses a Segment Tree. He practices that data structure every day, but still somehow manages to get it wrong. Will you show him a working example?

Input Specification

The first line has and .

The second line has integers, the original array.

The next lines each contain an operation in the format described above.

Output Specification

For each M, G, or Q operation, output the answer on its own line.

Sample Input 1

5 5
1 1 4 2 8
C 2 16
M 2 4
G 2 3
C 2 1
Q 1 5

Sample Output 1

2
4
2

Sample Input 2

5 2
1 1 2 2 2
Q 1 4
Q 3 5

Sample Output 2

2
3

• abcConjecture  commented on Feb. 6, 2018, 5:46 p.m. edited

I've been experiencing some erratic runtimes. One of my submissions received 90/100 (and passed Case 12 in about 2.5 seconds), but submitting the same code later yielded 60/100. Do I need to optimize my code in any way?

• 0xc3  commented on Oct. 22, 2017, 10:56 a.m.

Does a solution with a time complexity of not work, or why is my solution TLEing?

• eric574  commented on May 18, 2017, 10:56 p.m.

Why does UTSJoey's submission have 0 bytes?

• Plasmatic  commented on Oct. 6, 2018, 11:00 p.m.

it's probably a bug