C++実装テンプレート

#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
#include<utility>
using namespace std;

#define mind(a,b) ((a)>(b)?(b):(a))
#define maxd(a,b) ((a)>(b)?(a):(b))
#define absd(x) ((x)<0?-(x):(x))
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<(n); ++i)
#define repr(i,n) for(int i=(n)-1; i>=0; --i)
#define repl(i,s,n) for(int i=(s); i<=(n); ++i)
#define replr(i,s,n) for(int i=(n); i>=(s); --i)
#define repf(i,s,n,j) for(int i=(s); i<=(n); i+=(j))
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<(n); ++i) cout << (val) << " "; cout << endl;
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

typedef int pairType;
typedef pair<pairType, pairType> P;
typedef pair<P, pairType> PI;
typedef pair<pairType, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;

int main() {
  return 0;
}