QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#479068#1. I/O Testdaydreamwarrior100 53ms102436kbC++171.1kb2024-07-15 14:37:222024-07-15 14:37:23

Judging History

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

  • [2024-07-15 14:37:23]
  • 评测
  • 测评结果:100
  • 用时:53ms
  • 内存:102436kb
  • [2024-07-15 14:37:22]
  • 提交

config.txt

10000000 0

input_test

#include<iostream>
using namespace std;
char buf[134217728];
const char* pin = buf;
inline unsigned ReadU() { for (; *pin < '0'; ++pin); unsigned ans = *pin ^ '0'; for (; *(++pin) >= '0'; ans = ans * 10 + *pin - '0'); return ans; }
int main()
{
	cin.read(buf, 134217728);
	const unsigned n = ReadU();
	unsigned long long ans = 0;
	for (unsigned i = 1; i <= n; ans += ReadU(), ++i);
	cout << ans;
	return 0;
}

output_test

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

namespace fastio{
    struct{template<typename T>operator T(){
        T x=0;char f=0,c=getchar();
        while(c<'0'||c>'9'){if(c=='-')f=1;c=getchar();}
        while(c>='0'&&c<='9'){x=x*10+(c^48);c=getchar();}
        return f?-x:x;
    }}in;int stk[39],tp;
    template<typename T>void out(T x,char c=0){
        if(x<0)putchar('-'),x=-x;
        do stk[tp++]=x%10;while(x/=10);
        while(tp)putchar(stk[--tp]^48);
        if(c)putchar(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: 53ms
memory: 102436kb

input:

10000000
503092499 628612193 497087908 946537182 658786221 500377335 834325530 575044714 656036699 436152560 255675471 783005615 538275851 711729343 502022277 886238463 282842085 652156324 251263448 357823839 362802992 646136233 136696686 587714639 977681449 917845296 832948221 524616969 610139654 6...

output:

5499223857298333

result:

points 1.0 input test passed

Subtask #2:

score: 0
Skipped