Submission #464670

#	Time	Username	Problem	Language	Result	Execution time	Memory
464670		soba	Cipele (COCI18_cipele)	C++14	63 / 90	398 ms	201588 KiB

cipele

#include <bits/stdc++.h>
using namespace std;

const int N = 10000+1;

int n ,m , x;
int dp[5001][5001];
vector<int>v1 , v2;
int solve(int i , int rem)
{
    if(rem==0)
        return 0;
    if(i==n)
        return 1e9;
    int &ret=dp[i][rem];
    if(ret!=-1)
        return ret;
    ret=min( max(solve(i+1, rem-1), abs(v1[i]-v2[m-rem]) ) , solve(i+1 , rem) );
    return ret;
}
int main() {

    cin>>n>>m;
    for(int i = 0 ; i < n; i++)
    {
        cin>>x;
        if(n>=m)
            v1.push_back(x);
        else v2.push_back(x);
    }
    for(int i=0 ; i < m ;i++ )
    {
        cin >> x;
        if(n>=m)
        {
            v2.push_back(x);
        }
        else v1.push_back(x);
    }
    if(n<m)swap(n,m);
    int ans=0;
    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    if(n==m)
    {
        for(int i = 0;  i< n ;i++)
        {
            ans=max(ans , abs(v1[i]-v2[i]));
        }
        cout << ans;
        return 0;
    }
    memset(dp , -1 , sizeof dp);
    cout << solve(0 , m);
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 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