| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 165527 | ArKCa | Cipele (COCI18_cipele) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n,k,m;
int dizi1[50005],dizi2[50005],dp[50005][50005];
int dpf(int crr,int r){
if(crr==(n-1)){
int mn=INT_MAX;
for(int i=r;i<m;i++){
mn=min(mn,abs(dizi1[crr]-dizi2[i]) );
}
dp[crr][r]=mn;
return dp[crr][r];
}
if( (n-crr) > (m-r) ){
return INT_MAX;
}
if(dp[crr][r]!=-1){
return dp[crr][r];
}
int mn=INT_MAX;
// printf("a\n");
for(int i=r;i<m;i++){
mn=min(mn,max( abs(dizi1[crr]-dizi2[i] ),dpf(crr+1,i+1) ) );
}
dp[crr][r]=mn;
return dp[crr][r];
}
int main(){
// freopen("a.gir","r",stdin);
// freopen("a.cik","w",stdout);
for(int i=0;i<50002;i++){
for(int j=0;j<50002;j++){
dp[i][j]=-1;
}
}
scanf("%d %d",&n,&m);
if(n==m){
int mx=0;
for(int i=0;i<n;i++){
scanf("%d",&dizi1[i]);
}
for(int i=0;i<n;i++){
scanf("%d",&dizi2[i]);
}
sort(dizi1,dizi1+n);
sort(dizi2,dizi2+m);
for(int i=0;i<n;i++){
mx=max(abs(dizi2[i]-dizi1[i]),mx);
}
printf("%d\n",mx );
return 0;
}
if(n<m){
for(int i=0;i<n;i++){
scanf("%d",&dizi1[i]);
}
for(int i=0;i<m;i++){
scanf("%d",&dizi2[i]);
}
sort(dizi1,dizi1+n);
sort(dizi2,dizi2+m);
printf("%d\n",dpf(0,0) );
return 0;
}
else{
for(int i=0;i<n;i++){
scanf("%d",&dizi2[i]);
}
for(int i=0;i<m;i++){
scanf("%d",&dizi1[i]);
}
swap(n,m);
sort(dizi1,dizi1+n);
sort(dizi2,dizi2+m);
printf("%d\n",dpf(0,0) );
return 0;
}
}