QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#32207 | #1. I/O Test | Qingyu | 200 ✓ | 63ms | 102088kb | C++23 | 856b | 2022-05-18 01:06:46 | 2023-09-11 15:16:43 |
Judging History
config.txt
10000000 10000000
input_test
#include <bits/stdc++.h>
template <int T>
struct fast_io {
char p[T], *p1, *p2;
fast_io() {
p1 = p2 = p;
fread(p, 1, T, stdin);
}
char gc() {
return *p1++;
}
};
fast_io<110'000'000> io;
int read() {
int r = 0, neg = 1;
char ch;
do ch = io.gc();while (ch < 48 || ch > 57);
do r = r * 10 + ch - 48, ch = io.gc(); while (ch >= 48 && ch <= 57);
return r;
}
int main() {
read();
long long sum = 0;
for (int i = 0; i < 10'000'000; ++i)
sum += read();
std::cout << sum;
}
output_test
#include <bits/stdc++.h>
char s[100'000'000];
int main() {
int n, x;
long long sum = 0;
int p=0;
for (int i = 0; i < 10'000'000; ++i) {
s[p++]=49;s[p++]=49;
s[p++]=49;
s[p++]=49;
s[p++]=49;
s[p++]=49;
s[p++]=49;
s[p++]=49;
s[p++]=49;
s[p++]='\n';
}
fwrite(s,1,p,stdout);
}
详细
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 63ms
memory: 102088kb
input:
10000000 462859139 453133661 994131955 571351663 248355519 370600789 631092732 212059016 502342675 933603178 126092840 101449924 225048699 681328875 698129271 269810485 138547814 732465511 391697509 858737647 986565924 452400980 264291448 784428954 592354397 594791977 456931307 614476641 739088870 1...
output:
5500287273136254
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 7ms
memory: 101076kb
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