<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://wiki.cvbbacm.com/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://wiki.cvbbacm.com/feed.php">
        <title>CVBB ACM Team 2021-2022:teams:aaub</title>
        <description></description>
        <link>https://wiki.cvbbacm.com/</link>
        <image rdf:resource="https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico" />
       <dc:date>2026-04-29T23:48:43+0800</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.7.19_%E7%89%9B%E5%AE%A22&amp;rev=1627913347&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.8.02_%E7%89%9B%E5%AE%A26&amp;rev=1627982839&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.8.05_cf3&amp;rev=1628155925&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:dp_%E5%88%86%E6%B2%BB%E5%8D%B7%E7%A7%AF&amp;rev=1627922713&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:front_page&amp;rev=1628155565&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico">
        <title>CVBB ACM Team</title>
        <link>https://wiki.cvbbacm.com/</link>
        <url>https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico</url>
    </image>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.7.19_%E7%89%9B%E5%AE%A22&amp;rev=1627913347&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-08-02T22:09:07+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2021-2022:teams:aaub:2021.7.19_牛客2</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.7.19_%E7%89%9B%E5%AE%A22&amp;rev=1627913347&amp;do=diff</link>
        <description>C: Draw Grids

$n*m$个网格点，两人交替操作，每次连接一条长度为$1$的边，且连接后不能形成环，不能连就输，问先手的胜负。

因为长度为$1$的边不管横向还是纵向滑行都不会影响是否成环，所以能连接的边数必为$n*m-1$$a$$b$$b$$k$$a$$a$$b_{p_i}, b_{p_{i+1}}$$x=p_{i+1}-p_{i}$$y=b_{p_{i+1}}-b_{p_i}$$a$$n$$k$$k$$i$$j$$i$$dp_{i,j}$$i$$j$$i$$k-i$$i$$i$$sqrt(m)$$sqrt(m)$</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.8.02_%E7%89%9B%E5%AE%A26&amp;rev=1627982839&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-08-03T17:27:19+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2021-2022:teams:aaub:2021.8.02_牛客6</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.8.02_%E7%89%9B%E5%AE%A26&amp;rev=1627982839&amp;do=diff</link>
        <description>pmxm：电脑坏了打的很菜，还是不能不写。

C: Delete Edges

考场构造了两个小时也没玩明白

zyy: done

----------

F: Hamburger Steak

pmxm：从大到小煎饼即可，考虑 99,99,2 可以知道分成两次烤的煎饼是不会有问题的。$[0,d] \times [0,d]$$n$$(a,b),(c,d),(e,f)$$U - (b,c), U - (d,e), U - (f,a)$$x \oplus y &gt; x$$\log$$n \log^2 n$$u$$v$$lca(u,v) = u$$BLK$$BLK$$u$</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.8.05_cf3&amp;rev=1628155925&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-08-05T17:32:05+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2021-2022:teams:aaub:2021.8.05_cf3</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:2021.8.05_cf3&amp;rev=1628155925&amp;do=diff</link>
        <description>pmxm：有眼缘

D

题意很简单，有一个6*6的方格，每次可以从任意一个格子的最顶上，往下或者往右放若干个数，要你对初始在(1,1)的$n \le 40000$个数排序，最后放在(6,6)这个位置。

思考：先考虑2*2的问题，那么可以先把两个数在$(1,2)$$(2,1)$$(1,2)$$(2,1)$$(1,1)$$(x,y)$$f(x,y)$$$
f(x,y) = \sum_{xx&lt;x \ or \ yy&lt;x} f(xx,yy)
$$$f(1,1) = 1, f(1,2) = f(2,1) = 2$$f(6,6)$</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:dp_%E5%88%86%E6%B2%BB%E5%8D%B7%E7%A7%AF&amp;rev=1627922713&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-08-03T00:45:13+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2021-2022:teams:aaub:dp_分治卷积</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:dp_%E5%88%86%E6%B2%BB%E5%8D%B7%E7%A7%AF&amp;rev=1627922713&amp;do=diff</link>
        <description>记录一下dp中遇到卷积转移的处理方式和例题:</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:front_page&amp;rev=1628155565&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-08-05T17:26:05+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2021-2022:teams:aaub:front_page</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2021-2022:teams:aaub:front_page&amp;rev=1628155565&amp;do=diff</link>
        <description>杯金银空铜天大学 AAUB

队员: pmxm xsy zyy

----------

2021暑期集训

2021.7.19 牛客2

2021.7.22 cf1

2021.7.24 牛客3

2021.7.26 牛客4

2021.7.29 cf2

2021.7.31 牛客5

2021.8.02 牛客6

dp+分治卷积

2021.8.05 cf3</description>
    </item>
</rdf:RDF>
