QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#432519#1. I/O Testmingjunyi100 262ms3692kbC++145.8kb2024-06-07 09:50:312024-06-07 09:50:32

Judging History

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

  • [2024-06-07 09:50:32]
  • 评测
  • 测评结果：100
  • 用时：262ms
  • 内存：3692kb
查看
  • [2024-06-07 09:50:31]
  • 提交

config.txt

10000000 10000000
Text file

input_test

#define useLL
#include <bits/stdc++.h>

using namespace std;

namespace AllRangeApply_Define{
#define CIN const int
#define il inline
#define l2(x) __lg(x)

#ifdef submit
#define MJY(p) freopen(p".in","r",stdin);freopen(p".out","w",stdout);
#define fileread(p) freopen(p".in","r",stdin);
#define filewrite(p) freopen(p".out","w",stdout);
#endif

#ifdef timecheck

#define endctime end = clock(); \
cerr<<"time = "<<double(end-start)/CLOCKS_PER_SEC<<"s"<<"\n";

#define endtime end = clock(); \
fprintf(stderr,"time = %.4lf s\n ",double(end-start)/CLOCKS_PER_SEC);

#define starttime clock_t start,end; \
start = clock();

#endif

#ifdef memcheck

#define mstart bool Med;
#define mend bool Mbe;
#define cmem fprintf(stderr, "%.3lf MB\n", (&Mbe - &Med) / 1048576.0);

#endif

#ifdef useLL
#define int long long
#endif

// temp define is following

#ifdef interaction
#define ffclean fflush(stdout);
#endif

#ifdef useArr
#define arr(x) array<int,x>
#endif

}

namespace Atomic{
namespace normalSTD{
void speed_up(int opt) {
	if(opt) {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);cout.tie(nullptr);
	}
}
}

namespace fastSTD{
int read() {
	int x = 0, w = 1;
	char ch = 0;
	while (ch < '0' || ch > '9') {
		if (ch == '-') w = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = x * 10 + (ch - '0');
		ch = getchar();
	}
	return x * w;
}

void write(int x) {
	static int sta[35];
	int f = 1;
	if(x < 0) f = -1,x *= f;
	int top = 0;
	do {
		sta[top++] = x % 10, x /= 10;
	} while (x);
	if(f == -1) putchar('-');
	while (top) putchar(sta[--top] + 48);
}

}

namespace SuperSTD{
struct FastIO
{
#define get( ) getchar( )
#define put(x) putchar(x)
public:
	inline FastIO &operator >>(char &t)  { t = get(); return *this; }
	inline FastIO &operator >>(char *t)  { while((*t = get()) != '\n') *(++t) = '\0'; return *this; }
	template <typename type>
	inline FastIO &operator >>(type &x)  { x = 0; register int sig = 1; register char ch = get();
		while (ch < 48 || ch > 57) { if (ch == '-') sig = -1; ch = get(); }
		while (ch > 47 && ch < 58) x = (x << 3) + (x << 1) + (ch ^ 48),
		ch = get(); x *= sig; return *this; }
	template <typename type>
	inline FastIO &operator <<(type  x)  { if (!x) put('0'); if (x < 0) put('-'), x = -x; static char vec[50];
		register int len = 0; while (x) vec[len++] = x % 10 + '0', x /= 10;
		while (len--) put(vec[len]); return *this; }
	template <typename type>
	inline FastIO &operator <<(type *t)  { for (; *t; t++) put(*t); return *this; }
	inline FastIO &operator <<(char  t)  { put(t); return *this; }
}IO;
}
}

using namespace Atomic::fastSTD;
using namespace AllRangeApply_Define;

namespace my{
CIN N = 1e7+1;
int n,s;

signed main() {
	n = read();
	for(int i = 1;i<=n;i++) s += read();
	write(s);
	return 0;
}

}

signed main() {
	return my::main();
}
Source code, Language: C++14

output_test

#define useLL
#include <bits/stdc++.h>

using namespace std;

