代码

#include<cstdio>
#include<cstring>
#include<sys/mman.h>

int hash_max=240000,hash_step;
struct _hash
{
	int v[240000];
	void clear(){memset(v,0,sizeof v);}
	int insert(int x)
	{
		int y=x%hash_max;
		for(;v[y]&&v[y]!=x;y+=hash_step,y>=hash_max?y-=hash_max:0);
		if(v[y]==x)return -1;v[y]=x;return y;
	}
	int find(int x)
	{
		int y=x%hash_max;
		for(;v[y]!=x;y+=hash_step,y>=hash_max?y-=hash_max:0);
		return y;
	}
}pp;

int fa[240000];

inline int find(int x)
{
	while(fa[x]>=0&&fa[fa[x]]>=0)x=fa[x]=fa[fa[x]];return fa[x]<0?x:fa[x];
}

inline void merge(int x,int y)
{
	x=find(x),y=find(y);
	if(x!=y){if(fa[x]<fa[y])fa[y]=x;else{if(fa[x]==fa[y])fa[y]--;fa[x]=y;}}
}

int q[100000][2],qm;
char *I;int _x;
int _(){_x=0;while(*I<48)*I++;while(*I>=48)_x=_x*10+*I++-'0';return _x;}

inline bool isp(int n)
{
	for(int i=2;i*i<=n;i++)if(n%i==0)return 0;
	return 1;
}

int main()
{
	
	I=(char*)mmap(NULL,30000000,PROT_READ,MAP_PRIVATE,fileno(stdin),0);
	int t,n,a,b,e,tmp;t=_();
    printf("%d",t);
}

评测结果