QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#542946#1. I/O Testsun_vitamessage10 4ms98976kbC++231.2kb2024-09-01 11:27:572024-09-01 11:27:57

Judging History

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

  • [2024-09-01 11:27:57]
  • 评测
  • 测评结果:10
  • 用时:4ms
  • 内存:98976kb
  • [2024-09-01 11:27:57]
  • 提交

config.txt

1000000 1000000

input_test

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

static constexpr size_t buf_size = 134217728;

static char inbuf[buf_size + 1] = {};

namespace {
char *pos, *end;

void load() {
	pos = inbuf;
	end = inbuf + cin.readsome(inbuf, buf_size);
	*end = '\0';
}
inline char get_next() { return *(pos++); }

template<class T>
void scan(T &x) {
	char c = get_next();
	// bool neg = false;
	// if (c == '-')
	// 	neg = true, x = 0;
	// else
		x = c & 15;
	while ((c = get_next()) >= '0')
		x = x * 10 + (c & 15);
	// if (neg)
	// 	x = -x;
}
}

int main()
{
	cin.tie(0)->sync_with_stdio(0);
	
	int x = 1e7;
	long long res = 0, y;
	
	load();
	scan(x);
	while (x--)
	{
		scan(y);
		res += y;
		// res ^= y;
	}
	cout << res << "\n";
	
	return 0;
}

output_test

#include <cstdio>
using namespace std;

constexpr int obuf = 1e8 + 1;

char s[obuf + 1];

signed main()
{
	int n = 1e7, p = 0;
	
	while (n--)
	{
		s[p++] = '1';
		s[p++] = '1';
		s[p++] = '1';
		s[p++] = '1';
		s[p++] = '1';
		s[p++] = '1';
		s[p++] = '1';
		s[p++] = '1';
		s[p++] = '1';
		s[p++] = ' ';
	}
	fwrite(s, 1, p, stdout);
	
	return 0;
}

詳細信息

Subtask #1:

score: 10
Acceptable Answer

Test #1:

score: 10
Acceptable Answer
time: 4ms
memory: 13928kb

input:

1000000
276904799 126699259 712057322 312126452 552241980 798955912 572020642 507606796 855591333 220371135 253984479 646893905 897351999 767691720 445282347 367907472 485937100 446269117 241843278 397490704 456454132 635690135 415255485 825178643 787182692 849366580 194393353 138458344 275018514 93...

output:

550107612734351

result:

points 0.10 input test passed

Subtask #2:

score: 0
Wrong Answer

Test #2:

score: 0
Wrong Answer
time: 3ms
memory: 98976kb

input:

1000000

output:

111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 ...

result:

wrong output format Extra information in the output file