QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#440533#1. I/O TestLDM0116200 ✓225ms3704kbC++142.3kb2024-06-13 20:11:522024-06-13 20:11:54

Judging History

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

  • [2024-06-13 20:11:54]
  • 评测
  • 测评结果:200
  • 用时:225ms
  • 内存:3704kb
  • [2024-06-13 20:11:52]
  • 提交

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 long long
	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 long long
	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: 175ms
memory: 3596kb

input:

10000000
872443408 742854626 289106670 417250308 144945746 172414280 937985851 634484304 386864984 803592891 865893460 997422158 304492036 605170000 205403567 737170638 745293157 492122325 879594990 794401452 681920016 559241236 866716596 358562876 677590785 863088867 811466602 652045697 856833321 9...

output:

5498437094930736

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 225ms
memory: 3704kb

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