QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#63237	#1. I/O Test	JKPJKP	200 ✓	937ms	3492kb	C++14	3.0kb	2022-11-21 04:13:35	2022-11-21 04:13:36

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:13:36]
评测

测评结果：200
用时：937ms
内存：3492kb

查看

[2022-11-21 04:13:35]
提交

config.txt

10000000 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.sync_with_stdio(false);
        cin.tie(0); cout.precision(16);
    }
} static _init_;

inline int _() {
    int ret = 0; char ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar();
    do {
        ret = 10 * ret + ch - '0';
        ch = getchar();
    } while ('0' <= ch && ch <= '9');
    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: 100

Accepted

Test #1:

score: 100

Accepted

time: 937ms

memory: 3492kb

input:

10000000
393521845 710370479 744471914 837888358 247567687 367125319 345233741 427625923 400845542 449743241 263181458 364526584 115997925 779006474 364402645 314138916 670109547 998971357 359567665 734853342 306761080 320213350 858889669 587604264 787518787 453214058 110383695 216608526 831336478 1...

output:

5499601956603670

result:

points 1.0 input test passed

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 865ms

memory: 3380kb

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