# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165532 | 2019-11-27T12:05:58 Z | ArKCa | Cipele (COCI18_cipele) | C++17 | 252 ms | 262148 KB |
#include<bits/stdc++.h> using namespace std; int n,k,m; int dizi1[20005],dizi2[20005],dp[20005][20005]; 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<20002;i++){ for(int j=0;j<20002;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; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 252 ms | 262148 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 249 ms | 262148 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 247 ms | 262148 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 247 ms | 262148 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 247 ms | 262148 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 251 ms | 262148 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 225 ms | 262148 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 219 ms | 262144 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 224 ms | 262144 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 231 ms | 262148 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |