祖传头文件(更新)
祖传头文件(更新)
/** /*@author Victor /*language C++ */ //#include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> //#include<map> #include<set> //#define DEBUG #define RI register int using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; #define pii pair<int,int> #define pll pair<ll,ll> #define pil pair<int , ll> #define pli pair<ll,int> #define pdl pair<double,ll> #define pld pair<ll,double> #define pdd pair<double,double> #define iput(n) scanf("%d",&n) #define iiput(a,n) scanf("%d%d",&a,&n) #define iiiput(a,b,c) scanf("%d%d%d",&a,&b,&c) #define dput(n) scanf("%lf",&n) #define llput(n) scanf("%lld",&n) #define cput(n) scanf("%s",n) #define puti(n) printf("%d\n",n) #define putll(n) printf("%lld\n",n) #define putd(n) printf("%lfd\n",n) #define _cls(n) memset(n,0,sizeof(n)) #define __cls(n) memset(n,INF,sizeof(n)) #define lc rt << 1 #define rc rt <<1|1 //priority_queue <int,vector<int>,greater<int> > Q;//优先队列递增 //priority_queue<int>Q;//递减 //map<ll,ll>mp; //set<ll>st; //stack<>st; //queue<>Q; #define F first #define S second #define pb push_back #define PB push_back #define MP make_pair #define ALL(x) begin(x), end(x) #define SZ(x) (int)(x).size() /***********************************************/ //加速输入挂 # define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0) # define FOR(i,a,n) for(int i=a; i<=n; ++i) //求二进制中1的个数 //__builtin_popcount(n); //求2^k //#define (ll)Pow(2,k) (1LL<<k) #define to_1(n) __builtin_popcount(n) //树状数组 #define lowbit(x) (x&-x) //#ifdef DEBUG #define fin freopen("input.in", "r", stdin) #define fout freopen("output.out", "w", stdout); //#endif //手动扩栈 #pragma comment(linker,"/STACK:102400000,102400000")