oj.uz

답안 #1085668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1085668 2024-09-08T14:41:19 Z alomaneya A Plus B (IOI23_aplusb) C++17
60 / 100
 1000 ms 1211524 KB 
#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)
{
	vector<int> ans;
	for (int i = 0; i < N; i++)
		for (int j = 0; j < N; j++)
			ans.push_back(A[i] + B[j]);
	sort(ans.begin(), ans.end());
	while (ans.size() != N)
		ans.pop_back();
	return ans;
}

Compilation message

aplusb.cpp: In function 'std::vector<int> smallest_sums(int, std::vector<int>, std::vector<int>)':
aplusb.cpp:13:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |  while (ans.size() != N)
      |         ~~~~~~~~~~~^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 436 KB Output is correct
18 Correct 1 ms 348 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 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 436 KB Output is correct
18 Correct 1 ms 348 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 2 ms 724 KB Output is correct
23 Correct 18 ms 4684 KB Output is correct
24 Correct 18 ms 4708 KB Output is correct
25 Correct 13 ms 4556 KB Output is correct
26 Correct 174 ms 33456 KB Output is correct
27 Correct 260 ms 33472 KB Output is correct
28 Correct 128 ms 33464 KB Output is correct
29 Correct 2 ms 728 KB Output is correct
30 Correct 33 ms 4700 KB Output is correct
31 Correct 33 ms 4556 KB Output is correct
32 Correct 37 ms 4556 KB Output is correct
33 Correct 405 ms 33328 KB Output is correct
34 Correct 400 ms 33464 KB Output is correct
35 Correct 411 ms 33288 KB Output is correct
36 Correct 296 ms 33468 KB Output is correct

Subtask #4
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 436 KB Output is correct
18 Correct 1 ms 348 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 2 ms 724 KB Output is correct
23 Correct 18 ms 4684 KB Output is correct
24 Correct 18 ms 4708 KB Output is correct
25 Correct 13 ms 4556 KB Output is correct
26 Correct 174 ms 33456 KB Output is correct
27 Correct 260 ms 33472 KB Output is correct
28 Correct 128 ms 33464 KB Output is correct
29 Correct 2 ms 728 KB Output is correct
30 Correct 33 ms 4700 KB Output is correct
31 Correct 33 ms 4556 KB Output is correct
32 Correct 37 ms 4556 KB Output is correct
33 Correct 405 ms 33328 KB Output is correct
34 Correct 400 ms 33464 KB Output is correct
35 Correct 411 ms 33288 KB Output is correct
36 Correct 296 ms 33468 KB Output is correct
37 Execution timed out 1136 ms 1211524 KB Time limit exceeded
38 Halted 0 ms 0 KB -