QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#440506#1. I/O TestLDM0116200 ✓235ms3636kbC++142.3kb2024-06-13 19:51:462024-06-13 19:51:46

Judging History

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

  • [2024-06-13 19:51:46]
  • 评测
  • 测评结果:200
  • 用时:235ms
  • 内存:3636kb
  • [2024-06-13 19:51:46]
  • 提交

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;
}

详细

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 207ms
memory: 3548kb

input:

10000000
428388381 704093493 400348796 680814603 948531395 245162319 853358931 143794952 727295486 416023894 683963738 940813360 125906466 610296775 740935120 583548471 409506908 351912199 967839398 855369153 679363859 202841228 323919980 351700408 932080034 439517717 422886277 287339394 803256370 3...

output:

5499535771557791

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 235ms
memory: 3636kb

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