QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#524592	#1. I/O Test	yae_miko	100	84ms	3664kb	C++14	2.0kb	2024-08-19 20:37:24	2024-08-19 20:37:24

Judging History

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

[2024-08-19 20:37:24]
评测

测评结果：100
用时：84ms
内存：3664kb

查看

[2024-08-19 20:37:24]
提交

config.txt

10000000 10000000

文本文件

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();
}
signed main(){
    ll t=1;
    while(t--){
        solve();
    }
    fwrite(obuf,p3-obuf,1,stdout);
    return 0;
}

源文件, 语言: C++14

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++14

詳細信息

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 0

Wrong Answer

time: 84ms

memory: 3532kb

input:

10000000
783469206 143982056 342827922 700443512 283993330 775154361 941739292 269932815 393767188 500467319 131085459 910199133 901126387 286640746 201960078 302584329 856493017 398171502 871712761 367315181 935825819 548308161 615350300 956761138 351200130 626753036 989457722 267337255 617846955 5...

output:

result:

wrong output format Unexpected end of file - int64 expected

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 71ms

memory: 3664kb

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