Submission #843749

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
843749	2023-09-04T13:57:41 Z	PagodePaiva	A Plus B (IOI23_aplusb)	C++17	100 / 100	102 ms	17412 KB

aplusb

#include "aplusb.h"
#include<bits/stdc++.h>

using namespace std;

std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
	priority_queue <tuple <int, int, int>> pq;
	int n = N;
	pq.push({-A[0]-B[0], 0, 0});
	map <pair <int, int>, int> mark;
	mark[{0, 0}] = 1;
	vector <int> ans;

	for(int i = 0;i < N;i++){
		auto [v, l, r] = pq.top();
		pq.pop();
		v *= -1;

		ans.push_back(v);

		if(!(mark[{l, r+1}] == 1 or (l >= n or r >= n))){pq.push({-A[l]-B[r+1], l, r+1}); mark[{l, r+1}] = 1;}
		if(!(mark[{l+1, r}] == 1 or (l >= n or r >= n))){pq.push({-A[l+1]-B[r], l+1, r}); mark[{l+1, r}] = 1;}
	}

	return ans;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 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	1 ms	344 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	436 KB	Output is correct
12	Correct	0 ms	432 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct

Subtask #3

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 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	1 ms	344 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	436 KB	Output is correct
12	Correct	0 ms	432 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	600 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	2 ms	856 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	2 ms	600 KB	Output is correct
34	Correct	2 ms	600 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct

Subtask #4

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 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	1 ms	344 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	436 KB	Output is correct
12	Correct	0 ms	432 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	600 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	2 ms	856 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	2 ms	600 KB	Output is correct
34	Correct	2 ms	600 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	15 ms	3416 KB	Output is correct
38	Correct	72 ms	13700 KB	Output is correct
39	Correct	58 ms	11132 KB	Output is correct
40	Correct	61 ms	11136 KB	Output is correct
41	Correct	75 ms	13100 KB	Output is correct
42	Correct	71 ms	13316 KB	Output is correct
43	Correct	102 ms	17412 KB	Output is correct
44	Correct	13 ms	3268 KB	Output is correct
45	Correct	58 ms	9732 KB	Output is correct
46	Correct	57 ms	9860 KB	Output is correct
47	Correct	60 ms	9732 KB	Output is correct
48	Correct	81 ms	13284 KB	Output is correct
49	Correct	82 ms	15860 KB	Output is correct
50	Correct	85 ms	17384 KB	Output is correct
51	Correct	79 ms	9712 KB	Output is correct
52	Correct	98 ms	9732 KB	Output is correct
53	Correct	83 ms	9672 KB	Output is correct