QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #188997 | #1. I/O Test | 5ab | 200 ✓ | 55ms | 101032kb | C++20 | 1.3kb | 2023-09-26 18:40:38 | 2023-09-26 18:40:38 |
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 = 1e8 + 1;
char s[obuf + 1];
signed main()
{
int n = 1e7, p = 0;
while (n--)
{
s[p++] = '1';
s[p++] = '1';
s[p++] = '1';
s[p++] = '1';
s[p++] = '1';
s[p++] = '1';
s[p++] = '1';
s[p++] = '1';
s[p++] = '1';
s[p++] = ' ';
}
fwrite(s, 1, p, stdout);
return 0;
}
// started coding at: 09-26 18:32:36
详细
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 55ms
memory: 101032kb
input:
10000000 517336647 796436800 432075377 462492699 278911661 334478931 645722285 174069689 838978276 445458534 780322127 394713457 169935149 348858892 505641553 353336936 974085795 290440514 962862737 217446519 741775568 498451149 663111394 717321679 477577391 162453265 845335528 598485088 138015575 3...
output:
5499012551741584
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 4ms
memory: 98936kb
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