QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#666232#1. I/O TestChenJiarun12345200 ✓201ms85996kbC++143.0kb2024-10-22 17:13:162024-10-22 17:13:16

Judging History

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

  • [2024-10-22 17:13:16]
  • 评测
  • 测评结果:200
  • 用时:201ms
  • 内存:85996kb
  • [2024-10-22 17:13:16]
  • 提交

config.txt

10000000
10000000

input_test

/*
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x3f3f3f3f3f3f3f3fll
#define For(i,l,r) for(register int i=(l);i<=(r);i++)
#define Rof(i,l,r) for(register int i=(l);i>=(r);i--)
#define bug cout<<"Ln:"<<__LINE__<<'\n'
bool M_S;
namespace IO{
	const int BASE=1<<21;
	#define getchar() (p1==p2&&(p2=(p1=ibuf)+fread(ibuf,1,BASE,stdin),p1==p2)?EOF:*p1++)
	char ibuf[BASE],*p1=ibuf,*p2=ibuf;
	template<typename T> void rd(T &x){
		char c=getchar();T f=1;x=0;
		for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
		for(;c>='0'&&c<='9';c=getchar()) x=x*10+(c-'0');x*=f;
	}
	char obuf[BASE],*p3=obuf;
	#define putchar(x) (p3-obuf==BASE?fwrite(obuf,1,BASE,stdout),p3=obuf,*p3++=x:*p3++=x)
	#define kg putchar(' ')
	#define dn putchar('\n')
	int tmp[40];
	template<typename T> void wr(T x){
		if(x<0) putchar('-'),x=-x;
		int len=(x==0);tmp[1]=0;
		while(x) tmp[++len]=x%10,x/=10;
		while(len) putchar(tmp[len--]+'0');
	}
	struct Flush{~Flush(){fwrite(obuf,1,p3-obuf,stdout);}}flush;
}
using namespace IO;
const int N=10000005;
int n,a[N];
void MAIN(int TEST){
	rd(n);int sum=0;
	For(i,1,n) rd(a[i]),sum+=a[i];
	wr(sum);
}

bool M_T;
signed main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	double T_S=clock();
	// cerr<<"Memory: "<<1.0*(&M_S-&M_T)/1048576<<"MiB\n";

	int test=1;
	// cin>>test;
	For(TEST,1,test) MAIN(TEST);
	
	double T_T=clock();
	// cerr<<"Time: "<<1.0*(T_T-T_S)/CLOCKS_PER_SEC<<"ms\n";
	return 0;
}

output_test

/*
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x3f3f3f3f3f3f3f3fll
#define For(i,l,r) for(register int i=(l);i<=(r);i++)
#define Rof(i,l,r) for(register int i=(l);i>=(r);i--)
#define bug cout<<"Ln:"<<__LINE__<<'\n'
bool M_S;
namespace IO{
	const int BASE=1<<21;
	#define getchar() (p1==p2&&(p2=(p1=ibuf)+fread(ibuf,1,BASE,stdin),p1==p2)?EOF:*p1++)
	char ibuf[BASE],*p1=ibuf,*p2=ibuf;
	template<typename T> void rd(T &x){
		char c=getchar();T f=1;x=0;
		for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
		for(;c>='0'&&c<='9';c=getchar()) x=x*10+(c-'0');x*=f;
	}
	char obuf[BASE],*p3=obuf;
	#define putchar(x) (p3-obuf==BASE?fwrite(obuf,1,BASE,stdout),p3=obuf,*p3++=x:*p3++=x)
	#define kg putchar(' ')
	#define dn putchar('\n')
	int tmp[40];
	template<typename T> void wr(T x){
		if(x<0) putchar('-'),x=-x;
		int len=(x==0);tmp[1]=0;
		while(x) tmp[++len]=x%10,x/=10;
		while(len) putchar(tmp[len--]+'0');
	}
	struct Flush{~Flush(){fwrite(obuf,1,p3-obuf,stdout);}}flush;
}
using namespace IO;
const int N=10000005;
int n,a[N];
void MAIN(int TEST){
	rd(n);
	For(i,1,n) wr(100000000),kg;
}

bool M_T;
signed main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	double T_S=clock();
	// cerr<<"Memory: "<<1.0*(&M_S-&M_T)/1048576<<"MiB\n";

	int test=1;
	// cin>>test;
	For(TEST,1,test) MAIN(TEST);
	
	double T_T=clock();
	// cerr<<"Time: "<<1.0*(T_T-T_S)/CLOCKS_PER_SEC<<"ms\n";
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 103ms
memory: 85996kb

input:

10000000
229677629 468462534 719600769 648245788 279569579 555178691 173847070 148337137 922370246 232328189 361745091 690339641 962345054 242983216 924790878 336740245 940189863 722301762 147275697 657402630 881756351 262660418 678580153 640895669 514768344 453390738 488797469 352530094 916065185 3...

output:

5500970985378089

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 201ms
memory: 7788kb

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