QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#63236	#1. I/O Test	JKPJKP	200 ✓	908ms	3444kb	C++14	3.0kb	2022-11-21 04:12:31	2022-11-21 04:12:32

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:12:32]
评测

测评结果：200
用时：908ms
内存：3444kb

查看

[2022-11-21 04:12:31]
提交

config.txt

10000000 10000000

Text file

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();
    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;
    n = _();
    do (i, 1, n) {
        x = _();
        sum += x;
    }
    cout << sum << endl;
    return 0;
}

Source code, Language: 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';
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100

Accepted

Test #1:

score: 100

Accepted

time: 387ms

memory: 3268kb

input:

10000000
935910227 250556061 292118864 416688606 820570751 852033851 883668219 978821150 626170803 974476344 794621581 229833179 960186674 937970652 197565104 185281145 112816226 710610259 704648024 531716567 204590549 770238957 454087077 548118930 304229251 969837237 920439494 909637362 149984289 5...

output:

5500162433884324

result:

points 1.0 input test passed

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 908ms

memory: 3444kb

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