QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #478859 | #1. I/O Test | daydreamwarrior | 200 ✓ | 192ms | 3684kb | C++17 | 1.8kb | 2024-07-15 11:50:30 | 2024-07-15 11:50:31 |
Judging History
config.txt
10000000 10000000
input_test
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define getchar my_getchar
const int Isize = 1<<22;
char ibuf[Isize],*p1=ibuf,*p2=ibuf;
inline char getchar() {return p1==p2&&(p2=(p1=ibuf)+fread(ibuf,sizeof(char),sizeof(ibuf),stdin),p1==p2)?EOF:*p1++;}
namespace fastio{
struct{template<typename T>operator T(){
T x=0;char f=0,c=getchar_unlocked();
while(c<'0'||c>'9'){if(c=='-')f=1;c=getchar_unlocked();}
while(c>='0'&&c<='9'){x=x*10+(c^48);c=getchar_unlocked();}
return f?-x:x;
}}in;int stk[39],tp;
template<typename T>void out(T x,char c=0){
if(x<0)putchar_unlocked('-'),x=-x;
do stk[tp++]=x%10;while(x/=10);
while(tp)putchar_unlocked(stk[--tp]^48);
if(c)putchar_unlocked(c);
}
}using fastio::in;using 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;
}
output_test
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define getchar my_getchar
const int Isize = 1<<22;
char ibuf[Isize],*p1=ibuf,*p2=ibuf;
inline char getchar() {return p1==p2&&(p2=(p1=ibuf)+fread(ibuf,sizeof(char),sizeof(ibuf),stdin),p1==p2)?EOF:*p1++;}
namespace fastio{
struct{template<typename T>operator T(){
T x=0;char f=0,c=getchar_unlocked();
while(c<'0'||c>'9'){if(c=='-')f=1;c=getchar_unlocked();}
while(c>='0'&&c<='9'){x=x*10+(c^48);c=getchar_unlocked();}
return f?-x:x;
}}in;int stk[39],tp;
template<typename T>void out(T x,char c=0){
if(x<0)putchar_unlocked('-'),x=-x;
do stk[tp++]=x%10;while(x/=10);
while(tp)putchar_unlocked(stk[--tp]^48);
if(c)putchar_unlocked(c);
}
}using fastio::in;using fastio::out;
int main(){
int n = in;
for(int k=1;k<=n;k++)
out(100000000,' ');
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 173ms
memory: 3684kb
input:
10000000 594007602 846628958 118688465 332740249 318313026 202845521 915042938 282378057 970481760 768422784 730025680 961375766 566839660 330029774 330145242 390029486 394999596 932266627 708066070 247620802 834036784 781577526 558421941 444222363 931066805 715863808 959706782 540027468 560125066 5...
output:
5499337585176090
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 192ms
memory: 3564kb
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