QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#432522#1. I/O Testmingjunyi0 327ms3500kbC++145.8kb2024-06-07 09:54:202024-06-07 09:54:20

Judging History

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

  • [2024-06-07 09:54:20]
  • 评测
  • 测评结果：0
  • 用时：327ms
  • 内存：3500kb
查看
  • [2024-06-07 09:54:20]
  • 提交

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::SuperSTD;
using namespace AllRangeApply_Define;

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

signed main() {
	IO>>n;
	for(int i = 1,a;i<=n;i++) IO>>a,s += a;
	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::SuperSTD;
using namespace AllRangeApply_Define;

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

signed main() {
	IO>>n;
	for(int i = 1;i<=n;i++) IO<<M + i<<'  ';
	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: 0
input_test Judgement Failed

Test #1:

score: 0
input_test Judgement Failed

input:

10000000
597764653 621523298 524435380 835879994 725258078 856893100 827466750 686970923 988339682 324432142 404681657 932200045 131599015 169796532 109833451 331040185 743495902 220543219 740776541 596813106 908310760 317611190 238659377 495101385 469557473 138852819 442903055 384780556 170042345 6...

output:

result:

Subtask #2:

score: 0
Wrong Answer

Test #2:

score: 0
Wrong Answer
time: 327ms
memory: 3500kb

input:

10000000

output:

100000001822410000000282241000000038224100000004822410000000582241000000068224100000007822410000000882241000000098224100000010822410000001182241000000128224100000013822410000001482241000000158224100000016822410000001782241000000188224100000019822410000002082241000000218224100000022822410000002382241...

result:

wrong output format Length of token exceeds 33554432, token is '100000001822410000000282241000...2410258110982241025811108224102...'
English 繁體中文 简体中文

Server Time: 2025-01-21 00:01:14 | OpenSource Project