DMOJ - Fluid Dynamics

Time Complexity: $\mathcal{O}(S\sqrt{S\log S})$, where $S=N+Q$.

Maintain a linked list of convex hulls of size $BLOCK \approx \sqrt{S\log S}$ each. Each update and query takes $\mathcal{O}(\sqrt{S\log S})$ time. TL is pretty tight ...

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;