#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
#define endl '\n'
using namespace std;
int n;
int table[1<<11][1<<11];
ll dp[1<<11][1<<11];
int main(){
ios_base::sync_with_stdio(23^23);cin.tie(NULL);
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>table[i][j];
}
}
for(int i=1;i<n;i++){
for(int j=0;j<n;j++){
dp[i][j]=2e15;
}
}
ll ans=2e15;
for(int i=1;i<=n;i++){
for(int j=0;j<n;j++){
if(i==n){
ans=min(ans,dp[i-1][j]);
continue;
}
int ls=(i&-i);
for(int k=ls;k<ls*2;k++){
dp[i][j^k]=min(dp[i][j^k],dp[i-1][j]+table[j][j^k]);
}
}
}
cout<<ans<<endl;
}
# | 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... |