QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#542945	#1. I/O Test	sun_vitamessage	20	8ms	3680kb	C++23	2.0kb	2024-09-01 11:25:19	2024-09-01 11:25:20

Judging History

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

[2024-09-01 11:25:20]
评测

测评结果：20
用时：8ms
内存：3680kb

查看

[2024-09-01 11:25:19]
提交

config.txt

1000000 1000000

文本文件

input_test

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define dbg(x) cout<<#x<<": "<<x<<"\n"
static char buf[100],*p1=buf,*p2=buf,obuf[100],*p3=obuf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,100,stdin),p1==p2)?EOF:*p1++
#define putchar(x) (p3-obuf<100)?(*p3++=x):(fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=x)
inline ll read(){ll x=0,f=1;char c=getchar();while(c<48||c>57){if(c==45)f=0;c=getchar();}while(c>47&&c<58)x=(x<<3)+(x<<1)+(c^48),c=getchar();return f?x:-x;}
inline void write(ll x){if(!x){putchar(48);putchar('\n');return;}short top=0,s[40];if(x<0)x=-x,putchar(45);while(x)s[top++]=x%10^48,x/=10;while(top--)putchar(s[top]);putchar('\n');}
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());
const ll mod=1e9+7,maxn=1e5+5,maxt=505;
ll n,sum;
inline void solve(){
    n=read();
    for(ll i=1;i<=n;++i)sum+=read();
    write(sum);
}
signed main(){
    ll t=1;
    while(t--){
        solve();
    }
    fwrite(obuf,p3-obuf,1,stdout);
    return 0;
}

源文件, 语言: C++23

output_test

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define dbg(x) cout<<#x<<": "<<x<<"\n"
static char buf[100],*p1=buf,*p2=buf,obuf[100],*p3=obuf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,100,stdin),p1==p2)?EOF:*p1++
#define putchar(x) (p3-obuf<100)?(*p3++=x):(fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=x)
inline ll read(){ll x=0,f=1;char c=getchar();while(c<48||c>57){if(c==45)f=0;c=getchar();}while(c>47&&c<58)x=(x<<3)+(x<<1)+(c^48),c=getchar();return f?x:-x;}
inline void write(ll x){if(!x){putchar(48);putchar(' ');return;}short top=0,s[40];if(x<0)x=-x,putchar(45);while(x)s[top++]=x%10^48,x/=10;while(top--)putchar(s[top]);putchar(' ');}
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());
const ll mod=1e9+7,maxn=1e5+5,maxt=505;
ll n;
inline void solve(){
    n=read();
    for(ll i=1;i<=n;++i)write(100000000);
}
signed main(){
    ll t=1;
    while(t--){
        solve();
    }
    fwrite(obuf,p3-obuf,1,stdout);
    return 0;
}

源文件, 语言: C++23

詳細信息

Subtask #1:

score: 10

Acceptable Answer

Test #1:

score: 10

Acceptable Answer

time: 7ms

memory: 3680kb

input:

1000000
841026144 251307128 597935318 332853152 989015469 800853799 144260356 348978309 572619345 284648268 150595251 453157475 567675383 182621905 957009650 979006431 681780826 381155169 426196428 849549733 527812920 131726405 956390628 433938353 321518011 602617800 853031614 637348529 973224247 29...

output:

549754012017182

result:

points 0.10 input test passed

Subtask #2:

score: 10

Acceptable Answer

Test #2:

score: 10

Acceptable Answer

time: 8ms

memory: 3536kb

input:

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 0.10 output test passed