QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#180728 | #1. I/O Test | 5ab | 100 | 68ms | 1744kb | C++20 | 1.1kb | 2023-09-16 10:55:56 | 2023-09-16 10:55:57 |
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] = {};
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: 68ms
memory: 1744kb
input:
10000000 176760540 420302759 890655446 185502498 391852169 528245553 149092014 703820142 626965496 463890586 558148190 777189673 997053153 139253859 844381904 255848459 772535756 786572010 931325965 500808112 703578117 797140271 613901706 206636950 352037525 814832283 208660464 350928217 362853020 1...
output:
5499920428471457
result:
points 1.0 input test passed
Subtask #2:
score: 0
Skipped