답안 #1085378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1085378	2024-09-08T07:29:18 Z	Timosh	A Plus B (IOI23_aplusb)	C++17	60 / 100	1000 ms	1884 KB

aplusb

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

std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B)
{
	multiset<int> st;
	for (int i = 0; i < N; i++)
		for (int j = 0; j < N; j++)
		{
			st.insert(A[i] + B[j]);
			if (st.size() > N)
				st.erase(prev(st.end()));
		}
	vector<int> ans;
	for (auto &i : st)
	{
		ans.push_back(i);
	}
	return ans;
}

Compilation message

aplusb.cpp: In function 'std::vector<int> smallest_sums(int, std::vector<int>, std::vector<int>)':
aplusb.cpp:12:18: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   12 |    if (st.size() > N)
      |        ~~~~~~~~~~^~~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	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	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	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	440 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	436 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	436 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct

Subtask #3

30.0 / 30.0

#	결과	실행 시간	메모리	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	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	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	440 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	436 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	436 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	16 ms	492 KB	Output is correct
24	Correct	15 ms	488 KB	Output is correct
25	Correct	17 ms	488 KB	Output is correct
26	Correct	175 ms	604 KB	Output is correct
27	Correct	268 ms	604 KB	Output is correct
28	Correct	298 ms	600 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	18 ms	484 KB	Output is correct
31	Correct	18 ms	492 KB	Output is correct
32	Correct	18 ms	484 KB	Output is correct
33	Correct	183 ms	600 KB	Output is correct
34	Correct	238 ms	604 KB	Output is correct
35	Correct	187 ms	604 KB	Output is correct
36	Correct	181 ms	600 KB	Output is correct

Subtask #4

0.0 / 40.0

#	결과	실행 시간	메모리	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	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	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	440 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	436 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	436 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	16 ms	492 KB	Output is correct
24	Correct	15 ms	488 KB	Output is correct
25	Correct	17 ms	488 KB	Output is correct
26	Correct	175 ms	604 KB	Output is correct
27	Correct	268 ms	604 KB	Output is correct
28	Correct	298 ms	600 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	18 ms	484 KB	Output is correct
31	Correct	18 ms	492 KB	Output is correct
32	Correct	18 ms	484 KB	Output is correct
33	Correct	183 ms	600 KB	Output is correct
34	Correct	238 ms	604 KB	Output is correct
35	Correct	187 ms	604 KB	Output is correct
36	Correct	181 ms	600 KB	Output is correct
37	Execution timed out	1060 ms	1884 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-