Submission #840971

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
840971	2023-09-01T02:47:15 Z	Desh03	A Plus B (IOI23_aplusb)	C++17	100 / 100	88 ms	13192 KB

aplusb

#include <bits/stdc++.h>

using namespace std;

vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> q;
    q.push({a[0] + b[0], 0, 0});
    set<pair<int, int>> s;
    vector<int> v;
    while (n--) {
        auto [p, i, j] = q.top();
        q.pop();
        v.push_back(p);
        if (s.find({i + 1, j}) == s.end()) {
            q.push({a[i + 1] + b[j], i + 1, j});
            s.insert({i + 1, j});
        }
        if (s.find({i, j + 1}) == s.end()) {
            q.push({a[i] + b[j + 1], i, j + 1});
            s.insert({i, j + 1});
        }
    }
    return v;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	296 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	2 ms	568 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	564 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	2 ms	564 KB	Output is correct
34	Correct	2 ms	568 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	3 ms	460 KB	Output is correct

Subtask #4

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	296 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	2 ms	568 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	564 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	2 ms	564 KB	Output is correct
34	Correct	2 ms	568 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	3 ms	460 KB	Output is correct
37	Correct	13 ms	2772 KB	Output is correct
38	Correct	61 ms	10532 KB	Output is correct
39	Correct	54 ms	8604 KB	Output is correct
40	Correct	57 ms	8532 KB	Output is correct
41	Correct	79 ms	9912 KB	Output is correct
42	Correct	79 ms	9672 KB	Output is correct
43	Correct	88 ms	13132 KB	Output is correct
44	Correct	12 ms	2628 KB	Output is correct
45	Correct	52 ms	7088 KB	Output is correct
46	Correct	53 ms	7128 KB	Output is correct
47	Correct	58 ms	7060 KB	Output is correct
48	Correct	69 ms	9760 KB	Output is correct
49	Correct	70 ms	12020 KB	Output is correct
50	Correct	79 ms	13192 KB	Output is correct
51	Correct	77 ms	7336 KB	Output is correct
52	Correct	74 ms	8024 KB	Output is correct
53	Correct	79 ms	8148 KB	Output is correct