QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#84164	#1. I/O Test	JWRuixi	0	76ms	4472kb	C++20	2.5kb	2023-03-05 20:38:34	2023-03-05 20:38:37

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:38:37]
评测

测评结果：0
用时：76ms
内存：4472kb

查看

[2023-03-05 20:38:34]
提交

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, 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(long long x) {
        if (x < 0) {
            x = ~(x - 1);
            putchar('-');
        }
        for (; x > 9; x /= 10) *oS++ = ((x % 10) | 48);
        *oS++ = (x | 48);
        fwrite(obuf, 1, oS - obuf, stdout);
    }
}

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, 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);
            putchar('-');
        }
        for (; x > 9; x /= 10) *oS++ = ((x % 10) | 48);
        *oS++ = (x | 48), *oS++ = ' ';
        fwrite(obuf, 1, oS - obuf, stdout);
    }
}

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: 0

Wrong Answer

Test #1:

score: 0

Wrong Answer

time: 76ms

memory: 4472kb

input:

10000000
279379144 415916308 460808247 421627793 441421312 867937245 831279430 577670908 620488271 215383143 266192165 127998734 359295645 997045564 578800188 244142139 629855773 741549952 876154789 717195722 453196671 548252066 721702456 234190985 786933061 937311010 298991541 878560230 157675853 1...

output:

4937965486668945

result:

wrong answer expected 5498666845697394, found 4937965486668945

Subtask #2:

score: 0

output_test Output Limit Exceeded

Test #2:

score: 0

output_test Output Limit Exceeded

input:

10000000

output:

000000001  000000001 000000001  000000001 000000001 000000001  000000001 000000001 000000001 000000001  000000001 000000001 000000001 000000001 000000001  000000001 000000001 000000001 000000001 000000001 000000001  000000001 000000001 000000001 000000001 000000001 000000001 000000001  000000001 000...