Codeforces 839E Mother of Dragons【__builtin_popcount()的使用】

E. Mother of Dragons

time limit per test:2 seconds

memory limit per test:256 megabytes

input:standard input

output:standard output

There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.

Sir Jaime Lannister has discovered that Daenerys Targaryen is going to attack his kingdom soon. Therefore he wants to defend his kingdom. He has k liters of a strange liquid. He wants to distribute that liquid among the castles, so each castle may contain some liquid (possibly zero or non-integer number of liters). After that the stability of a wall is defined as follows: if the wall connects two castles a and b, and they contain x and y liters of that liquid, respectively, then the strength of that wall is x·y.

Your task is to print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 40, 1 ≤ k ≤ 1000).

Then n lines follows. The i-th of these lines contains n integers ai, 1, ai, 2, ..., ai, n (

). If castles i and j are connected by a wall, then ai, j = 1. Otherwise it is equal to 0.

It is guaranteed that ai, j = aj, i and ai, i = 0 for all 1 ≤ i, j ≤ n.

Output

Print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.

Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if

.

Examples

Input

3 1
0 1 0
1 0 0
0 0 0

Output

0.250000000000

Input

4 4
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0

Output

4.000000000000

Note

In the first sample, we can assign 0.5, 0.5, 0 liters of liquid to castles 1, 2, 3, respectively, to get the maximum sum (0.25).

In the second sample, we can assign 1.0, 1.0, 1.0, 1.0 liters of liquid to castles 1, 2, 3, 4, respectively, to get the maximum sum (4.0)

题目链接:http://codeforces.com/contest/839/problem/E

分析__builtin_popcount()的使用及原理参看这里

下面给出AC代码:

 1 #include "bits/stdc++.h"
 2 using namespace std;
 3 const int N = 44;
 4 const double eps = 1e-10;
 5 int n , k;
 6 long long graph[N];
 7 double ans;
 8 int clique;
 9 int bitcnt[1 << 22];
10 void solve(long long mask , int cur){
11     clique = max(clique , cur);
12     int idx = -1;
13     int mx = 0;
14     for(int i = 1 ; i <= n ; ++i){
15         if(!((mask >> i) & 1)){
16             continue;
17         }
18         int tmp = __builtin_popcountll(graph[i] & mask);
19         if(idx == -1 || tmp > mx){
20             mx = tmp;
21             idx = i;
22         }
23     }
24     if(idx == -1){
25         return;
26     }
27     clique = max(clique , cur + 1);
28     if(mx + 1 + cur <= clique){
29         return;
30     }
31     solve((mask ^ (1LL << idx)) & graph[idx] , cur + 1);
32     solve(mask ^ (1LL << idx) , cur);
33 }
34 int main(){
35     scanf("%d %d" , &n , &k);
36     for(int i = 1 ; i <= n ; ++i){
37         int tmp;
38         graph[i] = 0;
39         for(int j = 1 ; j <= n ; ++j){
40             scanf("%d" , &tmp);
41             graph[i] |= (1LL << j) * tmp;
42         }
43     }
44     long long mask = 0;
45     for(int i = 1 ; i <= n ; ++i){
46         mask |= 1LL << i;
47     }
48     clique = 1;
49     solve(mask , 0);
50     ans = (1.0 * k * k) / (1.0 * clique * clique);
51     ans *= clique * (clique - 1);
52     ans /= 2;
53     printf("%.6lf\n" , ans);
54 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏数据结构与算法

BZOJ1269: [AHOI2006]文本编辑器editor

Descriptio 这些日子,可可不和卡卡一起玩了,原来可可正废寝忘食的想做一个简单而高效的文本编辑器。你能帮助他吗? 为了明确任务目标,可可对“文本编辑器...

29870
来自专栏于晓飞的专栏

Android开发从GC root分析内存泄漏

我们常说的垃圾回收机制中会提到GC Roots这个词,也就是Java虚拟机中所有引用的根对象。我们都知道,垃圾回收器不会回收GC Roots以及那些被它们间接引...

30720
来自专栏jianhuicode

js与android webview交互

0x01 js调用java代码 android webview中支持通过添加js接口 webview.addJavascriptInterface(new Js...

24850
来自专栏pangguoming

Android Data Binding(数据绑定)用户指南

1)介绍 这篇文章介绍了如何使用Data Binding库来写声明的layouts文件,并且用最少的代码来绑定你的app逻辑和layouts文件。 Data B...

43480
来自专栏butterfly100

ConcurrentHashMap源码阅读

1. 前言 HashMap是非线程安全的,在多线程访问时没有同步机制,并发场景下put操作可能导致同一数组下的链表形成闭环,get时候出现死循环,导致CPU利用...

32170
来自专栏IT杂记

TThreadedSelectorServer介绍及Direct Memory OOM分析

一、TThreadedSelectorServer线程模型: 该服务会启动1个AcceptThread, 2个SelectorThread(默认为2个,可设置)...

29480
来自专栏图像识别与深度学习

蓝牙项目开发心得

35290
来自专栏androidBlog

Android 常用工具类

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/gdutxiaoxu/article/de...

21210
来自专栏pangguoming

完全掌握Android Data Binding

编辑推荐:稀土掘金,这是一个针对技术开发者的一个应用,你可以在掘金上获取最新最优质的技术干货,不仅仅是Android知识、前端、后端以至于产品和设计都有涉猎,想...

64670
来自专栏郭霖

Android图片加载框架最全解析(二),从源码的角度理解Glide的执行流程

在本系列的上一篇文章中,我们学习了Glide的基本用法,体验了这个图片加载框架的强大功能,以及它非常简便的API。还没有看过上一篇文章的朋友,建议先去阅读 An...

733100

扫码关注云+社区

领取腾讯云代金券