oj.uz

답안 #98742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98742 2019-02-25T14:42:29 Z pamaj Kronican (COCI16_kronican) C++17
100 / 100
 882 ms 8756 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
#define int uint_fast32_t
 
#pragma GCC optimize ("Ofast")
 
int n, k;
int c[maxn][maxn];
int dp[1 << 20];
 
int32_t main()
{	
	ios::sync_with_stdio(false), cin.tie(nullptr);
	cin >> n >> k;
 
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
			cin >> c[i][j];
	}
 
 
	for(int mask = 0; mask < (1 << n); mask++)
	{
		if(__builtin_popcount(mask) <= k) {dp[mask] = 0; continue;}
 
		int ans = 1e7;
 
		for(int i = 0; i < n; i++)
		{
			if(!(mask & (1 << i))) continue;
			for(int j = 0; j < n; j++)
			{
				if(i == j or !(mask & (1 << j))) continue;
 
				ans = min(ans, dp[mask ^ (1 << i)] + c[i][j]);
			}
		}
 
		dp[mask] = ans;
	}
 
	cout << dp[(1 << n) - 1] << "\n";
}

Compilation message

kronican.cpp: In function 'int32_t main()':
kronican.cpp:24:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int mask = 0; mask < (1 << n); mask++)
                    ~~~~~^~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 10 ms 512 KB Output is correct
6 Correct 17 ms 640 KB Output is correct
7 Correct 34 ms 888 KB Output is correct
8 Correct 73 ms 1400 KB Output is correct
9 Correct 882 ms 8756 KB Output is correct
10 Correct 78 ms 8600 KB Output is correct