Submission #1028208

#	Time	Username	Problem	Language	Result	Execution time	Memory
1028208		CSQ31	Growing Vegetables is Fun 5 (JOI24_vegetables5)	C++17	30 / 100	5037 ms	21212 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 1e6;
int a[MAXN],b[MAXN],c[MAXN];
int n;
int comp1(int x){
    vector<int>v,u;
    for(int i=0;i<2*n;i++){
        if(i>=x && i<x+n)v.pb(a[i]);
        else u.pb(a[i]);
    }
    sort(all(v));
    sort(all(u));
    int mx = 0;
    for(int i=0;i<n;i++)mx = max(mx,abs(v[i]-b[i]));
    for(int i=0;i<n;i++)mx = max(mx,abs(u[i]-c[i]));
    return mx;
}
int comp2(int x){
    vector<int>v,u;
    for(int i=0;i<2*n;i++){
        if(i>=x && i<x+n)v.pb(a[i]);
        else u.pb(a[i]);
    }
    sort(all(v));
    sort(all(u));
    int mx = 0;
    for(int i=0;i<n;i++)mx = max(mx,abs(u[i]-b[i]));
    for(int i=0;i<n;i++)mx = max(mx,abs(v[i]-c[i]));
    return mx;
}
int main()
{
    owo
    cin>>n;
    for(int i=0;i<2*n;i++)cin>>a[i];
    for(int i=0;i<n;i++)cin>>b[i];
    for(int i=0;i<n;i++)cin>>c[i];
    sort(b,b+n);
    sort(c,c+n);
    int ans = 1e9;
    for(int i=0;i<=n;i++){
        int res = comp1(i);
        ans = min(ans,res);
        //cout<<res<<'\n';
    }
    cout<<'\n';
    for(int i=0;i<=n;i++){
        int res = comp2(i);
        ans = min(ans,res);
        //cout<<res<<'\n';
    }
    cout<<ans<<'\n';
    

}

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