제출 #884566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
884566		vjudge1	Kronican (COCI16_kronican)	C++17	100 / 100	690 ms	4520 KiB

kronican

#include <bits/stdc++.h>
using namespace std;
//#define int long long
const int mod = 1e9 + 7;
const int maxn = 20;
const int infinito = 1e9;
int n,k;
int v[maxn][maxn];
int dp[(1<<maxn) + 10];
signed main(){
	cin >> n >> k;
	for(int i = 0; i < n; i++){
		for(int y = 0; y < n; y++){
			cin >> v[i][y];
		}
	}
	for(int i = 0; i <= (1<<n)-1; i++){
		dp[i] = infinito;
	}
	dp[(1<<n)-1] = 0;
	int resul = infinito;
	for(int i = (1<<n)-1; i >= 0; i--){
		int uns = __builtin_popcount(i);
		for(int y = 0; y < n; y++){
			if(((i&(1<<y)) < 1)){
				continue;
			}
			for(int j = 0; j < n; j++){
				if(j != y && ((i&(1<<j)) >= 1)){
					dp[i^(1<<y)] = min(dp[i^(1<<y)],  dp[i] + v[y][j]);
				}
			}
		}
		if(uns <= k){
			//cout << i << "  " << dp[i] << endl;
			resul = min(resul, dp[i]);
		}
		
	}
	cout << resul << endl;
	return 0;
}

• Subtask 1: 100 / 100