oj.uz

Submission #1087302

# Submission time Handle Problem Language Result Execution time Memory
1087302 2024-09-12T13:15:31 Z Tesla89 Just Long Neckties (JOI20_ho_t1) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#define int long
#define endl '\n'

using namespace std;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    vector<int> a(n+1),b(n);
    vector<int> pref(n+1),suf(n+2);
    suf[n+1]=pref[0]=0;
    for(int i=0;i<=n;i++)cin>>a[i];
    for(int i=0;i<n;i++)cin>>b[i];
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    for(int i=1;i<=n;i++)pref[i]=max(pref[i-1],a[i-1]-b[i-1]);
    for(int i=n+1;i>1;i--)suf[i]=max(suf[i+1],a[i-1]-b[i-2]);
    for(int i=1;i<=n+1;i++)cout<<max(pref[i-1],suf[i+1])<<" ";
    cout<<endl;
    return 0;
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 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 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -