oj.uz

Submission #973071

# Submission time Handle Problem Language Result Execution time Memory
973071 2024-05-01T13:13:17 Z marinaluca A Plus B (IOI23_aplusb) C++17
100 / 100
 75 ms 11208 KB 
#include <bits/stdc++.h>
 
 
using namespace std;
 
 
#define ll long long
#define xx first
#define yy second
#define all (x) begin (x), end(x)
 
vector <int> smallest_sums (int n, vector <int> a, vector <int> b){
    sort (a.begin(), a.end());
    sort (b.begin(), b.end());
    set <pair<int, pair<int, int>>> s;
    vector <int> rez;
    for (int i = 0; i < n; ++ i){
        s.insert ({a[i] + b[0], {i, 0}});
    }
    for (int i = 0; i < n; ++ i){
        auto val = *s.begin();
        rez.push_back(val.xx);
        s.insert ({a[val.yy.xx] + b[val.yy.yy + 1], {val.yy.xx, val.yy.yy + 1}});
        s.erase(val);
    }
    return rez;
}

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 1 ms 348 KB Output is correct
4 Correct 0 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 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 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 352 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 1 ms 356 KB Output is correct
21 Correct 0 ms 428 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 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 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 352 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 1 ms 356 KB Output is correct
21 Correct 0 ms 428 KB Output is correct
22 Correct 1 ms 356 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 856 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 0 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 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 600 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 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 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 352 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 1 ms 356 KB Output is correct
21 Correct 0 ms 428 KB Output is correct
22 Correct 1 ms 356 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 856 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 0 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 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 600 KB Output is correct
37 Correct 10 ms 2652 KB Output is correct
38 Correct 46 ms 8144 KB Output is correct
39 Correct 44 ms 8148 KB Output is correct
40 Correct 54 ms 8256 KB Output is correct
41 Correct 64 ms 10920 KB Output is correct
42 Correct 64 ms 11208 KB Output is correct
43 Correct 57 ms 10196 KB Output is correct
44 Correct 13 ms 2652 KB Output is correct
45 Correct 45 ms 8316 KB Output is correct
46 Correct 44 ms 8296 KB Output is correct
47 Correct 50 ms 8668 KB Output is correct
48 Correct 68 ms 10712 KB Output is correct
49 Correct 75 ms 10712 KB Output is correct
50 Correct 73 ms 10268 KB Output is correct
51 Correct 73 ms 10052 KB Output is correct
52 Correct 70 ms 9948 KB Output is correct
53 Correct 73 ms 9928 KB Output is correct