More exhaustive template for Codeforces

Code Templates/Codeforces.cpp

@@ -1,31 +1,45 @@
 #include <bits/stdc++.h>
 using namespace std;
 
-typedef long long ll;
-
-#define M 1000000007
-#define PI 3.1415926
 
-#define pb push_back
+typedef long long ll;
+typedef pair<int,int> ii;
+typedef vector<int> vi;
+typedef vector<ii> vii;
+typedef vector<long long int> vll;
+typedef vector<char> vc;
+typedef long double ld;
+
+typedef set<int>::iterator sit;
+typedef map<int,int>::iterator mit;
+typedef vector<int>::iterator vit;
+typedef vector<long long int>::iterator vllit;
+
+const int INF = 1e9 + 7;
+const int MOD = 1e9 + 7;
+const int MAXN = 1e6 + 3;
+
+#define _  %  MOD
+#define __ %= MOD
+
+#define      each(it,s)        for(vit it = s.begin(); it != s.end(); ++it)
+#define      sortA(v)          sort(v.begin(), v.end())
+#define      sortD(v)          sort(v.begin(), v.end(), greater<auto>())
+#define      fill(a)           memset(a, 0, sizeof (a))
+
+#define      rep(i, n)         for(int i = 0; i < (n); ++i)
+#define      repA(i, a, n)     for(int i = a; i <= (n); ++i)
+#define      repD(i, a, n)     for(int i = a; i >= (n); --i)
+#define 	 pq(x)			   priority_queue<x,std::vector<x>,compare>
+#define 	 rpq(x)			   priority_queue<x,std::vector<x>,compare>
+#define fi first
+#define se second
 #define mp make_pair
+#define pb push_back
 
-#define ff first
-#define ss second
-
-#define all(v) v.begin(),v.end()
-
-#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
-
-#define forf(x,n) for(int x = 0; x < n; ++x)
-#define forb(x,n) for(int x = n-1; x >= 0; --x)
-
-#define itr(c,it) for( auto it = c.begin(); it != c.end(); ++it)
-
-typedef priority_queue <int> pq;
-
-int main()
-{
-	fastio;
-
-	return 0;
-}
+#define fbo find_by_order
+#define ook order_of_key
+/*
+ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    */