QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#84178#1. I/O TestJWRuixi200 ✓212ms4404kbC++202.8kb2023-03-05 21:01:302023-03-05 21:01:33

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 21:01:33]
  • 评测
  • 测评结果:200
  • 用时:212ms
  • 内存:4404kb
  • [2023-03-05 21:01:30]
  • 提交

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);
        while (oS != obuf) putchar(*--oS);
    }
}

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!

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[20], *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 flush () {
    	fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;
	}
    inline void pc (char ch) {
    	if (oS == obuf + (1 << 20) + 1) flush(); 
    	*oS++ = ch;
	}
    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 namespace IO;

int n;

int main() {
	n = read();
	for (int i = 1; i <= n; i++) 
		pc(49), pc(49), pc(49), pc(49), pc(49), pc(49), pc(49), pc(49), pc(49), pc(' ');
	return flush(), 0;
}
// I love WHQ!

詳細信息

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 100ms
memory: 4404kb

input:

10000000
652226807 906590870 544610122 109328853 768311747 722977133 260201553 825948900 236225422 929175561 415929609 544196634 187963913 618901800 743317967 858662771 830948239 661997316 198622505 121926639 583011526 728677866 324059587 667524452 436379593 873304709 519627994 155238297 918911627 7...

output:

5498900912306376

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 212ms
memory: 4344kb

input:

10000000

output:

111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 ...

result:

points 1.0 output test passed