QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#432521 | #1. I/O Test | mingjunyi | 200 ✓ | 294ms | 3692kb | C++14 | 5.8kb | 2024-06-07 09:51:43 | 2024-06-07 09:51:43 |
Judging History
config.txt
10000000 10000000
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();
}
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,M = 1e8;
int n,s;
signed main() {
n = read();
for(int i = 1;i<=n;i++) write(M + i),putchar(' ');
return 0;
}
}
signed main() {
return my::main();
}
詳細信息
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 210ms
memory: 3692kb
input:
10000000 532746230 144194921 462331968 171278783 820989819 295203807 302372126 135816379 660031510 504076244 564414624 613824018 803794394 789104770 606698482 670988584 399571541 560236183 499526500 723742128 258757971 650127119 147793081 383781675 128160850 241558120 752839866 686734144 164540784 7...
output:
5500529560789085
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 294ms
memory: 3636kb
input:
10000000
output:
100000001 100000002 100000003 100000004 100000005 100000006 100000007 100000008 100000009 100000010 100000011 100000012 100000013 100000014 100000015 100000016 100000017 100000018 100000019 100000020 100000021 100000022 100000023 100000024 100000025 100000026 100000027 100000028 100000029 100000030 ...
result:
points 1.0 output test passed