oj.uz

Submission #1023653

# Submission time Handle Problem Language Result Execution time Memory
1023653 2024-07-15T04:15:31 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 0 ms 348 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
    int N;
    cin >> N;
    vector<long long> A(N + 1), B(N);
    for (int i = 0; i <= N; ++i) {
        cin >> A[i];
    }
    for (int i = 0; i < N; ++i) {
        cin >> B[i];
    }
    sort(B.begin(), B.end());
    vector<long long> min_strangeness(N + 1);
    for (int i = 0; i <= N; ++i) {
        auto it = lower_bound(B.begin(), B.end(), A[i]);
        if (it == B.begin()) {
            min_strangeness[i] = abs(A[i] - B[0]);
        } else if (it == B.end()) {
            min_strangeness[i] = abs(A[i] - B[N - 1]);
        } else {
            int idx = it - B.begin();
            min_strangeness[i] = min(abs(A[i] - B[idx]), abs(A[i] - B[idx - 1]));
        }
    }
    for (int i = 0; i <= N; ++i) {
        cout << min_strangeness[i] << " ";
    }
    cout << endl;
    return 0;
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -