Freaks City

A. Points in Segments An approach with a time complextiy of $ \mathcal{O}(n \times m) $ works well for small data ranges. The idea is to mark each point within the given intervals and then count how many points are not marked. #include <bits/stdc++.h> #define int long long using namespace std; signed main() { ios::sync_with_stdio(f ...