Submission #464655

#	Time	Username	Problem	Language	Result	Execution time	Memory
464655		ahmedfouadnew	Cipele (COCI18_cipele)	C++17	45 / 90	521 ms	262144 KiB

cipele

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
const int mod=1e9+7;
int a[5005],b[5005],n,m;
int dp[5005][5005];
int fun(int idx,int idx2)
{
    if(idx2==m)
    {
        return 0;
    }
    if(idx==n)
        return 1e15;
    int &ret=dp[idx][idx2];
    if(~ret)
        return ret;
    ret=1e15;
    ret=max(abs(a[idx]-b[idx2]),fun(idx+1,idx2+1));
    ret=min(ret,fun(idx+1,idx2));
    return ret;
}
signed main()
{
    memset(dp,-1,sizeof dp);
    cin>>n>>m;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    for(int i=0;i<m;i++)
    {
        cin>>b[i];
    }
    if(n<m)
    {
        for(int i=0;i<m;i++)
        {
            swap(a[i],b[i]);
        }
        swap(n,m);
    }
    sort(a,a+n);
    sort(b,b+m);
    cout<<fun(0,0)<<endl;
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9