oj.uz

Submission #98457

# Submission time Handle Problem Language Result Execution time Memory
98457 2019-02-23T17:55:04 Z thiago4532 Kronican (COCI16_kronican) C++17
0 / 100
 9 ms 4480 KB 
#include <bits/stdc++.h>
// #define int int64_t

using namespace std;
const int maxn = 30;
int c[maxn][maxn];
int dp[1<<(maxn-10)];
int n, k;

int solve(int mask){
	if(__builtin_popcount(mask) == k) return 0;
	//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((1<<n)-1) << "\n";
	return 0;
}

Compilation message

kronican.cpp: In function 'int solve(int)':
kronican.cpp:18:15: warning: suggest parentheses around operand of '!' or change '&' to '&&' or '!' to '~' [-Wparentheses]
    if(i==j || !mask&(1<<(j-1))) continue;
               ^~~~~

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 4480 KB Output isn't correct
2 Incorrect 6 ms 4480 KB Output isn't correct
3 Incorrect 5 ms 4480 KB Output isn't correct
4 Incorrect 7 ms 4480 KB Output isn't correct
5 Incorrect 6 ms 4352 KB Output isn't correct
6 Incorrect 5 ms 4352 KB Output isn't correct
7 Incorrect 6 ms 4420 KB Output isn't correct
8 Incorrect 9 ms 4352 KB Output isn't correct
9 Incorrect 0 ms 4352 KB Output isn't correct
10 Incorrect 6 ms 4352 KB Output isn't correct