头文件定义

 1 #include <string>
 2 #include <vector>
 3 #include <algorithm>
 4 #include <numeric>
 5 #include <set>
 6 #include <map>
 7 #include <queue>
 8 #include <iostream>
 9 #include <sstream>
10 #include <cstdio>
11 #include <cmath>
12 #include <ctime>
13 #include <cstring>
14 #include <cctype>
15 #include <cassert>
16 #include <limits>
17 #include <functional>
18 #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
19 #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
20 #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
21 #if defined(_MSC_VER) || __cplusplus > 199711L
22 #define aut(r,v) auto r = (v)
23 #else
24 #define aut(r,v) __typeof(v) r = (v)
25 #endif
26 #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
27 #define all(o) (o).begin(), (o).end()
28 #define pb(x) push_back(x)
29 #define mp(x,y) make_pair((x),(y))
30 #define mset(m,v) memset(m,v,sizeof(m))
31 #define INF 0x3f3f3f3f
32 #define INFL 0x3f3f3f3f3f3f3f3fLL
33 using namespace std;
34 typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
35 template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
36 template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
37 
38 int main() {
39     
40     return 0;
41 }