<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>mayokoex</author_name>
  <author_url>https://blog.hatena.ne.jp/mayokoex/</author_url>
  <blog_title>mayoko’s diary</blog_title>
  <blog_url>https://mayokoex.hatenablog.com/</blog_url>
  <categories>
    <anon>TopCoder</anon>
  </categories>
  <description>問題 TopCoder Statistics - Problem Statement 解法 「それぞれの人が A と B どちらの噂を先に伝えるか」で 2^n 通りの場合分けをして, それぞれの場合についてシミュレーションします。 const int INF = 1e9; const int MAXN = 20; bool done[MAXN]; class Rumor { public: int getMinimum(string knowledge, vector &lt;string&gt; graph) { int n = knowledge.size(); int ret = INF; vect…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmayokoex.hatenablog.com%2Fentry%2F2015%2F11%2F12%2F123726&quot; title=&quot;SRM 525 div1 med:Rumor - mayoko’s diary&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2015-11-12 12:37:26</published>
  <title>SRM 525 div1 med:Rumor</title>
  <type>rich</type>
  <url>https://mayokoex.hatenablog.com/entry/2015/11/12/123726</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
