QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#425675	#1. I/O Test	LDM0116	200 ✓	212ms	3648kb	C++14	8.8kb	2024-05-30 15:37:28	2024-05-30 15:37:31

Judging History

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

[2024-05-30 15:37:31]
评测

测评结果：200
用时：212ms
内存：3648kb

查看

[2024-05-30 15:37:28]
提交

config.txt

10000000 10000000

Text file

input_test

/*
............................................................................
............................................................................
........................................!,..................................
.......................................XM&..................................
......................................&MM$..................................
.....................................&M@M$..................................
....................................*MMMM#..................................
...................................!MMN&EX..................................
...................................E%l!,F/..................................
..................................!$~''!$,..................................
..................................lY;!;lX...................................
..................................I};~'#~...................................
..................................I1''1&`;,,`...............................
..................................}/''&X*IIIIIl1>;.....`;!i/}]l**]*l1i~`....
..................................}1;!+''''''~"i/}}>i1]ll]}1/+i!"XMMMMMM%&!.
.................:,'!">>+~......./I>~~'~~~~~~~''''~ili'';,,;;;~1$MMMM@WK*+,.
............,!+}ll]}/+>iX;......"X;~'~~'~~~~~~~~~~~';~llII**IYR$#X*|";......
.......:~+]IIl1i!~'''';I'.,.....&+'~1+i!~~~~~~~~~~~~!;Y/~!~';,`.............
...:!|*I*}i!';'''~~~~;1&l}*+:..+F,;}MYWY;~~~'~~~''!'~;X!....................
:>lI*1>~';'~~~~~~~!!'iR!"~~1]+"W*}>!Y#X!'~~'"!~~"Yil"'R;....................
"X"~;''~~~~~'~!>i++/"/Ri;~~'~"#$&KR+,;;>"!!"1~';+MEM/1Y.:...................
:l~~~~~~~~'~">i++/+++*~X;~~~~;X$F&E]'!~+$RREEX/i!>l+,K!.....................
.i];~~~~~~"i/]*Yl+/>I+.Yi'~~~'"%FI}~~~'iR*IIIRN1"',!l$/'""!"!...............
..*"'~~~"i]YY}!}li+/X..!&'~~~~'+&!;~~~'>Rl*lYKi;~~iKK%I/+++1ll:.............
..;I~'~>lX*":..I+/iY*!/1&];~~~~'iI!~~~~'&FI&F"'~~;1$#l;''';,+K:.............
...!l"]Fl'....!Yi/+1]}1+/#}~~~~~'~~~~~~'"II}''~~"+}]"'~~''il/~..............
....~X*'......}]>+/1]/i+*,1]"~~~~~~~~~!"!'''~~~!i>~;'''!+l};................
.....:........Y}lI*+*KIF>,"F>~~~~~~~~~~">i>"!~~~''~"+1]}i,..................
.............:FI+;..X$EW&#%>'~~~~~~~~~~~'~~~~~~~~Yl}/",.....................
..............:....'$#E#E%1'~~~~~~~~~~~~~~~~~~~'l+`.........................
.................../$Yi>N1;~~~~~~~~~~~~~~~~~~~~'R,.:........................
...................``.,F+;~~~~~~~~~~~~~~~~~~~~~'}R~.........................
.....................~#>'~~~~~~~~~~~~~~~~~~~~~~~'i#/........................
....................:K+;~~~~~~~~~~~~~~~~~~~~~~~~~'~E".......................
....................:#>">"""!!!"">>>>>>>""!!~~~~~~;1F.......................
.....................>K]+/+>>iiii+/11}1+iiii>>>>>"'Y+.:.....................
...................`i1l]+|*XYIIYII*]1lF&F*]]1/+++iI&~:......................
..................}#&Y}}l]]/~'';,:.....,~>i/FY*]]l*}&Kl:....................
.................."l+>!',:..................:,;'~~!"i1/..............:......
............................................................................
............................................................................
..................................Pi-kaPika.................................
*/


