QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#64666#1. I/O Testruizhangj200 ✓173ms36004kbC++142.2kb2022-11-25 09:04:122022-11-25 09:04:15

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-11-25 09:04:15]
  • 评测
  • 测评结果:200
  • 用时:173ms
  • 内存:36004kb
  • [2022-11-25 09:04:12]
  • 提交

config.txt

10000000 10000000

input_test

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace IO{
    const int siz=1<<25;
    char a[siz],b[siz],*ia=a+siz,*ea=a+siz,*ib=b,*eb=b+siz;
    int p[105],l=0;
    inline char gc(){if (ia==ea) fread(a,1,siz,stdin),ia=a;return *ia++;}
    inline void flush(){fwrite(b,1,ib-b,stdout);ib=b;}
    inline void pc(char c){if (ib==eb) flush();*ib++=c;}
    template<typename T> inline T read(){
        T x=0;char t=gc();
        for (;t<'0' || t>'9';t=gc());
        for (;'0'<=t && t<='9';t=gc()) x=x*10+t-'0';
        return x;
    }
    template<typename T> inline void write(T x,char ed='\n'){
        if (x<0) pc('-'),x=-x;
        if (!x) pc('0');
        for (;x;x/=10) p[++l]=x%10;
        for (;l;--l) pc(p[l]+'0');pc(ed);
    }
    struct f{~f(){flush();}}F;
}
using IO::read;
using IO::write;
#define input
// #define output
int main(){
    #ifdef input
    ll sum=0;
    for (int i=1,n=read<int>();i<=n;++i) sum+=read<int>();
    write(sum);
    #endif
    #ifdef output
    for (int i=1,n=read<int>();i<=n;++i) write<int>(999999999,' ');
    #endif
    return 0;
}

output_test

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace IO{
    const int siz=1<<25;
    char a[siz],b[siz],*ia=a+siz,*ea=a+siz,*ib=b,*eb=b+siz;
    int p[105],l=0;
    inline char gc(){if (ia==ea) fread(a,1,siz,stdin),ia=a;return *ia++;}
    inline void flush(){fwrite(b,1,ib-b,stdout);ib=b;}
    inline void pc(char c){if (ib==eb) flush();*ib++=c;}
    template<typename T> inline T read(){
        T x=0;char t=gc();
        for (;t<'0' || t>'9';t=gc());
        for (;'0'<=t && t<='9';t=gc()) x=x*10+t-'0';
        return x;
    }
    template<typename T> inline void write(T x,char ed='\n'){
        if (x<0) pc('-'),x=-x;
        if (!x) pc('0');
        for (;x;x/=10) p[++l]=x%10;
        for (;l;--l) pc(p[l]+'0');pc(ed);
    }
    struct f{~f(){flush();}}F;
}
using IO::read;
using IO::write;
// #define input
#define output
int main(){
    #ifdef input
    ll sum=0;
    for (int i=1,n=read<int>();i<=n;++i) sum+=read<int>();
    write(sum);
    #endif
    #ifdef output
    for (int i=1,n=read<int>();i<=n;++i) write<int>(999999999,' ');
    #endif
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 79ms
memory: 35948kb

input:

10000000
501587335 216605345 251139660 322341403 507807432 401164385 874722741 509767831 448624333 987555682 755025520 578956666 843123167 825828668 882625152 141530094 225093389 722359228 908625950 818324069 868000019 846723926 115641864 621136967 664153740 595369228 576078838 327702477 137399146 2...

output:

5500789884285568

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 173ms
memory: 36004kb

input:

10000000

output:

999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 ...

result:

points 1.0 output test passed