QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#54108#1. I/O TestZGY200 ✓81ms11296kbC++1.9kb2022-10-06 21:09:192022-10-06 21:09:20

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-10-06 21:09:20]
  • 评测
  • 测评结果:200
  • 用时:81ms
  • 内存:11296kb
  • [2022-10-06 21:09:19]
  • 提交

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: 81ms
memory: 11296kb

input:

10000000
485356269 502791950 248234289 616891464 963181354 482288270 876171500 362775316 112602708 103600442 187790475 404912544 471934430 947765825 330518519 157341229 579844217 983949529 923472840 209597453 194760621 384990357 682355795 535575026 954394177 708051074 993298033 452119708 671599249 9...

output:

5501076005371187

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 72ms
memory: 11180kb

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