oj.uz

답안 #447307

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447307 2021-07-26T03:23:11 Z dz001 Kronican (COCI16_kronican) C++11
100 / 100
 1250 ms 16692 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
 
typedef long long ll;

const int N=22;
int a[N][N],dp[(1<<N)];
int n,k;

int _dp(int mask){
	int &ans=dp[mask];
	if(ans!=-1)return ans;
	int cnt=0;
	for(int i=0;i<n;++i)if((mask>>i)&1)++cnt;
	if(cnt==k)return 0;
	ans=1e9;
	
	for(int i=0;i<n;++i){
		if(!(mask&(1<<i)))continue;
		for(int j=0;j<n;++j){
			if(!(mask&(1<<j))||i==j)continue;
			ans=min(ans,a[i][j]+_dp(mask^(1<<i)));
		}
	}
	return ans;
}

signed main(){
	cin>>n>>k;
	for(int i=0;i<n;++i){
		for(int j=0;j<n;++j){
			cin>>a[i][j];
		}
	}
	
	memset(dp,-1,sizeof dp);
	cout<<_dp((1<<n)-1);
	
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s.";
#endif
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16588 KB Output is correct
2 Correct 7 ms 16652 KB Output is correct
3 Correct 7 ms 16668 KB Output is correct
4 Correct 8 ms 16588 KB Output is correct
5 Correct 18 ms 16692 KB Output is correct
6 Correct 32 ms 16588 KB Output is correct
7 Correct 77 ms 16588 KB Output is correct
8 Correct 131 ms 16588 KB Output is correct
9 Correct 1250 ms 16688 KB Output is correct
10 Correct 286 ms 16684 KB Output is correct