QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#440504#1. I/O TestLDM0116200 ✓224ms3708kbC++142.3kb2024-06-13 19:48:542024-06-13 19:48:56

Judging History

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

  • [2024-06-13 19:48:56]
  • 评测
  • 测评结果:200
  • 用时:224ms
  • 内存:3708kb
  • [2024-06-13 19:48:54]
  • 提交

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: 203ms
memory: 3708kb

input:

10000000
651791366 334200605 683372154 172063184 348818265 745858090 846454652 983334488 676848714 587274310 864428693 639031968 109111970 660805417 570345826 527098735 682062663 191965454 178242352 841296232 482700210 952995411 223270318 495656452 209927879 368830183 202762132 114966151 669740986 8...

output:

5499074545292051

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 224ms
memory: 3628kb

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