oj.uz

Submission #1092993

# Submission time Handle Problem Language Result Execution time Memory
1092993 2024-09-25T15:48:25 Z ortsac Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pii pair<long long, long long>
#define fr first
#define se second

int32_t main() {
    //freopen("in", "r", stdin);
    int n;
    cin >> n;
    vector<pii> a(n + 2);
    vector<int> b(n + 1);
    for (int i = 1; i <= (n + 1); i++) {
            cin >> a[i].fr;
            a[i].se = i;
    }
    for (int i = 1; i <= n; i++) cin >> b[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    vector<int> pf(n + 5), sf(n + 5);
    for (int i = 1; i <= n; i++) {
        int c = max(a[i].fr - b[i], 0LL);
        pf[i] = max(pf[i - 1], c);
    }
    for (int i = n + 1; i >= 2; i--) {
        int c = max(a[i].fr - b[i - 1], 0LL);
        sf[i] = max(sf[i + 1], c);
    }
    vector<int> ans(n + 1);
    for (int i = 1; i <= (n + 1); i++) {
        ans[a[i].se] = max(pf[i - 1], sf[i + 1]);
    }
    for (int i = 1; i <= (n + 1); i++) cout << ans[i] << " ";
    cout << "\n";
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -