QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#479066#1. I/O Testdaydreamwarrior100 56ms101708kbC++171.2kb2024-07-15 14:36:522024-07-15 14:36:53

Judging History

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

  • [2024-07-15 14:36:53]
  • 评测
  • 测评结果:100
  • 用时:56ms
  • 内存:101708kb
  • [2024-07-15 14:36:52]
  • 提交

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()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	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;
}

詳細信息

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 56ms
memory: 101708kb

input:

10000000
219658924 176499631 559424898 966326127 433602635 126989467 532101294 157153719 715501991 856602908 605293037 491154428 888348364 234607793 556951461 168547852 584356397 493948385 266161417 426185323 722562629 270344840 995591777 429462156 416599033 949855770 575781487 784920842 386062334 7...

output:

5500674723032862

result:

points 1.0 input test passed

Subtask #2:

score: 0
Skipped