oj.uz

답안 #840969

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840969 2023-09-01T02:43:45 Z Desh03 A Plus B (IOI23_aplusb) C++17
10 / 100
 1 ms 260 KB 
#include <bits/stdc++.h>

using namespace std;

vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> q;
    q.push({a[0] + b[0], 0, 0});
    set<pair<int, int>> s;
    vector<int> v;
    while (n--) {
        auto [p, i, j] = q.top();
        q.pop();
        v.push_back(p);
        s.insert({i, j});
        if (i < n - 1 && s.find({i + 1, j}) != s.end()) {
            q.push({a[i + 1] + b[j], i + 1, j});
        }
        if (j < n - 1 && s.find({i, j + 1}) != s.end()) {
            q.push({a[i] + b[j + 1], i, j + 1});
        }
    }
    return v;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct

Subtask #2
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 260 KB 1st lines differ - on the 2nd token, expected: '3', found: '1'
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 260 KB 1st lines differ - on the 2nd token, expected: '3', found: '1'
6 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 260 KB 1st lines differ - on the 2nd token, expected: '3', found: '1'
6 Halted 0 ms 0 KB -