Submission #165766

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
165766	2019-11-28 14:15:48	asifthegreat	Kronican (COCI16_kronican)	C++14	100 / 100	1565 ms	12156 KiB

kronican

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int N = 21;
int cost[N][N];
int dp[3000000];
int n,k;
bool Check(int x,int bit){return 1&(x>>bit);}
int Set(int x,int bit){return x|(1<<bit);}
int call(int mask){
  if(__builtin_popcount(mask) == n-k)return 0;
  if(dp[mask] != -1)return dp[mask];
  int &ret = dp[mask];
  ret = 1<<30;
  for(int i = 0; i < n;i++){
    if(Check(mask,i)) continue;
    for(int j = 0; j < n;j++){
      if(Check(mask,j) or i == j)continue;
      // cout << "Hell yah\n";
      ret = min(ret, call(Set(mask,j))+cost[j][i]);
    }
  }
  return ret;
}
int main()
{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100