Submission #839915

# Submission time Handle Problem Language Result Execution time Memory
839915 2023-08-30T21:01:03 Z zeroesandones A Plus B (IOI23_aplusb) C++17
60 / 100
1000 ms 1406372 KB
#include <algorithm>
#include <iostream>
#include "aplusb.h"

std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
    std::vector<int> sum;
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j < N; ++j) {
            sum.push_back(A[i] + B[j]);
        }
    }

    std::sort(sum.begin(), sum.end());
    std::vector<int> res;
    for(int i = 0; i < N; ++i)
        res.push_back(sum[i]);

	return res;
}

Compilation message

aplusb.cpp: In function 'std::vector<int> smallest_sums(int, std::vector<int>, std::vector<int>)':
aplusb.cpp:15:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   15 |     for(int i = 0; i < N; ++i)
      |     ^~~
aplusb.cpp:18:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   18 |  return res;
      |  ^~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 13 ms 4548 KB Output is correct
24 Correct 21 ms 4548 KB Output is correct
25 Correct 13 ms 4548 KB Output is correct
26 Correct 176 ms 33328 KB Output is correct
27 Correct 250 ms 33260 KB Output is correct
28 Correct 127 ms 33336 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 33 ms 4548 KB Output is correct
31 Correct 36 ms 4548 KB Output is correct
32 Correct 32 ms 4548 KB Output is correct
33 Correct 435 ms 33312 KB Output is correct
34 Correct 396 ms 33336 KB Output is correct
35 Correct 391 ms 33336 KB Output is correct
36 Correct 303 ms 33328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 13 ms 4548 KB Output is correct
24 Correct 21 ms 4548 KB Output is correct
25 Correct 13 ms 4548 KB Output is correct
26 Correct 176 ms 33328 KB Output is correct
27 Correct 250 ms 33260 KB Output is correct
28 Correct 127 ms 33336 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 33 ms 4548 KB Output is correct
31 Correct 36 ms 4548 KB Output is correct
32 Correct 32 ms 4548 KB Output is correct
33 Correct 435 ms 33312 KB Output is correct
34 Correct 396 ms 33336 KB Output is correct
35 Correct 391 ms 33336 KB Output is correct
36 Correct 303 ms 33328 KB Output is correct
37 Execution timed out 1122 ms 1406372 KB Time limit exceeded
38 Halted 0 ms 0 KB -