<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>状态压缩 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E7%8A%B6%E6%80%81%E5%8E%8B%E7%BC%A9/</link><description>Recent content in 状态压缩 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sun, 21 Aug 2016 11:18:49 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E7%8A%B6%E6%80%81%E5%8E%8B%E7%BC%A9/index.xml" rel="self" type="application/rss+xml"/><item><title>hdu 5036 Explosion||2014 北京区域赛网络赛 (概率+bitset优化的状态压缩+floyd传递闭包)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-21-hdu-5036/</link><pubDate>Sun, 21 Aug 2016 11:18:49 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-21-hdu-5036/</guid><description>&lt;p&gt;&lt;a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5036" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：有n扇门，n种钥匙，一一对应。每扇门打开后可能得到k把钥匙（k可能为0）。一扇门还可以用一颗炸弹炸开。现在问要开所有门，使用炸弹的期望个数。&lt;/p&gt;</description></item></channel></rss>