QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#188995 | #1. I/O Test | 5ab | 100 | 193ms | 101084kb | C++20 | 1.3kb | 2023-09-26 18:39:08 | 2023-09-26 18:39:09 |
Judging History
config.txt
10000000 10000000
input_test
#include <iostream>
#include <cstring>
#include <limits>
using namespace std;
static constexpr size_t buf_size = 134217728;
static char inbuf[buf_size + 1] = {};
namespace {
char *pos, *end;
void load() {
pos = inbuf;
end = inbuf + cin.readsome(inbuf, buf_size);
*end = '\0';
}
inline char get_next() { return *(pos++); }
template<class T>
void scan(T &x) {
char c = get_next();
// 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()
{
cin.tie(0)->sync_with_stdio(0);
int x = 1e7;
long long res = 0, y;
load();
scan(x);
while (x--)
{
scan(y);
res += y;
// res ^= y;
}
cout << res << "\n";
return 0;
}
output_test
/* name: out
* author: 5ab
* created at: 2023-09-26
*/
#include <cstdio>
using namespace std;
constexpr int obuf = 9e7 + 1;
char buf[obuf + 1], *p = buf;
signed main()
{
int n = 1e7;
while (n--)
{
*p++ = '1';
*p++ = '1';
*p++ = '1';
*p++ = '1';
*p++ = '1';
*p++ = '1';
*p++ = '1';
*p++ = '1';
*p++ = ' ';
}
fwrite(buf, 1, p - buf, stdout);
return 0;
}
// started coding at: 09-26 18:32:36
详细
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 51ms
memory: 101084kb
input:
10000000 530945809 265884906 581707984 170572253 916053803 602435271 262641621 512247852 986581312 953496233 709812338 589594369 500881124 335185121 115995486 601984435 673926576 661428746 684918733 234170575 422091091 397209196 949309236 112574903 998762043 352000850 888869050 524694757 970299524 6...
output:
5499372074344938
result:
points 1.0 input test passed
Subtask #2:
score: 0
Wrong Answer
Test #2:
score: 0
Wrong Answer
time: 193ms
memory: 89096kb
input:
10000000
output:
11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 111...
result:
wrong answer Integer 11111111 violates the range [10^8, 999999999]