QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#84172	#1. I/O Test	JWRuixi	200 ✓	574ms	4324kb	C++20	2.6kb	2023-03-05 20:49:47	2023-03-05 20:49:50

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-03-05 20:49:50]
评测

测评结果：200
用时：574ms
内存：4324kb

查看

[2023-03-05 20:49:47]
提交

config.txt

10000000
10000000

文本文件

input_test

#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#define LL long long
#define writesp(x) write(x), putchar(' ')
#define writeln(x) write(x), putchar('\n')
#define FileIO(ch) freopen(ch".in", "r", stdin), freopen(ch".out", "w", stdout)
using namespace std;

namespace IO {
    char ibuf[(1 << 20) + 1], *iS, *iT, stk[(1 << 20) + 1], *tp = stk, obuf[(1 << 20) + 1], *oS = obuf;
#if ONLINE_JUDGE
#define gh() (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, (1 << 20) + 1, stdin), (iS == iT ? EOF : *iS++) : *iS++)
#else
#define gh() getchar()
#endif
    inline int read() {
        char ch = gh();
        int x = 0;
        bool t = 0;
        while (ch < '0' || ch > '9') t |= ch == '-', ch = gh();
        while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = gh();
        return t ? ~(x - 1) : x;
    }
    inline void write(LL x) {
    	if (x < 0) {
    		x = ~(x - 1);
    		*oS++ = '-';
		}
		for (; x > 9; x /= 10) *tp++ = ((x % 10) | 48);
		*tp++ = (x | 48);
		while (tp != stk) *oS++ = *--tp;
		fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;
    }
}

using IO::read;
using IO::write;

int n;
LL ans;

int main() {
	n = read();
	for (int i = 1; i <= n; i++) ans += read();
	write(ans);
}
// I love WHQ!

源文件, 语言: C++20

output_test

#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#define LL long long
#define writesp(x) write(x), putchar(' ')
#define writeln(x) write(x), putchar('\n')
#define FileIO(ch) freopen(ch".in", "r", stdin), freopen(ch".out", "w", stdout)
using namespace std;

namespace IO {
    char ibuf[(1 << 20) + 1], *iS, *iT, stk[(1 << 20) + 1], *tp = stk, obuf[(1 << 20) + 1], *oS = obuf;
#if ONLINE_JUDGE
#define gh() (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, (1 << 20) + 1, stdin), (iS == iT ? EOF : *iS++) : *iS++)
#else
#define gh() getchar()
#endif
    inline int read() {
        char ch = gh();
        int x = 0;
        bool t = 0;
        while (ch < '0' || ch > '9') t |= ch == '-', ch = gh();
        while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = gh();
        return t ? ~(x - 1) : x;
    }
    inline void write(int x) {
    	if (x < 0) {
    		x = ~(x - 1);
    		*oS++ = '-';
		}
		for (; x > 9; x /= 10) *tp++ = ((x % 10) | 48);
		*tp++ = (x | 48);
		while (tp != stk) *oS++ = *--tp;
		fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;
    }
}

using IO::read;
using IO::write;

int n;

int main() {
	n = read();
	for (int i = 1; i <= n; i++) writesp(100000000);
}
// I love WHQ!

源文件, 语言: C++20

詳細信息

Subtask #1:

score: 100

Accepted

Test #1:

score: 100

Accepted

time: 103ms

memory: 4324kb

input:

10000000
324482531 123707703 803586446 287034489 599818766 499897313 317488866 113008618 546560365 240912895 995449064 426965754 840742953 546420076 702463916 736805584 877642230 386610056 608888447 298743938 421781301 249641438 893052972 716727179 234859032 728093817 992065046 784197286 323979237 3...

output:

5498949547386074

result:

points 1.0 input test passed

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 574ms

memory: 3316kb

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