QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#63230	#1. I/O Test	JKPJKP	100	872ms	3348kb	C++14	2.7kb	2022-11-21 03:59:31	2022-11-21 03:59:35

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 03:59:35]
评测

测评结果：100
用时：872ms
内存：3348kb

查看

[2022-11-21 03:59:31]
提交

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

/* default code ends here */

const int maxn = 200100;
int n;

int main() {
    cin >> n;
    int a;
    ll sum = 0;
    while (n --) {
        cin >> a;
        sum += a;
    }
    cout << sum << '\n';
}

源文件, 语言: 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: 0

input_test Time Limit Exceeded

Test #1:

score: 0

input_test Time Limit Exceeded

input:

10000000
654764904 532747731 254714829 953571430 789908135 777922309 755379069 872294379 568852897 331364735 419278855 535472545 573777254 901473161 115970680 997061965 575721183 391852034 797804095 692860468 606967449 943176846 560553845 413640251 628558700 105470321 277850441 186495526 644212120 3...

output:

result:

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 872ms

memory: 3348kb

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