QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#666148#1. I/O TestChenJiarun12345200 ✓190ms85968kbC++143.0kb2024-10-22 16:50:482024-10-22 16:50:54

Judging History

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

  • [2024-10-22 16:50:54]
  • 评测
  • 测评结果:200
  • 用时:190ms
  • 内存:85968kb
  • [2024-10-22 16:50:48]
  • 提交

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,1<<21,stdin),p1==p2)?EOF:*p1++)
	char ibuf[BASE],*p1=ibuf,*p2=ibuf;
	template<typename T> void rd(T &x){
		char c=getchar();x=0;bool f=0;
		for(;!isdigit(c);c=getchar())f^=!(c^45);
		for(;isdigit(c);c=getchar()) x=(x<<1)+(x<<3)+(c^48);
		if(f) x=-x;
	}
	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,1<<21,stdin),p1==p2)?EOF:*p1++)
	char ibuf[BASE],*p1=ibuf,*p2=ibuf;
	template<typename T> void rd(T &x){
		char c=getchar();x=0;bool f=0;
		for(;!isdigit(c);c=getchar())f^=!(c^45);
		for(;isdigit(c);c=getchar()) x=(x<<1)+(x<<3)+(c^48);
		if(f) x=-x;
	}
	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: 98ms
memory: 85968kb

input:

10000000
947646658 727921997 865591321 521243886 576906071 998851322 796120208 134108617 558961091 115976978 726787964 528928268 410998160 715202502 764672349 944974133 730071947 103633601 700564468 109590849 371370562 975780049 628025233 758212172 667613984 246390957 486999786 622468669 367693034 6...

output:

5499107384084495

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 190ms
memory: 7848kb

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