oj.uz

답안 #1067226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067226 2024-08-20T13:10:01 Z ChericMAC A Plus B (IOI23_aplusb) C++17
10 / 100
 0 ms 348 KB 
#include <aplusb.h>
#include <queue>
#include <algorithm>
using namespace std;

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
    priority_queue<int, vector<int>, greater<int>> C;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N - i * 2; j++) {
            C.push(A[j] + B[i]);
        }
    }
    vector<int> result;
    while (N--) {
        result.push_back(C.top());
        C.pop();
    }
    return result;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 17th token, expected: '76', found: '90'
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 17th token, expected: '76', found: '90'
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 17th token, expected: '76', found: '90'
8 Halted 0 ms 0 KB -