QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#440508#1. I/O TestLDM0116200 ✓214ms3604kbC++142.3kb2024-06-13 19:52:042024-06-13 19:52:05

Judging History

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

  • [2024-06-13 19:52:05]
  • 评测
  • 测评结果:200
  • 用时:214ms
  • 内存:3604kb
  • [2024-06-13 19:52:04]
  • 提交

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 smiling{
	int read(){
		int x=0;
		int f=1;
		char c=getchar();
		while(!isdigit(c)){
			if(c=='-'){
				f=-1;
			}
			c=getchar();
		}
		while(isdigit(c)){
			x=x*10+c-'0';
			c=getchar();
		}

		return x*f;
	}
	void print(ll x){
		if(x<10){
			putchar(x+'0');
			return;
		}
		print(x/10);
		putchar(x%10+'0');
	}
	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 smiling{
	int read(){
		int x=0;
		int f=1;
		char c=getchar();
		while(!isdigit(c)){
			if(c=='-'){
				f=-1;
			}
			c=getchar();
		}
		while(isdigit(c)){
			x=x*10+c-'0';
			c=getchar();
		}

		return x*f;
	}
	void print(ll x){
		if(x<10){
			putchar(x+'0');
			return;
		}
		print(x/10);
		putchar(x%10+'0');
	}
	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: 197ms
memory: 3576kb

input:

10000000
386659916 613869670 356868445 624137938 440341478 466302862 851249841 958499022 474820560 347375088 415179792 632824041 983661535 682643362 899804895 500901780 655599455 609256249 672273798 273649341 799628683 717885582 156811786 856352001 107913998 582243073 367686709 662763145 891357519 6...

output:

5500278624321735

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 214ms
memory: 3604kb

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