// incorrect/solution-150NlogN.cpp
#include "aplusb.h"
#include <vector>
#include <algorithm>
std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
int h = std::min(150,N);
std::vector<int> C(N*h*2-h*h);
int pos = 0;
for(int i=0; i<h; i++){
for(int j=0; j<N; j++) C[pos++] = A[i]+B[j];
}
for(int j=0; j<h; j++){
for(int i=h; i<N; i++) C[pos++] = A[i]+B[j];
}
std::sort(C.begin(),C.end());
std::vector<int> ans(N);
for(int i=0; i<N; i++) ans[i] = C[i];
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
256 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 |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 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 |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 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 |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
256 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 |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 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 |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 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 |
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 |
340 KB |
Output is correct |
23 |
Correct |
7 ms |
980 KB |
Output is correct |
24 |
Correct |
8 ms |
1044 KB |
Output is correct |
25 |
Correct |
7 ms |
1092 KB |
Output is correct |
26 |
Correct |
31 ms |
3164 KB |
Output is correct |
27 |
Correct |
39 ms |
3164 KB |
Output is correct |
28 |
Correct |
25 ms |
3188 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
13 ms |
980 KB |
Output is correct |
31 |
Correct |
9 ms |
980 KB |
Output is correct |
32 |
Correct |
9 ms |
1096 KB |
Output is correct |
33 |
Correct |
31 ms |
3184 KB |
Output is correct |
34 |
Correct |
31 ms |
3164 KB |
Output is correct |
35 |
Correct |
54 ms |
3156 KB |
Output is correct |
36 |
Correct |
36 ms |
3164 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
256 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 |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 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 |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 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 |
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 |
340 KB |
Output is correct |
23 |
Correct |
7 ms |
980 KB |
Output is correct |
24 |
Correct |
8 ms |
1044 KB |
Output is correct |
25 |
Correct |
7 ms |
1092 KB |
Output is correct |
26 |
Correct |
31 ms |
3164 KB |
Output is correct |
27 |
Correct |
39 ms |
3164 KB |
Output is correct |
28 |
Correct |
25 ms |
3188 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
13 ms |
980 KB |
Output is correct |
31 |
Correct |
9 ms |
980 KB |
Output is correct |
32 |
Correct |
9 ms |
1096 KB |
Output is correct |
33 |
Correct |
31 ms |
3184 KB |
Output is correct |
34 |
Correct |
31 ms |
3164 KB |
Output is correct |
35 |
Correct |
54 ms |
3156 KB |
Output is correct |
36 |
Correct |
36 ms |
3164 KB |
Output is correct |
37 |
Correct |
275 ms |
23988 KB |
Output is correct |
38 |
Execution timed out |
1028 ms |
89700 KB |
Time limit exceeded |
39 |
Halted |
0 ms |
0 KB |
- |