QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#63234	#1. I/O Test	JKPJKP	110	919ms	3496kb	C++14	3.0kb	2022-11-21 04:09:20	2022-11-21 04:09:22

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-11-21 04:09:22]
评测

测评结果：110
用时：919ms
内存：3496kb

查看

[2022-11-21 04:09:20]
提交

config.txt

1000000 10000000

文本文件

input_test

#include "bits/stdc++.h"
using namespace std;
typedef int64_t         ll;
typedef uint64_t        ul;
typedef double          ld;
typedef pair<int, int>  pii;
typedef pair<ll, ll>    pll;
typedef pair<ld, ld>    pdd;
typedef vector<int>     vi;
#define fi              first
#define se              second
#define pb              push_back
#define do(i, j, k)     for (int i = (j); i <= (k); i ++)
#define dec(i, j, k)    for (int i = (j); i >= (k); i --)
#define open(i, j, k)   for (int i = (j); i <  (k); i ++)
#define mfil(a, x)      memset(a, x, sizeof(a))
#define mcpy(a, b)      memcpy(a, b, sizeof(a))
#define fio(x)          freopen(x".in", "r", stdin); freopen(x".out", "w", stdout);
template<class T>
inline bool chkmin(T &x, T y) { return y < x ? (x=y, true) : false; }
template<class T>
inline bool chkmax(T &x, T y) { return y > x ? (x=y, true) : false; }

#define multi           void init(); void work();\
                        int main() { int T; cin >> T; while (T --) { init(); work(); } }

struct __init__ {
    __init__() {
        srand(time(0) ^ ul(new char));
        // cin.tie(0); cout.precision(16);
    }
} static _init_;

inline int _() {
    int ret = 0; char ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar();
    while ('0' <= ch && ch <= '9') {
        ret = 10 * ret + ch - '0';
        ch = getchar();
    }
    return ret;
}

/* default code ends here */

const int maxn = 200100;
int n;

int main() {
    int x = 0;
    ll sum = 0;
    cin >> n;
    do (i, 1, n) {
        cin >> x;
        sum += x;
    }
    cout << sum << endl;
    return 0;
}

源文件, 语言: C++14

output_test

#include "bits/stdc++.h"
using namespace std;
typedef int64_t         ll;
typedef uint64_t        ul;
typedef double          ld;
typedef pair<int, int>  pii;
typedef pair<ll, ll>    pll;
typedef pair<ld, ld>    pdd;
typedef vector<int>     vi;
#define fi              first
#define se              second
#define pb              push_back
#define do(i, j, k)     for (int i = (j); i <= (k); i ++)
#define dec(i, j, k)    for (int i = (j); i >= (k); i --)
#define open(i, j, k)   for (int i = (j); i <  (k); i ++)
#define mfil(a, x)      memset(a, x, sizeof(a))
#define mcpy(a, b)      memcpy(a, b, sizeof(a))
#define fio(x)          freopen(x".in", "r", stdin); freopen(x".out", "w", stdout);
template<class T>
inline bool chkmin(T &x, T y) { return y < x ? (x=y, true) : false; }
template<class T>
inline bool chkmax(T &x, T y) { return y > x ? (x=y, true) : false; }

#define multi           void init(); void work();\
                        int main() { int T; cin >> T; while (T --) { init(); work(); } }

struct __init__ {
    __init__() {
        srand(time(0) ^ ul(new char));
        cin.tie(0); cout.precision(16);
    }
} static _init_;

/* default code ends here */

const int maxn = 200100;
int n;

int main() {
    cin >> n;
    while (n --) {
        cout << n + 100000000 << ' ';
    }
    cout << '\n';
}

源文件, 语言: C++14

詳細信息

Subtask #1:

score: 10

Acceptable Answer

Test #1:

score: 10

Acceptable Answer

time: 281ms

memory: 3444kb

input:

1000000
600807062 757937316 422964739 168619064 131493721 143751907 884708697 771935351 984814276 758827370 101850785 904882027 592381048 978777127 666492553 241727499 346233148 512115906 251165152 475612116 787861271 795229263 110832987 493841778 462386148 999135685 121697485 420302474 712461125 24...

output:

550350569628100

result:

points 0.10 input test passed

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 919ms

memory: 3496kb

input:

10000000

output:

109999999 109999998 109999997 109999996 109999995 109999994 109999993 109999992 109999991 109999990 109999989 109999988 109999987 109999986 109999985 109999984 109999983 109999982 109999981 109999980 109999979 109999978 109999977 109999976 109999975 109999974 109999973 109999972 109999971 109999970 ...

result:

points 1.0 output test passed