QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#440535#1. I/O TestLDM0116200 ✓219ms3536kbC++142.3kb2024-06-13 20:12:342024-06-13 20:12:35

Judging History

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

  • [2024-06-13 20:12:35]
  • 评测
  • 测评结果:200
  • 用时:219ms
  • 内存:3536kb
  • [2024-06-13 20:12:34]
  • 提交

config.txt

10000000 10000000

input_test

#include<bits/stdc++.h>
#define mkp make_pair
#define ll long long
#define ull unsigned long long
#define pb emplace_back
#define sort stable_sort
#define iinf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define i128 __int128
using namespace std;
namespace io{
	#define int ll
	const int B=10;
	int read(){
		int x=0,f=1;char c=getchar();
		while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
		while(isdigit(c)){x=x*B+c-'0';c=getchar();}
		return x*f;
	}
	void print(int x){
		if(x<B){putchar(x+'0');return;}
		print(x/B);putchar(x%B+'0');
	}
	#undef int
}using namespace io;
namespace smiling{

	int n,a;
	ll s;
	int main(){
		n=read();
		for(int i=1;i<=n;i++){
			a=read();
			s+=a;
		}
		print(s);
		return 0;
	}
}
int main(){
	#ifdef ONLINE_JUDGE
    #else
        freopen("1.in","r",stdin);
        freopen("1.out","w",stdout);

        double s=clock();
    #endif


    ios::sync_with_stdio(false);
    cin.tie(0);
    
    smiling::main();


    #ifdef ONLINE_JUDGE
    #else
        double t=clock();
        printf("\n\ntime:%.6lf",(t-s)/1000);
    #endif
	return 0;
}

output_test

#include<bits/stdc++.h>
#define mkp make_pair
#define ll long long
#define ull unsigned long long
#define pb emplace_back
#define sort stable_sort
#define iinf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define i128 __int128
using namespace std;
namespace io{
	#define int ll
	const int B=10;
	int read(){
		int x=0,f=1;char c=getchar();
		while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
		while(isdigit(c)){x=x*B+c-'0';c=getchar();}
		return x*f;
	}
	void print(int x){
		if(x<B){putchar(x+'0');return;}
		print(x/B);putchar(x%B+'0');
	}
	#undef int
}using namespace io;
namespace smiling{
	int n;
	int main(){
		n=read();
		for(int i=1;i<=n;i++){
			print(100000000),putchar(' ');
		}
		return 0;
	}
}
int main(){
	#ifdef ONLINE_JUDGE
    #else
        freopen("1.in","r",stdin);
        freopen("1.out","w",stdout);

        double s=clock();
    #endif


    ios::sync_with_stdio(false);
    cin.tie(0);
    
    smiling::main();


    #ifdef ONLINE_JUDGE
    #else
        double t=clock();
        printf("\n\ntime:%.6lf",(t-s)/1000);
    #endif
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 200ms
memory: 3536kb

input:

10000000
542738404 841137609 542005934 522201463 115359984 896544765 980884822 608144015 353937780 409485884 491109120 828958449 922230656 232064496 260537913 697423071 926507861 295371046 699181480 719277442 531300954 270820345 191365486 908076140 279277713 283542575 366648167 263378741 880426855 6...

output:

5500825791638670

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 219ms
memory: 3516kb

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