Submission #1067232

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1067232	2024-08-20T13:15:50 Z	ChericMAC	A Plus B (IOI23_aplusb)	C++17	60 / 100	1000 ms	1051312 KB

aplusb

#include <aplusb.h>
#include <queue>
#include <algorithm>
using namespace std;

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
    priority_queue<int, vector<int>, greater<int>> C;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N - i; j++) {
            C.push(A[j] + B[i]);
        }
    }
    vector<int> result(N);
    for (int i = 0; i < N; i++) {
        result[i] = C.top();
        C.pop();
    }
    return result;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct

Subtask #3

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	2 ms	2512 KB	Output is correct
24	Correct	2 ms	2512 KB	Output is correct
25	Correct	3 ms	2512 KB	Output is correct
26	Correct	17 ms	18532 KB	Output is correct
27	Correct	17 ms	18628 KB	Output is correct
28	Correct	17 ms	17088 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	2 ms	2508 KB	Output is correct
31	Correct	3 ms	2512 KB	Output is correct
32	Correct	3 ms	2512 KB	Output is correct
33	Correct	15 ms	17860 KB	Output is correct
34	Correct	13 ms	17348 KB	Output is correct
35	Correct	13 ms	17092 KB	Output is correct
36	Correct	13 ms	17984 KB	Output is correct

Subtask #4

0.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	2 ms	2512 KB	Output is correct
24	Correct	2 ms	2512 KB	Output is correct
25	Correct	3 ms	2512 KB	Output is correct
26	Correct	17 ms	18532 KB	Output is correct
27	Correct	17 ms	18628 KB	Output is correct
28	Correct	17 ms	17088 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	2 ms	2508 KB	Output is correct
31	Correct	3 ms	2512 KB	Output is correct
32	Correct	3 ms	2512 KB	Output is correct
33	Correct	15 ms	17860 KB	Output is correct
34	Correct	13 ms	17348 KB	Output is correct
35	Correct	13 ms	17092 KB	Output is correct
36	Correct	13 ms	17984 KB	Output is correct
37	Execution timed out	1082 ms	1051312 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-