QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #330396 | #1. I/O Test | Difficult_to_naming | 200 ✓ | 67ms | 4048kb | C++20 | 2.4kb | 2024-02-17 15:19:34 | 2024-02-17 15:19:36 |
Judging History
config.txt
10000000 10000000
input_test
#include<bits/stdc++.h>
namespace FAST_IO{
const int LEN=1<<18;
char BUF[LEN],PUF[LEN];
int Pin=LEN,Pout;
inline void flushin(){memcpy(BUF,BUF+Pin,LEN-Pin),fread(BUF+LEN-Pin,1,Pin,stdin),Pin=0;return;}
inline void flushout(){fwrite(PUF,1,Pout,stdout),Pout=0;return;}
inline char Getc(){return (Pin==LEN?(fread(BUF,1,LEN,stdin),Pin=0):0),BUF[Pin++];}
inline char Get(){return BUF[Pin++];}
inline void Putc(char x){if(Pout==LEN)flushout(),Pout=0;PUF[Pout++]=x;}
inline void Put(char x){PUF[Pout++]=x;}
template<typename tp=int>inline tp read(){(Pin+32>=LEN)?flushin():void();tp res=0;char f=1,ch=' ';for(;ch<'0'||ch>'9';ch=Get())if(ch=='-')f=-1;for(;ch>='0'&&ch<='9';ch=Get())res=(res<<3)+(res<<1)+ch-48;return res*f;}
template<typename tp>inline void wt(tp a){if(a>9)wt(a/10);Put(a%10+'0');return;}
template<typename tp>inline void write(tp a,char b=' ')
{
static int stk[20],top;
(Pout+32>=LEN)?flushout():void();
if(a<0)Put('-'),a=-a;
else if(a==0)Put('0');
for(top=0;a;a/=10)stk[++top]=a%10;
for(;top;--top)Put(stk[top]^48);
Put(b);
return;
}
}
using namespace FAST_IO;
int n;
long long sum;
signed main(){
n=read();
for(int i=1;i<=n;i++)sum+=read();
printf("%lld",sum);
return 0;
}
output_test
#include<bits/stdc++.h>
namespace FAST_IO{
const int LEN=1<<18;
char BUF[LEN],PUF[LEN];
int Pin=LEN,Pout;
inline void flushin(){memcpy(BUF,BUF+Pin,LEN-Pin),fread(BUF+LEN-Pin,1,Pin,stdin),Pin=0;return;}
inline void flushout(){fwrite(PUF,1,Pout,stdout),Pout=0;return;}
inline char Getc(){return (Pin==LEN?(fread(BUF,1,LEN,stdin),Pin=0):0),BUF[Pin++];}
inline char Get(){return BUF[Pin++];}
inline void Putc(char x){if(Pout==LEN)flushout(),Pout=0;PUF[Pout++]=x;}
inline void Put(char x){PUF[Pout++]=x;}
template<typename tp=int>inline tp read(){(Pin+32>=LEN)?flushin():void();tp res=0;char f=1,ch=' ';for(;ch<'0'||ch>'9';ch=Get())if(ch=='-')f=-1;for(;ch>='0'&&ch<='9';ch=Get())res=(res<<3)+(res<<1)+ch-48;return res*f;}
template<typename tp>inline void wt(tp a){if(a>9)wt(a/10);Put(a%10+'0');return;}
template<typename tp>inline void write(tp a,char b=' ')
{
static int stk[20],top;
(Pout+32>=LEN)?flushout():void();
if(a<0)Put('-'),a=-a;
else if(a==0)Put('0');
for(top=0;a;a/=10)stk[++top]=a%10;
for(;top;--top)Put(stk[top]^48);
Put(b);
return;
}
}
using namespace FAST_IO;
int n,sum;
signed main(){
n=read();
for(int i=1;i<=n;i++)write(114514191);
flushout();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 67ms
memory: 4048kb
input:
10000000 307350756 700695849 641227391 543365228 185393198 439068546 543720957 693539447 745706386 645984746 497049221 595194516 782887207 868783393 533943837 326979820 466411574 341575484 940047315 132376518 287772577 141112076 965117607 933230301 814228325 510345093 154174728 693015243 747280901 8...
output:
5499844801680597
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 23ms
memory: 4008kb
input:
10000000
output:
114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 114514191 ...
result:
points 1.0 output test passed