namespace AllRangeApply_Define{
#define CIN const int
#define il inline
#define l2(x) __lg(x)

#ifdef submit
#define MJY(p) freopen(p".in","r",stdin);freopen(p".out","w",stdout);
#define fileread(p) freopen(p".in","r",stdin);
#define filewrite(p) freopen(p".out","w",stdout);
#endif

#ifdef timecheck

#define endctime end = clock(); \
cerr<<"time = "<<double(end-start)/CLOCKS_PER_SEC<<"s"<<"\n";

#define endtime end = clock(); \
fprintf(stderr,"time = %.4lf s\n ",double(end-start)/CLOCKS_PER_SEC);

#define starttime clock_t start,end; \
start = clock();

#endif

#ifdef memcheck

#define mstart bool Med;
#define mend bool Mbe;
#define cmem fprintf(stderr, "%.3lf MB\n", (&Mbe - &Med) / 1048576.0);

#endif

#ifdef useLL
#define int long long
#endif

// temp define is following

#ifdef interaction
#define ffclean fflush(stdout);
#endif

#ifdef useArr
#define arr(x) array<int,x>
#endif

}

namespace Atomic{
namespace normalSTD{
void speed_up(int opt) {
	if(opt) {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);cout.tie(nullptr);
	}
}
}

namespace fastSTD{
int read() {
	int x = 0, w = 1;
	char ch = 0;
	while (ch < '0' || ch > '9') {
		if (ch == '-') w = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = x * 10 + (ch - '0');
		ch = getchar();
	}
	return x * w;
}

void write(int x) {
	static int sta[35];
	int f = 1;
	if(x < 0) f = -1,x *= f;
	int top = 0;
	do {
		sta[top++] = x % 10, x /= 10;
	} while (x);
	if(f == -1) putchar('-');
	while (top) putchar(sta[--top] + 48);
}

}

namespace SuperSTD{
struct FastIO
{
#define get( ) getchar( )
#define put(x) putchar(x)
public:
	inline FastIO &operator >>(char &t)  { t = get(); return *this; }
	inline FastIO &operator >>(char *t)  { while((*t = get()) != '\n') *(++t) = '\0'; return *this; }
	template <typename type>
	inline FastIO &operator >>(type &x)  { x = 0; register int sig = 1; register char ch = get();
		while (ch < 48 || ch > 57) { if (ch == '-') sig = -1; ch = get(); }
		while (ch > 47 && ch < 58) x = (x << 3) + (x << 1) + (ch ^ 48),
		ch = get(); x *= sig; return *this; }
	template <typename type>
	inline FastIO &operator <<(type  x)  { if (!x) put('0'); if (x < 0) put('-'), x = -x; static char vec[50];
		register int len = 0; while (x) vec[len++] = x % 10 + '0', x /= 10;
		while (len--) put(vec[len]); return *this; }
	template <typename type>
	inline FastIO &operator <<(type *t)  { for (; *t; t++) put(*t); return *this; }
	inline FastIO &operator <<(char  t)  { put(t); return *this; }
}IO;
}
}

using namespace Atomic::fastSTD;
using namespace AllRangeApply_Define;

namespace my{
CIN N = 1e7+1;
int n,s;

signed main() {
	n = read();
	for(int i = 1;i<=n;i++) write(N + i),putchar(' ');
	return 0;
}

}

signed main() {
	return my::main();
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 205ms
memory: 3692kb

input:

10000000
549800890 290829031 365171131 754700117 506364986 930971073 306517097 601779158 231991484 702167979 279739683 599134881 268609071 344903994 736579413 439014069 333183250 977332934 898846772 854201722 700617171 436723662 178101377 636937467 294774640 103881740 469226027 998626782 732601651 1...

output:

5499904774746160

result:

points 1.0 input test passed

Subtask #2:

score: 0
Wrong Answer

Test #2:

score: 0
Wrong Answer
time: 262ms
memory: 3516kb

input:

10000000

output:

10000002 10000003 10000004 10000005 10000006 10000007 10000008 10000009 10000010 10000011 10000012 10000013 10000014 10000015 10000016 10000017 10000018 10000019 10000020 10000021 10000022 10000023 10000024 10000025 10000026 10000027 10000028 10000029 10000030 10000031 10000032 10000033 10000034 100...

result:

wrong answer Integer 10000002 violates the range [10^8, 999999999]
English 繁體中文 简体中文

Server Time: 2025-02-01 16:36:19 | OpenSource Project