QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#50393	#1. I/O Test	JerryCKB	200 ✓	234ms	101208kb	C++	4.3kb	2022-09-25 20:18:22	2022-09-25 20:18:25

Judging History

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

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

[2022-09-25 20:18:25]
评测

测评结果：200
用时：234ms
内存：101208kb

查看

[2022-09-25 20:18:22]
提交

config.txt

10000000 10000000

Text file

input_test

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using lui = long unsigned int;
using ull = unsigned long long;

template <int size = 1 << 20>
struct IO {
    char in[size], out[size], *p1, *p2, *pp;
    IO() : p1(in), p2(in), pp(out) {}
    ~IO() { fwrite(out, 1, pp - out, stdout); }
    inline char gc() { if (p1 == p2) p2 = (p1 = in) + fread(in, 1, size, stdin); return p1 == p2 ? ' ' : *p1++; }
    inline bool blank(char ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'; }

    template <class T>
    inline void read(T &x) { double tmp = 1; bool sign = 0; x = 0; char ch = gc(); for (; !isdigit(ch); ch = gc()) sign |= ch == 45; for (; isdigit(ch); ch = gc()) x = x * 10 + ch - 48; if (ch == '.') for (ch = gc(); isdigit(ch); ch = gc()) tmp /= 10.0, x += tmp * (ch - '0'); if (sign) x = -x; }
    inline void read(char* s) { char ch = gc(); while (blank(ch)) ch = gc(); while (!blank(ch)) ch = gc(), *s++ = ch; *s = 0; }
    inline void read(char& c) { while (!blank(c)) c = gc(); }

    inline void push(const char& c) { if (pp - out == size) fwrite(out, 1, size, stdout), pp = out; *pp++ = c; }
    template <class T> inline void write(T x) { if (x < 0) x = -x, push('-'); static T sta[35]; T top = 0; do sta[top++] = x % 10, x /= 10; while (x); while (top) push(sta[--top] + '0'); }
    template <class T> inline void write(T x, char c) { write(x), push(c); }
    
    inline void yes(int type = 0) { switch (type) { case 0: push('Y'), push('E'), push('S'), push('\n'); break; case 1: push('Y'), push('e'), push('s'), push('\n'); break; default: push('Y'), push('E'), push('S'), push('\n'); break; } }
    inline void no(int type = 0) { switch (type) { case 0: push('N'), push('O'), push('\n'); break; case 1: push('N'), push('o'), push('\n'); break; default: push('N'), push('O'), push('\n'); break; } }
    
    void file(const string s) { freopen((s + ".in").c_str(), "r", stdin), freopen((s + ".out").c_str(), "w", stdout); }
};

IO<1000000000> io;

const int N = 1e7;
const int inf = 0x3f3f3f3f;

int n, x; ll sum;

int main() {
    io.read(n);
	for (int i = 1; i <= n; ++i) io.read(x), sum += x;
	io.write(sum);
    return 0;
}

Source code, Language: C++

output_test

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using lui = long unsigned int;
using ull = unsigned long long;

template <int size = 1 << 20>
struct IO {
    char in[size], out[size], *p1, *p2, *pp;
    IO() : p1(in), p2(in), pp(out) {}
    ~IO() { fwrite(out, 1, pp - out, stdout); }
    inline char gc() { if (p1 == p2) p2 = (p1 = in) + fread(in, 1, size, stdin); return p1 == p2 ? ' ' : *p1++; }
    inline bool blank(char ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'; }

    template <class T>
    inline void read(T &x) { double tmp = 1; bool sign = 0; x = 0; char ch = gc(); for (; !isdigit(ch); ch = gc()) sign |= ch == 45; for (; isdigit(ch); ch = gc()) x = x * 10 + ch - 48; if (ch == '.') for (ch = gc(); isdigit(ch); ch = gc()) tmp /= 10.0, x += tmp * (ch - '0'); if (sign) x = -x; }
    inline void read(char* s) { char ch = gc(); while (blank(ch)) ch = gc(); while (!blank(ch)) ch = gc(), *s++ = ch; *s = 0; }
    inline void read(char& c) { while (!blank(c)) c = gc(); }

    inline void push(const char& c) { if (pp - out == size) fwrite(out, 1, size, stdout), pp = out; *pp++ = c; }
    template <class T> inline void write(T x) { if (x < 0) x = -x, push('-'); static T sta[35]; T top = 0; do sta[top++] = x % 10, x /= 10; while (x); while (top) push(sta[--top] + '0'); }
    template <class T> inline void write(T x, char c) { write(x), push(c); }
    
    inline void yes(int type = 0) { switch (type) { case 0: push('Y'), push('E'), push('S'), push('\n'); break; case 1: push('Y'), push('e'), push('s'), push('\n'); break; default: push('Y'), push('E'), push('S'), push('\n'); break; } }
    inline void no(int type = 0) { switch (type) { case 0: push('N'), push('O'), push('\n'); break; case 1: push('N'), push('o'), push('\n'); break; default: push('N'), push('O'), push('\n'); break; } }
    
    void file(const string s) { freopen((s + ".in").c_str(), "r", stdin), freopen((s + ".out").c_str(), "w", stdout); }
};

IO<1000000000> io;

const int N = 1e8;
const int inf = 0x3f3f3f3f;

int n;
int main() {
	io.read(n);
	for (int i = 1; i <= n; ++i) io.write(N, ' ');
    return 0;
}

Source code, Language: C++

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100

Accepted

Test #1:

score: 100

Accepted

time: 158ms

memory: 101196kb

input:

10000000
402003837 959544033 611870772 605138185 932730284 653742139 183308407 149159539 667732321 923095942 697656766 158018892 631158161 346802046 271048609 899731713 361751409 487637249 318234702 235577753 123623092 491851753 789828137 111731629 854268601 755364501 550888230 432865120 538014765 8...

output:

5500658349840982

result:

points 1.0 input test passed

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 234ms

memory: 101208kb

input:

10000000

output:

100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 ...

result:

points 1.0 output test passed