StellarSpecter's blog

DONT CLICK IF YOU'RE <=1400 rating
By StellarSpecter, history, 5 months ago, In English

Help me solve this problem please ->

**** **** There is an array of n elements, initially filled with zeros. You need to write a data structure that processes two types of queries: assign value v to all elements on the segment from l to r−1, find the sum on the segment from l to r−1.

Input

The first line contains two numbers n and m (1≤n, m≤100000), the size of the array and the number of operations. The following lines contain the description of the operations. The description of each operation is as follows: 1 l r v: assign value v to all elements on the segment from l to r−1 (0≤l<r≤n, 0≤v≤109). 2 l r: find the sum on the segment from l to r−1 (0≤l<r≤n).

Output

For each operation of the second type, print the corresponding value.

  • Vote: I like it
  • -35
  • Vote: I do not like it

»
5 months ago, # |
  Vote: I like it +1 Vote: I do not like it

This title is ratism

→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Title increased this blog's both <=1400 & >1400 click through count, But the problem is no one will post comments related to the question lol

    → Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

i barley make the cut but it can be solved with a segment tree and btw its to early to learn it

→ Reply
  • »
    »
    5 months ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Please it's too hard for me to understand. Can you write the code or approach ? Also why is it early? Any help?

    → Reply
    • »
      »
      »
      5 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      its a advanced technique i think its too early for you to learn it

      → Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

So you can't click on this blog, right?

→ Reply