제출 #637519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
637519		NotLinux	Cipele (COCI18_cipele)	C++14	0 / 90	131 ms	262144 KiB

cipele

/**
 * author: NotLinux
 * created: 02.09.2022 ~ 13:30:25
**/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL
    #include "/home/notlinux/debug.h"
#else
    #define debug(x...) void(37)
#endif
void solve(){
    int n,m;cin >> n >> m;
    vector < int > a(n),b(m);
    for(auto &inp : a)cin >> inp;
    for(auto &inp : b)cin >> inp;
    sort(a.begin(),a.end());;
    sort(b.begin(),b.end());;
    const int inf = 1e9+7;
    vector < vector < int > > dp(n , vector < int > (m,inf));
    vector < vector < int > > pre(n , vector < int > (m+2,inf));
    for(int i = 0;i<m;i++){
        dp[0][i] = abs(a[0]-b[i]);
        pre[0][i+1] = min(pre[0][i] , dp[0][i]);
    }
    for(int i = 1;i<n;i++){
        for(int j = 0;j<m;j++){
            dp[i][j] = max(pre[i-1][j] , abs(a[i]-b[j]));
            pre[i][j+1] = min(pre[i][j] , dp[i][j]);
        }
    }
    for(int i = 0;i<n;i++){
        debug(dp[i]);
    }
    cout << *min_element(dp[n-1].begin(),dp[n-1].end()) << endl;
}
int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);
    int tt=1;
    //cin >> tt;
    while(tt--)solve();
}

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