QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#440511#1. I/O TestLDM0116200 ✓210ms3608kbC++142.3kb2024-06-13 19:53:332024-06-13 19:53:35

Judging History

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

  • [2024-06-13 19:53:35]
  • 评测
  • 测评结果:200
  • 用时:210ms
  • 内存:3608kb
  • [2024-06-13 19:53:33]
  • 提交

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: 199ms
memory: 3592kb

input:

10000000
169262105 447137848 136510754 303182049 544818470 122708832 150271933 654124431 389305694 575361103 266891567 716827727 643968488 450771792 117413094 948241526 771044248 283367509 496960329 647018295 120274681 190488917 154865995 741871844 362217365 536506870 583735176 757257256 269646369 1...

output:

5500252000267629

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 210ms
memory: 3608kb

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