https://www.cheasim.com/categories/dfs/ Recent content in Dfs on CheaSim Blog Hugo zh-cn Wed, 06 Mar 2019 00:00:00 +0000 https://www.cheasim.com/2019/03/06/hdoj2260-difficulty-control-dfs/ Wed, 06 Mar 2019 00:00:00 +0000 https://www.cheasim.com/2019/03/06/hdoj2260-difficulty-control-dfs/ <h1 id="difficulty-control">Difficulty Control</h1> <h2 id="题意">题意</h2> <p>中文题目不说了。</p> <h2 id="题解">题解</h2> <p>dfs+剪枝</p> <ul> <li> <p>剩下的加不到最优值剪掉</p> </li> <li> <p>已经加过了最优值剪掉</p> </li> </ul> <p>我在大二的时候TLE了20次的题目终于在队友的指导之下完成了。</p> <h2 id="ac代码">ac代码</h2> <div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;"><code class="language-cpp" data-lang="cpp"><span style="display:flex;"><span><span style="color:#75715e">#include </span></span></span><span style="display:flex;"><span><span style="color:#66d9ef">using</span> </span></span><span style="display:flex;"><span><span style="color:#75715e">#define </span></span></span><span style="display:flex;"><span><span style="color:#75715e">#define </span></span></span><span style="display:flex;"><span><span style="color:#75715e">#define </span></span></span><span style="display:flex;"><span><span style="color:#75715e">#define </span></span></span><span style="display:flex;"><span><span style="color:#66d9ef">typedef</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">typedef</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">const</span> </span></span><span style="display:flex;"><span><span style="color:#75715e">//head </span></span></span><span style="display:flex;"><span> </span></span><span style="display:flex;"><span>ll n,m; </span></span><span style="display:flex;"><span><span style="color:#66d9ef">const</span> </span></span><span style="display:flex;"><span>ll num[maxn]; </span></span><span style="display:flex;"><span>vector </span></span><span style="display:flex;"><span>ll ans <span style="color:#f92672">=</span> INT_MAX; </span></span><span style="display:flex;"><span><span style="color:#66d9ef">int</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">int</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">void</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">if</span> </span></span><span style="display:flex;"><span>ans <span style="color:#f92672">=</span> abs </span></span><span style="display:flex;"><span>memcpy </span></span><span style="display:flex;"><span>} </span></span><span style="display:flex;"><span>ll tt <span style="color:#f92672">=</span> <span style="color:#ae81ff">0</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">if</span> </span></span><span style="display:flex;"><span>rep(i,x,n) tt <span style="color:#f92672">+=</span> num[ve[i]]; </span></span><span style="display:flex;"><span><span style="color:#66d9ef">if</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">if</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">return</span> </span></span><span style="display:flex;"><span>} </span></span><span style="display:flex;"><span>temp[ve[x]] <span style="color:#f92672">=</span> <span style="color:#ae81ff">1</span> </span></span><span style="display:flex;"><span>dfs(x<span style="color:#f92672">+</span><span style="color:#ae81ff">1</span> </span></span><span style="display:flex;"><span>temp[ve[x]] <span style="color:#f92672">=</span> <span style="color:#ae81ff">0</span> </span></span><span style="display:flex;"><span>dfs(x<span style="color:#f92672">+</span><span style="color:#ae81ff">1</span> </span></span><span style="display:flex;"><span>} </span></span><span style="display:flex;"><span><span style="color:#66d9ef">int</span> </span></span><span style="display:flex;"><span><span style="color:#75715e">#ifdef </span></span></span><span style="display:flex;"><span>freopen(<span style="color:#e6db74">&#34;1.in&#34;</span> </span></span><span style="display:flex;"><span><span style="color:#75715e">#endif </span></span></span><span style="display:flex;"><span><span style="color:#66d9ef">while</span> </span></span><span style="display:flex;"><span>ve.clear(); </span></span><span style="display:flex;"><span>memset </span></span><span style="display:flex;"><span>memset </span></span><span style="display:flex;"><span>rep(i,<span style="color:#ae81ff">0</span> </span></span><span style="display:flex;"><span>ll x; <span style="color:#66d9ef">char</span> </span></span><span style="display:flex;"><span>ve.push_back(ch<span style="color:#f92672">-</span><span style="color:#e6db74">&#39;A&#39;</span> </span></span><span style="display:flex;"><span>num[ch<span style="color:#f92672">-</span><span style="color:#e6db74">&#39;A&#39;</span> </span></span><span style="display:flex;"><span>} </span></span><span style="display:flex;"><span>sort(ve.begin(),ve.end()); </span></span><span style="display:flex;"><span>ans <span style="color:#f92672">=</span> INT_MAX; </span></span><span style="display:flex;"><span>dfs(<span style="color:#ae81ff">0</span> </span></span><span style="display:flex;"><span>vector </span></span><span style="display:flex;"><span>rep(i,<span style="color:#ae81ff">0</span> </span></span><span style="display:flex;"><span><span style="color:#66d9ef">int</span> </span></span><span style="display:flex;"><span>printf </span></span><span style="display:flex;"><span>rep(i,<span style="color:#ae81ff">0</span> </span></span><span style="display:flex;"><span>printf </span></span><span style="display:flex;"><span>} </span></span><span style="display:flex;"><span>} </span></span><span style="display:flex;"><span><span style="color:#66d9ef">return</span> </span></span><span style="display:flex;"><span>} </span></span></code></pre></div><p>[hdoj2260]Difficulty control(dfs)</p>