QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#117511 | #1. I/O Test | icyM1voya | 100 | 78ms | 3800kb | C++14 | 936b | 2023-07-01 14:52:04 | 2023-07-01 14:52:07 |
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: 78ms
memory: 3800kb
input:
10000000 534920722 804367243 927342289 758226881 573481771 445816635 111867212 151083638 816981318 372139091 429168907 844752980 942431702 433669035 602720605 846911196 367030873 324142632 202490727 558689342 767301456 157195110 786576006 161715289 429973185 204644261 330413783 172159088 449163438 3...
output:
5499561008079938
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