update segment tree tests

content/Contest/template.cpp

@@ -1,32 +1,28 @@
 /*8<{==========~ BEGIN TEMPLATE ~============>8*/
 #include <bits/stdc++.h>
 using namespace std;
-
 #ifdef LOCAL
 #include "debug.cpp"
 #else
 #define dbg(...)
 #endif
-
 #define endl '\n'
-
 #define fastio                  \
   ios_base::sync_with_stdio(0); \
   cin.tie(0);
-
 #define int long long
-
 #define all(j) j.begin(), j.end()
 #define rall(j) j.rbegin(), j.rend()
 #define len(j) (int)j.size()
 #define rep(i, a, b)                           \
   for (common_type_t<decltype(a), decltype(b)> \
-           i = a;                              \
-       i < b; i++)
+           i = (a);                              \
+       i < (b); i++)
 #define rrep(i, a, b)                          \
   for (common_type_t<decltype(a), decltype(b)> \
-           i = a;                              \
-       i > b; i--)
+           i = (a);                              \
+       i > (b); i--)
+#define trav(a,x) for (auto& a : x)
 #define pb push_back
 #define pf push_front
 #define ppb pop_back
@@ -35,7 +31,8 @@ using namespace std;
 #define lb lower_bound
 #define ub upper_bound
 #define emp emplace
-
+#define ins insert
+#define divc(a,b) ((a)+(b)-1ll)/(b)
 using str = string;
 using ll = long long;
 using ull = unsigned long long;
@@ -49,14 +46,11 @@ using pii = pair<int, int>;
 using vpii = vector<pii>;
 using vc = vector<char>;
 using vs = vector<str>;
-
 template <typename T>
-using min_heap =
+using pqmn =
     priority_queue<T, vector<T>, greater<T>>;
-
 template <typename T>
-using max_heap = priority_queue<T, vector<T>>;
-
+using pqmx = priority_queue<T, vector<T>>;
 template <typename T, typename U>
 inline bool chmax(T &a, U const &b) {
   return (a < b ? a = b, 1 : 0);