QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#758607#1. I/O Testbaoyangawa200 ✓206ms4812kbC++143.0kb2024-11-17 19:01:442024-11-17 19:01:45

Judging History

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

  • [2024-11-17 19:01:45]
  • 评测
  • 测评结果:200
  • 用时:206ms
  • 内存:4812kb
  • [2024-11-17 19:01:44]
  • 提交

config.txt

10000000 10000000

input_test

#include <bits/stdc++.h>
#define frr(a) freopen(a, "r", stdin)
#define fww(a) freopen(a, "w", stdout)
#define MP make_pair
#define fi first
#define se second
#define eb emplace_back
using namespace std;
using ll = long long;
const int inf = 0x3f3f3f3f, MB = 1 << 20;
const ll INF = 0x3f3f3f3f3f3f3f3f;
struct fio {
	char ib[MB + 100], *p, *q;
	fio() {
		p = q = ib;
	}
	char gc() {
//		return getchar();
		if (p == q) {
			q = (p = ib) + fread(ib, 1, MB, stdin);
			if (p == q) return EOF;
		}
		return *p++;
	}
	template <typename T> void read(T& x) {
		char c = gc(), l = 0;
		x = 0;
		while (!isdigit(c)) l = c, c = gc();
		while ( isdigit(c)) x = (x << 1) + (x << 3) + c - 48, c = gc();
		if (l == '-') x = -x;
	}
	bool bk(char c) {
		return c == ' ' || c == '\r' || c == '\n' || c == '\t' || c == EOF;
	}
	void read(char& x) {
		char c = gc();
		while (bk(c)) c = gc();
		x = c;
	}
	void read(string& x) {
		char c = gc();
		x.clear();
		while ( bk(c)) c = gc();
		while (!bk(c)) x += c, c = gc();
	}
	template <typename T1, typename T2> void read(pair <T1, T2> &x) {
		read(x.fi), read(x.se);
	}
	template <typename T, typename ...Argc> void read(T& x, Argc&... argc) {
		read(x), read(argc...);
	}
	template <typename T> void readt(T bg, T ed) {
		for (T it = bg; it != ed; it++) {
			read(*it);
		}
	}
} IO;
const int N = 123123;
ll n, a, res;
int main() {
	IO.read(n);
	while (n--) {
		IO.read(a), res += a;
	} printf("%lld\n", res);
	return 0;
}

output_test

#include <bits/stdc++.h>
#define frr(a) freopen(a, "r", stdin)
#define fww(a) freopen(a, "w", stdout)
#define MP make_pair
#define fi first
#define se second
#define eb emplace_back
using namespace std;
using ll = long long;
const int inf = 0x3f3f3f3f, MB = 1 << 20;
const ll INF = 0x3f3f3f3f3f3f3f3f;
struct fio {
	char ib[MB + 100], *p, *q;
	fio() {
		p = q = ib;
	}
	char gc() {
//		return getchar();
		if (p == q) {
			q = (p = ib) + fread(ib, 1, MB, stdin);
			if (p == q) return EOF;
		}
		return *p++;
	}
	template <typename T> void read(T& x) {
		char c = gc(), l = 0;
		x = 0;
		while (!isdigit(c)) l = c, c = gc();
		while ( isdigit(c)) x = (x << 1) + (x << 3) + c - 48, c = gc();
		if (l == '-') x = -x;
	}
	bool bk(char c) {
		return c == ' ' || c == '\r' || c == '\n' || c == '\t' || c == EOF;
	}
	void read(char& x) {
		char c = gc();
		while (bk(c)) c = gc();
		x = c;
	}
	void read(string& x) {
		char c = gc();
		x.clear();
		while ( bk(c)) c = gc();
		while (!bk(c)) x += c, c = gc();
	}
	template <typename T1, typename T2> void read(pair <T1, T2> &x) {
		read(x.fi), read(x.se);
	}
	template <typename T, typename ...Argc> void read(T& x, Argc&... argc) {
		read(x), read(argc...);
	}
	template <typename T> void readt(T bg, T ed) {
		for (T it = bg; it != ed; it++) {
			read(*it);
		}
	}
} IO;
const int N = 123123;
ll n;
int main() {
	IO.read(n);
	while (n--) {
		putchar_unlocked('1');
		for (int i = 1; i <= 8; i++) putchar_unlocked('0');
		putchar_unlocked(' ');
	} 
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 81ms
memory: 4812kb

input:

10000000
780502662 500585358 821893370 162717118 642049859 628796240 117649387 317551802 615708114 354465738 287455606 536788362 867831077 977926044 666291630 853330476 696113636 294661673 957387316 863392103 483367932 411654092 485627052 338180721 755100626 611896951 294986229 726802372 355913396 3...

output:

5499234578728066

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 206ms
memory: 3536kb

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