QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#180729 | #1. I/O Test | 5ab | 100 | 66ms | 1728kb | C++20 | 1.1kb | 2023-09-16 10:58:31 | 2023-09-16 10:58:32 |
Judging History
config.txt
10000000 0
input_test
#include <cstdio>
#include <cstring>
using namespace std;
static constexpr size_t buf_size = 1 << 18;
static constexpr size_t integer_size = 10;
static char inbuf[buf_size + 1] = {};
namespace {
size_t pos, end;
void load() {
end = fread(inbuf, 1, buf_size, stdin);
inbuf[end] = '\0';
}
void reload() {
size_t len = end - pos;
memmove(inbuf, inbuf + pos, len);
end = len + fread(inbuf + len, 1, buf_size - len, stdin);
inbuf[end] = '\0';
pos = 0;
}
void skip_space() {
while (inbuf[pos] <= ' ') {
if (__builtin_expect(++pos == end, 0))
reload();
}
}
char get_next() { return inbuf[pos++]; }
char get_next_nonspace() {
skip_space();
return inbuf[pos++];
}
template<class T>
void scan(T &x) {
char c = get_next_nonspace();
if (__builtin_expect(pos + integer_size >= end, 0))
reload();
x = c & 15;
while ((c = get_next()) >= '0')
x = x * 10 + (c & 15);
}
}
int main()
{
// cin.tie(0)->sync_with_stdio(0);
int x, y;
long long res = 0;
load();
scan(x);
while (x--)
{
scan(y);
res += y;
}
printf("%lld\n", res);
return 0;
}
output_test
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 66ms
memory: 1728kb
input:
10000000 920614891 631765003 895963001 656554606 944947958 178566358 239709230 597491786 544837167 760948050 555139320 372176066 601055047 259629156 580534883 522995989 281996100 931325376 296934414 447451026 957771286 560287487 684380096 362868583 384685274 142991207 157454493 988697038 162874214 9...
output:
5499574179154546
result:
points 1.0 input test passed
Subtask #2:
score: 0
Skipped