Codeforces 839E Mother of Dragons【__builtin_popcount()的使用】
E. Mother of Dragons
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.
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.
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 .
3 1
0 1 0
1 0 0
0 0 0
0.250000000000
4 4
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
4.000000000000
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 }
作 者:Angel_Kitty
出 处:https://www.cnblogs.com/ECJTUACM-873284962/
关于作者:阿里云ACE,目前主要研究方向是Web安全漏洞以及反序列化。如有问题或建议,请多多赐教!
版权声明:本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文链接。
特此声明:所有评论和私信都会在第一时间回复。也欢迎园子的大大们指正错误,共同进步。或者直接私信我
声援博主:如果您觉得文章对您有帮助,可以点击文章右下角【推荐】一下。您的鼓励是作者坚持原创和持续写作的最大动力!
欢迎大家关注我的微信公众号IT老实人(IThonest),如果您觉得文章对您有很大的帮助,您可以考虑赏博主一杯咖啡以资鼓励,您的肯定将是我最大的动力。thx.
![](https://images.cnblogs.com/cnblogs_com/ECJTUACM-873284962/1318325/o_donate.png)
我的公众号是IT老实人(IThonest),一个有故事的公众号,欢迎大家来这里讨论,共同进步,不断学习才能不断进步。扫下面的二维码或者收藏下面的二维码关注吧(长按下面的二维码图片、并选择识别图中的二维码),个人QQ和微信的二维码也已给出,扫描下面👇的二维码一起来讨论吧!!!
![](https://images.cnblogs.com/cnblogs_com/ECJTUACM-873284962/1318325/o_chat.png)
欢迎大家关注我的Github,一些文章的备份和平常做的一些项目会存放在这里。