QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#117512 | #1. I/O Test | icyM1voya | 100 | 86ms | 3556kb | C++14 | 936b | 2023-07-01 14:53:34 | 2023-07-01 14:53:36 |
Judging History
config.txt
10000000 10000000
input_test
#include<bits/stdc++.h>
#define gc (l==r&&(r=(l=c)+fread(c,1,65536,stdin),l==r)?EOF:*l++)
long long s0,s1,s2,s3,s4,s5,s6,s7; char c[65536],*l=c,*r=c;
inline int read() {
int x=0; char ch=gc;
while (!isdigit(ch)) ch=gc;
while (isdigit(ch)) x=x*10+(ch^48),ch=gc;
return x;
}
int main() {
read();
for (int i=1; i<=1250000; ++i) {
s0+=read(); s1+=read(); s2+=read(); s3+=read();
s4+=read(); s5+=read(); s6+=read(); s7+=read();
}
printf("%lld\n",s0+s1+s2+s3+s4+s5+s6+s7);
return 0;
}
output_test
#include<cstdio>
#define O cw[++p1]='1';
char cw[65536];
inline void write() {
O O O O O O O O O cw[++p1]=' ';
if (p1>65516) fwrite(cw,1,p1+1,stdout),p1=-1;
}
int main() {
for (int i=1; i<=1250000; ++i) {
write(); write(); write(); write();
write(); write(); write(); write();
}
return fwrite(cw,1,p1+1,stdout),0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 86ms
memory: 3556kb
input:
10000000 172210602 708263996 884455153 341454765 871367919 325933243 970565201 854700040 197170499 752188097 270437437 301713366 978412732 764125763 817682120 772196778 302705273 804824683 495986185 192808028 588640122 776358366 682155759 772775468 862341636 772825938 716583017 877528627 898521811 4...
output:
5499194256597289
result:
points 1.0 input test passed
Subtask #2:
score: 0
output_test Judgement Failed
Test #2:
score: 0
output_test Judgement Failed
input:
10000000