You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

1 line
28 KiB
HTML

This file contains invisible Unicode characters!

This file contains invisible Unicode characters that may be processed differently from what appears below. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to reveal hidden characters.

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

<!DOCTYPE html><html lang="zh-CN"><head><meta charset="utf-8"><meta http-equiv="x-dns-prefetch-control" content="on"><meta name="viewport" content="width=device-width,initial-scale=1,minimum-scale=1,maximum-scale=1,user-scalable=no"><meta name="renderer" content="webkit"><meta name="force-rendering" content="webkit"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><meta name="HandheldFriendly" content="True"><meta name="mobile-web-app-capable" content="yes"><link rel="shortcut icon" href="https://hans362-img.oss.0vv0.top/favicon.ico"><link rel="icon" type="image/png" sizes="16x16" href="https://hans362-img.oss.0vv0.top/favicon-16x16.png"><link rel="icon" type="image/png" sizes="32x32" href="https://hans362-img.oss.0vv0.top/favicon-32x32.png"><link rel="apple-touch-icon" sizes="180x180" href="https://hans362-img.oss.0vv0.top/apple-touch-icon.png"><link rel="mask-icon" href="https://hans362-img.oss.0vv0.top/safari-pinned-tab.svg"><title>2021 CSP-S 复赛游记 | Hans362 &#39;s Blog</title><meta name="keywords" content="OI, 游记, CSP, Hans362"><meta name="description" content="昨天也就是2021年10月23日我刚刚考完了本年度的 CSP-S 第二轮。晚上六点多走出考场时,我人已经麻了。欲知发生了甚么事,请继续阅读本文。 P.S. 去年复赛游记请移步2020 CSP-S 复赛游记"><meta property="og:type" content="article"><meta property="og:title" content="2021 CSP-S 复赛游记"><meta property="og:url" content="https://blog.hans362.cn/post/2021-csp-s-2/"><meta property="og:site_name" content="Hans362 &#39;s Blog"><meta property="og:description" content="昨天也就是2021年10月23日我刚刚考完了本年度的 CSP-S 第二轮。晚上六点多走出考场时,我人已经麻了。欲知发生了甚么事,请继续阅读本文。 P.S. 去年复赛游记请移步2020 CSP-S 复赛游记"><meta property="og:locale" content="zh_CN"><meta property="og:image" content="https://hans362-img.oss.0vv0.top/2019/11/03/noi.png?width=1920"><meta property="article:published_time" content="2021-10-24T15:17:52.000Z"><meta property="article:modified_time" content="2025-04-11T10:35:15.351Z"><meta property="article:author" content="Hans362"><meta property="article:tag" content="OI"><meta property="article:tag" content="游记"><meta property="article:tag" content="CSP"><meta name="twitter:card" content="summary_large_image"><meta name="twitter:image" content="https://hans362-img.oss.0vv0.top/2019/11/03/noi.png?width=1920"><link rel="stylesheet" href="/css/style/main.css"><link rel="stylesheet" id="hl-default-theme" href="https://blog.hans362.cn/npm/highlight.js@10.1.2/styles/atom-one-light.css" media="none"><link rel="stylesheet" id="hl-dark-theme" href="https://blog.hans362.cn/npm/highlight.js@10.1.2/styles/atom-one-dark.css" media="none"><script src="/js/darkmode.js"></script><link rel="dns-prefetch" href="https://analytics.0vv0.top"><link rel="preconnect" href="https://hans362-img.oss.0vv0.top"><meta name="generator" content="Hexo 7.1.1"><link rel="alternate" href="/atom.xml" title="Hans362 's Blog" type="application/atom+xml"></head><body><div class="app-shell-loader">加载中...</div><div class="container" tabindex="-1"><header><div class="header__left"><a href="/" class="button"><span class="logo__text">Hans362 &#39;s Blog</span></a></div><div class="header__right"><div class="navbar__menus"><a href="/" class="button"><div class="navbar-menu">首页</div></a><a href="/archives/" class="button"><div class="navbar-menu">归档</div></a><a href="/tags/" class="button"><div class="navbar-menu">标签</div></a><a href="/bangumi/" class="button"><div class="navbar-menu">追番</div></a><a href="/links/" class="button"><div class="navbar-menu">友链</div></a><a href="/about/" class="button"><div class="navbar-menu">关于</div></a><a href="/atom.xml" class="button"><div class="navbar-menu">RSS</div></a></div><a href="/search/" class="button"><div id="btn-search"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 1024 1024" width="24" height="24" fill="currentColor" stroke="currentColor" stroke-width="32"><path d="M192 448c0-141.152 114.848-256 256-256s256 114.848 256 256-114.848 256-256 256-256-114.848-256-256z m710.624 409.376l-206.88-206.88A318.784 318.784 0 0 0 768 448c0-176.736-143.264-320-320-320S128 271.264 128 448s143.264 320 320 320a318.784 318.784 0 0 0 202.496-72.256l206.88 206.88 45.248-45.248z"></path></svg></div></a><a href="javaScript:void(0);" rel="external nofollow noreferrer" class="button"><div id="btn-toggle-dark"><svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M21 12.79A9 9 0 1 1 11.21 3 7 7 0 0 0 21 12.79z"></path></svg></div></a><a href="#" class="button" id="b2t" aria-label="回到顶部" title="回到顶部"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 1024 1024" width="32" height="32"><path d="M233.376 722.752L278.624 768 512 534.624 745.376 768l45.248-45.248L512 444.128zM192 352h640V288H192z" fill="currentColor"></path></svg> </a><a class="dropdown-icon button" tabindex="0"><div id="btn-dropdown"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 20 20" width="24" height="24" fill="none" stroke="currentColor" stroke-width="0.7" stroke-linecap="round" stroke-linejoin="round"><path fill="currentColor" d="M3.314,4.8h13.372c0.41,0,0.743-0.333,0.743-0.743c0-0.41-0.333-0.743-0.743-0.743H3.314c-0.41,0-0.743,0.333-0.743,0.743C2.571,4.467,2.904,4.8,3.314,4.8z M16.686,15.2H3.314c-0.41,0-0.743,0.333-0.743,0.743s0.333,0.743,0.743,0.743h13.372c0.41,0,0.743-0.333,0.743-0.743S17.096,15.2,16.686,15.2z M16.686,9.257H3.314c-0.41,0-0.743,0.333-0.743,0.743s0.333,0.743,0.743,0.743h13.372c0.41,0,0.743-0.333,0.743-0.743S17.096,9.257,16.686,9.257z"></path></svg></div></a><div class="dropdown-menus" id="dropdown-menus"><a href="/" class="dropdown-menu button">首页</a> <a href="/archives/" class="dropdown-menu button">归档</a> <a href="/tags/" class="dropdown-menu button">标签</a> <a href="/bangumi/" class="dropdown-menu button">追番</a> <a href="/links/" class="dropdown-menu button">友链</a> <a href="/about/" class="dropdown-menu button">关于</a> <a href="/atom.xml" class="dropdown-menu button">RSS</a></div></div></header><cover></cover><main><div class="post-content"><div class="post-title"><h1 class="post-title__text">2021 CSP-S 复赛游记</h1><div class="post-title__meta"><a href="/archives/2021/10/" class="post-meta__date button">2021-10-24</a> <span class="separate-dot"></span> <a href="/categories/%E6%B0%B4/" class="button"><span class="post-meta__cats"></span></a><style>.post-meta__pv{color:var(--t-l);visibility:hidden;opacity:0;transition:.2s}</style><span class="separate-dot"></span> <span class="post-meta__pv"></span></div></div><aside class="post-side"><div class="post-side__toc"><div class="toc-title">文章目录</div><ol class="toc"><li class="toc-item toc-level-2"><a class="toc-link" href="#day-0"><span class="toc-text">Day 0</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#day-1"><span class="toc-text">Day 1</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#t1-%E5%BB%8A%E6%A1%A5%E5%88%86%E9%85%8D-airport"><span class="toc-text">T1 廊桥分配 airport</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#t3-%E5%9B%9E%E6%96%87-palin"><span class="toc-text">T3 回文 palin</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#t4-%E4%BA%A4%E9%80%9A%E8%A7%84%E5%88%92-traffic"><span class="toc-text">T4 交通规划 traffic</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#t2-%E6%8B%AC%E5%8F%B7%E5%BA%8F%E5%88%97-bracket"><span class="toc-text">T2 括号序列 bracket</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#20211024"><span class="toc-text">2021.10.24</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%80%BB%E7%BB%93"><span class="toc-text">总结</span></a></li></ol></div></aside><a class="btn-toc button" id="btn-toc" tabindex="0"><svg viewBox="0 0 1024 1024" width="32" height="32" xmlns="http://www.w3.org/2000/svg"><path d="M128 256h64V192H128zM320 256h576V192H320zM128 544h64v-64H128zM320 544h576v-64H320zM128 832h64v-64H128zM320 832h576v-64H320z" fill="currentColor"></path></svg></a><div class="toc-menus" id="toc-menus"><div class="toc-title">文章目录</div><ol class="toc"><li class="toc-item toc-level-2"><a class="toc-link" href="#day-0"><span class="toc-text">Day 0</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#day-1"><span class="toc-text">Day 1</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#t1-%E5%BB%8A%E6%A1%A5%E5%88%86%E9%85%8D-airport"><span class="toc-text">T1 廊桥分配 airport</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#t3-%E5%9B%9E%E6%96%87-palin"><span class="toc-text">T3 回文 palin</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#t4-%E4%BA%A4%E9%80%9A%E8%A7%84%E5%88%92-traffic"><span class="toc-text">T4 交通规划 traffic</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#t2-%E6%8B%AC%E5%8F%B7%E5%BA%8F%E5%88%97-bracket"><span class="toc-text">T2 括号序列 bracket</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#20211024"><span class="toc-text">2021.10.24</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%80%BB%E7%BB%93"><span class="toc-text">总结</span></a></li></ol></div><article class="post post__with-toc card"><div class="post__header"><img alt="Cover Image" class="lazy" src="https://hans362-img.oss.0vv0.top/2019/11/03/noi.png?width=1920" srcset="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABAQMAAAAl21bKAAAABlBMVEXMzMyWlpYU2uzLAAAACXBIWXMAAA7EAAAOxAGVKw4bAAAACklEQVQImWNgAAAAAgAB9HFkpgAAAABJRU5ErkJggg==" data-srcset="https://hans362-img.oss.0vv0.top/2019/11/03/noi.png?width=1920"><div class="post__expire" id="post-expired-notify"><p><svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 16 16" style="fill:#f5a623;stroke:#f5a623"><path fill-rule="evenodd" d="M8.893 1.5c-.183-.31-.52-.5-.887-.5s-.703.19-.886.5L.138 13.499a.98.98 0 0 0 0 1.001c.193.31.53.501.886.501h13.964c.367 0 .704-.19.877-.5a1.03 1.03 0 0 0 .01-1.002L8.893 1.5zm.133 11.497H6.987v-2.003h2.039v2.003zm0-3.004H6.987V5.987h2.039v4.006z"></path></svg> 本文最后更新于 <span id="expire-date"></span> 天前,文中部分描述可能已经过时。</p></div><script>(()=>{var e=Date.parse("2021-10-24"),t=(new Date).getTime(),t=Math.floor((t-e)/864e5);120<=t&&(document.querySelectorAll("#expire-date")[0].innerHTML=t,document.querySelectorAll("#post-expired-notify")[0].style.display="block")})()</script></div><div class="post__content"><html><head><script>var meting_api="https://api-v2.hans362.cn/vip/?server=:server&type=:type&id=:id&r=:r"</script><script class="meting-secondary-script-marker" src="/js/Meting.min.js"></script></head><body><p>昨天也就是2021年10月23日我刚刚考完了本年度的 CSP-S 第二轮。晚上六点多走出考场时,我人已经麻了。欲知发生了甚么事,请继续阅读本文。</p><p>P.S. 去年复赛游记请移步:<a href="https://blog.hans362.cn/post/2020-csp-s-2/">2020 CSP-S 复赛游记</a></p><span id="more"></span><h2 id="day-0"><a class="markdownIt-Anchor" href="#day-0"></a> Day 0</h2><p>复赛那天恰逢成人高考,原以为我校应该做不了 CSP 认证点,和初赛一样要跑很远去华二考试,结果一看准考证,认证点竟然就在自己学校?!瞬间狂喜,而且机房也在以前刷题的机房,监考老师就是自己教练。</p><p>考试前一天下午因为成人高考布置考场三点多就放学了回到家大致梳理了一下常用模版的实现思路。由于今年9月1日起 NOI 系列活动启用全新的技术标准,采用 C++14 标准,放开了大部分原本禁用的下划线开头的函数,<code>pbds</code>也可以使用,因此又现学了一下一些原本禁用的函数和库。</p><h2 id="day-1"><a class="markdownIt-Anchor" href="#day-1"></a> Day 1</h2><p>下午提前45分钟到达学校看到校门口好多人于是想也没想就跟在后面排队测温快排到我时我瞥了一眼工作人员的胸牌一眼就看到大大的 SHMEEA 的标志。嗯?怎么是上海市教育考试院的牌子?再一看别人手里拿的准考证,然后瞬间明白了我混进了成人高考的队伍。当然也无伤大雅,进去后直奔科技楼,终于看到教练在门口负责收集考试安全承诺书。因为时间还早就先去底楼的实验室开了台电脑练习一下手感,提前十五分钟再进楼上的考场。</p><p>到点了公布解压密码,一次输对,解压、建文件夹一气呵成,毕竟都打了两年比赛了。然后开始看题,发现今年可以吸氧(开 O2 优化STL 可以放心用了。吸取去年 T1 的教训我把4道题都看完了。然而看完我就慌了因为我根本找不到签到题就只好先从 T1 开始。</p><h3 id="t1-廊桥分配-airport"><a class="markdownIt-Anchor" href="#t1-廊桥分配-airport"></a> T1 廊桥分配 airport</h3><p>尝试抽象了一下数学模型,感觉和线段覆盖有关?莫非是线段树?那我可不会打。思索了半小时没啥正经的思路,暴力做法倒是想到了,也就是将每架飞机的起飞降落都分别看成一个事件,用结构体维护事件,上来先把事件按时序用 <code>sort()</code> 排列,然后对于每一种分配方案再模拟时间轴,统计停靠廊桥的飞机数量,最后取其中的最大值。当然我也很清楚这样的做法时间复杂度是 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mi>n</mi><mi>l</mi><mi>o</mi><mi>g</mi><mi>n</mi><mo stretchy="false">(</mo><msub><mi>m</mi><mn>1</mn></msub><mo>+</mo><msub><mi>m</mi><mn>2</mn></msub><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(nlogn(m_1+m_2))</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-.25em"></span><span class="mord mathnormal" style="margin-right:.02778em">O</span><span class="mopen">(</span><span class="mord mathnormal">n</span><span class="mord mathnormal" style="margin-right:.01968em">l</span><span class="mord mathnormal">o</span><span class="mord mathnormal" style="margin-right:.03588em">g</span><span class="mord mathnormal">n</span><span class="mopen">(</span><span class="mord"><span class="mord mathnormal">m</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:.30110799999999993em"><span style="top:-2.5500000000000003em;margin-left:0;margin-right:.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:.2222222222222222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:.2222222222222222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-.25em"></span><span class="mord"><span class="mord mathnormal">m</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:.30110799999999993em"><span style="top:-2.5500000000000003em;margin-left:0;margin-right:.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:.15em"><span></span></span></span></span></span></span><span class="mclose">)</span><span class="mclose">)</span></span></span></span>,看了下数据范围 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:.43056em;vertical-align:0"></span><span class="mord mathnormal">n</span></span></span></span><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>m</mi><mn>1</mn></msub><mo>+</mo><msub><mi>m</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">m_1+m_2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:.73333em;vertical-align:-.15em"></span><span class="mord"><span class="mord mathnormal">m</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:.30110799999999993em"><span style="top:-2.5500000000000003em;margin-left:0;margin-right:.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:.2222222222222222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:.2222222222222222em"></span></span><span class="base"><span class="strut" style="height:.58056em;vertical-align:-.15em"></span><span class="mord"><span class="mord mathnormal">m</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:.30110799999999993em"><span style="top:-2.5500000000000003em;margin-left:0;margin-right:.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:.15em"><span></span></span></span></span></span></span></span></span></span> 都要到 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>1</mn><mi>e</mi><mn>5</mn></mrow><annotation encoding="application/x-tex">1e5</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:.64444em;vertical-align:0"></span><span class="mord">1</span><span class="mord mathnormal">e</span><span class="mord">5</span></span></span></span>,明显会爆炸。然而已经过去半小时了,实在没什么更好的思路了,只能先暴力开搞。半小时写完样例都通过了,可见样例非常水。</p><h3 id="t3-回文-palin"><a class="markdownIt-Anchor" href="#t3-回文-palin"></a> T3 回文 palin</h3><p>因为 T2 实在没啥想法甚至连暴力都不知道咋写,果断跳 T3。这题也没啥正经做法的思路看到输出字典序最小的结果考虑可以 DFS优先走搜索树的左子树即可当然看了下数据范围肯定炸因此想写个 DFS 再试试看能不能剪枝。写完 DFS 过了前两个样例,考虑剪枝。发现搜索到 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi><mo>+</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">n+2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:.66666em;vertical-align:-.08333em"></span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:.2222222222222222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:.2222222222222222em"></span></span><span class="base"><span class="strut" style="height:.64444em;vertical-align:0"></span><span class="mord">2</span></span></span></span> 层就可以开始判断是否回文了,如果不是就直接回溯,即</p><pre><code class="hljs apache"><span class="hljs-attribute">if</span> (k&gt;n+<span class="hljs-number">1</span> &amp;&amp; (b[k-<span class="hljs-number">1</span>]!=b[<span class="hljs-number">2</span>*n+<span class="hljs-number">2</span>-k])) return;</code></pre><p>然而样例3还是炸遂放弃。</p><h3 id="t4-交通规划-traffic"><a class="markdownIt-Anchor" href="#t4-交通规划-traffic"></a> T4 交通规划 traffic</h3><p>题看起来都费劲,而且不像去年,今年这道没有好做的部分分。显然不可做,就直接放弃了,回头去看 T2。</p><h3 id="t2-括号序列-bracket"><a class="markdownIt-Anchor" href="#t2-括号序列-bracket"></a> T2 括号序列 bracket</h3><p>这题一上来完全没往 DP 上想,我的思路是枚举每个<code>?</code>可能的值,再判断整个字符串是否合法。但是问题就出在这个判断函数应该咋写,我联想到了利用栈进行括号匹配的操作,于是大胆猜想这题也应该是这么干的,只不过还要确认连续出栈的<code>*</code>个数小于等于 <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>k</mi></mrow><annotation encoding="application/x-tex">k</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:.69444em;vertical-align:0"></span><span class="mord mathnormal" style="margin-right:.03148em">k</span></span></span></span>然而很不幸猜错了。当样例1死活过不了之时我才突然发现我这个算法很容易就证伪了。然后我就开始想另一种校验字符串合法的方式完全陷入了这种思维定势导致我浪费了大量时间。</p><p>最后只剩下半小时了我才突然意识到 DP结果当然并没有推出转移方程。无奈放弃。试图开一下虚拟机准备跑一下 T1 T3结果学校的破电脑根本承受不住竟然直接死机了硬盘仿佛在呼啸最后也没测成。</p><p>到点交卷签字走人,我觉得我凉透了,应该是没有三位数了。</p><h2 id="20211024"><a class="markdownIt-Anchor" href="#20211024"></a> 2021.10.24</h2><p>一早测了下洛谷民间数据40+0+28+0我人没了。后来发现 T3 还有一个枝忘剪了,加了行代码直接 28pts 变 40pts我人麻了。</p><h2 id="总结"><a class="markdownIt-Anchor" href="#总结"></a> 总结</h2><p>今年可以说更加注重思维的考察,没有去年的大模拟、卡精度之类的妖魔鬼怪,但是对于我这种缺乏思考能力的选手而言确实是挺有难度的,至少我认为比去年难多了。而我这次 T2 被自己刚开始的思路局限住了,没有充足的时间去思考 DP 做法,也值得引以为鉴。</p><p>总之这场 CSP 打得稀烂,但愿还能有机会苟进 NOIP。</p></body></html></div><div class="license"><div class="license-title">2021 CSP-S 复赛游记</div><div class="license-link"><a href="https://blog.hans362.cn/post/2021-csp-s-2/">https://blog.hans362.cn/post/2021-csp-s-2/</a></div><div class="license-meta"><div class="license-meta-item"><div class="license-meta-title">本文作者</div><div class="license-meta-text">Hans362</div></div><div class="license-meta-item"><div class="license-meta-title">最后更新</div><div class="license-meta-text">2021-10-24</div></div><div class="license-meta-item"><div class="license-meta-title">许可协议</div><div class="license-meta-text"><a href="https://creativecommons.org/licenses/by-nc-sa/4.0/deed.zh" rel="nofollow noopener noreferrer" target="_blank">CC BY-NC-SA 4.0</a></div></div></div><div>转载或引用本文时请遵守许可协议,注明出处、不得用于商业用途!</div></div><div class="post-footer__cats"><a href="/categories/%E6%B0%B4/" class="post-cats__link button"></a><a href="/tags/OI/" class="post-tags__link button"># OI</a><a href="/tags/%E6%B8%B8%E8%AE%B0/" class="post-tags__link button"># 游记</a><a href="/tags/CSP/" class="post-tags__link button"># CSP</a></div></article><div class="nav"><div class="nav__prev"><a href="/post/noip-2021/" class="nav__link"><div><svg viewBox="0 0 1024 1024" xmlns="http://www.w3.org/2000/svg" width="24" height="24"><path d="M589.088 790.624L310.464 512l278.624-278.624 45.248 45.248L400.96 512l233.376 233.376z" fill="#808080"></path></svg></div><div><div class="nav__label">上一篇</div><div class="nav__title">NOIP 2021 游记&amp;退役记</div></div></a></div><div class="nav__next"><a href="/post/2021-csp-s-1/" class="nav__link"><div><div class="nav__label">下一篇</div><div class="nav__title">2021 CSP-S 初赛游记</div></div><div><svg viewBox="0 0 1024 1024" xmlns="http://www.w3.org/2000/svg" width="24" height="24"><path d="M434.944 790.624l-45.248-45.248L623.04 512l-233.376-233.376 45.248-45.248L713.568 512z" fill="#808080"></path></svg></div></a></div></div><div class="post__sponsers card"><div class="sponser-label">喜欢这篇文章吗?考虑支持一下作者吧~</div><a class="sponser-button button" href="https://afdian.net/@hans362" rel="external nofollow noreferrer" target="_blank" data-type="afdian">爱发电</a> <a class="sponser-button button" data-type="alipay">支付宝<img class="sponser-qrcode" src="https://hans362-img.oss.0vv0.top/2021/08/05/68281340.jpg"></a></div><div class="post__comments post__with-toc card" id="comment"><h4>评论</h4><div id="disqus_thread">您所在的地区可能无法访问 Disqus 评论系统,请切换网络环境再尝试。</div></div></div></main><footer><p class="footer-copyright">Copyright © 2017&nbsp;-&nbsp;2025 <a href="/">Hans362 &#39;s Blog</a></p><p>Powered by <a href="https://hexo.io" target="_blank">Hexo</a> | Theme - <a href="https://github.com/ChrAlpha/hexo-theme-cards" target="_blank">Cards</a></p><script async src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js"></script><ins class="adsbygoogle" style="display:block" data-ad-client="ca-pub-8746554831230893" data-ad-slot="6356225601" data-ad-format="auto" data-full-width-responsive="true"></ins><script>(adsbygoogle=window.adsbygoogle||[]).push({})</script></footer></div><script defer src="https://blog.hans362.cn/npm/vanilla-lazyload@17.8.3/dist/lazyload.min.js"></script><script>window.lazyLoadOptions={elements_selector:".lazy"}</script><script async defer data-website-id="5d181692-8a81-4c20-a282-cee87a6b90ef" src="https://analytics.0vv0.top/vue.js"></script><script src="/js/pageviews.js"></script><link rel="stylesheet" href="https://blog.hans362.cn/npm/katex@0.16.0/dist/katex.min.css" crossorigin="anonymous"><script>function loadComment(){let n,e;(n=document.createElement("script")).src="https://blog.hans362.cn/js/disqus.js",document.body.appendChild(n),n.onload=()=>{new DisqusJS({shortname:"hans362-s-blog",siteName:"Hans362 &#39;s Blog",api:"https://api-v3.hans362.cn/",apikey:"8Z1UVT4UOk22yNyk9MhpqQ0FLb27Hb1bpV066b4v9zOFie0GQ6VCoJ9TJwoGlCVF",admin:"hans362",identifier:"post/2021-csp-s-2/",url:"https://blog.hans362.cn/post/2021-csp-s-2/",nesting:"4"})},(e=document.createElement("link")).rel="stylesheet",e.href="https://blog.hans362.cn/css/disqusjs.css",document.head.appendChild(e)}var runningOnBrowser="undefined"!=typeof window,isBot=runningOnBrowser&&!("onscroll"in window)||"undefined"!=typeof navigator&&/(gle|ing|ro|msn)bot|crawl|spider|yand|duckgo/i.test(navigator.userAgent),supportsIntersectionObserver=runningOnBrowser&&"IntersectionObserver"in window;setTimeout(function(){var e;!isBot&&supportsIntersectionObserver?(e=new IntersectionObserver(function(n){n[0].isIntersecting&&(loadComment(),e.disconnect())},{threshold:[0]})).observe(document.getElementById("comment")):loadComment()},1)</script></body></html>