oj.uz

Submission #1063822

# Submission time Handle Problem Language Result Execution time Memory
1063822 2024-08-18T03:47:36 Z BlueGlaucus1 Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 0 ms 348 KB 
#include <iostream>

#include <algorithm>
using namespace std;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int n; cin >> n;
    int prefix[n+1];
    int suffix[n+1];
    int a[n+1];
    int b[n];
    prefix[0] = 0;
    suffix[0] = 0;
    
    for(int i =0; i <n+1;i++){
        cin >> a[i];
    }for(int i =0; i <n;i++){
        cin >> b[i];
    }
    sort(a, a+n+1);
    sort(b, b+n);
    int maxi = 0;
    for(int i = 0; i <n;i++){
        maxi = max(maxi,max(0,a[i]-b[i]));
        prefix[i] = maxi;
    }
    maxi = 0;
    for(int i = 0; i <n;i++){
        maxi = max(maxi,max(0,a[n-i]-b[n-i-1]));
        suffix[n-i-1] = maxi;
    }
    for(int i = 0; i <n;i++){
        cout << max(suffix[i], prefix[i-1])<< " ";
    }
     cout << max(suffix[n], prefix[n-1]);
}

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 -