QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#40753#1. I/O TestLQ_is_my_son200 ✓89ms11272kbC++231.9kb2022-07-26 08:12:002022-07-26 08:12:01

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-07-26 08:12:01]
  • 评测
  • 测评结果:200
  • 用时:89ms
  • 内存:11272kb
  • [2022-07-26 08:12:00]
  • 提交

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();
}

详细

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 89ms
memory: 11272kb

input:

10000000
530040465 884656629 736968361 487641019 494170402 188220136 387102490 282645042 602040228 250504323 462019244 531014316 728106283 229482647 612014104 931512217 612249600 461489961 370892557 875493537 282861440 111812435 600342670 965219554 250765329 246149825 882194455 260131377 471973935 7...

output:

5498981429944634

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

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

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