oj.uz

답안 #1016535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016535 2024-07-08T07:50:33 Z Ariadna A Plus B (IOI23_aplusb) C++17
10 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#define pb push_back

using namespace std;

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
    priority_queue<int> pq;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            pq.push(A[i]+B[j]);
        }
    }
    vector<int> ans(N);
    for (int i = 0; i < N; ++i) {
        ans[i] = pq.top();
        pq.pop();
    }

    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #3
0.0 / 30.0

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

Subtask #4
0.0 / 40.0

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