oj.uz

Submission #748726

# Submission time Handle Problem Language Result Execution time Memory
748726 2023-05-26T19:32:34 Z Desh03 Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pair<int, int>> a(n + 1);
    vector<int> b(n), p(n), s(n), x(n + 1);
    for (int i = 0; i <= n; i++) cin >> a[i].first, a[i].second = i;
    for (int i = 0; i < n; i++) cin >> b[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    p[0] = abs(a[0].first - b[0]);
    for (int i = 1; i < n; i++) p[i] = max(p[i - 1], abs(a[i].first - b[i]));
    s[n - 1] = abs(a[n].first - b[n - 1]);
    for (int i = n - 2; i >= 0; i--) s[i] = max(s[i + 1], abs(a[i + 1].first - b[i]));
    x[a[0].second] = s[0], x[a[n].second] = p[n - 1];
    for (int i = 1; i < n; i++) x[a[i].second] = max(p[i - 1], s[i]);
    for (int i : x) cout << i << ' ';
}

Subtask #1
0 / 1.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 91.0

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