QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #684086 | #1. I/O Test | daydreamwarrior | 200 ✓ | 261ms | 4616kb | C++14 | 2.1kb | 2024-10-28 10:00:56 | 2024-10-28 10:00:57 |
Judging History
config.txt
10000000 10000000
input_test
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
struct{char buf[1<<20],*l=buf,*r=l;
operator char(){return l==r&&(r=(l=buf)+fread(buf,1,1<<20,stdin),l==r)?-1:*l++;}
template<typename T>operator T(){
T x=0;char f=0,c;
do if((c=*this)=='-')f=1;while(c<'0'||c>'9');
while(c>='0'&&c<='9')x=x*10+(c^48),c=*this;
return f?-x:x;
}}in;
struct fasto{
char buf[1<<20],*p=buf;
void flush(){fwrite(buf,1,p-buf,stdout);p=buf;}
void operator()(char c){putchar(c);}
void operator()(const char *s){while(*s)(*this)(*s++);}
~fasto(){flush();}
signed stk[39],tp;
template<typename T>void operator()(T x){
if(x<0)(*this)('-'),x=-x;
do stk[tp++]=x%10;while(x/=10);
while(tp)(*this)(char(stk[--tp]^48));
}
template<typename T,typename...Args>
void operator()(T x,Args... args){(*this)(x);(*this)(args...);}
}out;
int main(){
int n = in;
long long ans = 0;
for(int k=1;k<=n;k++)
ans += (int)in;
out(ans);
return 0;
}
output_test
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
struct{char buf[1<<20],*l=buf,*r=l;
operator char(){return l==r&&(r=(l=buf)+fread(buf,1,1<<20,stdin),l==r)?-1:*l++;}
template<typename T>operator T(){
T x=0;char f=0,c;
do if((c=*this)=='-')f=1;while(c<'0'||c>'9');
while(c>='0'&&c<='9')x=x*10+(c^48),c=*this;
return f?-x:x;
}}in;
struct fasto{
char buf[1<<20],*p=buf;
void flush(){fwrite(buf,1,p-buf,stdout);p=buf;}
void operator()(char c){putchar(c);}
void operator()(const char *s){while(*s)(*this)(*s++);}
~fasto(){flush();}
signed stk[39],tp;
template<typename T>void operator()(T x){
if(x<0)(*this)('-'),x=-x;
do stk[tp++]=x%10;while(x/=10);
while(tp)(*this)(char(stk[--tp]^48));
}
template<typename T,typename...Args>
void operator()(T x,Args... args){(*this)(x);(*this)(args...);}
}out;
int main(){
int n = in;
for(int k=1;k<=n;k++)
out(100000000,' ');
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 84ms
memory: 4616kb
input:
10000000 255274080 682322299 206467790 770061370 962004026 914201992 745844869 924313539 791240848 405573019 870417159 784621253 100568146 945552924 255485870 921974098 314880195 788413076 643415873 952148083 770279530 241102284 711370277 581950606 436603216 235672731 739820523 441735620 258139125 4...
output:
5499683929396629
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 261ms
memory: 3612kb
input:
10000000
output:
100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 ...
result:
points 1.0 output test passed