#include<bits/stdc++.h>
#include<ext/numeric>
#define fastIO ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
#define FOR(i, j, k, in) for (int i = (j); i < (k); i += (in))
#define FORW(i, j, k, in) for (int i = (j); i <= (k); i += (in))
#define RFOR(i, j, k, in) for (int i = (j); i >= (k); i -= (in))
#define RFORW(i, j, k, in) for (int i = (j); i > (k); i -= (in))
#define sz(arr) ((int)(arr).size())
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
using namespace __gnu_cxx;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef pair<int,pii> piii;
typedef vector<pii> vii;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
const int inf=INT_MAX-(13*7);
const float PI=acos(-1);
const ll linf=LLONG_MAX-(13ll*7ll);
const int N=22;
int n,k;
int a[N][N];
int dp[1<<N];
int f(int mask){
if(__builtin_popcount(mask) == k) return 0;
if(dp[mask]!=-1) return dp[mask];
dp[mask]=1<<30;
FOR(i,0,n,1){
if(!(mask&(1<<i))) continue;
FOR(j,0,n,1){
if(i==j) continue;
if(!(mask&(1<<j))) continue;
dp[mask] = min(dp[mask],f(mask^(1<<i))+a[i][j]);
}
}
return dp[mask];
}
int main(){
#ifndef ONLINE_JUDGE
freopen("dungdich.inp","r",stdin);
freopen("dungdich.out","w",stdout);
#endif // ONLINE_JUDGE
fastIO;
cin>>n>>k;
memset(dp,-1,sizeof dp);
FOR(i,0,n,1){
FOR(j,0,n,1){
cin>>a[i][j];
}
}
cout<<f((1<<n)-1);
}
//-T nghi la t khong the de mat 1 nguoi ban tot nhu m dau =)))
//
Compilation message
kronican.cpp: In function 'int main()':
kronican.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
50 | freopen("dungdich.inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
kronican.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
51 | freopen("dungdich.out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
11 ms |
16716 KB |
Output isn't correct |
| 2 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
| 3 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
| 4 |
Incorrect |
9 ms |
16796 KB |
Output isn't correct |
| 5 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
| 6 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
| 7 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
| 8 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
| 9 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
| 10 |
Incorrect |
9 ms |
16764 KB |
Output isn't correct |
