QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#677286	#1. I/O Test	daydreamwarrior	200 ✓	252ms	4656kb	C++17	1.6kb	2024-10-26 10:57:10	2024-10-26 10:57:13

Judging History

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

[2024-10-26 10:57:13]
评测

测评结果：200
用时：252ms
内存：4656kb

查看

[2024-10-26 10:57:10]
提交

config.txt

10000000 10000000

Text file

input_test

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

namespace fastio{
    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;signed stk[39],tp;
    template<typename T>void out(T x,char c=0){
        if(x<0)putchar('-'),x=-x;
        do stk[tp++]=x%10;while(x/=10);
        while(tp)putchar(stk[--tp]^48);
        if(c)putchar(c);
    }
}using fastio::in,fastio::out;

int main(){
    int n = in;
    long long ans = 0;
    for(int k=1;k<=n;k++)
        ans += (int)in;
    out(ans);
    return 0;
}

Source code, Language: C++17

output_test

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

namespace fastio{
    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;signed stk[39],tp;
    template<typename T>void out(T x,char c=0){
        if(x<0)putchar('-'),x=-x;
        do stk[tp++]=x%10;while(x/=10);
        while(tp)putchar(stk[--tp]^48);
        if(c)putchar(c);
    }
}using fastio::in,fastio::out;

int main(){
    int n = in;
    for(int k=1;k<=n;k++)
        out(100000000,' ');
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100

Accepted

Test #1:

score: 100

Accepted

time: 75ms

memory: 4656kb

input:

10000000
575290857 476305671 874958655 214162030 868492466 139908735 945556023 746299816 770814979 305623216 364408354 904011800 470501958 632858792 273105820 533879681 401659898 861694846 287653410 961745310 958060395 384753372 893957618 271399678 951059621 782318994 690763543 722347488 865877135 3...

output:

5499758147856047

result:

points 1.0 input test passed

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 252ms

memory: 3632kb

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