Freaks City

The following reusable segment tree implementation uses 0-based indexing with half-open intervals [l, r). It supports point assignment, point addition, range queries, and methods to locate the first or last endex satisfying a custom predicate. #include <bits/stdc++.h> template<typename Info> struct SegmentTree { int size = 0; ...

Problem A Problem Statement: Taro avoids stomach illness if he eats food that expired no more then X days ago, and finds unexpired food delicious; expired food beyond X days causes illness. He bought a bag of food today with A days left until expiration and plans to eat it B days later. Determine his state: delicious, safe, or dangerous. Approa ...