답안 #840434

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
840434	2023-08-31T11:26:34 Z	grossly_overconfident	A Plus B (IOI23_aplusb)	C++17	100 / 100	90 ms	13572 KB

aplusb

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

vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
	priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<>> pq;
	vector<int> out(n);
	set<pair<int, int>> visited;
	int f = 0;
	pq.push({a[0] + b[0], {0, 0}});
	for (int i = 0; i < n; ++i){
		auto h = pq.top();
		pq.pop();
		out[f] = h.first;
		f += 1;
		if (!visited.count({h.second.first + 1, h.second.second})){
			pq.push({a[h.second.first + 1] + b[h.second.second], {h.second.first + 1, h.second.second}});
			visited.insert({h.second.first + 1, h.second.second});
		}
		if (!visited.count({h.second.first, h.second.second + 1})){
			pq.push({a[h.second.first] + b[h.second.second + 1], {h.second.first, h.second.second + 1}});
			visited.insert({h.second.first, h.second.second + 1});
		}
	}
	return out;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	300 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 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	1 ms	212 KB	Output is correct
14	Correct	1 ms	304 KB	Output is correct
15	Correct	1 ms	304 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct

Subtask #3

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	300 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 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	1 ms	212 KB	Output is correct
14	Correct	1 ms	304 KB	Output is correct
15	Correct	1 ms	304 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 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	596 KB	Output is correct
27	Correct	3 ms	468 KB	Output is correct
28	Correct	2 ms	596 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	308 KB	Output is correct
32	Correct	1 ms	308 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	568 KB	Output is correct
35	Correct	2 ms	564 KB	Output is correct
36	Correct	2 ms	444 KB	Output is correct

Subtask #4

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	300 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 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	1 ms	212 KB	Output is correct
14	Correct	1 ms	304 KB	Output is correct
15	Correct	1 ms	304 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 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	596 KB	Output is correct
27	Correct	3 ms	468 KB	Output is correct
28	Correct	2 ms	596 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	308 KB	Output is correct
32	Correct	1 ms	308 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	568 KB	Output is correct
35	Correct	2 ms	564 KB	Output is correct
36	Correct	2 ms	444 KB	Output is correct
37	Correct	15 ms	2784 KB	Output is correct
38	Correct	66 ms	10564 KB	Output is correct
39	Correct	57 ms	8640 KB	Output is correct
40	Correct	64 ms	8612 KB	Output is correct
41	Correct	81 ms	9804 KB	Output is correct
42	Correct	73 ms	9892 KB	Output is correct
43	Correct	90 ms	13572 KB	Output is correct
44	Correct	13 ms	2644 KB	Output is correct
45	Correct	55 ms	7428 KB	Output is correct
46	Correct	57 ms	7436 KB	Output is correct
47	Correct	56 ms	7560 KB	Output is correct
48	Correct	73 ms	9992 KB	Output is correct
49	Correct	75 ms	12292 KB	Output is correct
50	Correct	86 ms	13560 KB	Output is correct
51	Correct	82 ms	7732 KB	Output is correct
52	Correct	81 ms	7760 KB	Output is correct
53	Correct	89 ms	7736 KB	Output is correct