QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #60781 | #1. I/O Test | platelet | 0 | 0ms | 0kb | C11 | 1.2kb | 2022-11-07 12:52:51 | 2022-11-07 12:52:51 |
Judging History
config.txt
10000000 10000000
input_test
#include <cstring>
#include <cstdio>
const int inSZ = 1 << 17;
unsigned char inBuf[inSZ], *in1, *in2;
inline __attribute((always_inline))
unsigned read() {
unsigned res = 0;
unsigned char c;
while((c = *in1++) < 48);
while(res = res * 10 + c - 48, (c = *in1++) >= 48);
return res;
}
inline __attribute((always_inline))
void refresh() {
if(__builtin_expect(in1 > inBuf + inSZ - 128, 0)) {
auto len = in2 - in1;
memcpy(inBuf, in1, len);
in1 = inBuf, in2 = inBuf + len;
in2 += fread(in2, 1, inSZ - len, stdin);
if(in2 != inBuf + inSZ) *in2 = 0;
}
}
int main() {
in1 = inBuf;
in2 = in1 + fread(in1, 1, inSZ, stdin);
read();
unsigned long sum = 0;
for(int i = 0; i < 1000000; i++) {
#pragma GCC unroll 10
for(int j = 0; j < 10; j++) sum += read();
refresh();
}
printf("%lu\n", sum);
}
output_test
#include <cstring>
#include <cstdio>
const int outSZ = 2e6;
unsigned char outBuf[outSZ];
int main() {
memset(outBuf, '9', outSZ);
for(int i = 9; i < outSZ; i += 10) outBuf[i] = ' ';
for(int i = 50; i; i--) fwrite(outBuf, 1, outSZ, stdout);
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
input_test Judgement Failed
Test #1:
score: 0
input_test Judgement Failed
input:
10000000 624609959 696030186 276395566 991525905 616308787 873823113 121271324 784015045 667803832 438217681 759330321 915370849 416848123 471188139 974514252 388559800 987275209 482230942 752474652 840824250 383280716 630273231 301047759 848590635 839583066 251907418 893700794 625525980 127597201 1...
output:
result:
Subtask #2:
score: 0
output_test Judgement Failed
Test #2:
score: 0
output_test Judgement Failed
input:
10000000