#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_unlocked();
		while(!isdigit(c)){
			if(c=='-'){
				f=-1;
			}
			c=getchar_unlocked();
		}
		while(isdigit(c)){
			x=x*10+c-'0';
			c=getchar_unlocked();
		}

		return x*f;
	}
	void print(ll x){
		if(x<10){
			putchar_unlocked(x+'0');
			return;
		}
		print(x/10);
		putchar_unlocked(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;
}

Source code, Language: C++14

output_test

/*
............................................................................
............................................................................
........................................!,..................................
.......................................XM&..................................
......................................&MM$..................................
.....................................&M@M$..................................
....................................*MMMM#..................................
...................................!MMN&EX..................................
...................................E%l!,F/..................................
..................................!$~''!$,..................................
..................................lY;!;lX...................................
..................................I};~'#~...................................
..................................I1''1&`;,,`...............................
..................................}/''&X*IIIIIl1>;.....`;!i/}]l**]*l1i~`....
..................................}1;!+''''''~"i/}}>i1]ll]}1/+i!"XMMMMMM%&!.
.................:,'!">>+~......./I>~~'~~~~~~~''''~ili'';,,;;;~1$MMMM@WK*+,.
............,!+}ll]}/+>iX;......"X;~'~~'~~~~~~~~~~~';~llII**IYR$#X*|";......
.......:~+]IIl1i!~'''';I'.,.....&+'~1+i!~~~~~~~~~~~~!;Y/~!~';,`.............
...:!|*I*}i!';'''~~~~;1&l}*+:..+F,;}MYWY;~~~'~~~''!'~;X!....................
:>lI*1>~';'~~~~~~~!!'iR!"~~1]+"W*}>!Y#X!'~~'"!~~"Yil"'R;....................
"X"~;''~~~~~'~!>i++/"/Ri;~~'~"#$&KR+,;;>"!!"1~';+MEM/1Y.:...................
:l~~~~~~~~'~">i++/+++*~X;~~~~;X$F&E]'!~+$RREEX/i!>l+,K!.....................
.i];~~~~~~"i/]*Yl+/>I+.Yi'~~~'"%FI}~~~'iR*IIIRN1"',!l$/'""!"!...............
..*"'~~~"i]YY}!}li+/X..!&'~~~~'+&!;~~~'>Rl*lYKi;~~iKK%I/+++1ll:.............
..;I~'~>lX*":..I+/iY*!/1&];~~~~'iI!~~~~'&FI&F"'~~;1$#l;''';,+K:.............
...!l"]Fl'....!Yi/+1]}1+/#}~~~~~'~~~~~~'"II}''~~"+}]"'~~''il/~..............
....~X*'......}]>+/1]/i+*,1]"~~~~~~~~~!"!'''~~~!i>~;'''!+l};................
.....:........Y}lI*+*KIF>,"F>~~~~~~~~~~">i>"!~~~''~"+1]}i,..................
.............:FI+;..X$EW&#%>'~~~~~~~~~~~'~~~~~~~~Yl}/",.....................
..............:....'$#E#E%1'~~~~~~~~~~~~~~~~~~~'l+`.........................
.................../$Yi>N1;~~~~~~~~~~~~~~~~~~~~'R,.:........................
...................``.,F+;~~~~~~~~~~~~~~~~~~~~~'}R~.........................
.....................~#>'~~~~~~~~~~~~~~~~~~~~~~~'i#/........................
....................:K+;~~~~~~~~~~~~~~~~~~~~~~~~~'~E".......................
....................:#>">"""!!!"">>>>>>>""!!~~~~~~;1F.......................
.....................>K]+/+>>iiii+/11}1+iiii>>>>>"'Y+.:.....................
...................`i1l]+|*XYIIYII*]1lF&F*]]1/+++iI&~:......................
..................}#&Y}}l]]/~'';,:.....,~>i/FY*]]l*}&Kl:....................
.................."l+>!',:..................:,;'~~!"i1/..............:......
............................................................................
............................................................................
..................................Pi-kaPika.................................
*/


#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_unlocked();
		while(!isdigit(c)){
			if(c=='-'){
				f=-1;
			}
			c=getchar_unlocked();
		}
		while(isdigit(c)){
			x=x*10+c-'0';
			c=getchar_unlocked();
		}

		return x*f;
	}
	void print(ll x){
		if(x<10){
			putchar_unlocked(x+'0');
			return;
		}
		print(x/10);
		putchar_unlocked(x%10+'0');
	}
	int n;
	int main(){
		n=read();
		for(int i=1;i<=n;i++){
			print(100000000),putchar_unlocked(' ');
		}
		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;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100

Accepted

Test #1:

score: 100

Accepted

time: 166ms

memory: 3648kb

input:

10000000
469324247 714977398 892216793 671602335 135555682 425548253 465331548 181776598 514691074 976234748 915255476 421804411 844554291 272514067 563358999 822582533 631241973 732984086 442684076 535198098 329142007 427131651 533740775 234395847 560780246 307075537 572843384 650978520 944108583 9...

output:

5500741852305355

result:

points 1.0 input test passed

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 212ms

memory: 3576kb

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