DMOJ - Time Traveller Imaxblue

Process portals and queries in reverse order of time. Maintain a priority queue at each vertex. Whenever we see a portal, add to each of the portals along its centroid path.

Time Complexity: $\mathcal{O}((N+Q)\log N+M{\log }^{2}N)$

Memory Complexity: $\mathcal{O}((N+M)\log N+Q)$

1#include <bits/stdc++.h>
2using namespace std;
3 
4using ll = long long;
5using ld = long double;
6using db = double; 
7using str = string; // yay python!
8
9using pi = pair<int,int>;
10using pl = pair<ll,ll>;