# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165496 | ArKCa | Cipele (COCI18_cipele) | C++17 | 1091 ms | 98728 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[5005],dizi2[5005],dp[5005][5005];
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];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |