QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#425666#1. I/O TestLDM0116200 ✓216ms3808kbC++1413.1kb2024-05-30 15:31:382024-05-30 15:31:39

Judging History

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

  • [2024-05-30 15:31:39]
  • 评测
  • 测评结果：200
  • 用时：216ms
  • 内存：3808kb
查看
  • [2024-05-30 15:31:38]
  • 提交

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 fast_IO {
#define FASTIO
#define IOSIZE 100000
	char ibuf[IOSIZE], obuf[IOSIZE];
	char *p1 = ibuf, *p2 = ibuf, *p3 = obuf;
#ifdef ONLINE_JUDGE
#define getchar() ((p1==p2)and(p2=(p1=ibuf)+fread(ibuf,1,IOSIZE,stdin),p1==p2)?(EOF):(*p1++))
#define putchar(x) ((p3==obuf+IOSIZE)&&(fwrite(obuf,p3-obuf,1,stdout),p3=obuf),*p3++=x)
#endif//fread in OJ, stdio in local
#define isdigit(ch) (ch>47&&ch<58)
#define isspace(ch) (ch<33)
	template<typename T> inline T read() {
		T s = 0;
		int w = 1;
		char ch;
		while (ch = getchar(), !isdigit(ch) and (ch != EOF)) if (ch == '-') w = -1;
		if (ch == EOF) return false;
		while (isdigit(ch)) s = s * 10 + ch - 48, ch = getchar();
		return s * w;
	}
	template<typename T> inline bool read(T &s) {
		s = 0;
		int w = 1;
		char ch;
		while (ch = getchar(), !isdigit(ch) and (ch != EOF)) if (ch == '-') w = -1;
		if (ch == EOF) return false;
		while (isdigit(ch)) s = s * 10 + ch - 48, ch = getchar();
		return s *= w, true;
	}
	inline bool read(char &s) {
		while (s = getchar(), isspace(s));
		return true;
	}
	inline bool read(char *s) {
		char ch;
		while (ch = getchar(), isspace(ch));
		if (ch == EOF) return false;
		while (!isspace(ch)) *s++ = ch, ch = getchar();
		*s = '\000';
		return true;
	}
	template<typename T> inline void print(T x) {
		if (x < 0) putchar('-'), x = -x;
		if (x > 9) print(x / 10);
		putchar(x % 10 + 48);
	}
	inline void print(char x) {
		putchar(x);
	}
	inline void print(char *x) {
		while (*x) putchar(*x++);
	}
	inline void print(const char *x) {
		for (int i = 0; x[i]; i++) putchar(x[i]);
	}
#ifdef _GLIBCXX_STRING
	inline bool read(std::string& s) {
		s = "";
		char ch;
		while (ch = getchar(), isspace(ch));
		if (ch == EOF) return false;
		while (!isspace(ch)) s += ch, ch = getchar();
		return true;
	}
	inline void print(std::string x) {
		for (int i = 0, n = x.size(); i < n; i++)
			putchar(x[i]);
	}
#endif//string
	template<typename T, typename... T1> inline int read(T& a, T1&... other) {
		return read(a) + read(other...);
	}
	template<typename T, typename... T1> inline void print(T a, T1... other) {
		print(a);
		print(other...);
	}

	struct Fast_IO {
		~Fast_IO() {
			fwrite(obuf, p3 - obuf, 1, stdout);
		}
	} io;
	template<typename T> Fast_IO& operator >> (Fast_IO &io, T &b) {
		return read(b), io;
	}
	template<typename T> Fast_IO& operator << (Fast_IO &io, T b) {
		return print(b), io;
	}
#define cout io
#define cin io
#define endl '\n'
} using namespace fast_IO;
namespace smiling{
	int n,a;
	ll s;
	int main(){
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a;
			s+=a;
		}
		cout<<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 fast_IO {
#define FASTIO
#define IOSIZE 100000
	char ibuf[IOSIZE], obuf[IOSIZE];
	char *p1 = ibuf, *p2 = ibuf, *p3 = obuf;
#ifdef ONLINE_JUDGE
#define getchar() ((p1==p2)and(p2=(p1=ibuf)+fread(ibuf,1,IOSIZE,stdin),p1==p2)?(EOF):(*p1++))
#define putchar(x) ((p3==obuf+IOSIZE)&&(fwrite(obuf,p3-obuf,1,stdout),p3=obuf),*p3++=x)
#endif//fread in OJ, stdio in local
#define isdigit(ch) (ch>47&&ch<58)
#define isspace(ch) (ch<33)
	template<typename T> inline T read() {
		T s = 0;
		int w = 1;
		char ch;
		while (ch = getchar(), !isdigit(ch) and (ch != EOF)) if (ch == '-') w = -1;
		if (ch == EOF) return false;
		while (isdigit(ch)) s = s * 10 + ch - 48, ch = getchar();
		return s * w;
	}
	template<typename T> inline bool read(T &s) {
		s = 0;
		int w = 1;
		char ch;
		while (ch = getchar(), !isdigit(ch) and (ch != EOF)) if (ch == '-') w = -1;
		if (ch == EOF) return false;
		while (isdigit(ch)) s = s * 10 + ch - 48, ch = getchar();
		return s *= w, true;
	}
	inline bool read(char &s) {
		while (s = getchar(), isspace(s));
		return true;
	}
	inline bool read(char *s) {
		char ch;
		while (ch = getchar(), isspace(ch));
		if (ch == EOF) return false;
		while (!isspace(ch)) *s++ = ch, ch = getchar();
		*s = '\000';
		return true;
	}
	template<typename T> inline void print(T x) {
		if (x < 0) putchar('-'), x = -x;
		if (x > 9) print(x / 10);
		putchar(x % 10 + 48);
	}
	inline void print(char x) {
		putchar(x);
	}
	inline void print(char *x) {
		while (*x) putchar(*x++);
	}
	inline void print(const char *x) {
		for (int i = 0; x[i]; i++) putchar(x[i]);
	}
#ifdef _GLIBCXX_STRING
	inline bool read(std::string& s) {
		s = "";
		char ch;
		while (ch = getchar(), isspace(ch));
		if (ch == EOF) return false;
		while (!isspace(ch)) s += ch, ch = getchar();
		return true;
	}
	inline void print(std::string x) {
		for (int i = 0, n = x.size(); i < n; i++)
			putchar(x[i]);
	}
#endif//string
	template<typename T, typename... T1> inline int read(T& a, T1&... other) {
		return read(a) + read(other...);
	}
	template<typename T, typename... T1> inline void print(T a, T1... other) {
		print(a);
		print(other...);
	}

	struct Fast_IO {
		~Fast_IO() {
			fwrite(obuf, p3 - obuf, 1, stdout);
		}
	} io;
	template<typename T> Fast_IO& operator >> (Fast_IO &io, T &b) {
		return read(b), io;
	}
	template<typename T> Fast_IO& operator << (Fast_IO &io, T b) {
		return print(b), io;
	}
#define cout io
#define cin io
#define endl '\n'
} using namespace fast_IO;
namespace smiling{
	int n,a;
	ll s;
	int main(){
		cin>>n;
		for(int i=1;i<=n;i++){
			cout<<100000000<<' ';
		}
		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: 79ms
memory: 3808kb

input:

10000000
159351169 393256766 568393100 544379911 208875355 510610212 860176511 778391584 997410966 337100680 309510583 422675831 940069154 640559017 964636758 133480545 177232158 675826071 456718832 294681807 781050628 906084001 373058275 656799641 403203061 965280468 139007913 900857466 341377069 8...

output:

5500158151261243

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 216ms
memory: 3724kb

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
English 繁體中文 简体中文

Server Time: 2025-01-20 21:59:11 | OpenSource Project