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 arr1[1000000], arr2[1000000], arr[101][101];
int main(){
int n, m;
cin>>n>>m;
for(int i=0; i<n+m-1; i++)
cin>>arr1[i];
for(int i=0; i<n+m-1; i++)
cin>>arr2[i];
int hi=m+n-1, mini=2e9;
for(int i=0; i<(1<<hi); i++){
for(int a=0; a<n; a++)
for(int b=0; b<m; b++)
arr[a][b]=0;
int tot=0;
for(int j=0; j<hi; j++){
if(i&(1<<j)){
for(int k=0; k<n; k++)
if(j-k>=0 && j-k<m)
arr[k][j-k]=1;
tot+=arr2[j];
}
}
set<int> si;
for(int j=0; j<n; j++){
for(int k=0; k<m; k++){
if(arr[j][k]==0)
si.insert(j-k+n-2);
}
}
for(auto x:si)
tot+=arr1[x];
mini=min(mini, tot);
}
cout<<mini;
return 0;
}
# | 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... |