oj.uz

Submission #1028697

# Submission time Handle Problem Language Result Execution time Memory
1028697 2024-07-20T07:11:32 Z BehruzbekX A Plus B (IOI23_aplusb) C++17
10 / 100
 1 ms 428 KB 
#include <bits/stdc++.h>
#include "aplusb.h"
using namespace std;
#define FOR(i, n, k) for(auto nx = (i);nx < (n);nx += (k))
#define FOR2(i, n, k) for(auto nxx = (i);nxx < (n);nxx += (k))

vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
    vector<int> ans;
    FOR(0, n, 1) {
        ans.push_back(a[0] + b[nx]);
    }
    FOR(1, n, 1) {
        ans.emplace_back(b[0] + a[nx]);

    }
    sort(ans.begin(), ans.end());
    return {ans.begin(), ans.begin() + n};
}


/*
 ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠀⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⢆⠀⠀⠀⠀⠀⢸⡀⠸⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⡈⠓⢤⣀⠀⠀⠸⣧⠀⢻⡄⠀⠀⠀⢀⣀⣠⡴⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢱⣄⠀⠀⠉⠉⠛⠛⠀⠀⠻⠒⠂⠉⢁⡴⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⣀⠀⠀⠀⢀⡠⠔⠚⢉⠤⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠒⠤⣀⠁⠒⠦⠤⠤⢤⣤⠄⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠈⠙⢍⡁⠀⠀⠀⡔⢁⡄⠀⠀⠀⠀⠀⠀⠀⠀⠈⠢⣀⠀⠀⠭⠤⢠⡤⠔⠊⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⢨⡿⠀⣼⢜⠏⡄⠀⡀⠀⡠⠀⡖⠀⢠⠀⠀⢄⠉⢀⠀⠀⠀⠳⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢠⣿⡵⡼⠏⡜⢸⠁⣤⠇⢀⠇⢠⡇⢰⢸⣾⠀⢸⡄⠀⣧⠀⣆⠀⠨⠒⢤⣄⡀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢠⠏⣻⠃⠀⣼⠇⡆⣰⢹⠀⣾⠀⣸⠇⢸⣾⣿⣇⠈⣿⣆⢹⡇⢹⣦⡈⢗⠉⠉⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⢀⣴⡿⠊⡽⢀⠎⣿⠀⣠⡗⢚⣾⣿⣴⠳⣧⡞⡄⢿⠟⠉⠉⢙⣦⢳⠘⣿⣿⣆⣿⡦⠄⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠈⠁⠀⢀⣇⡎⢠⢿⢠⣿⣤⠊⢀⣠⣴⣿⣿⠴⢷⣿⣤⣶⣾⣿⣿⡿⣷⢿⣿⣦⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⡼⢻⣥⣿⢸⣸⣿⢿⣾⣿⣿⣿⣿⠟⠀⠀⠘⢿⣿⣿⣿⠟⠀⢹⣾⣾⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠁⡿⢻⢟⣿⣿⣷⡄⠙⠿⠿⠿⠏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⢋⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠈⠁⢸⠟⡿⣿⣿⡇⠀⠀⠀⠀⢀⣠⠤⠐⠒⠒⠒⠢⡄⠀⢀⣯⠞⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⠀⠁⠈⢦⣽⡀⠀⠀⣴⢋⣤⣴⣶⣿⣿⡿⣿⡇⠀⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢳⣄⠀⠸⣿⢟⡏⠝⠒⢓⣣⠟⢁⣴⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⡷⣄⡈⠙⠛⠋⠉⠁⣀⡴⣻⣿⣶⣤⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⣶⣶⣤⣼⡧⠿⣙⣶⣶⣶⣶⣾⣿⣧⣿⣿⣿⣿⣿⣿⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⢠⣤⣀⣠⣿⠿⣿⣿⣿⣷⠀⠈⠳⢿⣋⣿⣿⡿⠛⠁⣿⣿⣿⣿⣿⣿⣿⣶⣤⡀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⣿⣿⣿⣿⣧⣝⢿⣿⣿⠀⠠⣀⠀⠈⠉⠉⢰⡆⠀⢋⣿⣴⣿⣿⣿⣾⣿⣿⡀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢰⣿⣿⢿⣿⣿⣿⣿⣿⣿⣿⣧⡀⠹⡆⠀⠀⠀⣾⠀⠀⣸⣿⣿⣿⣿⡿⠋⢸⣿⣇⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢐⣿⣿⣿⣦⣝⣿⣿⣿⣿⣿⣿⣿⣿⣄⠑⠀⠀⠀⠘⠀⢠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠶⣤⣄⠀⠀
⠀⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄⠀⠀⢀⣠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀⣿⣌⣇⠀
⠀⠀⠀⣠⠏⢉⣻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡗⠄⠠⠋⠀⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣤⣿⣿⣿⡆
⢀⣠⠞⣱⣾⣿⣿⣿⣿⣿⣿⡿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇
 */

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 428 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 5th token, expected: '31', found: '60'
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 428 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 5th token, expected: '31', found: '60'
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 428 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 5th token, expected: '31', found: '60'
8 Halted 0 ms 0 KB -