QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#84177#1. I/O TestJWRuixi200 ✓209ms4468kbC++202.8kb2023-03-05 20:59:312023-03-05 20:59: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 20:59:33]
  • 评测
  • 测评结果:200
  • 用时:209ms
  • 内存:4468kb
  • [2023-03-05 20:59:31]
  • 提交

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!

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!

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 110ms
memory: 4468kb

input:

10000000
103221478 105034662 941012333 658591553 785442722 539953221 672698418 843634196 501396750 472459928 184941595 877230219 760053115 550175888 990676092 720313385 148186177 533904095 868817776 771164192 543320197 199974594 873271177 888753904 425106146 784761382 227694292 711910900 432068992 4...

output:

5500515802469401

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 209ms
memory: 4280kb

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