#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
int n, k;
int c[maxn][maxn];
int dp[1 << 20][maxn];
int dist[maxn][maxn];
int solve(int mask, int val)
{
if(val <= 0) return 0;
if(dp[mask][val] != -1) return dp[mask][val];
int ans = 1e9;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(i == j or (mask & (1 << i)) or (mask & (1 << j))) continue;
ans = min(ans, solve(mask | (1 << i), val - 1) + c[i][j]);
}
}
return dp[mask][val] = ans;
}
int main()
{
cin >> n >> k;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
cin >> c[i][j];
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(i == 0) continue;
dist[i][j] = 1e9;
}
}
memset(dp, -1, sizeof(dp));
cout << solve(0, n - k) << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
44 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Runtime error |
35 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
3 |
Runtime error |
35 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
4 |
Runtime error |
43 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
5 |
Runtime error |
35 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
6 |
Runtime error |
36 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
7 |
Runtime error |
41 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
8 |
Runtime error |
34 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
9 |
Runtime error |
40 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
10 |
Runtime error |
37 ms |
33792 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |