Site updated: 2024-08-21 00:00:47

2024/07/24/模拟赛记录/index.html

@@ -24,7 +24,7 @@
 <meta property="og:description" content="D1A题循环变量手贱写错 -60pts B题贪心策略完全错误 -76pts C题写了一个很申金的dfs -100pts D题赛时大脑抽风不会写dij模板 cout&lt;&lt;12; 企图骗过评测机 最终 80&#x2F;400 遗憾离场*1 D2A不会写 写了全排列 B不会写 写了全排列 C题想到了正解 赛时打不出ST表 遗憾离场*2 D题把 DFS 当 DP 写 遗憾离场*3 D3A题没开l">
 <meta property="og:locale" content="zh_CN">
 <meta property="article:published_time" content="2024-07-24T12:53:42.000Z">
-<meta property="article:modified_time" content="2024-07-25T15:40:02.942Z">
+<meta property="article:modified_time" content="2024-08-20T15:59:49.986Z">
 <meta property="article:author" content="Gavin">
 <meta name="twitter:card" content="summary_large_image">
 
@@ -221,7 +221,7 @@
  <span class="post-meta mr-2">
  <i class="iconfont icon-chart"></i>
 
- 783 字
+ 948 字
 
  </span>
 
@@ -232,7 +232,7 @@
 
 
 
- 7 分钟
+ 8 分钟
 
  </span>
 
@@ -321,6 +321,18 @@ <h2 id="D6"><a href="#D6" class="headerlink" title="D6"></a>D6</h2><p>T1T2一眼
 <p>同机房一位唐sir赛时看到1e6的n觉得O(n)暴力算幂会炸 当场写出了一个O(2n)的快速幂&#x2F;kel\</p>
 <h2 id="后记"><a href="#后记" class="headerlink" title="后记"></a>后记</h2><p>至此 为期6天的模拟赛结束了 rating从1500变为了1503 也算涨了把（逃</p>
 <p>回头一看还有1501的 汗流浃背了</p>
+<hr>
+<p>没错我回来了</p>
+<h2 id="D1-1"><a href="#D1-1" class="headerlink" title="D1"></a>D1</h2><p>AB水 但是为什么有这么多人B题没A啊orz</p>
+<p>C题一眼AtCoder，这个高桥青木太明显了好吧… 但是还是不会</p>
+<blockquote>
+<p>讲个笑话 笔者上次尝试cf&lt;-&gt;at rating转换器 我同学实际跟转换结果一摸一样 但是我转换出来at250，实际100…</p>
+</blockquote>
+<p>D题叫Dota 啊？原来是以TI8为背景 但这掩盖不了他高难度DP的本质。。</p>
+<h2 id="D2-1"><a href="#D2-1" class="headerlink" title="D2"></a>D2</h2><p>PDF第一页写的普及组 上来一看 T1绿 T2紫 嚯</p>
+<p>T3坚信打的正解直到评测前最后一刻</p>
+<p>T4是OJ原题 最优性剪枝&gt;&#x3D;写成大于喜提90pts</p>
+<p>T2 CF229D或”合并神犇” 欢迎观摩orz</p>
 
 
  </div>

local-search.xml

@@ -8,7 +8,7 @@
  <link href="/2024/07/24/%E6%A8%A1%E6%8B%9F%E8%B5%9B%E8%AE%B0%E5%BD%95/"/>
  <url>/2024/07/24/%E6%A8%A1%E6%8B%9F%E8%B5%9B%E8%AE%B0%E5%BD%95/</url>
 
- <content type="html"><![CDATA[<h2 id="D1"><a href="#D1" class="headerlink" title="D1"></a>D1</h2><p>A题循环变量手贱写错 -60pts</p><p>B题贪心策略完全错误 -76pts</p><p>C题写了一个很申金的dfs -100pts</p><p>D题赛时大脑抽风不会写dij模板 <code>cout&lt;&lt;12;</code> 企图骗过评测机</p><p>最终 80&#x2F;400 遗憾离场*1</p><h2 id="D2"><a href="#D2" class="headerlink" title="D2"></a>D2</h2><p>A不会写 写了全排列</p><p>B不会写 写了全排列</p><p>C题想到了正解 赛时打不出ST表 遗憾离场*2</p><p>D题把 DFS 当 DP 写 遗憾离场*3</p><h2 id="D3"><a href="#D3" class="headerlink" title="D3"></a>D3</h2><p>A题没开long long痛失40pts，但是同一个机房的大佬开long long就AK了，但是他也没开 :(</p><p>B题两个情况只判了一种 -70pts</p><p>C题终于赛时AC DP板子.jpg</p><p>D题 完美の申金骗分居然骗了30</p><p>最终以220&#x2F;400拿下rk3 <strong>完美离场</strong></p><blockquote><p>晚上打vp发现有人c代码 于是<del>激↗情问候</del>开始对线</p><p>详情请见 <a href="https://www.luogu.com/article/ac0xxdqo">如何在洛谷高效学习</a></p></blockquote><h2 id="D4"><a href="#D4" class="headerlink" title="D4"></a>D4</h2><p>A题C题赛时拿下</p><p>B题忘写前缀和优化</p><p>D题忘写二进制优化</p><p>T了110pts 遗憾离场*4</p><blockquote><p>和同学把2kb的代码压到了400b 但是奇技淫巧</p></blockquote><h2 id="D5"><a href="#D5" class="headerlink" title="D5"></a>D5</h2><p>中规中矩</p><p>D题第一眼Dijkstra并坚信是正解，因为忘记了Dij怎么写被迫写Floyd，赛后发现Floyd就是正解&#x2F;kk</p><h2 id="D6"><a href="#D6" class="headerlink" title="D6"></a>D6</h2><p>T1T2一眼切 赛后发现居然有一堆人2题只拿了50pts 都把贪心想成了背包&#x2F;kel</p><blockquote><p>经典 D&lt;C</p></blockquote><p>T4靠在代码里发电拿下了0pts</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br></pre></td><td class="code"><pre><code class="hljs cpp"><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 15</span><br><span class="hljs-comment">f[i][j] 表示前i个数中使用k次修改的最大价值</span><br><span class="hljs-comment">f[i][j] = max&#123;f[i-1][j],f[i-1][j-1]+min&#123;a[i-1],a[i+1]&#125;-1&#125;</span><br><span class="hljs-comment"> --------- --------------------------------</span><br><span class="hljs-comment"> 不使用 使用</span><br><span class="hljs-comment">ans = f[n][k]</span><br><span class="hljs-comment"></span><br><span class="hljs-comment">O(kn²)</span><br><span class="hljs-comment">如果i使用后j也使用会造成冲突？记录使用节点？</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 25</span><br><span class="hljs-comment">f[i] 表示使用i次的整体最大值</span><br><span class="hljs-comment">f[i] = f[i-1]+新高</span><br><span class="hljs-comment">ans = f[k]</span><br><span class="hljs-comment"></span><br><span class="hljs-comment">枚举k是O(k)</span><br><span class="hljs-comment">每次枚举新高也是O(n)</span><br><span class="hljs-comment">O(kn) 差不多是这样？</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 36</span><br><span class="hljs-comment">样例过了 构造的数据没过</span><br><span class="hljs-comment">4 2</span><br><span class="hljs-comment">5 6 7 8</span><br><span class="hljs-comment">=9 绷</span><br><span class="hljs-comment">正解应该是4</span><br><span class="hljs-comment">最终5 4 5 8的第二个5不是谷点</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 48</span><br><span class="hljs-comment">操作标记有问题</span><br><span class="hljs-comment">还有一种替代方案 先跑一遍再统一求谷点 先确定操作有没有问题吧 其他都好说</span><br><span class="hljs-comment">*/</span><br><span class="hljs-comment">/*09: 53 为什么怎么改样例都能过 水*/</span><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 56</span><br><span class="hljs-comment">一开始应该是对的 应该判断两边而不是中间</span><br><span class="hljs-comment">但是这样的话5 6 7 8就只能操作7了</span><br><span class="hljs-comment">寄</span><br><span class="hljs-comment">*/</span><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">10: 00</span><br><span class="hljs-comment">所谓标记只是为了在算的时候不多算罢了</span><br><span class="hljs-comment">1. 当check到j-1或j+1的cz==1时 减去</span><br><span class="hljs-comment">2. 跑完操作再来算一遍</span><br><span class="hljs-comment">*/</span><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">10: 03</span><br><span class="hljs-comment">第一种方法写挂了</span><br><span class="hljs-comment">=10 遗憾离场</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*10: 09 对了*/</span><br><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">10: 14</span><br><span class="hljs-comment">ai全部为100时是100 99 98。。</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*10: 17 把&gt;=写成&gt;了 我是颠佬*/</span><br></code></pre></td></tr></table></figure><p>赛后旁边的佬告诉我 我9：15第一个想到的是正解 然后我把正解pass了 唐</p><p>C题看得出来是数学 奈何whk不乐观 暴力拿下10pts（怎么其他人的暴力都是40）</p><p>同机房一位唐sir赛时看到1e6的n觉得O(n)暴力算幂会炸 当场写出了一个O(2n)的快速幂&#x2F;kel\</p><h2 id="后记"><a href="#后记" class="headerlink" title="后记"></a>后记</h2><p>至此 为期6天的模拟赛结束了 rating从1500变为了1503 也算涨了把（逃</p><p>回头一看还有1501的 汗流浃背了</p>]]></content>
+ <content type="html"><![CDATA[<h2 id="D1"><a href="#D1" class="headerlink" title="D1"></a>D1</h2><p>A题循环变量手贱写错 -60pts</p><p>B题贪心策略完全错误 -76pts</p><p>C题写了一个很申金的dfs -100pts</p><p>D题赛时大脑抽风不会写dij模板 <code>cout&lt;&lt;12;</code> 企图骗过评测机</p><p>最终 80&#x2F;400 遗憾离场*1</p><h2 id="D2"><a href="#D2" class="headerlink" title="D2"></a>D2</h2><p>A不会写 写了全排列</p><p>B不会写 写了全排列</p><p>C题想到了正解 赛时打不出ST表 遗憾离场*2</p><p>D题把 DFS 当 DP 写 遗憾离场*3</p><h2 id="D3"><a href="#D3" class="headerlink" title="D3"></a>D3</h2><p>A题没开long long痛失40pts，但是同一个机房的大佬开long long就AK了，但是他也没开 :(</p><p>B题两个情况只判了一种 -70pts</p><p>C题终于赛时AC DP板子.jpg</p><p>D题 完美の申金骗分居然骗了30</p><p>最终以220&#x2F;400拿下rk3 <strong>完美离场</strong></p><blockquote><p>晚上打vp发现有人c代码 于是<del>激↗情问候</del>开始对线</p><p>详情请见 <a href="https://www.luogu.com/article/ac0xxdqo">如何在洛谷高效学习</a></p></blockquote><h2 id="D4"><a href="#D4" class="headerlink" title="D4"></a>D4</h2><p>A题C题赛时拿下</p><p>B题忘写前缀和优化</p><p>D题忘写二进制优化</p><p>T了110pts 遗憾离场*4</p><blockquote><p>和同学把2kb的代码压到了400b 但是奇技淫巧</p></blockquote><h2 id="D5"><a href="#D5" class="headerlink" title="D5"></a>D5</h2><p>中规中矩</p><p>D题第一眼Dijkstra并坚信是正解，因为忘记了Dij怎么写被迫写Floyd，赛后发现Floyd就是正解&#x2F;kk</p><h2 id="D6"><a href="#D6" class="headerlink" title="D6"></a>D6</h2><p>T1T2一眼切 赛后发现居然有一堆人2题只拿了50pts 都把贪心想成了背包&#x2F;kel</p><blockquote><p>经典 D&lt;C</p></blockquote><p>T4靠在代码里发电拿下了0pts</p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br></pre></td><td class="code"><pre><code class="hljs cpp"><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 15</span><br><span class="hljs-comment">f[i][j] 表示前i个数中使用k次修改的最大价值</span><br><span class="hljs-comment">f[i][j] = max&#123;f[i-1][j],f[i-1][j-1]+min&#123;a[i-1],a[i+1]&#125;-1&#125;</span><br><span class="hljs-comment"> --------- --------------------------------</span><br><span class="hljs-comment"> 不使用 使用</span><br><span class="hljs-comment">ans = f[n][k]</span><br><span class="hljs-comment"></span><br><span class="hljs-comment">O(kn²)</span><br><span class="hljs-comment">如果i使用后j也使用会造成冲突？记录使用节点？</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 25</span><br><span class="hljs-comment">f[i] 表示使用i次的整体最大值</span><br><span class="hljs-comment">f[i] = f[i-1]+新高</span><br><span class="hljs-comment">ans = f[k]</span><br><span class="hljs-comment"></span><br><span class="hljs-comment">枚举k是O(k)</span><br><span class="hljs-comment">每次枚举新高也是O(n)</span><br><span class="hljs-comment">O(kn) 差不多是这样？</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 36</span><br><span class="hljs-comment">样例过了 构造的数据没过</span><br><span class="hljs-comment">4 2</span><br><span class="hljs-comment">5 6 7 8</span><br><span class="hljs-comment">=9 绷</span><br><span class="hljs-comment">正解应该是4</span><br><span class="hljs-comment">最终5 4 5 8的第二个5不是谷点</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 48</span><br><span class="hljs-comment">操作标记有问题</span><br><span class="hljs-comment">还有一种替代方案 先跑一遍再统一求谷点 先确定操作有没有问题吧 其他都好说</span><br><span class="hljs-comment">*/</span><br><span class="hljs-comment">/*09: 53 为什么怎么改样例都能过 水*/</span><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">09: 56</span><br><span class="hljs-comment">一开始应该是对的 应该判断两边而不是中间</span><br><span class="hljs-comment">但是这样的话5 6 7 8就只能操作7了</span><br><span class="hljs-comment">寄</span><br><span class="hljs-comment">*/</span><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">10: 00</span><br><span class="hljs-comment">所谓标记只是为了在算的时候不多算罢了</span><br><span class="hljs-comment">1. 当check到j-1或j+1的cz==1时 减去</span><br><span class="hljs-comment">2. 跑完操作再来算一遍</span><br><span class="hljs-comment">*/</span><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">10: 03</span><br><span class="hljs-comment">第一种方法写挂了</span><br><span class="hljs-comment">=10 遗憾离场</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*10: 09 对了*/</span><br><br><span class="hljs-comment">/*</span><br><span class="hljs-comment">10: 14</span><br><span class="hljs-comment">ai全部为100时是100 99 98。。</span><br><span class="hljs-comment">*/</span><br><br><span class="hljs-comment">/*10: 17 把&gt;=写成&gt;了 我是颠佬*/</span><br></code></pre></td></tr></table></figure><p>赛后旁边的佬告诉我 我9：15第一个想到的是正解 然后我把正解pass了 唐</p><p>C题看得出来是数学 奈何whk不乐观 暴力拿下10pts（怎么其他人的暴力都是40）</p><p>同机房一位唐sir赛时看到1e6的n觉得O(n)暴力算幂会炸 当场写出了一个O(2n)的快速幂&#x2F;kel\</p><h2 id="后记"><a href="#后记" class="headerlink" title="后记"></a>后记</h2><p>至此 为期6天的模拟赛结束了 rating从1500变为了1503 也算涨了把（逃</p><p>回头一看还有1501的 汗流浃背了</p><hr><p>没错我回来了</p><h2 id="D1-1"><a href="#D1-1" class="headerlink" title="D1"></a>D1</h2><p>AB水 但是为什么有这么多人B题没A啊orz</p><p>C题一眼AtCoder，这个高桥青木太明显了好吧… 但是还是不会</p><blockquote><p>讲个笑话 笔者上次尝试cf&lt;-&gt;at rating转换器 我同学实际跟转换结果一摸一样 但是我转换出来at250，实际100…</p></blockquote><p>D题叫Dota 啊？原来是以TI8为背景 但这掩盖不了他高难度DP的本质。。</p><h2 id="D2-1"><a href="#D2-1" class="headerlink" title="D2"></a>D2</h2><p>PDF第一页写的普及组 上来一看 T1绿 T2紫 嚯</p><p>T3坚信打的正解直到评测前最后一刻</p><p>T4是OJ原题 最优性剪枝&gt;&#x3D;写成大于喜提90pts</p><p>T2 CF229D或”合并神犇” 欢迎观摩orz</p>]]></content>
 
 
  <categories>