QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#36715#1. I/O TestWithers200 ✓82ms11276kbC++1.9kb2022-06-28 16:14:572022-06-28 16:14:59

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-06-28 16:14:59]
  • 评测
  • 测评结果:200
  • 用时:82ms
  • 内存:11276kb
  • [2022-06-28 16:14:57]
  • 提交

config.txt

10000000
10000000

input_test

#include<cstdio>
#define R register
static char buf[10000000],*paa=buf,*pddd=buf;
static char buf2[10000000],*pppp=buf2;
#define getchar() paa==pddd&&(pddd=(paa=buf)+fread(buf,1,10000000,stdin),paa==pddd)?EOF:*paa++
inline void pc(char ch){
	if(pppp-buf2==10000000) fwrite(buf2,1,10000000,stdout),pppp=buf2;
	*pppp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pppp-buf2,stdout);
	pppp=buf2;
}
inline unsigned int read(void){
	//int w=1;
	register  unsigned int x(0);register char c(getchar());
	while(c<'0'||c>'9'){c=getchar();}
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x;
}
inline void write(int x){
	if(x<0) pc('-'),x=-x;
	static unsigned int sta[20];int top=0;
	do{sta[top++]=x%10,x/=10;}while(x);
	while(top) pc(sta[--top]+48);
}
int main()
{
	R unsigned int n;
	n=read();
	R long long sum=0;
	for(R unsigned int i=1;i<=n;++i)
	{
		sum+=read();
	}
	printf("%lld",sum);
}

output_test

#include<cstdio>
#define R register
static char buf[10000000],*paa=buf,*pddd=buf;
static char buf2[10000000],*pppp=buf2;
#define getchar() paa==pddd&&(pddd=(paa=buf)+fread(buf,1,10000000,stdin),paa==pddd)?EOF:*paa++
inline void pc(char ch){
	if(pppp-buf2==10000000) fwrite(buf2,1,10000000,stdout),pppp=buf2;
	*pppp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pppp-buf2,stdout);
	pppp=buf2;
}
inline unsigned int read(void){
	//int w=1;
	register  unsigned int x(0);register char c(getchar());
	while(c<'0'||c>'9'){c=getchar();}
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x;
}
inline void write(int x){
	if(x<0) pc('-'),x=-x;
	static unsigned int sta[20];int top=0;
	do{sta[top++]=x%10,x/=10;}while(x);
	while(top) pc(sta[--top]+48);
}
int main()
{
	R unsigned int n;
	n=read();
	for(R unsigned int i=1;i<=n;++i)
	{
		pc('1');pc('0');pc('0');pc('0');pc('0');pc('0');pc('0');pc('0');pc('0');
		pc(' ');
	}
	pcc();
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 82ms
memory: 11276kb

input:

10000000
990916270 815457971 815043122 989028442 274547602 620037775 125959085 591716016 202697913 321689249 458199637 493715785 171001314 692660945 766267661 339622235 140068470 704092554 655081684 388505913 813885353 563884676 447310075 562422025 659374936 977533157 525584004 230577163 765652878 7...

output:

5499681168206765

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 77ms
memory: 11192kb

input:

10000000

output:

100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 ...

result:

points 1.0 output test passed