//#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <sstream> //stringstream
#include <iomanip> //cout输出小数格式
#include <utility> //pair
#include <bitset> //bitset
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>
#include <cstdlib>
#include <climits> //limit
#include <cstdio>
#include <cmath>
using namespace std;
#define rep(i,a,n) for(int i=a;i< n;++i)
#define rrep(i,a,n) for(int i=n;i>=a;--i)
#define reps(i,a,n) for(int i=a;i<=n;++i)
#define W(a) while(a)
#define met(a,b) memset(a, b, sizeof(a));
#define IN freopen("in.txt", "r", stdin);
#define OT freopen("out.txt", "w", stdout);
#define pb push_back
#define mp make_pair
#define fastio iostream::sync_with_stdio(false);cin.tie(0);cout.tie(0);
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }
static const int DX[] = { 1, 0, -1, 0, 1, -1, 1, -1};
static const int DY[] = { 0, 1, 0, -1, 1, -1, -1, 1};
typedef unsigned long long uLL;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef vector<int> VI;
const double pi = acos(-1.0);
const double eps = 1e-8;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const LL mod = 1000000007;
const int maxn = 1e5 + 100;
const int maxm = 100;
/*==================================================*/
50行头文件+宏:acm专用 -- 初级版
最新推荐文章于 2021-11-23 21:11:01 发布