Submission #1188223

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188223		12345678	Growing Vegetables is Fun 5 (JOI24_vegetables5)	C++20	30 / 100	311 ms	496 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int nx=2e3+5;

int n, a[2*nx], b[nx], c[nx], res=INT_MAX;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=2*n; i++) cin>>a[i];
    for (int i=1; i<=n; i++) cin>>b[i];
    for (int i=1; i<=n; i++) cin>>c[i];
    sort(b+1, b+n+1);
    sort(c+1, c+n+1);
    for (int i=1; i<=n; i++)
    {
        vector<int> x, y;
        for (int j=i; j<i+n; j++) x.push_back(a[j]);
        for (int j=1; j<i; j++) y.push_back(a[j]);
        for (int j=i+n; j<=2*n; j++) y.push_back(a[j]);
        sort(x.begin(), x.end());
        sort(y.begin(), y.end());
        //cout<<"x "<<x[0]<<' '<<x[1]<<'\n';
        //cout<<"y "<<y[0]<<' '<<y[1]<<'\n';
        int mx=0;
        for (int i=1; i<=n; i++) mx=max({mx, abs(b[i]-x[i-1]), abs(c[i]-y[i-1])});
        res=min(res, mx);
        mx=0;
        for (int i=1; i<=n; i++) mx=max({mx, abs(c[i]-x[i-1]), abs(b[i]-y[i-1])});
        res=min(res, mx);
    }
    cout<<res;
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 21 / 21
• Subtask 4: 0 / 37
• Subtask 5: 0 / 33