模板-开始

存放一些代码的缺省源,IO优化。
-尚未完工-


1、缺省源1(快速)

#include <bits/stdc++.h>
using namespace std;
	//-------------define--------------
//#define int long long
typedef long long ll;
typedef unsigned long long ull;
const int INF=0x3f3f3f3f;
const ll LLINF=0x3f3f3f3f3f3f3f3f;
const int MINF=0x3f;
const int NINF=0xc0c0c0c0;
const ll LLNINF=0xc0c0c0c0c0c0c0c0;
const int MNINF=0xc0;
const double PI=acos(-1);
#define Mem0(a) memset(a,0,sizeof(a))
#define MemINF(a) memset(a,MINF,sizeof(a))
#define MemNINF(a) memset(a,MNINF,sizeof(a))
#define MemN1(a) memset(a,-1,sizeof(a))
	//-------------vector--------------
typedef vector<int> vii;
typedef vector<int>::iterator vit;
//#define push_back PB
	//-------------quick IO--------------
int read()
{
	unsigned n=0; int f=1; char ch;
	for(ch=getchar();ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar()) n=(n<<3)+(n<<1)+(ch^48);
	return f*n;
}
ll readll()
{
	ull n=0; ll f=1; char ch;
	for(ch=getchar();ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar()) n=(n<<3)+(n<<1)+(ch^48);
	return f*n;
}
	//-------------start--------------
//#define DEBUG 1
const int NN=2E5; const int N=NN+5;
const int MM=1E6; const int M=MM+5;
const ll P=998244353;
	//------queue------
//int q[N*2],hd=1,tl=0;
	//------Graph------
//int V[N*2],H[N],K[N*2],l=1 ,E[N*2];
//inline void Add(int x,int y,int w){V[++l]=y,E[l]=w,K[l]=H[x],H[x]=l;}
//inline void add(int x,int y){Add(x,y); Add(y,x);}
//inline void add(int x,int y,int w){Add(x,y,w); Add(y,x,w);}]
	//------normal------
int n,a[N];

inline int Solve()
{
	#ifdef DEBUG
	printf("Debuging...\n");
	#endif

	int a,b;	cin>>a>>b;
	cout<<"Hallo world!\n"<<a+b<<endl;

	return 0;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	//init();
	int T=1;
	cin>>T;
	for(;T--;)Solve();	
	return 0;
}

2、缺省源2(格式化)

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

//#define DEBUG 1
const int N=1E6+5;

inline void Solve()
{
	#ifdef DEBUG
	printf("Debuging...\n");
	#endif

	int a,b;	cin>>a>>b;
	cout<<"Hallo world!\n"<<a+b<<endl;

	return ;
}

//#define FILES_IO 2
int main()
{
	#ifdef FILES_IO
	string FileName="test",ReadFile=FileName+".in",WriteFile=FileName+".out";
	freopen(ReadFile.c_str(),"r", stdin);
	freopen(WriteFile.c_str(),"w", stdout);
	#endif
	//srand((unsigned)time(0));
	//ios::sync_with_stdio(false);
	//cin.tie(0);

	int T=1;
	//scanf("%d",&T);
	for(;T--;)
		Solve();

	#ifdef FILES_IO
	fclose(stdin);
	fclose(stdout);
	#endif
	return 0;
}

3、快读快输
(1)getchar/putchar版

//int 快读
int read()
{
	unsigned n=0; int f=1; char ch;
	for(ch=getchar();ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar()) n=(n<<3)+(n<<1)+(ch^48);
	return f*n;
}

//long long 快读
ll read()
{
	ull n=0; ll f=1; char ch;
	for(ch=getchar();ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar()) n=(n<<3)+(n<<1)+(ch^48);
	return f*n;
}
//特定char 快读
char readch()
{
	char ch;
	for(ch=getchar();'A'>ch || ch>'Z';ch=getchar());
	return ch;
}

//ull 快输
void Write(ull x)
{
	if(x==0)	return;
	Write(x/10); putchar(x%10+'0');
}

//int 快输
void write_(int x)
{
	if(x==0)return;
	write_(x/10);putchar(x%10+'0');
}
void write(int x)
{
	if(x==0){putchar('0');return;}
	if(x<0)	putchar('-'),x=-x;
	write_(x);
}
//int128 输入输出
typedef __int128 lll;
lll readl()
{
	lll n=0; lll f=1; char ch;
	for(ch=getchar();ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar()) n=(n<<3)+(n<<1)+(ch^48);
	return f*n;
}
void writel_(lll x)
{
	if(x==0)	return;
	writel_(x/10); putchar(x%10+'0');
}
void writel(lll x)
{
	if(x==0){putchar('0');return;}
	if(x<0)	putchar('-'),x=-x;
	writel_(x);
	putchar('\n');
}

(2)fread/fwrite版


4、常用宏定义与常数

#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)

/*
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define MINF 0x3f
*/

const int INF=0x3f3f3f3f;
const ll LLINF=0x3f3f3f3f3f3f3f3f;
const int MINF=0x3f;

#define Mem0(a) memset(a,0,sizeof(a))
#define MemINF(a) memset(a,MINF,sizeof(a))

const double PI=acos(-1);

5、火车头

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps"),,
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
posted @ 2021-02-03 00:54  Coinred  阅读(138)  评论(0)    收藏  举报