QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#36714#1. I/O TestWithers200 ✓90ms2456kbC++1.9kb2022-06-28 16:13:362022-06-28 16:13:38

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:13:38]
  • 评测
  • 测评结果:200
  • 用时:90ms
  • 内存:2456kb
  • [2022-06-28 16:13:36]
  • 提交

config.txt

10000000
10000000

input_test

#include<cstdio>
#define R register
static char buf[1000000],*paa=buf,*pddd=buf;
static char buf2[1000000],*pppp=buf2;
#define getchar() paa==pddd&&(pddd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pddd)?EOF:*paa++
inline void pc(char ch){
	if(pppp-buf2==1000000) fwrite(buf2,1,1000000,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[1000000],*paa=buf,*pddd=buf;
static char buf2[1000000],*pppp=buf2;
#define getchar() paa==pddd&&(pddd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pddd)?EOF:*paa++
inline void pc(char ch){
	if(pppp-buf2==1000000) fwrite(buf2,1,1000000,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: 90ms
memory: 2456kb

input:

10000000
262992237 403464610 954986357 108313759 467587362 662202498 499683653 120426074 220997317 732096995 286182406 421693657 936260217 643608199 808414349 851063632 309377540 998246517 970539735 196147149 908285802 859852393 234143965 217919540 157720326 264707266 676398553 395240624 132058835 7...

output:

5499302861952478

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 70ms
memory: 2404kb

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