oj.uz

답안 #98460

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98460 2019-02-23T18:00:51 Z thiago4532 Kronican (COCI16_kronican) C++17
90 / 100
 2000 ms 8584 KB 
#include <bits/stdc++.h>
// #define int int64_t
 
using namespace std;
const int maxn = 30;
int c[maxn][maxn];
int dp[1<<(maxn-9)];
int n, k;
 
int solve(int mask){
	if(n - __builtin_popcount(mask) == k) return 0;
	if(dp[mask] != -1) return dp[mask];

	//cout << bitset<10>(mask) << "\n";
	int ans=0x3f3f3f3f;
	for(int i=1;i<=n;i++){
		if(mask&(1<<(i-1))) continue;
 
		for(int j=1;j<=n;j++){
			if(i==j || mask&(1<<(j-1))) continue;
			int mask2 = mask | (1<<(i-1));
			ans = min(ans, c[i][j] + solve(mask2));
		}
	}
	return dp[mask] = ans;
}
 
int32_t main(){
	//memset(c, 0x3f3f3f3f, sizeof c);
	memset(dp, -1, sizeof dp);
	cin >> n >> k;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin >> c[i][j];
		}
	}
	cout << solve(0) << "\n";
	return 0;
}

Subtask #1
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8584 KB Output is correct
2 Correct 10 ms 8528 KB Output is correct
3 Correct 6 ms 8500 KB Output is correct
4 Correct 11 ms 8576 KB Output is correct
5 Correct 19 ms 8548 KB Output is correct
6 Correct 45 ms 8572 KB Output is correct
7 Correct 85 ms 8568 KB Output is correct
8 Correct 157 ms 8568 KB Output is correct
9 Execution timed out 2017 ms 8448 KB Time limit exceeded
10 Correct 209 ms 8576 KB Output is correct