QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #684091 | #1. I/O Test | daydreamwarrior | 200 ✓ | 196ms | 4536kb | C++14 | 1.8kb | 2024-10-28 10:08:42 | 2024-10-28 10:08:43 |
Judging History
config.txt
10000000 10000000
input_test
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
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;
struct{signed stk[39],tp;
void operator()(char c){putchar_unlocked(c);}
void operator()(const char *s){while(*s)(*this)(*s++);}
template<typename T>void operator()(T x){
if(x<0)(*this)('-'),x=-x;
do stk[tp++]=x%10;while(x/=10);
while(tp)(*this)(char(stk[--tp]^48));
}template<typename T,typename...Args>
void operator()(T x,Args... args){(*this)(x);(*this)(args...);}
}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;
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;
struct{signed stk[39],tp;
void operator()(char c){putchar_unlocked(c);}
void operator()(const char *s){while(*s)(*this)(*s++);}
template<typename T>void operator()(T x){
if(x<0)(*this)('-'),x=-x;
do stk[tp++]=x%10;while(x/=10);
while(tp)(*this)(char(stk[--tp]^48));
}template<typename T,typename...Args>
void operator()(T x,Args... args){(*this)(x);(*this)(args...);}
}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: 87ms
memory: 4536kb
input:
10000000 150965041 430110151 481578913 284817671 613064401 443052286 680280947 804039175 233075702 331093927 348227690 439323787 789184041 518733194 798828922 585801879 290847691 575451949 767969936 419506959 938006116 401116401 248114220 370285142 274013860 145684224 294977598 449313424 198215717 9...
output:
5499969248196094
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 196ms
memory: 3692kb
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