QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#209800	#7107. Chaleur	Eznibuil	RE	1ms	5584kb	C++14	2.6kb	2023-10-10 17:36:01	2023-10-10 17:36:02

Judging History

你现在查看的是最新测评结果

[2023-10-10 17:36:02]
评测

测评结果：RE
用时：1ms
内存：5584kb

查看

[2023-10-10 17:36:01]
提交

answer

#include<stdio.h>
#include<algorithm>
#include<numeric>
#include<vector>
#define FIOBUFSIZ (1<<20|1)
struct freader
{
	FILE*f;
#	ifdef ONLINE_JUDGE
		char buf[FIOBUFSIZ],*p1,*p2;
#		define fgetc(f) (p1==p2&&(p2=(p1=buf)+fread(buf,1,FIOBUFSIZ,f),p1==p2)?EOF:*p1++)
#	endif
#	ifdef BOOLTRANS
		bool neof;
#		define NEOF(c) ((c)!=EOF||(neof=0))
#	else
#		define NEOF(c) ((c)!=EOF)
#	endif
#	ifdef NOTONLYDIGIT
#		define isdigit(c) ((c)>='0'&&(c)<='9')
#		define isnotdigit(c) ((c)<'0'||(c)>'9')
#	else
#		define isdigit(c) ((c)>='0')
#		define isnotdigit(c) ((c)<'0')
#	endif
	freader(FILE*_f=stdin):f(_f)
	{
#		ifdef BOOLTRANS
			neof=1;
#		endif
#		ifdef ONLINE_JUDGE
			setvbuf(f,NULL,_IONBF,0);
			p1=p2=buf;
#		endif
	}
#	ifdef NOTONLYDIGIT
		void read(char&x)
		{
			for(x=fgetc(f);NEOF(x)&&x<=' ';x=fgetc(f));
			return;
		}
		void read(char*s)
		{
			for(*s=fgetc(f);NEOF(*s)&&*s<=' ';*s=fgetc(f));
			for(s++;NEOF(*s=fgetc(f))&&*s>' ';s++);
			*s='\0';
			return;
		}
		freader&operator>>(char*x)
		{
#			ifdef BOOLTRANS
				return *this?read(x),*this:*this;
#			else
				return read(x),*this;
#			endif
		}
#	endif
	template<typename T>void read(T&x)
	{
		char c(fgetc(f));
#		ifdef NEGATIVE
			for(;NEOF(c)&&isnotdigit(c)&&c!='-';c=fgetc(f));
			if(c=='-')
				for(c=fgetc(f),x=0;NEOF(c)&&isdigit(c);c=fgetc(f))
					x=(x<<3)+(x<<1)-(c^'0');
			else
				for(x=0;NEOF(c)&&isdigit(c);c=fgetc(f))
					x=(x<<3)+(x<<1)+(c^'0');
#		else
			for(;NEOF(c)&&isnotdigit(c);c=fgetc(f));
			for(x=0;NEOF(c)&&isdigit(c);c=fgetc(f))
				x=(x<<3)+(x<<1)+(c^'0');
#		endif
		return;
	}
#	if __cplusplus>=201103
		template<typename T,typename...Args>void read(T&x,Args&...args){return read(x),read(args...);}
#	endif
	template<typename T>freader&operator>>(T&x)
	{
#		ifdef BOOLTRANS
			return *this?read(x),*this:*this;
#		else
			return read(x),*this;
#		endif
	}
#	ifdef BOOLTRANS
		operator bool(){return neof;}
#	endif
#	ifdef ONLINE_JUDGE
#		undef fgetc
#	endif
#	undef NEOF
#	undef isdigit
#	undef isnotdigit
}fin;
#undef FIOBUFSIZ
int e[1000001],deg[1000001];
int main()
{
	int t;
	fin>>t;
	while(t--)
	{
		int n,m;
		fin>>n>>m,std::fill_n(deg,n,0),std::iota(e,e+n,0);
		while(m--)
		{
			int a,b;
			fin>>a>>b,deg[a-1]++,deg[b-1]++;
		}
		std::sort(e,e+n,[](int x,int y){return deg[x]>deg[y];});
		int x{};
		for(;deg[e[x]]>=x;x++);
		int ans[2]{1+std::count_if(e+x,e+n,[=](int y){return deg[y]==x-1;}),std::count_if(e,e+x,[=](int y){return deg[y]==x-1;})};
		if(!ans[1])
			ans[1]=1+std::count_if(e,e+x,[=](int y){return deg[y]==x;});
		printf("%d %d\n",ans[0],ans[1]);
	}
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 5584kb

input:

output:

2 1
1 4
1 2

result:

ok 3 lines

Test #2:

score: -100

Runtime Error

input:

output: