QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#180711 | #1. I/O Test | 5ab | 0 | 53ms | 1664kb | C++20 | 1.1kb | 2023-09-16 10:39:03 | 2023-09-16 10:39:04 |
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 = 20;
static char inbuf[buf_size + 1] = {};
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++];
}
void scan(long long &x) {
char c = get_next_nonspace();
if (__builtin_expect(pos + integer_size >= end, 0))
reload();
bool neg = false;
if (c == '-')
neg = true, x = 0;
else
x = c & 15;
while ((c = get_next()) >= '0')
x = x * 10 + (c & 15);
if (neg)
x = -x;
}
int main()
{
int x = 1e7;
long long res = 0, y;
load();
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: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 53ms
memory: 1664kb
input:
10000000 752444893 925688333 662961128 789532247 899319450 975572998 162122790 540778113 608398293 779710558 968710711 617938292 877191102 394585013 102260825 242749634 803653552 556099763 863558830 116101052 429408177 424103246 675846053 269093690 321225099 303013111 943073345 356469972 313059820 7...
output:
5500411630325146
result:
wrong answer expected 5500411917121858, found 5500411630325146
Subtask #2:
score: 0
Skipped