Weekly Contest 6: BIT and Segment Tree
Welcome to the sixth 2023-24 Weekly Contest!
Before writing the contest, please ensure you have completed this week's attendance, found here.
This week's contest will feature 5 problems on Binary-Indexed Tree and Segment Tree. Before writing the contest, you may wish to check out the faq and tips pages.
The contest will run until next week's competitive lesson. During this time frame, you can join the contest anytime and solve the questions. You can also leave the contest and your submissions won't be lost. Some problems offer partial marks in the form of subtasks, solve these for those extra points!
Number of problems: 5, full feedback (you will see the results of your submissions instantly).
Feel free to refer to our BIT and Segment Tree slides, found here.
Problems
| Problem | Points | AC Rate | Users |
|---|---|---|---|
| A Range Update Problem | 7 | 23.2% | 48 |
| Fired | 10 | 18.4% | 5 |
| Component Sum | 12p | 43.9% | 15 |
| Maintaining a Sequence | 12p | 27.2% | 31 |
| Segment Tree Test | 15 | 33.3% | 1 |
Comments