Educational Segment Tree Contest - ITMIX

View as PDF
Submit solution
Points: 0.50
Time limit: 2.0s
Memory limit: 256M
Input: stdin
Output: stdout
Problem source:
Educational Segment Tree Contest - Anh Nguyên
Problem type
Allowed languages
C, C++, Go, Java, Kotlin, Pascal, PyPy, Python, Rust, Scratch

In case the statement didn't load correctly, you can download the statement here: Statement

Comments

Please read the guidelines before commenting.


  • 6
    CBNK28_XUANTHAO  commented on July 24, 2022, 3:10 p.m.

    cách giải khác thay vì dùng IT

    sử dụng thuật toán chia căn và 3 mảng lazy update các căn đó tương ứng cho các truy vấn 1,2,3

    độ phức tạp : m*sqrt(n)


  • -7
    dajunctic  commented on Jan. 17, 2022, 2:55 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • -5
    huynguyen  commented on Dec. 21, 2021, 2:15 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


    • 6
      YugiHackerKhongCopCode  commented on Dec. 21, 2021, 3:49 p.m.

      Chắc là không vì truy vấn 4 phải mod rồi


      • -4
        huynguyen  commented on Dec. 21, 2021, 4:48 p.m.

        Vâng ạ, E AC rồi, không cần dùng số lớn ạ!